Upper bounds on the complexity of solving systems of linear equations
type: Item
instance of: scholarly article
title: Upper bounds on the complexity of solving systems of linear equations
zbMATH Open document ID: 0563.68039
DOI: 10.1007/BF02104747
author: V. I. Solodovnikov
published in: Journal of Soviet Mathematics
publication date: 1985-01-01T00:00:00Z
review text: Translation from Zap. Nauchn. Semin. Leningr. Otd. Mat. Inst. Steklova 118, 159-187 (Russian) (1982; Zbl 0494.68052).
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W99
Mathematics Subject Classification ID: 65F10
Mathematics Subject Classification ID: 68-02
Mathematics Subject Classification ID: 65-02
zbMATH DE Number: 3898235
zbMATH Keywords: parallel algorithms
zbMATH Keywords: matrix multiplication and inversion
zbMATH Keywords: sequential algorithms
MaRDI profile type: Publication
cites work: Q4091421
cites work: Q5818478
cites work: Minimization of the number of arithmetic operations in the solution of linear algebraic systems of equations
cites work: Parallel computations in linear algebra
cites work: Parallel computations in linear algebra. II
cites work: Q5617226
cites work: Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
cites work: \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
cites work: Q4190138
cites work: Triangular Factorization and Inversion by Fast Matrix Multiplication
cites work: On Direct Methods for Solving Poisson’s Equations
cites work: Time and Parallel Processor Bounds for Linear Recurrence Systems
cites work: On the Asymptotic Complexity of Matrix Multiplication
cites work: Fast Parallel Matrix Inversion Algorithms
cites work: A Survey of Parallel Algorithms in Numerical Linear Algebra
cites work: On the Parallel Evaluation of Multivariate Polynomials
cites work: Matrix Inversion Using Parallel Processing
cites work: An improved parallel processor bound in fast matrix inversion
cites work: An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations
cites work: Q3719829
cites work: An Algorithm for the Inversion of Finite Toeplitz Matrices
cites work: Computing multivariate polynomials in parallel
cites work: Q3912022
cites work: A Computation Model of Parallel Solution of Linear Equations
cites work: Q3875192
Recommended article: Q3361793
Recommended article: The true complexity of a system of linear equations
Recommended article: On the computational complexity of the solution of linear systems with moduli
Recommended article: Q5090373
Recommended article: Complexity of Solving Linear Systems in Different Models of Computation
Recommended article: An improvement of the complexity bound for solving systems of polynomial equations
Recommended article: The complexity of matrix rank and feasible systems of linear equations
Recommended article: Q4395357
Recommended article: The complexity of solution-free sets of integers for general linear equations
Recommended article: The solvability of linear systems and the satisfiability
description: scientific article; zbMATH DE number 3898235