Solving Linear Algebraic Equations on an MIMD Computer

DOI10.1145/322358.322366MaRDI QIDQ3968377zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1983

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322358.322366

zbMATH Keywords

Gaussian eliminationgivens triangularizationMIMD computerparallel algorithms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Orthogonalization in numerical linear algebra (65F25)

Cited in

(25)

• Advantages for solving linear systems in an asynchronous environment
• A pipelined Givens method for computing the QR factorization of a sparse matrix
• Parallel QR decomposition of a rectangular matrix
• The semantics and complexity of parallel programs for vector computations. I: A case study using Ada
• A review of parallel methods for solving sets of linear equations and their application within optimization algorithms
• A parallel algorithm for solving the inverse scattering moment problem
• Minimizing the schedule length for a parallel 3D-grid precedence graph
• Performance bounds for column-block partitioning of parallel Gaussian elimination and Gauss-Jordan methods
• The theoretical cost of sequential and parallel algorithms for solving linear systems of equations
• A systolic architecture for optimal filter design support
• Linear algebra software in IBM and CRAY computers
• Optimal scheduling algorithms for parallel Gaussian elimination
• Data allocation strategies for the Gauss and Jordan algorithms on a ring of processors
• Designing linear algebra algorithms on the IBM 3090 vector multiprocessor with a hierarchical memory system
• A new Gaussian elimination-based algorithm for parallel solution of linear equations
• An optimal schedule for Gaussian elimination on an MIMD architecture
• Systolic algorithm for the solution of dense linear equations
• Résolution systolique de systèmes linéaires denses
• Parallel solution of dense linear systems using diagonalization methods
• Systolic givens factorization of dense rectangular matrices
• Efficient FORTRAN implementation of the gaussian elimination and Householder reduction algorithms on the IBM 3090 vector multiprocessor
• A fault tolerant systolic mesh for linear system solution
• TWO-SIDED ELIMINATION ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS USING HOUSEHOLDER REDUCTIONS
• PARALLEL BLOCK METHODS FOR SOLVING LINEAR SYSTEMS
• A NEW MODIFIED GRAM-SCHMIDT ORTHOGONAL MATRIX FACTORIZATION BASED ALGORITHM FOR PARALLEL SOLUTION OF LINEAR EQUATIONS

This page was built for publication: Solving Linear Algebraic Equations on an MIMD Computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3968377)