scientific article; zbMATH DE number 1113872
From MaRDI portal
Publication:4375647
zbMath0888.65036MaRDI QIDQ4375647
Manfred Sauren, H. Martin Bücker
Publication date: 13 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical experimentsefficiencyorthogonalizationscalingparallel algorithmsKrylov subspace methodLanczos algorithmquasi-minimal residual method
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05)
Related Items
The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR ⋮ An improved bi-conjugate residual algorithm suitable for distributed parallel computing ⋮ A parallel version of GPBi-CG method suitable for distributed parallel computing ⋮ Conjugate residual squared method and its improvement for non-symmetric linear systems ⋮ An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing ⋮ Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems ⋮ A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides ⋮ An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
This page was built for publication:
