The multivariate bisection algorithm
From MaRDI portal
Publication:5227502
zbMATH Open1416.65142arXiv1702.05542MaRDI QIDQ5227502FDOQ5227502
Authors: Manuel López Galván
Publication date: 6 August 2019
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.
Full work available at URL: https://arxiv.org/abs/1702.05542
Recommendations
Numerical computation of solutions to systems of equations (65H10) Interval and finite arithmetic (65G30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Introduction to Interval Analysis
- The Poincare-Miranda Theorem
- A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane
- A Machine Method for Solving Polynomial Equations
- Title not available (Why is that?)
- A New Method of Solving Nonlinear Simultaneous Equations
- Algorithmic error estimation for approximate solutions of nonlinear systems of equations
Cited In (5)
Uses Software
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)