Efficient \(n\)-point iterative methods with memory for solving nonlinear equations (Q747735): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11075-014-9951-8 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11075-014-9951-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078532150 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Order of One-Point and Multipoint Iteration / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a General Class of Multipoint Root-Finding Methods of High Computational Efficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of higher order methods for solving equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal Steffensen-type family for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4752897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new sixth-order scheme for nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some eighth-order root-finding three-step methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of modified Ostrowski's methods with accelerated eighth order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-step iterative methods with eighth-order convergence for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of three-point methods of optimal order for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative methods based on the signum function approach for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Steffensen-type methods with eighth order of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of two-step Steffensen type methods with fourth-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of Steffensen type methods with seventh-order convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an efficient family of derivative free three-point methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new family of Newton-type iterative methods with and without memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME NEWTON-TYPE ITERATIVE METHODS WITH AND WITHOUT MEMORY FOR SOLVING NONLINEAR EQUATIONS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4979465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivative free two-point methods with and without memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolatory multipoint methods with memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-point methods with and without memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized multipoint root-solvers with memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On efficient two-parameter methods for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized biparametric multipoint root finding methods with memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variants of Newton's method using fifth-order quadrature formulas / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11075-014-9951-8 / rank
 
Normal rank

Latest revision as of 03:00, 10 December 2024

scientific article
Language Label Description Also known as
English
Efficient \(n\)-point iterative methods with memory for solving nonlinear equations
scientific article

    Statements

    Efficient \(n\)-point iterative methods with memory for solving nonlinear equations (English)
    0 references
    0 references
    0 references
    19 October 2015
    0 references
    A new family of \(n\)-point derivative-free iterative methods with and without memory for solving nonlinear equations is proposed. The convergence order of the new \(n\)-point derivative-free methods with memory is \((2^{n+1} - 1 + \sqrt{2^{2(n+1)} + 1}) /2\). The computational efficiency of the new \(n\)-point methods with memory is very high. Numerical results are given.
    0 references
    multipoint iterative methods
    0 references
    computational efficiency
    0 references
    nonlinear equations
    0 references
    root-finding methods
    0 references
    derivative-free
    0 references
    convergence order
    0 references
    numerical result
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers