Related papers: A comparative study on low-memory iterative solver…
We propose a mesh refinement technique for solving elliptic difference equations on unbounded domains based on the fast lattice Green's function (FLGF) method. The FLGF method exploits the regularity of the Cartesian mesh and uses the fast…
We propose an iterative algorithm for low-rank matrix completion that can be interpreted as an iteratively reweighted least squares (IRLS) algorithm, a saddle-escaping smoothing Newton method or a variable metric proximal gradient method…
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
We propose a hydridizable discontinuous Galerkin (HDG) method for solving the Cahn-Hilliard equation. The temporal discretization can be based on either the backward Euler method or the convex-splitting method. We show that the fully…
We study the use of the hybridizable discontinuous Galerkin (HDG) method for numerically solving fractional diffusion equations of order $-\alpha$ with $-1<\alpha<0$. For exact time-marching, we derive optimal algebraic error estimates…
A parallel algorithm for computing the finite difference solution to the elliptic equations with non-separable variables is presented. The resultant matrix is symmetric positive definite, thus the preconditioning conjugate gradient or the…
Projected gradient descent and its Riemannian variant belong to a typical class of methods for low-rank matrix estimation. This paper proposes a new Nesterov's Accelerated Riemannian Gradient algorithm by efficient orthographic retraction…
Numerical solutions for flows in partially saturated porous media pose challenges related to the non-linearity and elliptic-parabolic degeneracy of the governing Richards' equation. Iterative methods are therefore required to manage the…
We develop a hybrid spatial discretization for the wave equation in second order form, based on high-order accurate finite difference methods and discontinuous Galerkin methods. The hybridization combines computational efficiency of finite…
This paper presents and analyzes a parallelizable iterative procedure based on domain decomposition for primal-dual weak Galerkin (PDWG) finite element methods applied to the Poisson equation. The existence and uniqueness of the PDWG…
We present a general finite element linearized Landau-Lifshitz-Gilbert equation (LLGE) solver for magnetic systems under weak time-harmonic excitation field. The linearized LLGE is obtained by assuming a small deviation around the…
A new algorithm is proposed to impose a macroscopic stress or mixed stress/deformation gradient history in the context of non-linear Galerkin based FFT homogenization. The method proposed is based in the definition of a modified projection…
A practical and simple stable method for calculating Fourier integrals is proposed, effective both at low and at high frequencies. An approach based on the fruitful idea of Levin, to use of the collocation method to approximate the slowly…
We present a new class of iterative schemes for solving initial value problems (IVP) based on discontinuous Galerkin (DG) methods. Starting from the weak DG formulation of an IVP, we derive a new iterative method based on a preconditioned…
We design and investigate a variety of multigrid solvers for high-order local discontinuous Galerkin methods applied to elliptic interface and multiphase Stokes problems. Using the template of a standard multigrid V-cycle, we consider a…
The electromagnetic behavior of plasmonic structures can be predicted after discretizing and solving a linear system of equations, derived from a continuous surface integral equation (SIE) and the appropriate boundary conditions, using a…
We introduce a homogeneous multigrid method in the sense that it uses the same embedded discontinuous Galerkin (EDG) discretization scheme for Poisson's equation on all levels. In particular, we use the injection operator developed in…
This article introduces a new primal-dual weak Galerkin (PDWG) finite element method for second order elliptic interface problems with ultra-low regularity assumptions on the exact solution and the interface and boundary data. It is proved…
Large sparse symmetric linear systems appear in several branches of science and engineering thanks to the widespread use of the finite element method (FEM). The fastest sparse linear solvers available implement hybrid iterative methods.…
We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…