A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
From MaRDI portal
Recommendations
- Efficient and optimal parallel algorithms for Cholesky decomposition
- A fast parallel algorithm for the solution of tridiagonal linear systems
- A parallel Cholesky algorithm for the solution of symmetric linear systems
- scientific article; zbMATH DE number 2080149
- A Parallel Algorithm for Computing the Eigenvalues of a Symmetric Tridiagonal Matrix
- A PARALLEL ALGORITHM FOR HOUSEHOLDER'S TRID1AGONALIZATION OF A SYMMETRIC MATRIX
- scientific article; zbMATH DE number 29780
- Parallel Factorizations for Tridiagonal Matrices
- A fast and stable parallel QR algorithm for symmetric tridiagonal matrices
- scientific article; zbMATH DE number 1302627
Cited in
(5)- A parallel Cholesky algorithm for the solution of symmetric linear systems
- A note on weighted least square distribution fitting and full standardization of the empirical distribution function
- scientific article; zbMATH DE number 440657 (Why is no real title available?)
- scientific article; zbMATH DE number 17454 (Why is no real title available?)
- A new parallel chasing algorithm for transforming arrowhead matrices to tridiagonal form
This page was built for publication: A Fast Parallel Cholesky Decomposition Algorithm for Tridiagonal Symmetric Matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4337389)