Fast and efficient parallel solution of dense linear systems
From MaRDI portal
Publication:1825589
DOI10.1016/0898-1221(89)90081-3zbMath0684.65024OpenAlexW2091101062MaRDI QIDQ1825589
Publication date: 1989
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(89)90081-3
linear systemsNewton's methodparallel computationmatrix inversionshared memory multiprocessorslinear solver
Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Theory of operating systems (68N25)
Related Items
Iterative methods for the parallel solution of linear systems, Random matrix theory for the analysis of the performance of an analog computer: a scaling theory, A Monte Carlo method for the parallel solution of linear systems, Efficient inversion of matrix \(\varphi \)-functions of low order, Newton’s Method Without Division, Cache Optimized Solution for Sparse Linear System over Large Order Finite Field, Scaling and universality of the complexity of analog computation, The parallel computation of minimum cost paths in graphs by stream contraction, Efficient parallel factorization and solution of structured and unstructured linear systems, Estimating the extremal eigenvalues of a symmetric matrix, Fast and efficient solution of path algebra problems, Successive matrix squaring algorithm for computing the Drazin inverse, A quantum interior-point predictor–corrector algorithm for linear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing the determinant in small parallel time using a small number of processors
- How to multiply matrices faster
- Matching is as easy as matrix inversion
- Complexity of parallel matrix computations
- Parallel evaluation of the determinant and of the inverse of a matrix
- An improved parallel processor bound in fast matrix inversion
- Fast and efficient linear programming and linear least-squares computations
- Fast Parallel Computation of Polynomials Using Few Processors
- Parallel Algorithms for Algebraic Problems
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Complexity of Solving Linear Systems in Different Models of Computation
- Error Analysis of Direct Methods of Matrix Inversion
- Fast Parallel Matrix Inversion Algorithms
- Fast parallel matrix and GCD computations
- A Note on an Iterative Method for Generalized Inversion of Matrices
- On Iterative Computation of Generalized Inverses and Associated Projections
- A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- Some New Methods in Matrix Calculation
- Further Points on Matrix Calculation and Simultaneous Equations
