Transformation methods for finding multiple roots of nonlinear equations
The problem of finding a root of multiplicity \((m\geq 1)\) of a nonlinear equation on an interval \((a,b)\) is considered. The function \(f(x)\) is transformed to a hyper tangent function combined with a simple difference formula whose value changes from \((-1)\) to 1 as \((x)\) passes through the root of function. Then the so-called numerical integration method is applied to the transformed equation. A Steffensen-type iterative method which does not require any derivatives of \(f(x)\) nor is quite effected by an initial approximation is proposed. It is shown that the convergence order of the proposed method becomes cubic by simultaneous approximation to the root and its multiplicity.
- A derivative free iterative method for finding multiple roots of nonlinear equations
- Finding a Multiple Zero by Transformations and Newton-Like Methods
- New higher order methods for solving nonlinear equations with multiple roots
- An improved method for finding multiple roots and it's multiplicity of nonlinear equations in \(\mathbb R\)
- A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods
- A derivative free iterative method for finding multiple roots of nonlinear equations
- A derivative-free transformation preserving the order of convergence of iteration methods in case of multiple zeros
- A family of multiopoint iterative functions for finding multiple roots of equations
- A non-iterative method for solving non-linear equations
- A secant method for multiple roots
- A third-order modification of Newton's method for multiple roots
- An improved method for finding multiple roots and it's multiplicity of nonlinear equations in \(\mathbb R\)
- An optimal multiple root-finding method of order three
- High-order nonlinear solver for multiple roots
- scientific article; zbMATH DE number 3195683 (Why is no real title available?)
- New families of nonlinear third-order solvers for finding multiple roots
- New third order nonlinear solvers for multiple roots
- Quadratically convergent multiple roots finding method without derivatives
- Symbolic computation and computer graphics as tools for developing and studying new root-finding methods
- Fifth-order iterative method for solving multiple roots of the highest multiplicity of nonlinear equation
- A modified Brent's method for finding zeros of functions
- On developing a novel sixth order transformation method for multiple roots and its basins of attraction
- New families of third-order iterative methods for finding multiple roots
- Sigmoid-like functions and root finding methods
- Dynamical behaviors of some iterative methods for multiple roots of nonlinear equations
- Finding a Multiple Zero by Transformations and Newton-Like Methods
- Iterative methods for solving nonlinear equations with finitely many roots in an interval
- On a general transformation of multipoint root-solvers
- On generalized Halley-like methods for solving nonlinear equations
- SOME FAMILIES OF ONE AND TWO-STEP ITERATIVE METHODS FOR APPROXIMATING MULTIPLE ROOTS OF NONLINEAR EQUATIONS
- A third-order iterative algorithm for inversion of cumulative central beta distribution
- New higher order methods for solving nonlinear equations with multiple roots
- Determining the multiplicity of a root of a nonlinear algebraic equation
- Fifth-order iterative method for finding multiple roots of nonlinear equations
- A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods
- On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
- An improved method for finding multiple roots and it's multiplicity of nonlinear equations in \(\mathbb R\)
This page was built for publication: Transformation methods for finding multiple roots of nonlinear equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q711289)
