Goal-oriented adaptive finite element methods with optimal computational complexity
We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver l...
Uloženo v:
| Vydáno v: | Numerische Mathematik Ročník 153; číslo 1; s. 111 - 140 |
|---|---|
| Hlavní autoři: | , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.01.2023
Springer Nature B.V Springer Verlag |
| Témata: | |
| ISSN: | 0029-599X, 0945-3245 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost. |
|---|---|
| AbstractList | We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost. We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost.We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which steers the adaptive mesh-refinement as well as the approximate solution of the arising linear systems by means of a contractive iterative solver like the optimally preconditioned conjugate gradient method or geometric multigrid. We prove linear convergence of the proposed adaptive algorithm with optimal algebraic rates. Unlike prior work, we do not only consider rates with respect to the number of degrees of freedom but even prove optimal complexity, i.e., optimal convergence rates with respect to the total computational cost. |
| Author | Praetorius, Dirk Innerberger, Michael Becker, Roland Gantner, Gregor |
| Author_xml | – sequence: 1 givenname: Roland surname: Becker fullname: Becker, Roland organization: IPRA-LMAP, Université de Pau et des Pays de l’Adour – sequence: 2 givenname: Gregor surname: Gantner fullname: Gantner, Gregor organization: Korteweg-de Vries (KdV) Institute for Mathematics, University of Amsterdam – sequence: 3 givenname: Michael surname: Innerberger fullname: Innerberger, Michael email: michael.innerberger@asc.tuwien.ac.at organization: TU Wien, Institute of Analysis and Scientific Computing – sequence: 4 givenname: Dirk surname: Praetorius fullname: Praetorius, Dirk organization: TU Wien, Institute of Analysis and Scientific Computing |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/36644212$$D View this record in MEDLINE/PubMed https://hal.science/hal-03968557$$DView record in HAL |
| BookMark | eNp9kk1P3DAQhq0KVD7aP9BDFamXckgZO45jXyohVKDSShxopd4srz1hjZJ4GztL-fc1ZOnHHjj5Y573nRl7jsjeEAYk5B2FTxSgOY0AjNISGCuBVhUv5StyCIrXZcV4vZf3wFRZK_XjgBzFeAdAG8Hpa3JQCcE5o-yQ3FwG05Vh9DgkdIVxZp38BovWDz5hgR32OVL0mFbBxeLep1URMtKbrrChX0_JJB-G7anDXz49vCH7rekivt2ux-T7xZdv51fl4vry6_nZorQ1yFRyR1uF0jauddZZZJK1xggupDTMMufqFhrjlghGgqmxsUaA5YYzkftbiuqYfJ5919Oyx-wwpNF0ej3m6sYHHYzX_0cGv9K3YaOVZErwOhuczAarHdnV2UI_3kGlhKzrZkMz-3GbbAw_J4xJ9z5a7DozYJiiZo0QIIRSTUY_7KB3YRrzGz1RTGXTBjL1_t_q_-R__psMyBmwY4hxxFZbP792bsZ3moJ-HAM9j4HOY6CfxkDLLGU70mf3F0XVLIoZHm5x_Fv2C6rfVqDGSQ |
| CitedBy_id | crossref_primary_10_1007_s44207_024_00001_0 crossref_primary_10_3390_mca29050087 crossref_primary_10_1515_jnma_2023_0150 crossref_primary_10_1016_j_camwa_2023_07_022 |
| Cites_doi | 10.1016/j.apnum.2016.11.005 10.1137/07069047X 10.1090/S0025-5718-07-01959-X 10.1007/s00211-011-0401-4 10.1137/15M1021982 10.1007/s10208-005-0183-0 10.1137/120897225 10.1007/s00365-013-9192-4 10.1093/imanum/drr014 10.1137/0733054 10.1137/060675666 10.1016/j.camwa.2017.12.035 10.1137/100794298 10.1007/s00211-015-0727-4 10.1090/mcom/3553 10.1017/S0962492901000010 10.1016/j.camwa.2013.12.003 10.1093/imanum/drx050 10.1090/mcom/3654 10.1017/S0962492900002531 10.1137/S0036142999360044 10.1007/s00211-003-0492-7 10.1007/978-3-0348-7605-6 10.1017/S096249290200003X |
| ContentType | Journal Article |
| Copyright | The Author(s) 2022 The Author(s) 2022. The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. Attribution |
| Copyright_xml | – notice: The Author(s) 2022 – notice: The Author(s) 2022. – notice: The Author(s) 2022. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: Attribution |
| DBID | C6C AAYXX CITATION NPM 7X8 1XC VOOES 5PM |
| DOI | 10.1007/s00211-022-01334-8 |
| DatabaseName | Springer Nature OA Free Journals CrossRef PubMed MEDLINE - Academic Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) PubMed Central (Full Participant titles) |
| DatabaseTitle | CrossRef PubMed MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic PubMed CrossRef |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISSN | 0945-3245 |
| EndPage | 140 |
| ExternalDocumentID | PMC9829645 oai:HAL:hal-03968557v1 36644212 10_1007_s00211_022_01334_8 |
| Genre | Journal Article |
| GrantInformation_xml | – fundername: Austrian Science Fund (FWF) – fundername: ; |
| GroupedDBID | --Z -52 -5D -5G -BR -EM -Y2 -~C -~X .86 .DC .VR 06D 0R~ 0VY 123 199 1N0 1SB 203 29N 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2WC 2~H 30V 4.4 406 408 409 40D 40E 41~ 5QI 5VS 67Z 692 6NX 6TJ 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDZT ABECU ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABLJU ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACGFO ACGFS ACHSB ACHXU ACIWK ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACREN ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADRFC ADTPH ADURQ ADYFF ADYOE ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFDYV AFEXP AFFNX AFGCZ AFLOW AFQWF AFWTZ AFYQB AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMTXH AMXSW AMYLF AMYQR AOCGG ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. BA0 BAPOH BBWZM BDATZ BGNMA BSONS C6C CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP EBLON EBS EIOEI EJD ESBYG FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW KQ8 LAS LLZTM LO0 M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OK1 P19 P2P P9R PF0 PKN PT4 PT5 QOK QOS R4E R89 R9I REI RHV RIG RNI RNS ROL RPX RSV RYB RZK RZZ S16 S1Z S26 S27 S28 S3B SAP SCLPG SDD SDH SDM SHX SISQX SJYHP SMT SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WH7 WK8 XJT YLTOR YNT YQT Z45 Z5O Z7R Z7X Z83 Z86 Z88 Z8M Z8R Z8W Z92 ZMTXR ZWQNP ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ABUFD ACSTC ADHKG AEZWR AFDZB AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION NPM 7X8 1XC VOOES 5PM |
| ID | FETCH-LOGICAL-c508t-4d1f9e8c7dfdcdce282faa64688a2c2dd5f07adbe0a80a5e7ca60c4a426324b63 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000884643400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0029-599X |
| IngestDate | Tue Nov 04 02:06:35 EST 2025 Tue Oct 14 20:10:20 EDT 2025 Wed Oct 01 14:20:59 EDT 2025 Mon Oct 06 16:25:01 EDT 2025 Mon Jul 21 06:00:05 EDT 2025 Tue Nov 18 22:13:46 EST 2025 Sat Nov 29 01:36:01 EST 2025 Fri Feb 21 02:46:12 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 1 |
| Keywords | 65N50 65Y20 41A25 65N22 65N30 |
| Language | English |
| License | The Author(s) 2022. Attribution: http://creativecommons.org/licenses/by Open AccessThis article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c508t-4d1f9e8c7dfdcdce282faa64688a2c2dd5f07adbe0a80a5e7ca60c4a426324b63 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0003-2921-7855 |
| OpenAccessLink | https://link.springer.com/10.1007/s00211-022-01334-8 |
| PMID | 36644212 |
| PQID | 2762939670 |
| PQPubID | 2043616 |
| PageCount | 30 |
| ParticipantIDs | pubmedcentral_primary_oai_pubmedcentral_nih_gov_9829645 hal_primary_oai_HAL_hal_03968557v1 proquest_miscellaneous_2766066997 proquest_journals_2762939670 pubmed_primary_36644212 crossref_citationtrail_10_1007_s00211_022_01334_8 crossref_primary_10_1007_s00211_022_01334_8 springer_journals_10_1007_s00211_022_01334_8 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-01-01 |
| PublicationDateYYYYMMDD | 2023-01-01 |
| PublicationDate_xml | – month: 01 year: 2023 text: 2023-01-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Germany – name: Heidelberg |
| PublicationTitle | Numerische Mathematik |
| PublicationTitleAbbrev | Numer. Math |
| PublicationTitleAlternate | Numer Math (Heidelb) |
| PublicationYear | 2023 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V Springer Verlag |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V – name: Springer Verlag |
| References | Chen, Nochetto, Jinchao (CR8) 2012; 120 Pfeiler, Praetorius (CR21) 2020; 89 Cascón, Nochetto (CR7) 2012; 32 Karkulik, Pavlicek, Praetorius (CR18) 2013; 38 CR17 Gantner, Haberl, Praetorius, Stiftner (CR15) 2018; 38 Gantner, Haberl, Praetorius, Schimanko (CR16) 2021; 90 Mommer, Stevenson (CR20) 2009; 47 Becker, Estecahandy, Trujillo (CR2) 2011; 49 Feischl, Führer, Praetorius (CR11) 2014; 52 Carstensen, Feischl, Page, Praetorius (CR5) 2014; 67 Cascon, Kreuzer, Nochetto, Siebert (CR6) 2008; 46 Dörfler (CR9) 1996; 33 Becker, Rannacher (CR3) 2001; 10 Eriksson, Estep, Hansbo, Johnson (CR10) 1995; 4 Binev, Dahmen, DeVore (CR1) 2004; 97 Bangerth, Rannacher (CR4) 2003 Morin, Nochetto, Siebert (CR19) 2000; 38 Feischl, Gantner, Haberl, Praetorius, Führer (CR12) 2016; 132 Stevenson (CR24) 2008; 77 CR22 Führer, Praetorius (CR13) 2018; 75 Feischl, Praetorius, van der Zee (CR14) 2016; 54 Jinbiao, Zheng (CR25) 2017; 113 Stevenson (CR23) 2007; 7 C Carstensen (1334_CR5) 2014; 67 1334_CR22 MS Mommer (1334_CR20) 2009; 47 L Chen (1334_CR8) 2012; 120 G Gantner (1334_CR16) 2021; 90 K Eriksson (1334_CR10) 1995; 4 R Stevenson (1334_CR24) 2008; 77 G Gantner (1334_CR15) 2018; 38 M Karkulik (1334_CR18) 2013; 38 JM Cascón (1334_CR7) 2012; 32 R Becker (1334_CR2) 2011; 49 W Bangerth (1334_CR4) 2003 W Dörfler (1334_CR9) 1996; 33 JM Cascon (1334_CR6) 2008; 46 P Morin (1334_CR19) 2000; 38 R Becker (1334_CR3) 2001; 10 W Jinbiao (1334_CR25) 2017; 113 M Feischl (1334_CR12) 2016; 132 M Feischl (1334_CR14) 2016; 54 M Feischl (1334_CR11) 2014; 52 P Binev (1334_CR1) 2004; 97 1334_CR17 CM Pfeiler (1334_CR21) 2020; 89 T Führer (1334_CR13) 2018; 75 R Stevenson (1334_CR23) 2007; 7 |
| References_xml | – ident: CR22 – volume: 113 start-page: 109 year: 2017 end-page: 123 ident: CR25 article-title: Uniform convergence of multigrid methods for adaptive meshes publication-title: Appl. Numer. Math. doi: 10.1016/j.apnum.2016.11.005 – volume: 46 start-page: 2524 issue: 5 year: 2008 end-page: 2550 ident: CR6 article-title: Quasi-optimal convergence rate for an adaptive finite element method publication-title: SIAM J. Numer. Anal. doi: 10.1137/07069047X – volume: 77 start-page: 227 issue: 261 year: 2008 end-page: 241 ident: CR24 article-title: The completion of locally refined simplicial partitions created by bisection publication-title: Math. Comp. doi: 10.1090/S0025-5718-07-01959-X – volume: 120 start-page: 1 issue: 1 year: 2012 end-page: 34 ident: CR8 article-title: Optimal multilevel methods for graded bisection grids publication-title: Numer. Math. doi: 10.1007/s00211-011-0401-4 – volume: 54 start-page: 1423 issue: 3 year: 2016 end-page: 1448 ident: CR14 article-title: An abstract analysis of optimal goal-oriented adaptivity publication-title: SIAM J. Numer. Anal. doi: 10.1137/15M1021982 – volume: 7 start-page: 245 issue: 2 year: 2007 end-page: 269 ident: CR23 article-title: Optimality of a standard adaptive finite element method publication-title: Found. Comput. Math. doi: 10.1007/s10208-005-0183-0 – volume: 52 start-page: 601 issue: 2 year: 2014 end-page: 625 ident: CR11 article-title: Adaptive FEM with optimal convergence rates for a certain class of nonsymmetric and possibly nonlinear problems publication-title: SIAM J. Numer. Anal. doi: 10.1137/120897225 – volume: 38 start-page: 213 issue: 2 year: 2013 end-page: 234 ident: CR18 article-title: On 2D newest vertex bisection: optimality of mesh-closure and -stability of -projection publication-title: Constr. Approx. doi: 10.1007/s00365-013-9192-4 – ident: CR17 – volume: 32 start-page: 1 issue: 1 year: 2012 end-page: 29 ident: CR7 article-title: Quasioptimal cardinality of AFEM driven by nonresidual estimators publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drr014 – volume: 33 start-page: 1106 issue: 3 year: 1996 end-page: 1124 ident: CR9 article-title: A convergent adaptive algorithm for Poisson’s equation publication-title: SIAM J. Numer. Anal. doi: 10.1137/0733054 – volume: 47 start-page: 861 issue: 2 year: 2009 end-page: 886 ident: CR20 article-title: A goal-oriented adaptive finite element method with convergence rates publication-title: SIAM J. Numer. Anal. doi: 10.1137/060675666 – volume: 75 start-page: 2678 issue: 8 year: 2018 end-page: 2697 ident: CR13 article-title: A linear Uzawa-type FEM-BEM solver for nonlinear transmission problems publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2017.12.035 – volume: 49 start-page: 2451 issue: 6 year: 2011 end-page: 2469 ident: CR2 article-title: Weighted marking for goal-oriented adaptive finite element methods publication-title: SIAM J. Numer. Anal. doi: 10.1137/100794298 – volume: 132 start-page: 541 issue: 3 year: 2016 end-page: 567 ident: CR12 article-title: Adaptive boundary element methods for optimal convergence of point errors publication-title: Numer. Math. doi: 10.1007/s00211-015-0727-4 – volume: 89 start-page: 2735 issue: 326 year: 2020 end-page: 2752 ident: CR21 article-title: Dörfler marking with minimal cardinality is a linear complexity problem publication-title: Math. Comp. doi: 10.1090/mcom/3553 – volume: 10 start-page: 1 year: 2001 end-page: 102 ident: CR3 article-title: An optimal control approach to a posteriori error estimation in finite element methods publication-title: Acta Numer. doi: 10.1017/S0962492901000010 – volume: 67 start-page: 1195 issue: 6 year: 2014 end-page: 1253 ident: CR5 article-title: Axioms of adaptivity publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2013.12.003 – volume: 38 start-page: 1797 year: 2018 end-page: 1831 ident: CR15 article-title: Rate optimal adaptive FEM with inexact solver for nonlinear operators publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drx050 – volume: 90 start-page: 2011 issue: 331 year: 2021 end-page: 2040 ident: CR16 article-title: Rate optimality of adaptive finite element methods with respect to overall computational costs publication-title: Math. Comp. doi: 10.1090/mcom/3654 – volume: 4 start-page: 105 year: 1995 end-page: 158 ident: CR10 article-title: Introduction to adaptive methods for differential equations publication-title: Acta Numer. doi: 10.1017/S0962492900002531 – volume: 38 start-page: 466 issue: 2 year: 2000 end-page: 488 ident: CR19 article-title: Data oscillation and convergence of adaptive FEM publication-title: SIAM J. Numer. Anal. doi: 10.1137/S0036142999360044 – volume: 97 start-page: 219 issue: 2 year: 2004 end-page: 268 ident: CR1 article-title: Adaptive finite element methods with convergence rates publication-title: Numer. Math. doi: 10.1007/s00211-003-0492-7 – year: 2003 ident: CR4 publication-title: Adaptive finite element methods for differential equations doi: 10.1007/978-3-0348-7605-6 – ident: 1334_CR17 doi: 10.1017/S096249290200003X – volume: 67 start-page: 1195 issue: 6 year: 2014 ident: 1334_CR5 publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2013.12.003 – volume: 97 start-page: 219 issue: 2 year: 2004 ident: 1334_CR1 publication-title: Numer. Math. doi: 10.1007/s00211-003-0492-7 – volume: 38 start-page: 466 issue: 2 year: 2000 ident: 1334_CR19 publication-title: SIAM J. Numer. Anal. doi: 10.1137/S0036142999360044 – volume-title: Adaptive finite element methods for differential equations year: 2003 ident: 1334_CR4 doi: 10.1007/978-3-0348-7605-6 – volume: 90 start-page: 2011 issue: 331 year: 2021 ident: 1334_CR16 publication-title: Math. Comp. doi: 10.1090/mcom/3654 – volume: 10 start-page: 1 year: 2001 ident: 1334_CR3 publication-title: Acta Numer. doi: 10.1017/S0962492901000010 – volume: 4 start-page: 105 year: 1995 ident: 1334_CR10 publication-title: Acta Numer. doi: 10.1017/S0962492900002531 – volume: 38 start-page: 1797 year: 2018 ident: 1334_CR15 publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drx050 – volume: 7 start-page: 245 issue: 2 year: 2007 ident: 1334_CR23 publication-title: Found. Comput. Math. doi: 10.1007/s10208-005-0183-0 – ident: 1334_CR22 – volume: 120 start-page: 1 issue: 1 year: 2012 ident: 1334_CR8 publication-title: Numer. Math. doi: 10.1007/s00211-011-0401-4 – volume: 46 start-page: 2524 issue: 5 year: 2008 ident: 1334_CR6 publication-title: SIAM J. Numer. Anal. doi: 10.1137/07069047X – volume: 49 start-page: 2451 issue: 6 year: 2011 ident: 1334_CR2 publication-title: SIAM J. Numer. Anal. doi: 10.1137/100794298 – volume: 75 start-page: 2678 issue: 8 year: 2018 ident: 1334_CR13 publication-title: Comput. Math. Appl. doi: 10.1016/j.camwa.2017.12.035 – volume: 38 start-page: 213 issue: 2 year: 2013 ident: 1334_CR18 publication-title: Constr. Approx. doi: 10.1007/s00365-013-9192-4 – volume: 77 start-page: 227 issue: 261 year: 2008 ident: 1334_CR24 publication-title: Math. Comp. doi: 10.1090/S0025-5718-07-01959-X – volume: 54 start-page: 1423 issue: 3 year: 2016 ident: 1334_CR14 publication-title: SIAM J. Numer. Anal. doi: 10.1137/15M1021982 – volume: 89 start-page: 2735 issue: 326 year: 2020 ident: 1334_CR21 publication-title: Math. Comp. doi: 10.1090/mcom/3553 – volume: 52 start-page: 601 issue: 2 year: 2014 ident: 1334_CR11 publication-title: SIAM J. Numer. Anal. doi: 10.1137/120897225 – volume: 47 start-page: 861 issue: 2 year: 2009 ident: 1334_CR20 publication-title: SIAM J. Numer. Anal. doi: 10.1137/060675666 – volume: 113 start-page: 109 year: 2017 ident: 1334_CR25 publication-title: Appl. Numer. Math. doi: 10.1016/j.apnum.2016.11.005 – volume: 132 start-page: 541 issue: 3 year: 2016 ident: 1334_CR12 publication-title: Numer. Math. doi: 10.1007/s00211-015-0727-4 – volume: 33 start-page: 1106 issue: 3 year: 1996 ident: 1334_CR9 publication-title: SIAM J. Numer. Anal. doi: 10.1137/0733054 – volume: 32 start-page: 1 issue: 1 year: 2012 ident: 1334_CR7 publication-title: IMA J. Numer. Anal. doi: 10.1093/imanum/drr014 |
| SSID | ssj0017641 |
| Score | 2.4146042 |
| Snippet | We consider a linear symmetric and elliptic PDE and a linear goal functional. We design and analyze a goal-oriented adaptive finite element method, which... |
| SourceID | pubmedcentral hal proquest pubmed crossref springer |
| SourceType | Open Access Repository Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 111 |
| SubjectTerms | Adaptive algorithms Complexity Computing costs Conjugate gradient method Convergence Finite element method Iterative methods Linear systems Mathematical analysis Mathematical and Computational Engineering Mathematical and Computational Physics Mathematical Methods in Physics Mathematics Mathematics and Statistics Numerical Analysis Numerical and Computational Physics Optimization Simulation Theoretical |
| Title | Goal-oriented adaptive finite element methods with optimal computational complexity |
| URI | https://link.springer.com/article/10.1007/s00211-022-01334-8 https://www.ncbi.nlm.nih.gov/pubmed/36644212 https://www.proquest.com/docview/2762939670 https://www.proquest.com/docview/2766066997 https://hal.science/hal-03968557 https://pubmed.ncbi.nlm.nih.gov/PMC9829645 |
| Volume | 153 |
| WOSCitedRecordID | wos000884643400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: Springer Nature - Connect here FIRST to enable access customDbUrl: eissn: 0945-3245 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0017641 issn: 0029-599X databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1JT90wEB7xoIf2UFpa2rQUmaq3NlLiJF6OCJVyAITKoneLHC_iSTRB5IHEv2fsLOixVGqPSSZx4sx4vvGMPwN8s4iKrVF5bJyWce5yhSZVuVgpo5lh3KWBZ_tsnx8eiulUHvWLwtqh2n1ISYaRelzs5t0Rhr7UlxJkWR6LCayguxPeHH8fn425A87ydCjsKKSc9ktlnn7GgjuanPtiyMdI83HB5IOsaXBGu6v_9xlv4HUPPsl2py1vYcnWa7A6bOxAejtfg1cHI5lr-w6OfzXqIm48ITLCU6KMuvRjJHEzj1eJ7QrQSbcXdUv8zC5pUOQPNqXDs_sJx3DkCTjnt-_hdPfnyc5e3O_FEGuEcPM4N6mTVmhunNHYDxipOaVYzoRQVFNjCpdwZSqbKJGownKtWKJz1fHBVyxbh-W6qe1HIEnFLU8rTSupMVziwmZFlWhqhU01pVUE6fBLSt0Tlfv9Mi7KkWI59GGJfViGPixFBN_Hey47mo6_Sn_FPz0Keobtve390p9LMslEUfCbNIKNQRHK3q7bkqLvkCjCkwi2xstokT7NomrbXAcZHxVKySP40OnN2FTGEH8iWoiAL2jUwrssXqln54H1WwqfIS8i-DHo1f1rPf-pn_5N_DO8pIjiujmmDVieX13bL_BC38xn7dUmTPhUbAZruwMuCyS1 |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9QwEB7RgkQ5UCi0hBYwiBtESpzEj2NVURaxXSFaqr1Fjh_qSm1SNdtK_HvGzgMtBSQ4JpnEiTPj-cYz_gzw1iIqtkblsXFaxrnLFZpU5WKljGaGcZcGnu3TKZ_NxHwuv_SLwtqh2n1ISYaRelzs5t0Rhr7UlxJkWR6LNbibo8fyhXxfj0_H3AFneToUdhRSzvulMr9_xoo7WjvzxZC3kebtgslfsqbBGR1u_t9nPIKHPfgk-522PIY7tt6CzWFjB9Lb-RY8OBrJXNsncPyxUedx4wmREZ4SZdSlHyOJW3i8SmxXgE66vahb4md2SYMiF9iUDs_uJxzDkSfgXH5_Ct8OP5wcTOJ-L4ZYI4RbxrlJnbRCc-OMxn7ASM0pxXImhKKaGlO4hCtT2USJRBWWa8USnauOD75i2Tas101tnwFJKm55WmlaSY3hEhc2K6pEUytsqimtIkiHX1Lqnqjc75dxXo4Uy6EPS-zDMvRhKSJ4N95z2dF0_FX6Df7pUdAzbE_2p6U_l2SSiaLgN2kEe4MilL1dtyVF3yFRhCcRvB4vo0X6NIuqbXMdZHxUKCWPYKfTm7GpjCH-RLQQAV_RqJV3Wb1SL84C67cUPkNeRPB-0Kufr_XnT33-b-Kv4P7k5GhaTj_NPu_CBkVE18037cH68uravoB7-ma5aK9eBpv7AQdsJrE |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB7RghAcKBQogQIGcYOoieP4cayApYhlValQ7c1y_FBXapNVN63Ev8d2HrAUkBDHJBMnsWfibzzjbwBeWY-KrVEkNU6LlDiivElVLlXKaGooc3nk2T6estmMz-fi8Kdd_DHbfQhJdnsaAktT3e4tjdsbN76Fqcm7wTikFRQFSfkGXCehaFDw14-OxzgCoyQfkjxKIeb9tpnft7E2NW2chMTIq6jzavLkLxHUODFNtv7_k-7CnR6Uov1Oi-7BNVtvw9ZQ8AH19r8Ntz-PJK-r-3D0oVGnaROIkj1sRcqoZfh3IrcIOBbZLjEddTWqVyis-KLGi5z5R-nYdr8QGY8CMWf77QF8nbz_8vYg7Ws0pNpDuzYlJnfCcs2MM9r3iffgnFKUUM4V1tiY0mVMmcpmimeqtEwrmmmiOp74ihYPYbNuavsIUFYxy_JK40po70YxbouyyjS23OYa4yqBfBgeqXsC81BH41SO1MuxD6XvQxn7UPIEXo_3LDv6jr9Kv_SjPgoG5u2D_akM57JCUF6W7DJPYHdQCtnb-0piP6cIL8KyBF6Ml72lhvCLqm1zEWWCtygES2Cn06HxUQX1uNSjiATYmnatvcv6lXpxEtnABQ-R8zKBN4OO_XitP3_q438Tfw43D99N5PTj7NMTuIU90OuWoXZhsz2_sE_hhr5sF6vzZ9H8vgOLui-V |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Goal-oriented+adaptive+finite+element+methods+with+optimal+computational+complexity&rft.jtitle=Numerische+Mathematik&rft.au=Becker%2C+Roland&rft.au=Gantner%2C+Gregor&rft.au=Innerberger%2C+Michael&rft.au=Praetorius%2C+Dirk&rft.date=2023-01-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=0029-599X&rft.eissn=0945-3245&rft.volume=153&rft.issue=1&rft.spage=111&rft.epage=140&rft_id=info:doi/10.1007%2Fs00211-022-01334-8&rft.externalDocID=10_1007_s00211_022_01334_8 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0029-599X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0029-599X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0029-599X&client=summon |