Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form

DOI10.1137/S0895479801387085MaRDI QIDQ4443777zbMATH OpenOpenAlexFDO

Authors L. Gemignani, Grazia Lotti

Publication date 18 January 2004

Published in SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0895479801387085

zbMATH Keywords

backward stabilityblock Hessenberg matricesdivide-and-conquer methoderror analysisGaussian eliminationsparse matrices

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Recommendations

• Rounding error analysis in solving \(M\)-matrix linear systems of block Hessenberg form
• On the solution of block Hessenberg systems
• Block triangular preconditioners for \(M\)-matrices and Markov chains
• Rounding errors in solving block Hessenberg systems
• scientific article; zbMATH DE number 956824

Cited in

(5)

• Rounding error analysis in solving \(M\)-matrix linear systems of block Hessenberg form
• Comparison theorems for splittings of M-matrices in (block) Hessenberg form
• scientific article; zbMATH DE number 2098223 (Why is no real title available?)
• On the solution of block Hessenberg systems
• Non‐recursive solution of sparse block Hessenberg systems

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form

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