Fast and efficient parallel solution of dense linear systems
type: Item
instance of: scholarly article
title: Fast and efficient parallel solution of dense linear systems
zbMATH Open document ID: 0684.65024
DOI: 10.1016/0898-1221(89)90081-3
publication date: 1989-01-01T00:00:00Z
review text: Theoretical investigation of matrix inversion and linear solver on shared memory multiprocessors (unrealistic for a great number of processors). Using Newton's method the optimum bound for the number of processors can be reduced by sqrt(n) for polylog time, compared to previous results. Furthermore the method is numerically stable and self-correcting.
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 65Y05
Mathematics Subject Classification ID: 68N25
zbMATH DE Number: 4121289
zbMATH Keywords: parallel computation
zbMATH Keywords: linear systems
zbMATH Keywords: matrix inversion
zbMATH Keywords: linear solver
zbMATH Keywords: shared memory multiprocessors
zbMATH Keywords: Newton's method
author: Victor Y. Pan
author: J. Reif
MaRDI profile type: Publication
full work available at URL: 0898-1221(89)90081-3
OpenAlex ID: W2091101062
cites work: Fast parallel matrix and GCD computations
cites work: Fast and efficient linear programming and linear least-squares computations
cites work: Complexity of parallel matrix computations
cites work: An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
cites work: Q3752425
cites work: Parallel Algorithms for Algebraic Problems
cites work: Matching is as easy as matrix inversion
cites work: Q3833499
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: How to multiply matrices faster
cites work: An improved parallel processor bound in fast matrix inversion
cites work: Parallel evaluation of the determinant and of the inverse of a matrix
cites work: Error Analysis of Direct Methods of Matrix Inversion
cites work: Q5674306
cites work: Fast Parallel Computation of Polynomials Using Few Processors
cites work: Q4047029
cites work: On computing the determinant in small parallel time using a small number of processors
cites work: Some New Methods in Matrix Calculation
cites work: Further Points on Matrix Calculation and Simultaneous Equations
cites work: Q3259278
cites work: On Iterative Computation of Generalized Inverses and Associated Projections
cites work: Q5543004
cites work: Q5553606
cites work: Complexity of Solving Linear Systems in Different Models of Computation
cites work: A Note on an Iterative Method for Generalized Inversion of Matrices
cites work: Q4190138
cites work: Q3732964
cites work: Q4187223
cites work: Q3692706
cites work: On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
cites work: Q5185900
cites work: Q3909906
cites work: Q5604166
cites work: Q5342712
cites work: A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
published in: Computers & Mathematics with Applications
description: scientific article; zbMATH DE number 4121289