Adaptive refinement with locally linearly independent LR B-splines: Theory and applications

01/30/2020
by   Francesco Patrizi, et al.
0

In this paper we describe an adaptive refinement strategy for LR B-splines. The presented strategy ensures, at each iteration, local linear independence of the obtained set of LR B-splines. This property is then exploited in two applications: the construction of efficient quasi-interpolation schemes and the numerical solution of elliptic problems using the isogeometric Galerkin method.

READ FULL TEXT
research
10/02/2021

Effective grading refinement for locally linearly independent LR B-splines

We present a new refinement strategy for locally refined B-splines which...
research
01/23/2017

An hp-adaptive strategy for elliptic problems

In this paper a new hp-adaptive strategy for elliptic problems based on ...
research
11/08/2022

Cost-optimal adaptive iterative linearized FEM for semilinear elliptic PDEs

We consider scalar semilinear elliptic PDEs where the nonlinearity is st...
research
09/27/2019

Convergence of adaptive discontinuous Galerkin methods (corrected version of [Math. Comp. 87 (2018), no. 314, 2611–2640])

We develop a general convergence theory for adaptive discontinuous Galer...
research
06/02/2020

Kernel-independent adaptive construction of ℋ^2-matrix approximations

A method for the kernel-independent construction of ℋ^2-matrix approxima...
research
02/04/2022

A weak Galerkin method and its two-grid algorithm for the quasi-linear elliptic problems of non-monotone type

In this article, a weak Galerkin method is firstly presented and analyze...
research
08/27/2020

Inf-sup stability implies quasi-orthogonality

We prove new optimality results for adaptive mesh refinement algorithms ...

Please sign up or login with your details

Forgot password? Click here to reset