Parallel computation of a Krylov matrix for a sparse and structured input
DOI10.1016/0895-7177(95)00084-FzbMATH Open0831.65027OpenAlexW2119751063MaRDI QIDQ1900259FDOQ1900259
Authors: Victor Y. Pan
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
Recommendations
sparse matricesparallel computationstructured matricestriangular matricesbanded matricesKrylov matrixKrylov sequences
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)
Cites Work
- The analysis of a nested dissection algorithm
- Title not available (Why is that?)
- Generalized Nested Dissection
- Title not available (Why is that?)
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Work-Preserving Speed-Up of Parallel Matrix Computations
- On parallel computations with banded matrices
- 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
Cited In (1)
This page was built for publication: Parallel computation of a Krylov matrix for a sparse and structured input
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900259)