Complexity of Solving Linear Systems in Different Models of Computation

DOI10.1137/0721041zbMath0563.65014OpenAlexW2010798306MaRDI QIDQ3677053

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

complexitycomparisonNewton's methodsystolic arraysGaussian eliminationvariable precision modelparallel numerical methodsGivens transforms

Mathematics Subject Classification ID

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

Related Items

Perspectives on information-based complexity ⋮ Some complexity results in parallel matrix-based signal processing ⋮ Parallel algorithm for householder transformation with applications to Ill-conditioned problems ⋮ Matrix inversion in RNC\(^ 1\) ⋮ A new convex objective function for the supervised learning of single-layer neural networks ⋮ ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages ⋮ Information-based complexity: New questions for mathematicians ⋮ Fast and efficient parallel solution of dense linear systems