Computational Complexity and Numerical Stability

DOI10.1137/0204009zbMATH Open0303.65028OpenAlexW1984797285MaRDI QIDQ4058013FDOQ4058013

Authors: 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

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

Cited In (15)

• On the complexity of linear quadratic control
• The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic
• Using Strassen's algorithm to accelerate the solution of linear systems
• A recursive doubling algorithm for solution of tridiagonal systems on hypercube multiprocessors
• On the depth complexity of formulas
• A theory of complexity, condition, and roundoff
• A parallel method for fast and practical high-order Newton interpolation
• Fast matrix multiplication is stable
• Fast structured matrix computations: tensor rank and Cohn-Umans method
• Stability of fast algorithms for matrix multiplication
• Multilinear algebra and parallel programming
• A non-iterative method for vertex corrections of the Kubo formula for electric conductivity
• Improving the numerical stability of fast matrix multiplication
• 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

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