New mono- and biaccelerator iterative methods with memory for nonlinear equations (Q1724774): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59040753 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2014/705674 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043360208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing geometric mean of two Hermitian positive definite matrices via matrix sign / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some matrix iterations for computing matrix sign function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4752897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5732060 / 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: New optimal class of higher-order methods for multiple roots, permitting \(f'(x_{n})=0\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potra-Pták iterative method with memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the inverse of a square matrix with application in computation of the Moore-Penrose inverse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved power flow algorithm for VSC-HVDC system based on high-order Newton-type method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-complexity root-finding iteration functions with no derivatives of any order of convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4920839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of optimal derivative-free techniques without memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal iterative methods and their with memory variants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient derivative free methods with memory for solving nonlinear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal Steffensen-type family for solving nonlinear equations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 05:26, 18 July 2024

scientific article
Language Label Description Also known as
English
New mono- and biaccelerator iterative methods with memory for nonlinear equations
scientific article

    Statements

    New mono- and biaccelerator iterative methods with memory for nonlinear equations (English)
    0 references
    0 references
    14 February 2019
    0 references
    Summary: Acceleration of convergence is discussed for some families of iterative methods in order to solve scalar nonlinear equations. In fact, we construct mono- and biparametric methods with memory and study their orders. It is shown that the convergence orders 12 and 14 can be attained using only 4 functional evaluations, which provides high computational efficiency indices. Some illustrations will also be given to reverify the theoretical discussions.
    0 references

    Identifiers