Complexity of Solving Linear Systems in Different Models of Computation

DOI10.1137/0721041zbMATH Open0563.65014OpenAlexW2010798306MaRDI QIDQ3677053FDOQ3677053

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

Recommendations

• scientific article
• 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 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)

Cited In (12)

• Title not available (Why is that?)
• Perspectives on information-based complexity
• Upper bounds on the complexity of solving systems of linear equations
• Computability in linear algebra
• ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages
• Fast and efficient parallel solution of dense linear systems
• 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
• Information-based complexity: New questions for mathematicians
• Matrix inversion in RNC\(^ 1\)
• Some complexity results in parallel matrix-based signal processing
• Parallel algorithm for householder transformation with applications to Ill-conditioned problems

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)