Parallel iterative S-step methods for unsymmetric linear systems

DOI10.1016/0167-8191(96)00022-1zbMath0873.65019OpenAlexW2089735355MaRDI QIDQ671295

C. D. Swanson, Anthony Theodore Chronopoulos

Publication date: 27 February 1997

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(96)00022-1

zbMATH Keywords

iterative methodsCray C90modified Gram-SchmidtS-step Orthomin

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items

Minimizing synchronizations in sparse iterative solvers for distributed supercomputers, The non-symmetric \(s\)-step Lanczos algorithm: derivation of efficient recurrences and synchronization-reducing variants of BiCG and QMR, Biconjugate residual algorithm for solving general Sylvester-transpose matrix equations, A generalization of \(s\)-step variants of gradient methods, Analyzing the Effect of Local Rounding Error Propagation on the Maximal Attainable Accuracy of the Pipelined Conjugate Gradient Method, Conjugate gradient-like algorithms for constrained operator equation related to quadratic inverse eigenvalue problems, Communication lower bounds and optimal algorithms for numerical linear algebra, Least squares solutions of quadratic inverse eigenvalue problem with partially bisymmetric matrices under prescribed submatrix constraints, Block s-step Krylov iterative methods, ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS, A block varaint of the GMRES method for unsymmetric linear systems, A robust meta-heuristic adaptive Bi-CGSTAB algorithm to online estimation of a three DoF state–space model in the presence of disturbance and uncertainty, Accuracy of the $s$-Step Lanczos Method for the Symmetric Eigenproblem in Finite Precision

Uses Software

• LAPACK