{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q426501","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q426501","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q426501","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T11:43:35Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q426501","name":"Three-point methods with and without memory for solving nonlinear equations","headline":"Three-point methods with and without memory for solving nonlinear equations","description":"scientific article; zbMATH DE number 6045260","url":"https://portal.mardi4nfdi.de/entity/Q426501","datePublished":"2012-06-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q410965"},{"@id":"https://portal.mardi4nfdi.de/entity/Q214138"},{"@id":"https://portal.mardi4nfdi.de/entity/Q505803"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q70476"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.AMC.2011.10.057","url":"https://doi.org/10.1016/J.AMC.2011.10.057"},"sameAs":["https://doi.org/10.1016/J.AMC.2011.10.057"],"comment":"A new family of three-point derivative free methods for solving nonlinear equations is presented. It is proved that the order of convergence of the basic family without memory is eight requiring four function-evaluations, which means that this family is optimal in the sense of the Kung-Traub conjecture. Further accelerations of convergence speed are attained by suitable variation of a free parameter in each iterative step. This self-accelerating parameter is calculated using information from the current and previous iteration so that the presented methods may be regarded as the methods with memory. The self-correcting parameter is calculated applying the secant-type method in three different ways and Newton's interpolatory polynomial of the second degree. The increase of convergence order is attained without any additional function calculations, providing a very high computational efficiency of the proposed methods with memory. Another advantage is a convenient fact that these methods do not use derivatives. Numerical examples and the comparison with existing three-point methods are included to confirm theoretical results and high computational efficiency.","citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q3345690"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2391307"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1004004"},{"@id":"https://portal.mardi4nfdi.de/entity/Q984905"},{"@id":"https://portal.mardi4nfdi.de/entity/Q544060"},{"@id":"https://portal.mardi4nfdi.de/entity/Q846439"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2430053"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4778232"},{"@id":"https://portal.mardi4nfdi.de/entity/Q606801"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5652137"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3097457"},{"@id":"https://portal.mardi4nfdi.de/entity/Q606698"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4899908"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5961876"},{"@id":"https://portal.mardi4nfdi.de/entity/Q847178"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5732060"},{"@id":"https://portal.mardi4nfdi.de/entity/Q972772"},{"@id":"https://portal.mardi4nfdi.de/entity/Q968543"},{"@id":"https://portal.mardi4nfdi.de/entity/Q555350"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T11:43:35Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}