A note on two fixed point problems

DOI10.1016/J.JCO.2007.04.004MaRDI QIDQ2465828zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 9 January 2008

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jco.2007.04.004

zbMATH Keywords

combustioncomputational complexityexterior ellipsoid algorithmfixed point problemhybrid bisection-regula falsi-secant methodsystem of nonlinear equations

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Complexity and performance of numerical algorithms (65Y20)

Review text

The authors discuss and extend the applicability of the exterior ellipsoid algorithm for approximating the fixed points of a system of nonlinear equations. It is shown that the ellipsoid algorithms could be extended and applied to larger classes of functions that are only nonexpanding in the direction of fixed points. These larger classes contain functions that may be globally expanding, may be noncontinuous or may have unbounded derivatives. Also, the authors are focused on the design of a nearly optimal algorithm that is applied to univariate fixed point problems originating in modeling combustion of energetic materials. The fixed points calculations are utilized in large scale transient combustion simulation. They are repeated at every grid cell of a very large model and at every time step. This is why they have to be extremely fast and sufficiently accurate. An almost optimal (on the average) hyper-bisection/secant modification of a hybrid bisection-regula falsi-secant method, to solve a nonlinear fixed point problem is derived. A significant improvement in the cost of calculation, by the reduction of the average number of iterations, for the specific univariate zero finding problem, are obtained.

Recommendations

• An ellipsoid algorithm for the computation of fixed points
• Algorithm 848
• Circumscribed ellipsoid algorithm for fixed-point problems
• A two-dimensional bisection envelope algorithm for fixed points
• Complexity of fixed point computation

Cites work

• A recursive algorithm for the infinity-norm fixed point problem
• A two-dimensional bisection envelope algorithm for fixed points
• Algorithm 825
• Algorithm 848
• An ellipsoid algorithm for the computation of fixed points
• Approximating fixed points of weakly contracting mappings
• Average-Case Optimality of a Hybrid Secant-Bisection Method
• Bisection is optimal
• Circumscribed ellipsoid algorithm for fixed-point problems
• Complexity of fixed points. I
• Exponential lower bounds for finding Brouwer fixed points
• Feature Article—The Ellipsoid Method: A Survey
• scientific article; zbMATH DE number 3637614 (Why is no real title available?)
• scientific article; zbMATH DE number 1997558 (Why is no real title available?)
• Ill-posed problems with a priori information
• On algorithms for discrete and approximate brouwer fixed points
• Optimal solution of nonlinear equations
• Role of gas- and condensed-phase kinetics in burning rate control of energetic solids

Cited in

(5)

• Approximating fixed points of weakly contracting mappings
• Unique end of potential line
• scientific article; zbMATH DE number 5896520 (Why is no real title available?)
• Circumscribed ellipsoid algorithm for fixed-point problems
• Unique End of Potential Line

Describes a project that uses

Uses Software

• BEDFix

This page was built for publication: A note on two fixed point problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465828)