REVIEW
BPX Preconditioners for Isogeometric Analysis Using (Truncated) Hierarchical B-splines
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
BPX Preconditioners for Isogeometric Analysis Using (Truncated) Hierarchical B-splines
read the original abstract
We present the construction of additive multilevel preconditioners, also known as BPX preconditioners, for the solution of the linear system arising in isogeometric adaptive schemes with (truncated) hierarchical B-splines. We show that the locality of hierarchical spline functions, naturally defined on a multilevel structure, can be suitably exploited to design and analyze efficient multilevel decompositions. By obtaining smaller subspaces with respect to standard tensor-product B-splines, the computational effort on each level is reduced. We prove that, for suitably graded hierarchical meshes, the condition number of the preconditioned system is bounded independently of the number of levels. A selection of numerical examples validates the theoretical results and the performance of the preconditioner.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.