A rapid generalized method of bisection for solving systems of non-linear equations
In dieser Arbeit wird ein verallgemeinerter Bisektions-Algorithmus zur Lösung eines nichtlinearen Gleichungssystems \(F(x)=0\) vorgestellt, der auf einer Arbeit von \textit{B. Kearfott} beruht [ibid. 32, 109-127 (1979; Zbl 0386.65016)]. Dort wird ein Algorithmus zur Berechnung des topologischen Abbildungsgrades von F untersucht und darauf hingewiesen, daß dieser Algorithmus auch iterativ zur Bestimmung von Nullstellen von F eingesetzt werden kann. Diese Idee wird in der vorliegenden Arbeit ausgeführt; durch Einführung des Begriffes des zulässigen Polygons kann dabei in den einzelnen Schritten auf die aufwendige Berechnung des Abbildungsgrades verzichtet werden. Der Algorithmus wird an Beispielen mit zwei, drei und vier Unbekannten vorgeführt.
- Improved Newton's method without direct function evaluations
- On the efficiency of Newton and Broyden numerical methods in the investigation of the regular polygon problem of (N + 1) bodies
- A new trigonometrical algorithm for computing real root of non-linear transcendental equations
- From linear to nonlinear iterative methods
- Locating, characterizing and computing the stationary points of a function
- Survey on generalizations of the intermediate value theorem and applications
- Fast intersection methods for the solution of some nonlinear systems of equations
- A bisection method for systems of nonlinear equations
- Solving systems of nonlinear equations In using a rotating hyperplane in
- AN ALGORITHM FOR FINDING ALL ZEROS OF VECTOR FUNCTIONS
- The implicit function theorem for solving systems of nonlinear equations in
- A dimension-reducing method for solving systems of nonlinear equations in
- scientific article; zbMATH DE number 736340 (Why is no real title available?)
- The topological degree theory for the localization and computation of complex zeros of bessel functions
- An Adaptive Weighted Bisection Method For Finding Roots Of Non-Linear Equations
- New algorithms for computing a root of non-linear equations using exponential series
- Generalizations of the Intermediate Value Theorem for Approximating Fixed Points and Zeros of Continuous Functions
- On perturbation of roots of homogeneous algebraic systems
- A modified Newton direction for unconstrained optimization
- Application of the characteristic bisection method for locating and computing periodic orbits in molecular systems
- An algorithm for finding all solutions of a nonlinear system
- On the complexity of isolating real roots and computing with certainty the topological degree
- Computing approximate roots of monotone functions
- Derivative-free root-finding algorithms: perpendicular and extended secant methods with CESTAC validation
- Pure strategy solutions in the progressive discrete silent duel with quadratic accuracy symmetry and shooting uniform jitter
- A convergence-improving iterative method for computing periodic orbits near bifurcation points
This page was built for publication: A rapid generalized method of bisection for solving systems of non-linear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1083175)
