Arithmetic Complexity Of Direct Solvers For Banded Systems

DOI10.1080/0020716022000005555MaRDI QIDQ4807699zbMATH OpenOpenAlexFDO

Authors Man M. Chawla, D. J. Evans

Publication date 6 October 2003

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/0020716022000005555

zbMATH Keywords

Cholesky factorizationpartial pivotingLU-factorizationarithmetic complexitybanded systemsroot-free symmetric elimination

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

• scientific article; zbMATH DE number 1256683
• The computation and communication complexity of a parallel banded system solver
• Parallel direct methods for solving banded linear systems
• Parallelized solution of banded linear systems with an introduction to p-adic computation
• On some parallel banded system solvers
• On the arithmetic operational complexity for solving Vandermonde linear equations
• Solving banded systems on a parallel processor
• scientific article; zbMATH DE number 572191
• On the computational complexity of the solution of linear systems with moduli
• Designing optimal algorithms for solving banded triangular systems on rings

Cites work

• scientific article; zbMATH DE number 4213315 (Why is no real title available?)
• scientific article; zbMATH DE number 43693 (Why is no real title available?)
• scientific article; zbMATH DE number 3528420 (Why is no real title available?)
• scientific article; zbMATH DE number 3228170 (Why is no real title available?)
• scientific article; zbMATH DE number 3198397 (Why is no real title available?)
• The choleski Q.I.F. algorithm for solving symmetric linear systems

Cited in

(2)

• Direct approach to the band completion problem
• A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices

This page was built for publication: Arithmetic Complexity Of Direct Solvers For Banded Systems

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