A parallel Cholesky algorithm for the solution of symmetric linear systems
DOI10.1155/S0161171204202265zbMATH Open1074.65030OpenAlexW2028467041MaRDI QIDQ1774750
Publication date: 18 May 2005
Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/51767
algorithmparallel computationLevinson algorithmCholesky factorizationSchur algorithmsymmetric system
Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (3)
Recommendations
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- Title not available (Why is that?) ๐ ๐
- A multilevel parallel algorithm to solve symmetric Toeplitz linear systems ๐ ๐
- A parallel algorithm for sparse symbolic Cholesky factorization on a multiprocessor ๐ ๐
- Efficient and optimal parallel algorithms for Cholesky decomposition ๐ ๐
- A New Class of Parallel Algorithms for Solving Systems of Linear Equations ๐ ๐
- A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices ๐ ๐
- The choleski Q.I.F. algorithm for solving symmetric linear systems ๐ ๐
- Computational Science โ ICCS 2005 ๐ ๐
This page was built for publication: A parallel Cholesky algorithm for the solution of symmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774750)