Reliable parallel solution of bidiagonal systems

DOI10.1007/S002110100296MaRDI QIDQ1348918zbMATH OpenOpenAlexFDO

Authors Ilan Bar-On, Mauro Leoncini

Publication date 21 May 2002

Published in Numerische Mathematik (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s002110100296

zbMATH Keywords

Cholesky factorizationnumerical examplesstabilityalgorithmparallel computationcyclic reductionpartition methoddivide and conquer approachbidiagonal systems

Mathematics Subject Classification ID

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

Recommendations

• Stability of a partitioning algorithm for bidiagonal systems
• scientific article; zbMATH DE number 1330400
• scientific article; zbMATH DE number 2109657
• scientific article; zbMATH DE number 1481740
• A survey of parallel direct methods for block bidiagonal linear systems on distributed memory computers

Cited in

(4)

• Aitken-Schwarz Acceleration not based on the mesh for CFD
• An efficient algorithm for a model with a bidiagonal coefficient matrix
• Checking robust nonsingularity of tridiagonal matrices in linear time
• Reliable solution of bidiagonal systems with applications

This page was built for publication: Reliable parallel solution of bidiagonal systems

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