Arithmetic Complexity Of Direct Solvers For Banded Systems
From MaRDI portal
Publication:4807699
DOI10.1080/0020716022000005555zbMath1020.65018OpenAlexW2090075014MaRDI QIDQ4807699
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
Cholesky factorizationLU-factorizationpartial pivotingarithmetic complexitybanded systemsroot-free symmetric elimination
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)
Cites Work
This page was built for publication: Arithmetic Complexity Of Direct Solvers For Banded Systems