ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS

DOI10.1080/10637199808947392zbMath0955.68128OpenAlexW2035714895MaRDI QIDQ4485122

Takako Soma, Suely Oliveira, Michael Holzrichter, Leonardo S. Borges

Publication date: 5 June 2000

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

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

zbMATH Keywords

parallel Gram-Schmidt orthogonalization algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (1)

Gram-Schmidt orthogonalization: 100 years and more

Cites Work

• Parallel iterative S-step methods for unsymmetric linear systems
• Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
• Iterative algorithms for Gram-Schmidt orthogonalization
• Parallel Gram-Schmidt orthogonalisation on a network of transputers
• The implementation of parallel Gram-Schmidt orthogonalisation algorithms on a ring of transputers
• A parallel Davidson-type algorithm for several eigenvalues
• Numerics of Gram-Schmidt orthogonalization

This page was built for publication: ANALYSIS OF DIFFERENT PARTITIONING SCHEMES FOR PARALLEL GRAM-SCHMIDT ALGORITHMS