Parallel computation of a Krylov matrix for a sparse and structured input
From MaRDI portal
Publication:1900259
DOI10.1016/0895-7177(95)00084-FzbMath0831.65027OpenAlexW2119751063MaRDI QIDQ1900259
Publication date: 30 October 1995
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(95)00084-f
parallel computationsparse matricesbanded matricesstructured matricestriangular matricesKrylov matrixKrylov sequences
Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Unnamed Item
- Unnamed Item
- The analysis of a nested dissection algorithm
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Improved parallel computations with Toeplitz-like and Hankel-like matrices
- Improved parallel solution of a triangular linear system
- On parallel computations with banded matrices
- Generalized Nested Dissection
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Work-Preserving Speed-Up of Parallel Matrix Computations
This page was built for publication: Parallel computation of a Krylov matrix for a sparse and structured input