Related papers: An adaptive BDDC algorithm in variational form for…
In this work, we first present an adaptive deterministic block coordinate descent method with momentum (mADBCD) to solve the linear least-squares problem, which is based on Polyak's heavy ball method and a new column selection criterion for…
Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [Combettes,Pesquet,2014], several variants of block-coordinate primal-dual algorithms are designed in order to solve a wide…
In this paper we propose two variants of the substructuring preconditioner for solving three-dimensional elliptic-type equations with strongly discontinuous coefficients. In the new preconditioners, we use the simplest coarse solver…
This paper develops an adaptive proximal alternating direction method of multipliers (ADMM) for solving linearly constrained, composite optimization problems under the assumption that the smooth component of the objective is weakly convex,…
We propose a component-based (CB) parametric model order reduction (pMOR) formulation for parameterized {nonlinear} elliptic partial differential equations (PDEs). CB-pMOR is designed to deal with large-scale problems for which full-order…
In this paper, we develop subspace correction preconditioners for discontinuous Galerkin (DG) discretizations of elliptic problems with $hp$-refinement. These preconditioners are based on the decomposition of the DG finite element space…
In this paper we investigate a variational discretization for the class of mechanical systems in presence of symmetries described by the action of a Lie group which reduces the phase space to a (non-trivial) principal bundle. By introducing…
We propose a simple domain decomposition method for $d$-dimensional elliptic PDEs which involves an overlapping decomposition into local subdomain problems and a global coarse problem. It relies on a space-filling curve to create equally…
Many partial differential equations (PDEs) such as Navier--Stokes equations in fluid mechanics, inelastic deformation in solids, and transient parabolic and hyperbolic equations do not have an exact, primal variational structure. Recently,…
Biot's consolidation model in poroelasticity has a number of applications in science, medicine, and engineering. The model depends on various parameters, and in practical applications these parameters ranges over several orders of…
Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG…
In this work, we provide a performance comparison between the Balancing Domain Decomposition by Constraints (BDDC) and the Algebraic Multigrid (AMG) preconditioners for cardiac mechanics on both structured and unstructured finite element…
This paper studies formulations of second-order elliptic partial differential equations in nondivergence form on convex domains as equivalent variational problems. The first formulation is that of Smears \& S\"uli [SIAM J.\ Numer.\ Anal.\…
This paper presents a quantum algorithm for the solution of prototypical second-order linear elliptic partial differential equations discretized by $d$-linear finite elements on Cartesian grids of a bounded $d$-dimensional domain. An…
We propose a high-order adaptive numerical solver for the semilinear elliptic boundary value problem modelling magnetic plasma equilibrium in axisymmetric confinement devices. In the fixed boundary case, the equation is posed on curved…
We present a two-level preconditioner for solving linear systems arising from the discretization of the elliptic, linear-elastic deformation equation, in displacement unknowns, over domains that have arbitrary geometric and topological…
A new computational algorithm, the discrete singular convolution (DSC), is introduced for computational electromagnetics. The basic philosophy behind the DSC algorithm for the approximation of functions and their derivatives is studied.…
A discretization method with non-matching grids is proposed for the coupled Stokes-Darcy problem that uses a mortar variable at the interface to couple the marker and cell (MAC) method in the Stokes domain with the Raviart-Thomas mixed…
Difference of Convex (DC) optimization problems have objective functions that are differences between two convex functions. Representative ways of solving these problems are the proximal DC algorithms, which require that the convex part of…
The flux-mortar mixed finite element method was recently developed for a general class of domain decomposition saddle point problems on non-matching grids. In this work we develop the method for Darcy flow using the multipoint flux…