Computational Complexity and Numerical Stability
- 1 June 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 4 (2) , 97-107
- https://doi.org/10.1137/0204009
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The Parallel Evaluation of General Arithmetic ExpressionsJournal of the ACM, 1974
- On the Number of Multiplications for the Evaluation of a Polynomial and Some of Its DerivativesJournal of the ACM, 1974
- Complexity of Computer ComputationsPublished by Springer Nature ,1972
- Modern Error AnalysisSIAM Review, 1971
- On Minimizing the Number of Multiplications Necessary for Matrix MultiplicationSIAM Journal on Applied Mathematics, 1971
- The stable calculation of polynomial valuesUSSR Computational Mathematics and Mathematical Physics, 1971
- Roundoff error analysis of the fast Fourier transformMathematics of Computation, 1971
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identityNumerische Mathematik, 1970
- Stable evaluation of polynomialsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1967
- On the conditioning of polynomial and rational formsNumerische Mathematik, 1965