Upper bounds on the complexity of solving systems of linear equations
From MaRDI portal
Publication:1057647
DOI10.1007/BF02104747zbMath0563.68039MaRDI QIDQ1057647
Publication date: 1985
Published in: Journal of Soviet Mathematics (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
65-02: Research exposition (monographs, survey articles) pertaining to numerical analysis
65F10: Iterative numerical methods for linear systems
68-02: Research exposition (monographs, survey articles) pertaining to computer science
68W99: Algorithms in computer science
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing multivariate polynomials in parallel
- An improved parallel processor bound in fast matrix inversion
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- Parallel computations in linear algebra. II
- A Computation Model of Parallel Solution of Linear Equations
- Parallel computations in linear algebra
- On the Asymptotic Complexity of Matrix Multiplication
- Time and Parallel Processor Bounds for Linear Recurrence Systems
- Fast Parallel Matrix Inversion Algorithms
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- On the Parallel Evaluation of Multivariate Polynomials
- Triangular Factorization and Inversion by Fast Matrix Multiplication
- An Algorithm for the Inversion of Finite Toeplitz Matrices
- Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations
- Matrix Inversion Using Parallel Processing
- On Direct Methods for Solving Poisson’s Equations
- An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
