On the efficiency of algorithms of analysis
From MaRDI portal
computational complexityefficiency of linear programmingefficient zero findingNewton's methodvon Neumann-Wilkinson condition numberwell-posed linear systems
Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Iterative numerical methods for linear systems (65F10) Numerical computation of solutions to systems of equations (65H10) General theory of numerical analysis in abstract spaces (65J05) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99) Linear programming (90C05)
Recommendations
Cites work
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- A convergent process of price adjustment and global Newton methods
- Cayley's problem and Julia sets
- Complex analytic dynamics on the Riemann sphere
- Complexity of Bezout's theorem. III: Condition number and packing
- Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
- Gaussian measures in Banach spaces
- scientific article; zbMATH DE number 3121940 (Why is no real title available?)
- scientific article; zbMATH DE number 3134444 (Why is no real title available?)
- scientific article; zbMATH DE number 3167270 (Why is no real title available?)
- scientific article; zbMATH DE number 3844090 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3705543 (Why is no real title available?)
- scientific article; zbMATH DE number 3476451 (Why is no real title available?)
- scientific article; zbMATH DE number 3565290 (Why is no real title available?)
- scientific article; zbMATH DE number 3623496 (Why is no real title available?)
- scientific article; zbMATH DE number 3624682 (Why is no real title available?)
- scientific article; zbMATH DE number 1234098 (Why is no real title available?)
- scientific article; zbMATH DE number 1024452 (Why is no real title available?)
- scientific article; zbMATH DE number 3992915 (Why is no real title available?)
- scientific article; zbMATH DE number 3248502 (Why is no real title available?)
- scientific article; zbMATH DE number 3307642 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3200250 (Why is no real title available?)
- Newton's Method, Circle Maps, and Chaotic Motion
- On the average number of steps of the simplex method of linear programming
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- On the cost of approximating all roots of a complex polynomial
- On the cost of computing roots of polynomials
- On the iteration of a rational function: Computer experiments with Newton's method
- The Average number of pivot steps required by the Simplex-Method is polynomial
- The Efficiency of the Simplex Method: A Survey
- The fundamental theorem of algebra and complexity theory
- The Solution of Systems of Piecewise Linear Equations
Cited in
(only showing first 100 items - show all)- Average case optimality
- On the existence of generally convergent algorithms
- Optimal solution of nonlinear equations
- Algebraic complexity of computing polynomial zeros
- Sequential and parallel complexity of approximate evaluation of polynomial zeros
- On the worst-case arithmetic complexity of approximating zeros of polynomials
- Complexity of fixed points. I
- Optimal quadratures with regard to the efficiency
- Complexity theory of numerical linear algebra
- Braiding of the attractor and the failure of iterative algorithms
- A polynomial-time algorithm, based on Newton's method, for linear programming
- A probabilistic theory for error estimation in automatic integration
- Discrete versus continuous Newton's method: A case study
- Newton's method and complex dynamical systems
- Statistical complexity of the power method for Markov chains
- On zero finding methods of higher order from data at one point
- On the convergence of Newton's method
- Condition numbers of random matrices
- Corrections to Probabilistic analysis of numerical methods for integral equations
- Unified complexity analysis for Newton LP methods
- Statistical complexity of dominant eigenvector calculation
- Families of rational maps and convergence basins of Newton's method
- Some computational methods for systems of nonlinear equations and systems of polynomial equations
- Convergence of the iteration of Halley's family and Smale operator class in Banach space
- A global analysis of Newton iterations for determining turning points
- Uniform convergence of higher order quasi Hermite-Fejér interpolation
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Local and global behavior for algorithms of solving equations
- The theory of Newton's method
- Newton's method for analytic systems of equations with constant rank derivatives
- Extraneous fixed points of Euler iteration and corresponding Sullivan's basin
- A stable family with high order of convergence for solving nonlinear equations
- Dynamics and limiting behavior of Julia sets of König's method for multiple roots
- Blowup points and baby Mandelbrot sets for a family of singularly perturbed rational maps
- Stability analysis of a parametric family of iterative methods for solving nonlinear models
- The smallest singular value of a shifted d-regular random square matrix
- An information technology for efficiency analysis of recursive algorithms using standard complexity recurrences
- Convergence analysis of Davidchack and Lai's algorithm for finding periodic orbits
- Smoothed analysis of \(\kappa(A)\)
- The implementation of linear programming algorithms based on homotopies
- Linear programming, complexity theory and elementary functional analysis
- Computing spectral measures and spectral types
- Sharp transition of the invertibility of the adjacency matrices of sparse random graphs
- The asymptotic distribution of the condition number for random circulant matrices
- Superattracting extraneous fixed points and n-cycles for Chebyshev's method on cubic polynomials
- A remark on the smallest singular value of powers of Gaussian matrices
- On the classification of plane graphs representing structurally stable rational Newton flows
- An adaptive Newton-method based on a dynamical systems approach
- A modern retrospective on probabilistic numerics
- Chaos in King's iterative family
- Newton's method in practice: finding all roots of polynomials of degree one million efficiently
- Average-case complexity without the black swans
- An analysis of the WITT algorithm
- Two-square theorems for infinite matrices on certain fields
- On general convergence in extracting radicals via a fundamental family of iteration functions
- Point estimation of simultaneous methods for solving polynomial equations: A survey. II.
- Dynamics of a higher-order family of iterative methods
- Attracting cycles for the relaxed Newton's method
- Dynamics of a family of Chebyshev-Halley type methods
- New identities in the Catalan triangle
- The Littlewood-Offord problem and invertibility of random matrices
- Upper bounds on the distribution of the condition number of singular matrices
- Immediate and virtual basins of Newton's method for entire functions.
- Simplex method and groups generated by reflections
- The Durand-Kerner polynomials roots-finding method in case of multiple roots
- On the separatrix graph of a rational vector field on the Riemann sphere
- On the basins of attraction of a one-dimensional family of root finding algorithms: from Newton to Traub
- Condition number of a square matrix with i.i.d. columns drawn from a convex body
- Sinks with relatively large immediate basins and a refinement of Mañé's C^1 generic dichotomy
- Universality in numerical computations with random data
- The Newton-Raphson method and adaptive ODE solvers
- Smooth analysis of the condition number and the least singular value
- Some connections of complex dynamics
- Plane Autonomous Systems with Rational Vector Fields
- On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
- Invertibility of random fredholm operators
- Rayleigh Quotient Iteration for Nonsymmetric Matrices
- scientific article; zbMATH DE number 5364247 (Why is no real title available?)
- Newton vector fields on the plane and on the torus
- A New Inequality for Complex-Valued Polynomial Functions
- Recent developments in information-based complexity
- scientific article; zbMATH DE number 4066861 (Why is no real title available?)
- A critique of numerical analysis
- Chaotic Numerics From an Integrable Hamiltonian System
- Further analysis of the remedian algorithm
- Numerical Dynamics of Ordinary Differential Equations with Singularity
- On optimal fourth-order iterative methods free from second derivative and their dynamics
- Iteration of meromorphic functions
- Global dynamical properties of Euler and backward Euler
- Approximate Zeros of Quadratically Convergent Algorithms
- McMullen’s root-finding algorithm for cubic polynomials
- scientific article; zbMATH DE number 1069617 (Why is no real title available?)
- Universality for Eigenvalue Algorithms on Sample Covariance Matrices
- Complex random matrices have no real eigenvalues
- Geometry of polynomials and root-finding via path-lifting
- Dynamics of a fifth-order iterative method
- Stability study of eighth-order iterative methods for solving nonlinear equations
- A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method
- Newton's method and the computational complexity of the fundamental theorem of algebra
- scientific article; zbMATH DE number 6169004 (Why is no real title available?)
This page was built for publication: On the efficiency of algorithms of analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3721699)
