New iterations of \(R\)-order four with reduced computational cost (Q2391029): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An adaptive version of a fourth-order iterative method for quadratic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Jarratt method in Banach space setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some variant of Newton's method with third-order convergence. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev's approximation algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified Newton method for rootfinding with cubic convergence. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Newton-type methods with cubic convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3943431 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3343091 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Newton's method with accelerated third-order convergence / rank
 
Normal rank

Revision as of 19:26, 1 July 2024

scientific article
Language Label Description Also known as
English
New iterations of \(R\)-order four with reduced computational cost
scientific article

    Statements

    New iterations of \(R\)-order four with reduced computational cost (English)
    0 references
    0 references
    24 July 2009
    0 references
    Starting from an one-point iterative methods \(x_{n+1}=\psi(x_{n})\) of order of convergence three to solve approximately a nonlinear equation \(F(x)=0\) in a Banach space, the authors construct a new two-point iterative procedure of order four having a lover cost of computation. Among the problems which can be approximatively solved by this method we can mention integral equations, boundary value problems and systems of nonlinear equations. The theory is illustrated on the following integral equation of mixed Hammerstein type: \[ x(s)=1+\frac{1}{3}\int^{1}_{0}G(s,t)(x(t)^{\frac{10}{3}}+x(t)^{4})dt, \quad s\in[0,1] , \] where \(x\in C[0,1] , \quad t\in[0,1]\) and \[ G(s,t)=\begin{cases} (1-s)t &t\leq s\\ s(1-t) &s\leq t.\end{cases} \]
    0 references
    computational cost
    0 references
    convergence
    0 references
    approximating sequence
    0 references
    order of convergence
    0 references
    nonlinear operator equation
    0 references
    Hammerstein integral equation
    0 references
    one-point iterative methods
    0 references
    Banach space
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references