相关论文: Optimality of multilevel preconditioners for local…
In this paper, we examine a number of additive and multiplicative multilevel iterative methods and preconditioners in the setting of two-dimensional local mesh refinement. While standard multilevel methods are effective for uniform…
We propose and analyze optimal additive multilevel solvers for isogeometric discretizations of scalar elliptic problems for locally refined T-meshes. Applying the refinement strategy in Morgenstern and Peterseim (2015, Comput. Aided Geom.…
We propose and analyze an overlapping Schwarz preconditioner for the $p$ and $hp$ boundary element method for the hypersingular integral equation in 3D. We consider surface triangulations consisting of triangles. The condition number is…
We investigate the dimension dependence of Bramble--Pasciak--Xu (BPX) preconditioners for high-dimensional partial differential equations and establish that the condition numbers of BPX-preconditioned systems grow only polynomially with the…
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…
This paper proposes and analyzes an optimal preconditioner for a general linear symmetric positive definite (SPD) system by following the basic idea of the well-known BPX framework. The SPD system arises from a large number of nonstandard…
Adaptive mesh refinement is a key component of efficient unstructured space-time finite element methods. Underlying any adaptive mesh refinement scheme is, of course, a method for local refinement of simplices. However, simplex bisection…
This paper introduces a novel adaptive refinement strategy for Isogeometric Analysis (IGA) using Truncated Hierarchical B-splines (THB-splines). The proposed strategy enhances locally-refined meshes for specific applications, simplifying…
For non-preconditioned Galerkin systems, the condition number grows with the number of elements as well as the quotient of the maximal and the minimal mesh-size. Therefore, reliable and effective numerical computations, in particular on…
We present a new refinement strategy for locally refined B-splines which ensures the local linear independence of the basis functions. The strategy also guarantees the spanning of the full spline space on the underlying locally refined…
We consider an automatic construction of locally optimal preconditioners for positive definite linear systems. To achieve this goal, we introduce a differentiable loss function that does not explicitly include the estimation of minimal…
The goal of this paper is to design optimal multilevel solvers for the finite element approximation of second order linear elliptic problems with piecewise constant coefficients on bisection grids. Local multigrid and BPX preconditioners…
A new preconditioner is developed for high order finite element approximation of linear elastic problems on triangular meshes in two dimensions. The new preconditioner results in a condition number that is bounded independently of the…
In this article, we develop goal-oriented error indicators to drive adaptive refinement algorithms for the Poisson-Boltzmann equation. Empirical results for the solvation free energy linear functional demonstrate that goal-oriented…
This paper presents an immersed, isogeometric finite element framework to predict the response of multi-material, multi-physics problems with complex geometries using locally refined discretizations. To circumvent the need to generate…
The vast majority of mesh-based modelling applications iteratively transform the mesh vertices under prescribed geometric conditions. This occurs in particular in methods cycling through the constraint set such as Position-Based Dynamics…
The concept of trimming, embedding, or immersing geometries into a computational background mesh has gained considerable attention in recent years, particularly in isogeometric analysis (IGA). In this approach, the physical domain is…
We present numerical experiments for geophysics electromagnetic (EM) modeling based upon high-order edge elements and supervised $h+p$ refinement approaches on massively parallel computers. Our high-order $h+p$ refinement strategy is based…
In the present work we introduce a complete set of algorithms to efficiently perform adaptive refinement and coarsening by exploiting truncated hierarchical B-splines (THB-splines) defined on suitably graded isogeometric meshes, that are…
The de Rham complex arises naturally when studying problems in electromagnetism and fluid mechanics. Stable numerical methods to solve these problems can be obtained by using a discrete de Rham complex that preserves the structure of the…