Arithmetic Complexity Of Direct Solvers For Banded Systems

DOI10.1080/0020716022000005555zbMath1020.65018OpenAlexW2090075014MaRDI QIDQ4807699

M. M. Chawla, David 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 factorizationLU-factorizationpartial pivotingarithmetic complexitybanded systemsroot-free symmetric elimination

Mathematics Subject Classification ID

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

Related Items (1)

A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices

Cites Work

• The choleski Q.I.F. algorithm for solving symmetric linear systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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