Results 251 to 260 of about 1,452,737 (303)
Strong Stability Preserving General Linear Methods [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppe Izzo, Zdzislaw Jackiewicz
openaire +4 more sources
GENERAL LINEAR NYSTROM METHODS [PDF]
In this talk we describe the family of General Linear Nystrom methods (GLNs), which provides the extension of the family of General Linear Methods for the numerical solution of first order Ordinary Differential Equations (ODEs) [1, 2] to special second order ODEs.
D'AMBROSIO, RAFFAELE +2 more
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Strongly Regular General Linear Methods
Journal of Scientific Computing, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter O. Olatunji, M. N. O. Ikhile
openaire +2 more sources
Linear Multistep Methods as Irreducible General Linear Methods
BIT Numerical Mathematics, 2006This paper is concerned with the topic of stability for linear multistep methods (LMM's) in relation with associated general linear methods (GLM's). The authors show how to write an LMM as a GLM and prove that if an LMM is irreducible then the corresponding GLM also is, improving in this way a procedure given by \textit{K. Burrage} and \textit{J.
Butcher, J. C., Hill, A. T.
openaire +2 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.
Ali Abdi 0004, Gholamreza Hojjati
openaire +1 more source
General linear methods with projection
Applied Numerical Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Habib, Yousaf, Mustafa, Lubna
openaire +2 more sources
The existence of symplectic general linear methods
Numerical Algorithms, 2008The paper obtains a criterion that any general linear integration method must satisfy if it is symplectic. After deriving a criterion for symplectic behavior based on a standard conservative problem of the form, \[ \begin{cases} z_1'(t)= -\alpha(z_3,z_4,\dots,z_N)z_2(t), \\ z_2'(t)= \alpha(z_3,z_4,\dots,z_N)z_1(t), \\ z_i'(t)=f_i(z_3,z_4,\dots,z_N)z_1 ...
John C. Butcher, L. L. Hewitt
openaire +2 more sources

