A family of root finding methods
From MaRDI portal
Publication:1239588
DOI10.1007/BF01396176zbMath0361.65041MaRDI QIDQ1239588
Eldon R. Hansen, Merrell L. Patrick
Publication date: 1977
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/132451
Related Items
Laguerre-like inclusion method for polynomial zeros, A general family of third order method for finding multiple roots, An optimal fourth order iterative method for solving nonlinear equations and its dynamics, Family of simultaneous methods of Hansen--Patrick's type, An optimal multiple root-finding method of order three, On the guaranteed convergence of the fourth order simultaneous method for polynomial zeros, An excellent derivative-free multiple-zero finding numerical technique of optimal eighth order convergence, A one parameter square root family of two-step root-finders, Dynamical behaviors of some iterative methods for multiple roots of nonlinear equations, A one parameter family of locally quartically convergent zero-finding methods, Comparative study of methods of various orders for finding repeated roots of nonlinear equations, A basic family of iteration functions for polynomial root finding and its characterizations, On Newton-type methods for multiple roots with cubic convergence, Newton-type methods of high order and domains of semilocal and global convergence, Some variants of Hansen-Patrick method with third and fourth order convergence, Empirical versus asymptotic rate of convergence of a class of methods for solving a polynomial equation, Convergence radius of Halley's method for multiple roots under center-Hölder continuous condition, Traub-Gander's family for the simultaneous determination of multiple zeros of polynomials, An improved Šiljak's algorithm for solving polynomial equations converges quadratically to multiple zeros, On zero-finding methods of the fourth order, Families of third and fourth order methods for multiple roots of nonlinear equations, A class of root finding methods, A new third-order family of nonlinear solvers for multiple roots, Comments on the Basto-Semiao-Calheiros root finding method, Construction of zero-finding methods by Weierstrass functions, On some simultaneous methods based on Weierstrass' correction, A family of simultaneous zero-finding methods, On a numerical technique for finding multiple zeros and its dynamic, A new family of adaptive methods with memory for solving nonlinear equations, On the local convergence of an eighth-order method for solving nonlinear equations, Computing multiple zeros by using a parameter in Newton-secant method, Basin attractors for various methods for multiple roots, Fifth-order iterative method for finding multiple roots of nonlinear equations, On some modified families of multipoint iterative methods for multiple roots of nonlinear equations, On the efficiency of some combined methods for polynomial complex zeros, A note on the modified super-Halley method, An efficient class of fourth-order derivative-free method for multiple-roots, Another simple way of deriving several iterative functions to solve nonlinear equations, Three new optimal fourth-order iterative methods to solve nonlinear equations, Sixth order methods for solving equations, One-point Newton-type iterative methods: a unified point of view, Convergence of the modified Halley's method for multiple zeros under Hölder continuous derivative, On a family of Halley-like methods to find simple roots of nonlinear equations, Chebyshev-Halley methods for analytic functions, A cubic-order variant of Newton's method for finding multiple roots of nonlinear equations, On a family of Laguerre methods to find multiple roots of nonlinear equations, Basins of attraction for Zhou-Chen-song fourth order family of methods for multiple roots, A family of optimal quartic-order multiple-zero finders with a weight function of the principal \(k\)th root of a derivative-to-derivative ratio and their basins of attraction, Basins of attraction for several optimal fourth order methods for multiple roots, Symbolic computation and computer graphics as tools for developing and studying new root-finding methods, Computer visualization and dynamic study of new families of root-solvers, Fifth-order iterative method for solving multiple roots of the highest multiplicity of nonlinear equation, An optimal order method for multiple roots in case of unknown multiplicity, A sixth order transformation method for finding multiple roots of nonlinear equations and basin attractors for various methods, New modifications of Hansen-Patrick's family with optimal fourth and eighth orders of convergence, Comparing the basins of attraction for Kanwar-Bhatia-Kansal family to the best fourth order method, New third order nonlinear solvers for multiple roots, Basins of attraction for several third order methods to find multiple roots of nonlinear equations, Efficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equations, On new higher order families of simultaneous methods for finding polynomial zeros, An iterative method of global convergence without derivatives in the class of smooth functions, General family of third order methods for multiple roots of nonlinear equations and basin attractors for various methods, On the convergence radius of the modified Newton method for multiple roots under the center-Hölder condition, Modified Chebyshev-Halley type method and its variants for computing multiple roots, On the \(R\)-order of some accelerated methods for the simultaneous finding of polynomial zeros, High-order nonlinear solver for multiple roots, An efficient higher order family of root finders, Traub's accelerating generator of iterative root-finding methods, An estimation of angular coordinates and angular distance of two moving objects by using the monopulse, MUSIC, and root-MUSIC methods, New families of nonlinear third-order solvers for finding multiple roots, The convergence of a family of parallel zero-finding methods, New third and fourth order nonlinear solvers for computing multiple roots, Convergence radius of the modified Newton method for multiple zeros under Hölder continuous derivative, Some fourth-order nonlinear solvers with closed formulae for multiple roots, Local convergence and dynamics of a family of iterative methods for multiple roots of nonlinear equations, Asymptotic error constants of cubically convergent zero finding methods, On the global convergence of Schröder's iterative formulae for real roots of algebraic equations, Fast switch and spline scheme for accurate inversion of nonlinear functions: the new first choice solution to Kepler's equation, Iteration functions re-visited, New algorithms for solving nonlinear eigenvalue problems, A new fourth-order iterative method for finding multiple roots of nonlinear equations, Un metodo iterativo non stazionario per la risoluzione di equazioni algebriche, Point estimation of a family of simultaneous zero-finding methods, On developing a novel sixth order transformation method for multiple roots and its basins of attraction, Convergence analysis of the modified Chebyshev's method for finding multiple roots, Recurrence relations for rational cubic methods. II: The Chebyshev method, An efficient class of Traub-Steffensen-type methods for computing multiple zeros, A third-order modification of Newton's method for multiple roots, Schröder-like algorithms for multiple complex zeros of a polynomial, Hybrid inclusion algorithms for polynomial multiple complex zeros in rectangular arithmetic, Some second-derivative-free variants of Halley's method for multiple roots, On a family of parallel root-finding methods for generalized polynomials, An effective implementation of a modified Laguerre method for the roots of a polynomial, Improving the order of convergence of iteration functions, Effective high-order iterative methods via the asymptotic form of the Taylor-Lagrange remainder, New families of third-order iterative methods for finding multiple roots, The polynomial pivots as initial values for a new root-finding iterative method, An efficient class of Traub-Steffensen-like seventh order multiple-root solvers with applications, Solving nonlinear eigenvalue problems by algorithmic differentiation, On the convergence of Halley's method for multiple polynomial zeros, On optimal parameter of Laguerre's family of zero-finding methods, A family of fifth-order iterative methods for finding multiple roots of nonlinear equations, Unnamed Item, Unnamed Item, A family of simultaneous zero finding methods, On generalized Halley-like methods for solving nonlinear equations, High-order iterative bracketing methods, Development of cubically convergent iterative derivative free methods for computing multiple roots, Repellers for the Laguerre Iteration Function, A faster King–Werner-type iteration and its convergence analysis, Second-derivative free methods of third and fourth order for solving nonlinear equations, Several new methods for solving equations, Julia sets for the super-Newton method, Cauchy’s method, and Halley’s method, SMOOTH DENSITY SPATIAL QUANTILE REGRESSION, On the construction of simultaneous methods for multiple zeros, Chebyshev-like root-finding methods with accelerated convergence, A combinatorial construction of high order algorithms for finding polynomial roots of known multiplicity, Extension of Murakami's high-order non-linear solver to multiple roots, A new family of Schröder's method and its variants based on power means for multiple roots of nonlinear equations, A family of one-point iteration formulae for finding roots, Point estimation of simultaneous methods for solving polynomial equations: A survey, An algorithm for the total, or partial, factorization of a polynomial, Unnamed Item, Some modifications of Laguerre's method, Higher-order simultaneous methods for the determination of polynomial multiple zeros, Some higher-order methods for the simultaneous approximation of multiple polynomial zeros, COMPARATIVE STUDY OF METHODS OF VARIOUS ORDERS FOR FINDING SIMPLE ROOTS OF NONLINEAR EQUATIONS, A family of simultaneous methods for the determination of polynomial complex zeros, Creating a new two-step recursive memory method with eight-order based on Kung and Traub’s method
Cites Work
