Monica Montardini , Giancarlo Sangalli , Mattia Tani
{"title":"A low-rank solver for conforming multipatch Isogeometric Analysis","authors":"Monica Montardini , Giancarlo Sangalli , Mattia Tani","doi":"10.1016/j.camwa.2025.03.036","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we propose an innovative isogeometric low-rank solver for the linear elasticity model problem, specifically designed to allow multipatch domains. Our approach splits the domain into subdomains, each formed by the union of neighboring patches. Within each subdomain, we employ Tucker low-rank matrices and vectors to approximate the system matrices and right-hand side vectors, respectively. This enables the construction of local approximate fast solvers. These local solvers are then combined into an overlapping Schwarz preconditioner, which is utilized in a truncated preconditioned conjugate gradient method. Numerical experiments demonstrate the significant memory storage benefits and a uniformly bounded number of iterations with respect to both mesh size and spline degree.</div></div>","PeriodicalId":55218,"journal":{"name":"Computers & Mathematics with Applications","volume":"189 ","pages":"Pages 86-108"},"PeriodicalIF":2.9000,"publicationDate":"2025-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Mathematics with Applications","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0898122125001385","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
In this paper, we propose an innovative isogeometric low-rank solver for the linear elasticity model problem, specifically designed to allow multipatch domains. Our approach splits the domain into subdomains, each formed by the union of neighboring patches. Within each subdomain, we employ Tucker low-rank matrices and vectors to approximate the system matrices and right-hand side vectors, respectively. This enables the construction of local approximate fast solvers. These local solvers are then combined into an overlapping Schwarz preconditioner, which is utilized in a truncated preconditioned conjugate gradient method. Numerical experiments demonstrate the significant memory storage benefits and a uniformly bounded number of iterations with respect to both mesh size and spline degree.
期刊介绍:
Computers & Mathematics with Applications provides a medium of exchange for those engaged in fields contributing to building successful simulations for science and engineering using Partial Differential Equations (PDEs).