On the diagonal approximation of full matrices

DOI10.1016/S0377-0427(96)00054-4zbMath0874.65033MaRDI QIDQ2564278

Walter M. Lioen

Publication date: 7 January 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

preconditioningscalingcomputer algebra system Maplediagonal approximation of inverse matricesparallel diagonal-implicit iteration of Runge-Kutta methods

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical computation of matrix norms, conditioning, scaling (65F35) Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations (65L06)

Related Items (4)

On diagonally iterated Runge-Kutta methods for dissipative ODEs ⋮ Chebyshev-type methods and preconditioning techniques ⋮ CWI contributions to the development of parallel Runge-Kutta methods ⋮ Recent advances in linear analysis of convergence for splittings for solving ODE problems

Uses Software

• Maple

Cites Work

• Iterated Runge–Kutta Methods on Parallel Computers

This page was built for publication: On the diagonal approximation of full matrices