Alternatives for parallel Krylov subspace basis computation

DOI10.1002/(SICI)1099-1506(199707/08)4:4%3C305::AID-NLA104%3E3.0.CO;2-DzbMATH Open0889.65029OpenAlexW4247693283MaRDI QIDQ4383433FDOQ4383433

Authors: Roger B. Sidje 

Publication date: 1 April 1998

Full work available at URL: https://doi.org/10.1002/(sici)1099-1506(199707/08)4:4%3C305::aid-nla104%3E3.0.co;2-d

Recommendations

• On the generation of Krylov subspace bases
• Modified Krylov acceleration for parallel environments
• Krylov Subspace Methods on Supercomputers
• Parallelization of the rational Arnoldi algorithm

zbMATH Keywords

Krylov subspace methodssparse matrixparallel computationorthogonalizationLeja point ordering

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Orthogonalization in numerical linear algebra (65F25)

Cites Work

• Title not available (Why is that?)

Cited In (7)

• On the generation of Krylov subspace bases
• Modified Krylov acceleration for parallel environments
• Experiments with Krylov subspace methods on a massively parallel computer
• A Communication Optimization Scheme for Basis Computation of Krylov Subspace Methods on Multi-GPUs
• Tridiagonal Toeplitz matrices: properties and novel applications
• Varying the \(s\) in your \(s\)-step GMRES
• Parallelization of the rational Arnoldi algorithm

Uses Software

• Harwell-Boeing sparse matrix collection

This page was built for publication: Alternatives for parallel Krylov subspace basis computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4383433)