Complexity of Solving Linear Systems in Different Models of Computation

DOI10.1137/0721041MaRDI QIDQ3677053zbMATH OpenOpenAlexFDO

Authors Adam W. Bojanczyk

Publication date 1984

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0721041

zbMATH Keywords

Gaussian eliminationcomplexitycomparisonNewton's methodsystolic arraysvariable precision modelparallel numerical methodsGivens transforms

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25) Roundoff error (65G50)

Recommendations

• scientific article; zbMATH DE number 4215257
• On the computational complexity of the solution of linear systems with moduli
• scientific article; zbMATH DE number 1163749
• Upper bounds on the complexity of solving systems of linear equations
• The computational complexity of some problems of linear algebra
• The true complexity of a system of linear equations
• Computational complexity of solving equation systems
• Computational Complexity and Numerical Stability of Linear Problems
• Linear complexity parallel algorithms for linear systems of equations with recursive structure
• scientific article; zbMATH DE number 4076454

Cited in

(12)

• Perspectives on information-based complexity
• Upper bounds on the complexity of solving systems of linear equations
• Some complexity results in parallel matrix-based signal processing
• Fast and efficient parallel solution of dense linear systems
• ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages
• Computability in linear algebra
• Information-based complexity: New questions for mathematicians
• Analysis of the binary complexity of asymptotically fast algorithms for linear system solving
• A new convex objective function for the supervised learning of single-layer neural networks
• Parallel algorithm for householder transformation with applications to Ill-conditioned problems
• Matrix inversion in RNC\(^ 1\)
• scientific article; zbMATH DE number 3581612 (Why is no real title available?)

This page was built for publication: Complexity of Solving Linear Systems in Different Models of Computation

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