Results 151 to 160 of about 4,525,854 (182)
Some of the next articles are maybe not open access.

Linearly Implicit General Linear Methods

2022
Linearly implicit Runge–Kutta methods provide a fitting balance of implicit treat- ment of stiff systems and computational cost. In this paper we extend the class of linearly implicit Runge–Kutta methods to include multi-stage and multi-step methods.
Sarshar, Arash   +2 more
openaire   +1 more source

Boundedness Properties of General Linear Methods

AIP Conference Proceedings, 2010
For Runge‐Kutta methods, linear multistep methods and other classes of general linear methods much attention has been paid in the literature to important nonlinear stability properties such as total‐variation‐diminishing (TVD), strong stability preserving (SSP) and monotonicity.
A. Mozartova   +3 more
openaire   +1 more source

A new linearization method for generalized linear multiplicative programming

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

GENERAL LINEAR NYSTROM METHODS

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   +1 more source

Algebraic Stability of General Linear Methods

1996
In Sections IV.12 and V.6 we have studied the nonlinear stability of Runge-Kutta methods (B -stability) and of one-leg methods (G-stability). It is natural to ask whether these theories can be combined within the class of general linear methods. This work was initiated by Burrage & Butcher (1980).
Ernst Hairer, Gerhard Wanner
openaire   +1 more source

New Implicit General Linear Method

Journal of the Nigerian Association of Mathematical Physics, 2015
A New implicit general linear method is designed for the numerical olution of stiff differential Equations. The coefficients matrix is derived from the stability function. The method combines the single-implicitness or diagonal implicitness with property that the first two rows are implicit and third and fourth row are explicit.
Ibrahim, MO, Mustafa, A
openaire   +1 more source

Structure-preserving General Linear Methods [PDF]

open access: possible, 2015
Geometric integration concerns the analysis and construction of structure-preserving numerical methods for the long-time integration of differential equations that possess some geometric property, e.g. Hamiltonian or reversible systems. In choosing a structure-preserving method, it is important to consider its efficiency, stability, order, and ability ...
openaire  

A Generalization of Linear Multistep Methods

1990
A generalization of the methods that are currently available to solve systems of ordinary differential equations is made. This generalization is made by constructing linear multistep methods from an arbitrary set of monotone interpolating and approximating functions. Local truncation error estimates as well as stability analysis is given. Specifically,
openaire   +1 more source

G-matrices for algebraically stable general linear methods

Numerical Algorithms, 2009
The aim of the paper is to find a \(G\)-matrix explicitly, in terms of the corresponding generalised eigenvectors, using an entirely different technique based on the theory of positive real control systems. This technique is feasible for a larger class of general linear methods (GLMs) than those that are algebraically stable.
openaire   +2 more sources

Generalized Quasi-Einearization Method

AIAA Journal, 1974
Scharmack, D. K., Sandell, N. R. jun.
openaire   +1 more source

Home - About - Disclaimer - Privacy