A family of permutations for concurrent factorization of block tridiagonal matrices
From MaRDI portal
Publication:5375477
DOI10.1109/12.24290zbMATH Open1396.65085OpenAlexW2149778021MaRDI QIDQ5375477FDOQ5375477
Authors: Senol Utku, M. Salama, Robert J. Melosh
Publication date: 14 September 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.24290
Recommendations
- Parallel Factorizations for Tridiagonal Matrices
- A block algorithm for computing antitriangular factorizations of symmetric matrices
- On the Factorization of Block-Tridiagonals without Storage Constraints
- Parallel \textit{QR} factorization of block-tridiagonal matrices
- On some new approximate factorization methods for block tridiagonal matrices suitable for vector and parallel processors
- Factorizations of block triangular matrices
- Parallel block tridiagonalization of real symmetric matrices
- A block diagonalization based algorithm for the determinants of block \(k\)-tridiagonal matrices
- Fast block diagonalization of \(k\)-tridiagonal matrices
- Block incomplete LU factorization for block-tridiagonal \(M\)-matrices
Direct numerical methods for linear systems and matrix inversion (65F05) Factorization of matrices (15A23)
Cited In (1)
This page was built for publication: A family of permutations for concurrent factorization of block tridiagonal matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375477)