Results 261 to 270 of about 26,927,576 (295)
Some of the next articles are maybe not open access.
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
A Class of Explicit Exponential General Linear Methods
BIT Numerical Mathematics, 2006The 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. +2 more
openaire +2 more sources
Generalization of the linear algebraic method to three dimensions
Physical Review A, 1991We 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
Variable order and stepsize in general linear methods
Numerical Algorithms, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saghir Ahmad +2 more
openaire +1 more source
Trajectories generation under constraints by linearization method
Computer Methods in Applied Mechanics and Engineering, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rouff, Marc, Verdier, Matthieu
openaire +2 more sources
A Generalization of Linear Multistep Methods
1990A 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
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
Goodness‐of‐Fit Methods for Generalized Linear Mixed Models
Biometrics, 2005SummaryWe 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
A generalized inverse method for asymptotic linear programming
Mathematical Programming, 1989The paper describes an efficient method for computing the solution x(t) of the system of equations \((A+tB)x=b\). It is shown that \textit{J. H. Wilkinson's} factorization [Recent applications of generalized inverses, Res. Notes Math. 66, 82-99 (1982; Zbl 0491.65025)] provides the Laurent expansion of x(t) for the case when both A and B are singular ...
openaire +2 more sources
General linear methods for ordinary differential equations
Mathematics and Computers in Simulation, 2009zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources

