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
POST COMMENT

Comments

There are no comments yet.

Authors

page 15

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...
06/02/2020

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

A method for the kernel-independent construction of ℋ^2-matrix approxima...
01/23/2017

An hp-adaptive strategy for elliptic problems

In this paper a new hp-adaptive strategy for elliptic problems based on ...
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...
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...
02/12/2021

Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems

We present a perturbed subspace iteration algorithm to approximate the l...
11/24/2018

Design and analysis adaptivity in multi-resolution topology optimization

Multiresolution topology optimization (MTO) methods involve decoupling o...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.