论文信息 - On the efficiency of a class of a-stable methods

On the efficiency of a class of a-stable methods

The numerical solution of systems of differential equations of the formB dx/dt=σ(t)Ax(t)+f(t),x(0) given, whereB andA (withB and —(A+AT) positive definite) are supposed to be large sparse matrices, is considered.A-stable methods like the Implicit Runge-Kutta methods based on Radau quadrature are combined with iterative methods for the solution of the algebraic systems of equations.

O. Axelsson

[1] A. Stroud,et al. Gaussian quadrature formulas , 1966 .

[2] Olof B. Widlund,et al. A note on unconditionally stable linear multistep methods , 1967 .

[3] Owe Axelsson,et al. A class ofA-stable methods , 1969 .

[4] J. L. Blue,et al. Rational approximations to matrix exponential for systems of stiff differential equations , 1970 .

[5] C. W. Gear,et al. Numerical initial value problem~ in ordinary differential eqttations , 1971 .

[6] J. A. George. Computer implementation of the finite element method , 1971 .

[7] I. Fried. Optimal gradient minimization scheme for finite element eigenproblems , 1972 .

[8] On the efficiency of some A-stable methods , 1973 .

[9] J. Lambert. Computational Methods in Ordinary Differential Equations , 1973 .

[10] D. Rose,et al. Complexity Bounds for Regular Finite Difference and Finite Element Grids , 1973 .

[11] O Axelsson,et al. On preconditioning and convergence acceleration in sparse matrix problems , 1974 .