Results 141 to 150 of about 4,525,854 (182)
Some of the next articles are maybe not open access.
Nonlinear Stability of General Linear Methods
Numerische Mathematik, 2006This paper extends the results of the important paper by \textit{J. C. Butcher} [The equivalence of algebraic stability and \(AN\)-stability, BIT 27, 510--533 (1987; Zbl 0637.65083)], and by \textit{G. Dahlquist} [\(G\)-stability is equivalent to \(A\)-stability, BIT 18, 384--401 (1978; Zbl 0413.65057)].
openaire +1 more source
General linear methods for y′′ = f (y (t))
Numerical Algorithms, 2012In this paper we consider the family of General Linear Methods (GLMs) for the numerical solution of special second order Ordinary Differential Equations (ODEs) of the type y???=?f(y(t)), with the aim to provide a unifying approach for the analysis of the properties of consistency, zero-stability and convergence.
D'AMBROSIO, RAFFAELE +2 more
openaire +1 more source
Strong Stability Preserving Integrating Factor General Linear Methods
Computational and Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pari Khakzad +4 more
openaire +2 more sources
Multistep Methods and General Linear Methods
1987This chapter is devoted to the study of multistep and general multivalue methods. After retracing their historical developement (Adams, Nystrom, Milne, BDF) we study in the subsequent sections the order, stability and convergence properties of these methods.
Ernst Hairer +2 more
openaire +1 more source
Linear and non-linear stability for general linear methods
BIT, 1987Stability in a numerical method prevents the growth of the approximate solution of a differential equation for which the solution is bounded. A variety of concepts of stability have been developed. For one-leg methods, two extremes, namely A-stability and algebraic stability together with a spectrum between these extremes are equivalent.
openaire +2 more sources
Starting procedures for general linear methods
Applied Numerical Mathematics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Califano, G., Izzo, G., Jackiewicz, Z.
openaire +3 more sources
An extension of general linear methods
Numerical Algorithms, 2010This paper introduces new numerical methods for solving an initial value problem for ordinary differential equations. These new methods belong to the class of general linear methods (GLMs), which generalize both the classical Runge-Kutta and linear multistep methods.
Abdi, Ali, Hojjati, Gholamreza
openaire +1 more source
Generalized method for non-linearity compensation
2005 Quantum Electronics and Laser Science Conference, 2005A unified method for nonlinearity compensation is demonstrated using a new graphical approach. This method provides deep physical insight of the known nonlinearity compensation techniques and allows deriving new compensation schemes.
P. Minzioni, A. Schiffini
openaire +1 more source
Linear convergence of generalized Weiszfeld's method
Computing, 1980Weiszfeld's method is widely used for solving problems of optimal location. It is shown that a very general variant of this method converges linearly thus generalizing a result of I. N. Katz.
Voß, H., Eckhardt, Ulrich
openaire +1 more source
General Linear Methods for Stiff Differential Equations
BIT Numerical Mathematics, 2001A general class of numerical methods for stiff initial value problems that contains both the linear multistep and Runge-Kutta methods is considered. The aim of the author is to obtain particular methods that combine the low computational cost shared by the standard backward differential formula (BDF) methods of the class of multistep methods with the ...
openaire +2 more sources