Results 241 to 250 of about 26,927,576 (295)

Strong Stability Preserving General Linear Methods

open access: yesJournal of Scientific Computing, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giuseppe Izzo, Zdzislaw Jackiewicz
openaire   +5 more sources

GENERAL LINEAR NYSTROM METHODS

open access: yes, 2011
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

General linear methods for y′′ = f (y (t))

open access: yesNumerical Algorithms, 2012
In 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.
Raffaele D'Ambrosio   +2 more
openaire   +2 more sources

Strongly Regular General Linear Methods

Journal of Scientific Computing, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter O. Olatunji, M. N. O. Ikhile
openaire   +3 more sources

Linear Multistep Methods as Irreducible General Linear Methods

BIT Numerical Mathematics, 2006
This 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, 2010
This 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   +2 more sources

General linear methods with projection

Applied Numerical Mathematics, 2021
zbMATH 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, 2008
The 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

A new linearization method for generalized linear multiplicative programming

Computers & Operations Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chun-Feng Wang, San-Yang Liu
openaire   +1 more source

Home - About - Disclaimer - Privacy