Back to search

Alternatives for parallel Krylov subspace basis computation

Data up to Jan 2025

Published1997
Citations18
References21

Total Citations Per Year

Abstract

References (21)

Analysis of Some Krylov Subspace Approximations to the Matrix Exponential Operator

1992 • 661 citations

Sparse matrix test problems

1989 • 649 citations

Efficient Solution of Parabolic Equations by Krylov Approximation Methods

1992 • 323 citations

Numerics of Gram-Schmidt orthogonalization

1994 • 265 citations

Newton interpolation at Leja points

1990 • 130 citations

A Newton basis GMRES implementation

1994 • 116 citations

Performance of parallel processors

1989 • 106 citations

A simpler GMRES

1994 • 88 citations

Numerical Linear Algebra

1993 • 87 citations

Distributed Orthogonal Factorization: Givens and Householder Algorithms

1989 • 60 citations

The economical storage of plane rotations

1976 • 58 citations

Implementation of some concurrent algorithms for matrix factorization

1986 • 55 citations

Parallel QR factorization by householder and modified Gram-Schmidt algorithms

1990 • 54 citations

Stability Analysis and Improvement of the Block Gram–Schmidt Algorithm

1991 • 44 citations

A Comparison of Preconditioned Nonsymmetric Krylov Methods on a Large-Scale MIMD Machine

1994 • 43 citations

QR Factorization of a Dense Matrix on a Hypercube Multiprocessor

1990 • 38 citations

On some parallel algorithms on a ring of processors

1985 • 18 citations

QR factorization of a dense matrix on a shared-memory multiprocessor

1989 • 14 citations

BASIC SPARSE MATRIX COMPUTATIONS ON THE CM-5

1993 • 8 citations

QR factorization for the regularized least squares problem on hypercubes

1993 • 4 citations

ALGORITHMICALLY SPECIALIZED COMPUTERS

1985 • 3 citations

Cited By (0)

Loading...