Parallel computation of a Krylov matrix for a sparse and structured input

Authors:
V. Y. Pan
Affiliations:
Department of Mathematics and Computer Science Lehman College, City University of New York Bronx, NY 10468, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 5
Cited 1

The analysis of a nested dissection algorithm

Numerische Mathematik
Fast and efficient parallel solution of sparse linear systems

SIAM Journal on Computing
Polynomial and matrix computations (vol. 1): fundamental algorithms

Polynomial and matrix computations (vol. 1): fundamental algorithms
On parallel computations with banded matrices

Information and Computation
Work-preserving speed-up of parallel matrix computations

SIAM Journal on Computing

Algebraic and numerical algorithms

Algorithms and theory of computation handbook

Quantified Score

Hi-index	0.98

Visualization

Abstract

As in our previous work, we reduce parallel computation of a Krylov matrix to solving a parametrized linear system of equations. This time we show that such a method is effective in the cases of banded matrices, sparse and structured matrices and triangular matrices.