scientific article; zbMATH DE number 1069617
From MaRDI portal
Publication:4356579
zbMATH Open0883.65125MaRDI QIDQ4356579FDOQ4356579
Authors: Stephen Smale 
Publication date: 23 March 1998
Title of this publication is not available (Why is that?)
Recommendations
algorithmscomputational complexitycondition numberpolynomial timepolynomial time complexityNP problemcomplexity theory of numerical analysis
Complexity and performance of numerical algorithms (65Y20) Analysis of algorithms and problem complexity (68Q25)
Cited In (59)
- On the computation of geometric features of spectra of linear operators on Hilbert spaces
- Pseudospectral shattering, the sign function, and diagonalization in nearly matrix multiplication time
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing
- Newton's method for sections on Riemannian manifolds: Generalized covariant \(\alpha \)-theory
- Extended Newton Methods for Multiobjective Optimization: Majorizing Function Technique and Convergence Analysis
- Local convergence of Newton's method on the Heisenberg group
- Condition number bounds for problems with integer coefficients
- Probabilistic analysis of the Grassmann condition number
- Title not available (Why is that?)
- The Legacy of Turing in Numerical Analysis
- Robust smoothed analysis of a condition number for linear programming
- Convergence behavior for Newton-Steffensen's method under \(\gamma\)-condition of second derivative
- A method for computing the number of iterations in data dependent loops
- On the Complexity of Numerical Analysis
- Extending the applicability of the Gauss-Newton method under average Lipschitz-type conditions
- Extended Newton methods for conic inequalities: approximate solutions and the extended Smale \(\alpha\)-theory
- On a problem posed by Steve Smale
- On semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spaces
- Computing spectral measures and spectral types
- Geometry of polynomials and root-finding via path-lifting
- Convergence behavior of Gauss-Newton's method and extensions of the Smale point estimate theory
- Uniqueness of the singular points of vector fields on Riemannian manifolds under the \(\gamma\)-condition
- On the solution of systems of equations with constant rank derivatives
- Primal and dual model representations in kernel-based learning
- The probability that a slightly perturbed numerical analysis problem is difficult
- Complexity analysis and its application
- Two-square theorems for infinite matrices on certain fields
- A note on the finite variance of the averaging function for polynomial system solving
- Convergence of the reach for a sequence of Gaussian-embedded manifolds
- The foundations of spectral computations via the solvability complexity index hierarchy
- Kantorovich-type convergence criterion for inexact Newton methods
- Computational cost of the Fekete problem. I: The forces method on the 2-sphere
- Estimating the local radius of convergence for Picard iteration
- On numerical stability in large scale linear algebraic computations
- Complete decomposition of symmetric tensors in linear time and polylogarithmic precision
- Local and global behavior for algorithms of solving equations
- Newton's method and its use in optimization
- Relations between roots and coefficients, interpolation and application to system solving
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- On the complexity of the Plantinga-Vegter algorithm
- Condition numbers for the cube. I: Univariate polynomials and hypersurfaces
- Computing the homology of semialgebraic sets. I: Lax formulas
- On the efficiency of algorithms of analysis
- Kantorovich's type theorems for systems of equations with constant rank derivatives
- Newton-Kantorovich method and its global convergence
- On the condition of the zeros of characteristic polynomials
- Local convergence of generalized Mann iteration
- Local convergence radius for the Mann-type iteration
- Globally convergent, iterative path-following for algebraic equations
- On the cost of iterative computations
- Convergence of Gauss-Newton's method and uniqueness of the solution
- Rigid continuation paths II. structured polynomial systems
- Title not available (Why is that?)
- Local convergence of the Newton’s method in two step nilpotent Lie groups
- On the solvability complexity index, the \(n\)-pseudospectrum and approximations of spectra of operators
- Topics in real and complex number complexity theory
- Adversarial smoothed analysis
- Smale's \(\alpha \)-theory for inexact Newton methods under the \(\gamma \)-condition
- Real computations with fake numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4356579)
