Related papers: A ghost-point smoothing strategy for geometric mul…
The use of multigrid and related preconditioners with the finite element method is often limited by the difficulty of applying the algorithm effectively to a problem, especially when the domain has a complex shape or adaptive refinement. We…
We propose a new hybrid topology optimization algorithm based on multigrid approach that combines the parallelization strategy of CPU using OpenMP and heavily multithreading capabilities of modern Graphics Processing Units (GPU). In…
There has been an increasing interest in developing efficient immersed boundary method (IBM) based on Cartesian grids, recently in the context of high-order methods. IBM based on volume penalization is a robust and easy to implement method…
A key challenge in applying reinforcement learning (RL) to diffusion large language models (dLLMs) lies in the intractability of their likelihood functions, which are essential for the RL objective, necessitating corresponding approximation…
In this paper, we apply the practical GADI-HS iteration as a smoother in algebraic multigrid (AMG) method for solving second-order non-selfadjoint elliptic problem. Additionally, we prove the convergence of the derived algorithm and…
A robust algorithm is proposed to reconstruct the spatial support and the Lam\'e parameters of multiple inclusions in a homogeneous background elastic material using a few measurements of the displacement field over a finite collection of…
This paper is concerned with a novel deep learning method for variational problems with essential boundary conditions. To this end, we first reformulate the original problem into a minimax problem corresponding to a feasible augmented…
We propose and analyze computationally a new fictitious domain method, based on higher order space-time finite element discretizations, for the simulation of the nonstationary, incompressible Navier-Stokes equations on evolving domains. The…
We present a general numerical approach to shape optimization with state constraints for 2-dimensional geometries, without relaxing the constraints. To do this we reformulate the problem on a fixed reference domain using a conformal…
The singularities that arise in elliptic boundary value problems are treated locally by a singular function boundary integral method. This method extracts the leading singular coefficients from a series expansion that describes the local…
We present a novel isogeometric method, namely the Immersed Boundary-Conformal Method (IBCM), that features a layer of discretization conformal to the boundary while employing a simple background mesh for the remaining domain. In this…
A numerical investigation of grain-boundary grooving by means of a Level Set method is carried out. An idealized polygranular interconnect which consists of grains separated by parallel grain boundaries aligned normal to the average…
This article is concerned with the discretisation of the Stokes equations on time-dependent domains in an Eulerian coordinate framework. Our work can be seen as an extension of a recent paper by Lehrenfeld & Olshanskii [ESAIM: M2AN,…
This paper proposes a novel Machine Learning-based approach to solve a Poisson problem with mixed boundary conditions. Leveraging Graph Neural Networks, we develop a model able to process unstructured grids with the advantage of enforcing…
A new approach to the solution of boundary value problems within the so-called fictitious domain methods philosophy is proposed which avoids well known shortcomings of other fictitious domain methods, including the need to generate…
High-dimensional simulation optimization is notoriously challenging. We propose a new sampling algorithm that converges to a global optimal solution and suffers minimally from the curse of dimensionality. The algorithm consists of two…
A method is proposed for accurately describing arbitrary-shaped free boundaries in single-grid finite-difference schemes for elastodynamics, in a time-domain velocity-stress framework. The basic idea is as follows: fictitious values of the…
In this article, we present a parallel discretization and solution method for parabolic problems with a higher number of space dimensions. It consists of a parallel-in-time approach using the multigrid reduction-in-time algorithm MGRIT with…
Point discretization of curved surfaces is required in many applications ranging from object rendering to the solution of surface partial differential equations (PDEs). These applications often impose that surfaces are sampled with local…
In this article, we analyse the domain mapping method approach to approximate statistical moments of solutions to linear elliptic partial differential equations posed over random geometries including smooth surfaces and bulk-surface…