A note on \(Q\)-order of convergence

From MaRDI portal
Revision as of 00:51, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5942340

DOI10.1023/A:1021902825707zbMath0973.40001MaRDI QIDQ5942340

Laurent O. Jay

Publication date: 28 August 2001

Published in: BIT (Search for Journal in Brave)




Related Items (78)

On optimal parameter of Laguerre's family of zero-finding methodsAn efficient derivative free family of fourth order methods for solving systems of nonlinear equationsOptimal iterative methods for finding multiple roots of nonlinear equations using free parametersA stable class of modified Newton-like methods for multiple roots and their dynamicsAnalysis of a generalised expectation–maximisation algorithm for Gaussian mixture models: a control systems perspectiveSome new bi-accelerator two-point methods for solving nonlinear equationsEfficient derivative-free numerical methods for solving systems of nonlinear equationsA general approach to the study of the convergence of Picard iteration with an application to Halley's method for multiple zeros of analytic functionsA family of fifth-order iterative methods for finding multiple roots of nonlinear equationsImproved Chebyshev-Halley methods with sixth and eighth order convergenceOn semilocal convergence analysis for two-step Newton method under generalized Lipschitz conditions in Banach spacesA stable class of improved second-derivative free Chebyshev-Halley type methods with optimal eighth order convergenceOptimal iterative methods for finding multiple roots of nonlinear equations using weight functions and dynamicsAn efficient fifth order method for solving systems of nonlinear equationsA stable family with high order of convergence for solving nonlinear equationsSimple yet efficient Newton-like method for systems of nonlinear equationsDynamic study of Schröder's families of first and second kindOn the Construction of Fast Steffensen-Type Iterative Methods for Nonlinear EquationsDesign and Analysis of a New Class of Derivative-Free Optimal Order Methods for Nonlinear EquationsTraub-Gander's family for the simultaneous determination of multiple zeros of polynomialsNew efficient derivative free family of seventh-order methods for solving systems of nonlinear equationsOn generalized Halley-like methods for solving nonlinear equationsBall convergence of an efficient multi-step scheme for solving equations and systems of equationsNew seventh and eighth order derivative free methods for solving nonlinear equationsDynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank ApproximationAn optimal eighth order derivative free multiple root finding numerical method and applications to chemistryStability analysis of a family of optimal fourth-order methods for multiple rootsStudy of dynamical behavior and stability of iterative methods for nonlinear equation with applications in engineeringA modified Chebyshev–Halley‐type iterative family with memory for solving nonlinear equations and its stability analysisAnalysis of optimal iterative methods from a dynamical point of view by studying their stability propertiesA new class of derivative-free root solvers with increasing optimal convergence order and their complex dynamicsSuper-Halley method under majorant conditions in Banach spacesImproved Newton-like methods for solving systems of nonlinear equationsOn the local convergence of Kung-Traub's two-point method and its dynamics.Optimal fourth and eighth-order iterative methods for non-linear equationsOn the semilocal convergence behavior for Halley's methodEfficient four-parametric with-and-without-memory iterative methods possessing high efficiency indicesUnnamed ItemA novel derivative free algorithm with seventh order convergence for solving systems of nonlinear equationsSome novel optimal eighth order derivative-free root solvers and their basins of attractionAn improved Newton-Traub composition for solving systems of nonlinear equationsSymbolic computation and computer graphics as tools for developing and studying new root-finding methodsComputer visualization and dynamic study of new families of root-solversGeneral efficient class of Steffensen type methods with memory for solving systems of nonlinear equationsOn an efficient inclusion method for finding polynomial zerosA note on the convergence order of some recent methods for solving nonlinear equationsA new family of optimal eighth order methods with dynamics for nonlinear equationsA novel family of composite Newton-Traub methods for solving systems of nonlinear equationsOn a general transformation of multipoint root-solversHigher-order derivative-free families of Chebyshev-Halley type methods with or without memory for solving nonlinear equationsEfficient derivative-free variants of Hansen-Patrick's family with memory for solving nonlinear equationsMultipoint methods for solving nonlinear equations: a surveyOn a general class of optimal order multipoint methods for solving nonlinear equationsA general class of four parametric with- and without memory iterative methods for nonlinear equationsTwo optimal general classes of iterative methods with eighth-orderAn efficient two-parametric family with memory for nonlinear equationsA survey on the high convergence orders and computational convergence orders of sequencesAn efficient family of Traub-Steffensen-type methods for solving systems of nonlinear equationsA novel bi-parametric sixth order iterative scheme for solving nonlinear systems and its dynamicsDynamical techniques for analyzing iterative schemes with memoryOn the convergence of high-order Gargantini-Farmer-Loizou type iterative methods for simultaneous approximation of polynomial zerosEfficient methods of optimal eighth and sixteenth order convergence for solving nonlinear equationsA family of optimal eighth order iteration functions for multiple roots and its dynamicsGeneral local convergence theory for a class of iterative processes and its applications to Newton's methodOn some efficient derivative-free iterative methods with memory for solving systems of nonlinear equationsMean-based iterative methods for finding multiple roots in nonlinear chemistry problemsComputer methodologies for comparison of computational efficiency of simultaneous methods for finding polynomial zerosOptimal eighth-order iterative methods for approximating multiple zeros of nonlinear functionsNovel Chebyshev wavelets algorithms for optimal control and analysis of general linear delay modelsA Modified Newton–Özban Composition for Solving Nonlinear SystemsOn Convergence and Efficiency in the Resolution of Systems of Nonlinear Equations from a Local AnalysisEfficient Ostrowski-like methods of optimal eighth and sixteenth order convergence and their dynamicsOn dynamics of iterative techniques for nonlinear equation with applications in engineeringAn efficient family of optimal eighth-order multiple root findersHow Many Steps Still Left to $x$*?Computer tools for the construction and analysis of some efficient root-finding simultaneous methodsEfficient higher order derivative-free multipoint methods with and without memory for systems of nonlinear equationsA simple yet efficient derivative free family of seventh order methods for systems of nonlinear equations




This page was built for publication: A note on \(Q\)-order of convergence