TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗

DOI10.1080/10637199408962541zbMath1049.68963OpenAlexW2078527302MaRDI QIDQ4820024

Giorgio Pini

Publication date: 6 October 2004

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637199408962541

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (max. 100)

Unnamed Item

Uses Software

• ITSOL
• SPARSKIT

Cites Work

• Unnamed Item
• The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
• Parallel conjugate gradient-like algorithms for solving sparse nonsymmetric linear systems on a vector multiprocessor
• On the performance of transputer networks for solving linear systems of equations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• MIMD implementations of linear solvers for oil reservoir simulation
• Krylov Subspace Methods on Supercomputers
• Sparse matrix test problems
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• On vectorizing the preconditioned generalized conjugate residual methods
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems

This page was built for publication: TRANSPOSE-FREE LANCZOS-TYPE SCHEMES ON TRANSPUTER NETWORK∗