Complexity of Solving Linear Systems in Different Models of Computation
From MaRDI portal
Publication:3677053
DOI10.1137/0721041zbMath0563.65014MaRDI QIDQ3677053
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
complexity; comparison; Newton's method; systolic arrays; Gaussian elimination; variable precision model; parallel numerical methods; Givens transforms
68Q25: Analysis of algorithms and problem complexity
65G50: Roundoff error
65F05: Direct numerical methods for linear systems and matrix inversion
Related Items
Parallel algorithm for householder transformation with applications to Ill-conditioned problems, Information-based complexity: New questions for mathematicians, Some complexity results in parallel matrix-based signal processing, A new convex objective function for the supervised learning of single-layer neural networks, Matrix inversion in RNC\(^ 1\), Fast and efficient parallel solution of dense linear systems, ν☆: a robot path planning algorithm based on renormalised measure of probabilistic regular languages, Perspectives on information-based complexity