Some Remarks on the Foundations of Numerical Analysis

DOI10.1137/1032043MaRDI QIDQ3482745zbMATH OpenOpenAlexFDO

Authors Stephen Smale

Publication date 1990

Published in SIAM Review (Search for Journal in Brave)

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

zbMATH Keywords

algorithmcomparisoncomputer sciencecomputer programfoundations in numerical analysis

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02)

Recommendations

• scientific article; zbMATH DE number 3156636
• scientific article; zbMATH DE number 4013838
• scientific article; zbMATH DE number 4217264
• Notes on the basic notions in nonlinear numerical analysis
• scientific article; zbMATH DE number 1979681
• Some problems in approximation theory and numerical analysis
• A theoretical introduction to numerical analysis
• Theoretical Numerical Analysis
• Theoretical Numerical Analysis
• Foundations of numerical mathematics and scientific computing

Cited in

(24)

• A theory of complexity for continuous time systems
• Real computations with fake numbers
• \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
• Real data-integer solution problems within the Blum-Shub-Smale computational model
• An alternative to Ben-Or's lower bound for the knapsack problem complexity
• scientific article; zbMATH DE number 997676 (Why is no real title available?)
• A refined model of computation for continuous problems
• A theory of complexity, condition, and roundoff
• From numerical mathematics to computer analysis in the work of N. J. Lehmann
• Algorithmic analysis of irrational rotations in a single neuron model
• Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
• A critique of numerical analysis
• On the complexity of linear programming under finite precision arithmetic
• Complexity of Bezout's theorem. V: Polynomial time
• scientific article; zbMATH DE number 219154 (Why is no real title available?)
• scientific article; zbMATH DE number 3848481 (Why is no real title available?)
• Linear programming, complexity theory and elementary functional analysis
• scientific article; zbMATH DE number 1979681 (Why is no real title available?)
• scientific article; zbMATH DE number 2109415 (Why is no real title available?)
• Some fundamental issues in computational mathematics
• Computable scalar fields: A basis for PDE software
• A weak version of the Blum, Shub, and Smale model
• On the complexity of solving feasible systems of linear inequalities specified with approximate data
• Numerical analysis vs. Mathematics

This page was built for publication: Some Remarks on the Foundations of Numerical Analysis

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