A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS

DOI10.1080/10637199508915497zbMath1049.68946OpenAlexW2006585022WikidataQ126248396 ScholiaQ126248396MaRDI QIDQ4820094

K. N. Balasubramanya Murthy, C. Siva Ram Murthy

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/10637199508915497

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel numerical computation (65Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Parallel QR factorization by Householder and modified Gram-Schmidt algorithms
• Gaussian elimination with partial pivoting and load balancing on a multiprocessor
• A new algorithm for parallel solution of linear equations
• Parallel Gauss-Jordan elimination for the solution of dense linear systems
• Implementing Linear Algebra Algorithms for Dense Matrices on a Vector Pipeline Machine
• Solving Linear Algebraic Equations on an MIMD Computer
• On Stable Parallel Linear System Solvers
• A Survey of Parallel Algorithms in Numerical Linear Algebra

This page was built for publication: A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS