On the diagonal approximation of full matrices

DOI10.1016/S0377-0427(96)00054-4MaRDI QIDQ2564278zbMATH OpenFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1526575
• Some schemes for the implementation of implicit Runge-Kutta methods
• Embedded Diagonally Implicit Runge-Kutta Algorithms on Parallel Computers
• Iteration of Runge‐Kutta Methods with Block Triangular Jacobians

Cites work

• Iterated Runge–Kutta Methods on Parallel Computers

Cited in

(6)

• scientific article; zbMATH DE number 1398648 (Why is no real title available?)
• The approximation characteristic of diagonal matrix in probabilistic setting
• Chebyshev-type methods and preconditioning techniques
• Recent advances in linear analysis of convergence for splittings for solving ODE problems
• CWI contributions to the development of parallel Runge-Kutta methods
• On diagonally iterated Runge-Kutta methods for dissipative ODEs

Describes a project that uses

Uses Software

• Maple

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2564278)