The multivariate bisection algorithm
From MaRDI portal
Publication:5227502
Abstract: The aim of this paper is the study of the bisection method in . In this work we propose a multivariate bisection method supported by the Poincar'e-Miranda theorem in order to solve non-linear system of equations. Given an initial cube verifying the hypothesis of Poincar'e-Miranda theorem the algorithm performs congruent refinements throughout its center by generating a root approximation. Throughout preconditioning we will prove the local convergence of this new root finder methodology and moreover we will perform a numerical implementation for the two dimensional case.
Recommendations
Cites work
- scientific article; zbMATH DE number 3454058 (Why is no real title available?)
- scientific article; zbMATH DE number 1440908 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- A Machine Method for Solving Polynomial Equations
- A New Method of Solving Nonlinear Simultaneous Equations
- Algorithmic error estimation for approximate solutions of nonlinear systems of equations
- Introduction to Interval Analysis
- The Poincare-Miranda Theorem
Cited in
(5)- Complexity of the bisection method
- scientific article; zbMATH DE number 4037050 (Why is no real title available?)
- scientific article; zbMATH DE number 5499421 (Why is no real title available?)
- scientific article; zbMATH DE number 176428 (Why is no real title available?)
- A modified DIRECT algorithm with bilevel partition
This page was built for publication: The multivariate bisection algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5227502)