Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs

We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positiv...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Brunner, Maximilian, Praetorius, Dirk, Streitberger, Julian
Format: Artikel
Sprache:eng
Schlagworte:
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 Brunner, Maximilian
Praetorius, Dirk
Streitberger, Julian
description We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positive definite. The resulting system is solved by a contractive algebraic solver such as a multigrid method with local smoothing. We formulate a fully adaptive algorithm that equibalances the various error components coming from mesh refinement, iterative linearization, and algebraic solver. We prove that the proposed adaptive iteratively linearized finite element method (AILFEM) guarantees convergence with optimal complexity, where the rates are understood with respect to the overall computational cost (i.e., the computational time). Numerical experiments investigate the involved adaptivity parameters.
doi_str_mv 10.48550/arxiv.2401.06486
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2401_06486</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2401_06486</sourcerecordid><originalsourceid>FETCH-LOGICAL-a676-e24d14419cb34a5057e34dfc474c5a4981f982017a7abb22b9f21b2729cef793</originalsourceid><addsrcrecordid>eNotz81OwzAQBGBfOKDCA3BiXyDBdjZxfEQhBaRWIMGZaO3YYMlNKicKP09PaTnNHEYjfYxdCZ5jXZb8htJXWHKJXOS8wro6Z2_NOM3ZuJ_DjiJQT4e2OFi3W_gM8wfEMDhK4YfmMA5AQw8U351JFCxMY1xcAj8mmNwunKbgYgyHEwvPd-10wc48xcld_ueKvazb1-Yh2zzdPza3m4wqVWVOYi8QhbamQCp5qVyBvbeo0JaEuhZe15ILRYqMkdJoL4WRSmrrvNLFil2fXo--bp8OmPTd_Tm7o7P4Bd7kTkQ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs</title><source>arXiv.org</source><creator>Brunner, Maximilian ; Praetorius, Dirk ; Streitberger, Julian</creator><creatorcontrib>Brunner, Maximilian ; Praetorius, Dirk ; Streitberger, Julian</creatorcontrib><description>We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positive definite. The resulting system is solved by a contractive algebraic solver such as a multigrid method with local smoothing. We formulate a fully adaptive algorithm that equibalances the various error components coming from mesh refinement, iterative linearization, and algebraic solver. We prove that the proposed adaptive iteratively linearized finite element method (AILFEM) guarantees convergence with optimal complexity, where the rates are understood with respect to the overall computational cost (i.e., the computational time). Numerical experiments investigate the involved adaptivity parameters.</description><identifier>DOI: 10.48550/arxiv.2401.06486</identifier><language>eng</language><subject>Computer Science - Numerical Analysis ; Mathematics - Numerical Analysis</subject><creationdate>2024-01</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,777,882</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2401.06486$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.06486$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Brunner, Maximilian</creatorcontrib><creatorcontrib>Praetorius, Dirk</creatorcontrib><creatorcontrib>Streitberger, Julian</creatorcontrib><title>Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs</title><description>We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positive definite. The resulting system is solved by a contractive algebraic solver such as a multigrid method with local smoothing. We formulate a fully adaptive algorithm that equibalances the various error components coming from mesh refinement, iterative linearization, and algebraic solver. We prove that the proposed adaptive iteratively linearized finite element method (AILFEM) guarantees convergence with optimal complexity, where the rates are understood with respect to the overall computational cost (i.e., the computational time). Numerical experiments investigate the involved adaptivity parameters.</description><subject>Computer Science - Numerical Analysis</subject><subject>Mathematics - Numerical Analysis</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz81OwzAQBGBfOKDCA3BiXyDBdjZxfEQhBaRWIMGZaO3YYMlNKicKP09PaTnNHEYjfYxdCZ5jXZb8htJXWHKJXOS8wro6Z2_NOM3ZuJ_DjiJQT4e2OFi3W_gM8wfEMDhK4YfmMA5AQw8U351JFCxMY1xcAj8mmNwunKbgYgyHEwvPd-10wc48xcld_ueKvazb1-Yh2zzdPza3m4wqVWVOYi8QhbamQCp5qVyBvbeo0JaEuhZe15ILRYqMkdJoL4WRSmrrvNLFil2fXo--bp8OmPTd_Tm7o7P4Bd7kTkQ</recordid><startdate>20240112</startdate><enddate>20240112</enddate><creator>Brunner, Maximilian</creator><creator>Praetorius, Dirk</creator><creator>Streitberger, Julian</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240112</creationdate><title>Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs</title><author>Brunner, Maximilian ; Praetorius, Dirk ; Streitberger, Julian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a676-e24d14419cb34a5057e34dfc474c5a4981f982017a7abb22b9f21b2729cef793</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Computer Science - Numerical Analysis</topic><topic>Mathematics - Numerical Analysis</topic><toplevel>online_resources</toplevel><creatorcontrib>Brunner, Maximilian</creatorcontrib><creatorcontrib>Praetorius, Dirk</creatorcontrib><creatorcontrib>Streitberger, Julian</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>Brunner, Maximilian</au><au>Praetorius, Dirk</au><au>Streitberger, Julian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs</atitle><date>2024-01-12</date><risdate>2024</risdate><abstract>We consider scalar semilinear elliptic PDEs, where the nonlinearity is strongly monotone, but only locally Lipschitz continuous. To linearize the arising discrete nonlinear problem, we employ a damped Zarantonello iteration, which leads to a linear Poisson-type equation that is symmetric and positive definite. The resulting system is solved by a contractive algebraic solver such as a multigrid method with local smoothing. We formulate a fully adaptive algorithm that equibalances the various error components coming from mesh refinement, iterative linearization, and algebraic solver. We prove that the proposed adaptive iteratively linearized finite element method (AILFEM) guarantees convergence with optimal complexity, where the rates are understood with respect to the overall computational cost (i.e., the computational time). Numerical experiments investigate the involved adaptivity parameters.</abstract><doi>10.48550/arxiv.2401.06486</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2401.06486
ispartof
issn
language eng
recordid cdi_arxiv_primary_2401_06486
source arXiv.org
subjects Computer Science - Numerical Analysis
Mathematics - Numerical Analysis
title Cost-optimal adaptive FEM with linearization and algebraic solver for semilinear elliptic PDEs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T10%3A38%3A55IST&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=Cost-optimal%20adaptive%20FEM%20with%20linearization%20and%20algebraic%20solver%20for%20semilinear%20elliptic%20PDEs&rft.au=Brunner,%20Maximilian&rft.date=2024-01-12&rft_id=info:doi/10.48550/arxiv.2401.06486&rft_dat=%3Carxiv_GOX%3E2401_06486%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