Alternatives for parallel Krylov subspace basis computation

DOI<305::AID-NLA104>3.0.CO;2-D 10.1002/(SICI)1099-1506(199707/08)4:4<305::AID-NLA104>3.0.CO;2-DzbMath0889.65029OpenAlexW4247693283MaRDI QIDQ4383433

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<305::aid-nla104>3.0.co;2-d

zbMATH Keywords

parallel computationsparse matrixorthogonalizationKrylov subspace methodsLeja point ordering

Mathematics Subject Classification ID

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

Related Items (3)

On the generation of Krylov subspace bases ⋮ Tridiagonal Toeplitz matrices: properties and novel applications ⋮ Varying the \(s\) in your \(s\)-step GMRES

Uses Software

• Harwell-Boeing sparse matrix collection

Cites Work

• Unnamed Item

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