Some Remarks on the Foundations of Numerical Analysis
From MaRDI portal
Publication:3482745
DOI10.1137/1032043zbMath0703.65003OpenAlexW2049390837MaRDI QIDQ3482745
Publication date: 1990
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/1032043
Related Items
Complexity of Bezout's theorem. V: Polynomial time ⋮ Real data-integer solution problems within the Blum-Shub-Smale computational model ⋮ On the complexity of solving feasible systems of linear inequalities specified with approximate data ⋮ On the complexity of linear programming under finite precision arithmetic ⋮ Linear programming, complexity theory and elementary functional analysis ⋮ Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing ⋮ A weak version of the Blum, Shub, and Smale model ⋮ \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) ⋮ A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF ⋮ A refined model of computation for continuous problems ⋮ Computable scalar fields: A basis for PDE software ⋮ A theory of complexity for continuous time systems ⋮ Real computations with fake numbers ⋮ An alternative to Ben-Or's lower bound for the knapsack problem complexity ⋮ Algorithmic analysis of irrational rotations in a single neuron model
