Optimal solution of nonlinear equations
From MaRDI portal
Publication:1086985
DOI10.1016/0885-064X(85)90011-1zbMath0609.65036OpenAlexW4210281981MaRDI QIDQ1086985
Publication date: 1985
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0885-064x(85)90011-1
bibliographyiterative algorithmstopological degreeworst-case complexityadaptive informationerror criteriaresidual criterionroot criterion
Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Degree, winding number (55M25) Numerical computation of solutions to single equations (65H05)
Related Items
A survey of information-based complexity, For which error criteria can we solve nonlinear equations?, Average errors for zero finding: Lower bounds for smooth or monotone functions, A recursive algorithm for the infinity-norm fixed point problem, Complexity of fixed points. I, Existence and computation of short-run equilibria in economic geography, Unique end of potential line, Recent developments in information-based complexity, General equilibrium models and homotopy methods, Equilibria, fixed points, and complexity classes, Approximating fixed points of weakly contracting mappings, A note on two fixed point problems, Efficient approximation schemes for economic lot-sizing in continuous time, On the complexity of isolating real roots and computing with certainty the topological degree, A two-dimensional bisection envelope algorithm for fixed points, Improved sign-based learning algorithm derived by the composite nonlinear Jacobi process, Interpolation of Lipschitz functions, Average-case results for zero finding, Average-Case Optimality of a Hybrid Secant-Bisection Method, Why does information-based complexity use the real number model?, Survey on generalizations of the intermediate value theorem and applications, Average case optimality
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of computing topological degree of Lipschitz functions in n dimensions
- The strength of nonstationary iteration
- Asymptotic near optimality of the bisection method
- Optimal solution of nonlinear equations satisfying a Lipschitz condition
- Optimal transformations for scalar sequences
- A survey of information-based complexity
- For which error criteria can we solve nonlinear equations?
- Families of rational maps and iterative root-finding algorithms
- Can we approximate zeros of functions with nonzero topological degree?
- Study of linear information for classes of polynomial equations
- Tight bounds on the complexity index of one-point iterations
- Optimal radius of convergence of interpolatory iterations for operator equations
- Convergence and complexity of interpolatory-Newton iteration in a Banach space
- On the construction of sufficient refinements for computation of topological degree
- Bisection is optimal
- Computing the topological degree of a mapping in \(R^n\)
- An integral-interpolation iterative method for the solution of scalar equations
- An efficient degree-computation method for a generalized method of bisection
- A simplification of Stenger's topological degree formula
- Optimal iterative processes for root-finding
- Computational Complexity: On the Geometry of Polynomials and a Theory of Cost: II
- Optimum Sequential Search and Approximation Methods Under Minimum Regularity Assumptions
- On the cost of computing roots of polynomials
- A bisection method for systems of nonlinear equations
- 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 efficiency of algorithms of analysis
- Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations
- Can Any Stationary Iteration Using Linear Information Be Globally Convergent?
- The fundamental theorem of algebra and complexity theory
- n -Evaluation Conjecture for Multipoint Iterations for the Solution of Scalar Nonlinear Equations
- Global Convergence of a Modified Newton Iteration for Algebraic Equations
- Perspectives on information-based complexity
- High Order Search Methods for Finding Roots
- Maximal Stationary Iterative Methods for the Solution of Operator Equations
- Optimal Order and Efficiency for Iterations with Two Evaluations
- Optimal search for the roots of a function satisfying a lipschitz condition
- Systematic Search in High Dimensional Sets
- A two-dimensional analogue to the method of bisections for solving nonlinear equations
- Optimal Dissection of Simplices
- Effective Price Mechanisms
- Convergence and Complexity of Newton Iteration for Operator Equations
- Integrals with a Kernel in the Solution of Nonlinear Equations in N Dimensions
- An algorithm for numerical calculation of topological degree
- On Algorithms for Solvingf(x)=0
- A Three-Dimensional Analogue to the Method of Bisections for Solving Nonlinear Equations
- A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization
- Sequential search of an optimal dosage: Non‐bayesian methods
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Optimal Order of One-Point and Multipoint Iteration
- Location of Zeros of Derivatives
- An optimal algorithm for finding the roots of an approximately computed function
- Sequential Minimax Search for a Zero of a Convex Function
- Sequential Minimax Search for a Maximum
