Optimal solution of nonlinear equations
From MaRDI portal
The paper surveys some recent worst-case complexity results for the solution of a nonlinear equation \(f(x)=0\) and for the computation of the topological degree of f. Here f is assumed to be smooth on a real interval, the unit simplex, or the unit cube of \(R^ m\), and the information on f consists of n values of arbitrary functionals which are computed sequentially. As measure of the error of an approximation x(f) of a zero \(\alpha\) (f) of the equation the root criterion \(\| x(f)- \alpha (f)\| \leq \epsilon\) and the residual criterion \(\| f(x(f))\| \leq \epsilon\) are admitted. The paper ends with some comments about the worst case and average case analysis of iterative algorithms. A bibliography of 82 items is included.
Recommendations
- Optimal solution of nonlinear equations
- Optimal solution of ordinary differential equations
- Finding the solution of nonlinear equations by a class of optimal methods
- Nonlinear equations and optimization
- The solution of nonlinear problems
- Solution of nonlinear systems of equations by an optimal projection method
- Optimal Newton-type methods for solving nonlinear equations
- scientific article; zbMATH DE number 4016050
- Optimal Iterative Methods for Nonlinear Equations
- scientific article; zbMATH DE number 3890623
Cites work
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- n -Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations
- A bisection method for systems of nonlinear equations
- A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
- A simplification of Stenger's topological degree formula
- A survey of information-based complexity
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- A two-dimensional analogue to the method of bisections for solving nonlinear equations
- An algorithm for numerical calculation of topological degree
- An efficient degree-computation method for a generalized method of bisection
- An integral-interpolation iterative method for the solution of scalar equations
- An optimal algorithm for finding the roots of an approximately computed function
- Asymptotic near optimality of the bisection method
- Bisection is optimal
- Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
- Can we approximate zeros of functions with nonzero topological degree?
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- Computing the topological degree of a mapping in \(R^n\)
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- Convergence and Complexity of Newton Iteration for Operator Equations
- Effective Price Mechanisms
- Families of rational maps and iterative root-finding algorithms
- For which error criteria can we solve nonlinear equations?
- Global Convergence of a Modified Newton Iteration for Algebraic Equations
- High Order Search Methods for Finding Roots
- scientific article; zbMATH DE number 3827201 (Why is no real title available?)
- scientific article; zbMATH DE number 3651397 (Why is no real title available?)
- scientific article; zbMATH DE number 3688714 (Why is no real title available?)
- scientific article; zbMATH DE number 3790207 (Why is no real title available?)
- scientific article; zbMATH DE number 3466443 (Why is no real title available?)
- scientific article; zbMATH DE number 3473205 (Why is no real title available?)
- scientific article; zbMATH DE number 3533995 (Why is no real title available?)
- scientific article; zbMATH DE number 3533996 (Why is no real title available?)
- scientific article; zbMATH DE number 3533999 (Why is no real title available?)
- scientific article; zbMATH DE number 3537168 (Why is no real title available?)
- scientific article; zbMATH DE number 3537171 (Why is no real title available?)
- scientific article; zbMATH DE number 3545108 (Why is no real title available?)
- scientific article; zbMATH DE number 3553652 (Why is no real title available?)
- scientific article; zbMATH DE number 3620621 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- scientific article; zbMATH DE number 3388498 (Why is no real title available?)
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions
- Location of Zeros of Derivatives
- Maximal Stationary Iterative Methods for the Solution of Operator Equations
- On Algorithms for Solvingf(x)=0
- On the complexity of a piecewise linear algorithm for approximating roots of complex polynomials
- On the construction of sufficient refinements for computation of topological degree
- On the cost of approximating all roots of a complex polynomial
- On the cost of computing roots of polynomials
- On the efficiency of algorithms of analysis
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Optimal Dissection of Simplices
- Optimal iterative processes for root-finding
- Optimal Order and Efficiency for Iterations with Two Evaluations
- Optimal Order of One-Point and Multipoint Iteration
- Optimal radius of convergence of interpolatory iterations for operator equations
- Optimal search for the roots of a function satisfying a lipschitz condition
- Optimal solution of nonlinear equations satisfying a Lipschitz condition
- Optimal transformations for scalar sequences
- Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
- Perspectives on information-based complexity
- Sequential Minimax Search for a Maximum
- Sequential Minimax Search for a Zero of a Convex Function
- Sequential search of an optimal dosage: Non‐bayesian methods
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Study of linear information for classes of polynomial equations
- Systematic Search in High Dimensional Sets
- The fundamental theorem of algebra and complexity theory
- The strength of nonstationary iteration
- Tight bounds on the complexity index of one-point iterations
Cited in
(29)- Solution of nonlinear systems of equations by an optimal projection method
- Average case optimality
- A survey of information-based complexity
- For which error criteria can we solve nonlinear equations?
- Complexity of fixed points. I
- Why does information-based complexity use the real number model?
- Average errors for zero finding: Lower bounds for smooth or monotone functions
- Efficient approximation schemes for economic lot-sizing in continuous time
- A recursive algorithm for the infinity-norm fixed point problem
- Optimality of the method of fundamental solutions
- General equilibrium models and homotopy methods
- Approximating fixed points of weakly contracting mappings
- Survey on generalizations of the intermediate value theorem and applications
- Unique end of potential line
- Some complexity results for zero finding for univariate functions
- A note on two fixed point problems
- Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process
- Interpolation of Lipschitz functions
- Optimal solution of nonlinear equations
- Recent developments in information-based complexity
- Equilibria, fixed points, and complexity classes
- Average-Case Optimality of a Hybrid Secant-Bisection Method
- scientific article; zbMATH DE number 5592491 (Why is no real title available?)
- Average-case results for zero finding
- Rate lifting for stochastic process algebra by transition context augmentation
- On the complexity of isolating real roots and computing with certainty the topological degree
- A two-dimensional bisection envelope algorithm for fixed points
- On degeneration of tetrahedra under longest-edge n-section refinement
- Existence and computation of short-run equilibria in economic geography
This page was built for publication: Optimal solution of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1086985)
