Results 271 to 280 of about 1,452,737 (303)

Generalized AOR methods for linear complementarity problem

Applied Mathematics and Computation, 2007
The authors propose a class of generalized accelerated overrelaxation (GAOR) methods for the linear complementarity problem, whose special case reduces to generalized successive overrelaxation (GSOR) methods. Some sufficient conditions for convergence of the GAOR and GSOR methods are presented when the system matrix \(M\) is an \(H\)-matrix, \(M ...
Yaotang Li, Pingfan Dai
openaire   +1 more source

Generalization of the linear algebraic method to three dimensions

Physical Review A, 1991
We present a numerical method for the solution of the Lippmann-Schwinger equation for electron-molecule collisions. By performing a three-dimensional numerical quadrature, this approach avoids both a basis-set representation of the wave function and a partial-wave expansion of the scattering potential.
, Lynch, , Schneider
openaire   +2 more sources

Linear and non-linear stability for general linear methods

BIT, 1987
Stability 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

A Class of Explicit Exponential General Linear Methods

BIT Numerical Mathematics, 2006
The paper presents a class of explicit exponential integrators for semilinear problems \(y'(t) = Ly(t) + N(t,y(t))\), where \(L\) is a sectorial linear operator and \(N\) a smooth nonlinear map. This abstract framework includes semilinear parabolic initial-boundary value problems.
Ostermann, Alexander., Thalhammer, Mechthild., Wright, William.   +2 more
openaire   +2 more sources

Variable order and stepsize in general linear methods

Numerical Algorithms, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saghir Ahmad, John C. Butcher, Winston L. Sweatman   +2 more
openaire   +1 more source

Trajectories generation under constraints by linearization method

Computer Methods in Applied Mechanics and Engineering, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rouff, Marc, Verdier, Matthieu
openaire   +2 more sources

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

Numerical 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, Elena Esposito, Beatrice Paternoster   +2 more
openaire   +1 more source

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

Goodness‐of‐Fit Methods for Generalized Linear Mixed Models

Biometrics, 2005
SummaryWe develop graphical and numerical methods for checking the adequacy of generalized linear mixed models (GLMMs). These methods are based on the cumulative sums of residuals over covariates or predicted values of the response variable. Under the assumed model, the asymptotic distributions of these stochastic processes can be approximated by ...
Pan, Zhiying, Lin, D. Y.
openaire   +2 more sources

General Linear Methods for Stiff Differential Equations

BIT Numerical Mathematics, 2001
A 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