Some Remarks on the Foundations of Numerical Analysis
From MaRDI portal
Publication:3482745
DOI10.1137/1032043zbMATH Open0703.65003OpenAlexW2049390837MaRDI QIDQ3482745FDOQ3482745
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
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)
- \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
- Real data-integer solution problems within the Blum-Shub-Smale computational model
- Title not available (Why is that?)
- An alternative to Ben-Or's lower bound for the knapsack problem complexity
- 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
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Algorithmic analysis of irrational rotations in a single neuron model
- A critique of numerical analysis
- On the complexity of linear programming under finite precision arithmetic
- Complexity of Bezout's theorem. V: Polynomial time
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear programming, complexity theory and elementary functional analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some fundamental issues in computational mathematics
- Computable scalar fields: A basis for PDE software
- Numerical analysis vs. Mathematics
- On the complexity of solving feasible systems of linear inequalities specified with approximate data
- A weak version of the Blum, Shub, and Smale model
- A theory of complexity for continuous time systems
- Real computations with fake numbers
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)
