scientific article; zbMATH DE number 1113872
From MaRDI portal
Publication:4375647
zbMATH Open0888.65036MaRDI QIDQ4375647FDOQ4375647
Authors: H. Martin Bücker, Manfred Sauren
Publication date: 13 May 1998
Title of this publication is not available (Why is that?)
Recommendations
- Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers.
- Parallel performance analysis of the improved quasi-minimal residual method on bulk synchronous parallel architectures
- scientific article; zbMATH DE number 592769
- scientific article; zbMATH DE number 176399
efficiencynumerical experimentsKrylov subspace methodparallel algorithmsscalingorthogonalizationLanczos algorithmquasi-minimal residual method
Parallel numerical computation (65Y05) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cited In (16)
- An Implementation of the QMR Method Based on Coupled Two-Term Recurrences
- Quantitative performance analysis of the improved quasi-minimal residual method on massively distributed memory computers.
- 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 bi-conjugate residual algorithm suitable for distributed parallel computing
- FQMR: A flexible quasi-minimal residual method with inexact preconditioning
- Numerical implementation of the QMR algorithm by using discrete stochastic arithmetic
- A parallel generalized global conjugate gradient squared algorithm for linear systems with multiple right-hand sides
- Title not available (Why is that?)
- The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR
- A modified QMR algorithm based on the \(A\)-Lanczos biorthogonal process
- An improved generalized conjugate residual squared (IGCRS2) algorithm suitable for distributed parallel computing
- An improved generalized conjugate residual squared algorithm suitable for distributed parallel computing
- A parallel version of QMRCGSTAB method for large linear systems in distributed parallel environments
- Parallel block ILUT/ILDLT preconditioning for sparse eigenproblems and sparse linear systems
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4375647)