Nonstationary iterative processes

Nonstationary iterative processes

In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev'...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Sapir, Luba, Kogan, Tamara, Sapir, Ariel, Sapir, Amir
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Sapir, Luba
Kogan, Tamara
Sapir, Ariel
Sapir, Amir
description In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward manner. The methods are demonstrated by numerical examples.
doi_str_mv 10.48550/arxiv.1911.01404
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1911_01404</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1911_01404</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-3b82e1a2a4bd2e2e56f95b8b29014c0c60b6392fc4f07e4462151307aec61dfa3</originalsourceid><addsrcrecordid>eNotzrsKwkAUBNBtLET9ACv1AxL37itJKeILRBv7cHe9CwFNwm4Q_XvjoxqmmTmMTYGnKteaLzE8q0cKBUDKQXE1ZItTU8cOu6qpMbzmVUehLw-at6FxFCPFMRt4vEWa_HPELtvNZb1PjufdYb06JmgylUibCwIUqOxVkCBtfKFtbkXRHznuDLdGFsI75XlGShkBGiTPkJyBq0c5YrPf7NdYtqG696DyYy2_VvkGVs041g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Nonstationary iterative processes</title><source>arXiv.org</source><creator>Sapir, Luba ; Kogan, Tamara ; Sapir, Ariel ; Sapir, Amir</creator><creatorcontrib>Sapir, Luba ; Kogan, Tamara ; Sapir, Ariel ; Sapir, Amir</creatorcontrib><description>In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward manner. The methods are demonstrated by numerical examples.</description><identifier>DOI: 10.48550/arxiv.1911.01404</identifier><language>eng</language><subject>Computer Science - Numerical Analysis ; Mathematics - Numerical Analysis</subject><creationdate>2019-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1911.01404$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1911.01404$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Sapir, Luba</creatorcontrib><creatorcontrib>Kogan, Tamara</creatorcontrib><creatorcontrib>Sapir, Ariel</creatorcontrib><creatorcontrib>Sapir, Amir</creatorcontrib><title>Nonstationary iterative processes</title><description>In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward manner. The methods are demonstrated by numerical examples.</description><subject>Computer Science - Numerical Analysis</subject><subject>Mathematics - Numerical Analysis</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrsKwkAUBNBtLET9ACv1AxL37itJKeILRBv7cHe9CwFNwm4Q_XvjoxqmmTmMTYGnKteaLzE8q0cKBUDKQXE1ZItTU8cOu6qpMbzmVUehLw-at6FxFCPFMRt4vEWa_HPELtvNZb1PjufdYb06JmgylUibCwIUqOxVkCBtfKFtbkXRHznuDLdGFsI75XlGShkBGiTPkJyBq0c5YrPf7NdYtqG696DyYy2_VvkGVs041g</recordid><startdate>20191104</startdate><enddate>20191104</enddate><creator>Sapir, Luba</creator><creator>Kogan, Tamara</creator><creator>Sapir, Ariel</creator><creator>Sapir, Amir</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20191104</creationdate><title>Nonstationary iterative processes</title><author>Sapir, Luba ; Kogan, Tamara ; Sapir, Ariel ; Sapir, Amir</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-3b82e1a2a4bd2e2e56f95b8b29014c0c60b6392fc4f07e4462151307aec61dfa3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Computer Science - Numerical Analysis</topic><topic>Mathematics - Numerical Analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Sapir, Luba</creatorcontrib><creatorcontrib>Kogan, Tamara</creatorcontrib><creatorcontrib>Sapir, Ariel</creatorcontrib><creatorcontrib>Sapir, Amir</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Sapir, Luba</au><au>Kogan, Tamara</au><au>Sapir, Ariel</au><au>Sapir, Amir</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Nonstationary iterative processes</atitle><date>2019-11-04</date><risdate>2019</risdate><abstract>In this paper we present iterative methods of high efficiency by the criteria of J. F. Traub and A. M. Ostrowski. We define {\it s-nonstationary iterative processes} and prove that, for any one-point iterative process without memory, such as, for example, Newton's, Halley's, Chebyshev's methods, there exists an s-nonstationary process of the same order, but of higher efficiency. We supply constructions of these methods, obtain their properties and, for some of them, also their geometric interpretation. The algorithms we present can be transformed into computer programs in straight-forward manner. The methods are demonstrated by numerical examples.</abstract><doi>10.48550/arxiv.1911.01404</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1911.01404
ispartof
issn
language eng
recordid cdi_arxiv_primary_1911_01404
source arXiv.org
subjects Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
title Nonstationary iterative processes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T17%3A38%3A14IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Nonstationary%20iterative%20processes&rft.au=Sapir,%20Luba&rft.date=2019-11-04&rft_id=info:doi/10.48550/arxiv.1911.01404&rft_dat=%3Carxiv_GOX%3E1911_01404%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true