Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1110.2063

Variational Implementation of Immersed Finite Element Methods

Luca Heltai·Francesco Costanzo
View original source ↗Read source document ↗Export metadata ↓

Abstract

Dirac-delta distributions are often crucial components of the solid-fluid coupling operators in immersed solution methods for fluid-structure interaction (FSI) problems. This is certainly so for methods like the Immersed Boundary Method (IBM) or the Immersed Finite Element Method (IFEM), where Dirac-delta distributions are approximated via smooth functions. By contrast, a truly variational formulation of immersed methods does not require the use of Dirac-delta distributions, either formally or practically. This has been shown in the Finite Element Immersed Boundary Method (FEIBM), where the variational structure of the problem is exploited to avoid Dirac-delta distributions at both the continuous and the discrete level. In this paper, we generalize the FEIBM to the case where an incompressible Newtonian fluid interacts with a general hyperelastic solid. Specifically, we allow (i) the mass density to be different in the solid and the fluid, (ii) the solid to be either viscoelastic of differential type or purely elastic, and (iii) the solid to be and either compressible or incompressible. At the continuous level, our variational formulation combines the natural stability estimates of the fluid and elasticity problems. In immersed methods, such stability estimates do not transfer to the discrete level automatically due to the non- matching nature of the finite dimensional spaces involved in the discretization. After presenting our general mathematical framework for the solution of FSI problems, we focus in detail on the construction of natural interpolation operators between the fluid and the solid discrete spaces, which guarantee semi-discrete stability estimates and strong consistency of our spatial discretization.

Explore related subjects

math.NAcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Luca Heltai, Francesco Costanzo. 2012-03-12. Variational Implementation of Immersed Finite Element Methods. https://doi.org/10.1016/j.cma.2012.04.001

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗