Non‐recursive solution of sparse block Hessenberg systems

DOI10.1002/NLA.370MaRDI QIDQ5492630zbMATH OpenOpenAlexFDO

Authors Paola Favati, Grazia Lotti, Ornella Menchi

Publication date 16 October 2006

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.370

zbMATH Keywords

block Hessenberg systemblock recursive LU decompositioncomputational costsdouble-phase algorithmGaussian eliminationinfinite systemsnumerical experimentssparse matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Complexity and performance of numerical algorithms (65Y20)

Recommendations

• Efficient and Stable Solution of M-Matrix Linear Systems of (Block) Hessenberg Form
• On the solution of block Hessenberg systems
• The block Hessenberg process for matrix equations
• Rounding errors in solving block Hessenberg systems
• Solution of infinite linear systems by automatic adaptive iterations

Cited in

(6)

• A hybrid triangulation method for banded linear systems
• Fast parallel-in-time quasi-boundary value methods for backward heat conduction problems
• A solution approach for lower Hessenberg linear systems
• On the solution of block Hessenberg systems
• Recessive solutions of block tridiagonal nonhomogeneous systems
• Double-parameter regularization for solving the backward diffusion problem with parallel-in-time algorithm

This page was built for publication: Non‐recursive solution of sparse block Hessenberg systems

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