Related papers: Optimal solvers for fourth-order PDEs discretized …
Common techniques for the spatial discretisation of PDEs on a macroscale grid include finite difference, finite elements and finite volume methods. Such methods typically impose assumed microscale structures on the subgrid fields, so…
We consider a space-time finite element method on fully unstructured simplicial meshes for optimal sparse control of semilinear parabolic equations. The objective is a combination of a standard quadratic tracking-type functional including a…
In this paper we present an overview of recent progress on the development and analysis of domain decomposition preconditioners for discretised Helmholtz problems, where the preconditioner is constructed from the corresponding problem with…
In this paper, we propose an efficient method for solving multi-dimensional Riesz space fractional diffusion equations with variable coefficients. The Crank-Nicolson (CN) method is used for temporal discretization, while the fourth-order…
When modeling scientific and industrial problems, geometries are typically modeled by explicit boundary representations obtained from computer-aided design software. Unfitted (also known as embedded or immersed) finite element methods offer…
The efficient solution of moderately large-scale linear systems arising from the KKT conditions in optimal control problems (OCPs) is a critical challenge in robotics. With the stagnation of Moore's law, there is growing interest in…
We study the high-contrast biharmonic plate equation with HCT and Morley discretizations. We construct a preconditioner that is robust with respect to contrast size and mesh size simultaneously based on the preconditioner proposed by…
In this paper, we address the efficient numerical solution of linear and quadratic programming problems, often of large scale. With this aim, we devise an infeasible interior point method, blended with the proximal method of multipliers,…
We study a thermo-poroelasticity model which describes the interaction between the deformation of an elastic porous material and fluid flow under non-isothermal conditions. The model involves several parameters that can vary significantly…
This paper aims to investigate the numerical approximation of a general second order parabolic stochastic partial differential equation(SPDE) driven by multiplicative and additive noise under more relaxed conditions. The SPDE is discretized…
In this note we present a multigrid preconditioning method for solving quadratic optimization problems constrained by a fractional diffusion equation. Multigrid methods within the all-at-once approach to solve the first order-order…
We propose an operator preconditioner for general elliptic pseudodifferential equations in a domain $\Omega$, where $\Omega$ is either in $\mathbb{R}^n$ or in a Riemannian manifold. For linear systems of equations arising from low-order…
The large sparse linear systems arising from the finite element or finite difference discretization of elliptic PDEs can be solved directly via, e.g., nested dissection or multifrontal methods. Such techniques reorder the nodes in the grid…
A new domain decomposition preconditioner is introduced for efficiently solving linear systems Ax = b with a symmetric positive definite matrix A. The particularity of the new preconditioner is that it is not necessary to have access to the…
Solving the normal equations corresponding to large sparse linear least-squares problems is an important and challenging problem. For very large problems, an iterative solver is needed and, in general, a preconditioner is required to…
We propose the first optimal geometric multigrid solver for hybrid high-order discretizations that can handle arbitrary polytopal agglomeration hierarchies in both two and three dimensions. The key ingredient is the use of modified skeleton…
We consider geometric multigrid methods for the solution of linear systems arising from isogeometric discretizations of elliptic partial differential equations. For classical finite elements, such methods are well known to be fast solvers…
Solving the Stokes equation by an optimal domain decomposition method derived algebraically involves the use of non standard interface conditions whose discretisation is not trivial. For this reason the use of approximation methods such as…
The discretization of the double-layer potential integral equation for the interior Dirichlet Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations…
We study the high-order local discontinuous Galerkin (LDG) method for the $p$-Laplace equation. We reformulate our spatial discretization as an equivalent convex minimization problem and use a preconditioned gradient descent method as the…