{"title":"On the Solution Existence for Collocation Discretizations of Time-Fractional Subdiffusion Equations","authors":"Sebastian Franz, Natalia Kopteva","doi":"10.1007/s10915-024-02619-w","DOIUrl":null,"url":null,"abstract":"<p>Time-fractional parabolic equations with a Caputo time derivative of order <span>\\(\\alpha \\in (0,1)\\)</span> are discretized in time using continuous collocation methods. For such discretizations, we give sufficient conditions for existence and uniqueness of their solutions. Two approaches are explored: the Lax–Milgram Theorem and the eigenfunction expansion. The resulting sufficient conditions, which involve certain <span>\\(m\\times m\\)</span> matrices (where <i>m</i> is the order of the collocation scheme), are verified both analytically, for all <span>\\(m\\ge 1\\)</span> and all sets of collocation points, and computationally, for all <span>\\( m\\le 20\\)</span>. The semilinear case is also addressed.\n</p>","PeriodicalId":2,"journal":{"name":"ACS Applied Bio Materials","volume":null,"pages":null},"PeriodicalIF":4.6000,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACS Applied Bio Materials","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10915-024-02619-w","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATERIALS SCIENCE, BIOMATERIALS","Score":null,"Total":0}
引用次数: 0
Abstract
Time-fractional parabolic equations with a Caputo time derivative of order \(\alpha \in (0,1)\) are discretized in time using continuous collocation methods. For such discretizations, we give sufficient conditions for existence and uniqueness of their solutions. Two approaches are explored: the Lax–Milgram Theorem and the eigenfunction expansion. The resulting sufficient conditions, which involve certain \(m\times m\) matrices (where m is the order of the collocation scheme), are verified both analytically, for all \(m\ge 1\) and all sets of collocation points, and computationally, for all \( m\le 20\). The semilinear case is also addressed.