Computational Complexity and Numerical Stability

DOI10.1137/0204009zbMath0303.65028OpenAlexW1984797285MaRDI QIDQ4058013

Webb Miller

Publication date: 1975

Published in: SIAM Journal on Computing (Search for Journal in Brave)

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

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 (15)

On the complexity of linear quadratic control ⋮ Fast matrix multiplication is stable ⋮ A non-iterative method for vertex corrections of the Kubo formula for electric conductivity ⋮ Stability of fast algorithms for matrix multiplication ⋮ Fast structured matrix computations: tensor rank and Cohn-Umans method ⋮ The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic ⋮ A parallel method for fast and practical high-order Newton interpolation ⋮ Multilinear algebra and parallel programming ⋮ Using Strassen's algorithm to accelerate the solution of linear systems ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ On the depth complexity of formulas ⋮ Improving the Numerical Stability of Fast Matrix Multiplication ⋮ A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors ⋮ Why does information-based complexity use the real number model? ⋮ Real computations with fake numbers

This page was built for publication: Computational Complexity and Numerical Stability