Related papers: Robust and efficient preconditioners for the disco…
We present a class of reduced basis (RB) methods for the iterative solution of parametrized symmetric positive-definite (SPD) linear systems. The essential ingredients are a Galerkin projection of the underlying parametrized system onto a…
In this article, interior penalty discontinuous Galerkin methods using immersed finite element functions are employed to solve parabolic interface problems. Typical semi-discrete and fully discrete schemes are presented and analyzed.…
A conforming discontinuous Galerkin finite element method is introduced for solving the biharmonic equation. This method, by its name, uses discontinuous approximations and keeps simple formulation of the conforming finite element method at…
We study linear parabolic initial-value problems in a space-time variational formulation based on fractional calculus. This formulation uses "time derivatives of order one half" on the bi-infinite time axis. We show that for linear,…
Recent work has explored solver strategies for the linear system of equations arising from a spectral Galerkin approximation of the solution of PDEs with parameterized (or stochastic) inputs. We consider the related problem of a matrix…
A new discontinuous Galerkin finite element method for the Stokes equations is developed in the primary velocity-pressure formulation. This method employs discontinuous polynomials for both velocity and pressure on general…
The ParaDiag family of algorithms solves differential equations by using preconditioners that can be inverted in parallel through diagonalization. In the context of optimal control of linear parabolic PDEs, the state-of-the-art ParaDiag…
In this paper we develop an adaptive procedure for the numerical solution of semilinear parabolic problems, with possible singular perturbations. Our approach combines a linearization technique using Newton's method with an adaptive…
A new numerical method is devised and analyzed for a type of ill-posed elliptic Cauchy problems by using the primal-dual weak Galerkin finite element method. This new primal-dual weak Galerkin algorithm is robust and efficient in the sense…
The treatment of the differential PDE constraint poses a key challenge in computing the numerical solution of the Serre-Green-Naghdi (SGN) equations. In this work, we introduce a constant coefficient preconditioner for the SGN constraint…
We develop a simple algorithmic framework to solve large-scale symmetric positive definite linear systems. At its core, the framework relies on two components: (1) a norm-convergent iterative method (i.e. smoother) and (2) a preconditioner.…
We present a discontinuous Galerkin-finite-difference hybrid scheme that allows high-order shock capturing with the discontinuous Galerkin method for general relativistic magnetohydrodynamics. The hybrid method is conceptually quite simple.…
The paper focuses on numerical solution of parametrized diffusion equations with scalar parameter-dependent coefficient function by the stochastic (spectral) Galerkin method. We study preconditioning of the related discretized problems…
We present parameter-robust preconditioners for linear systems that arise after applying static condensation to a hybridizable discontinuous Galerkin (HDG) discretization of the time-dependent Stokes problem. Building upon the theoretical…
Standard discontinuous Galerkin methods, based on piecewise polynomials of degree $ \qq=0,1$, are considered for temporal semi-discretization for second order hyperbolic equations. The main goal of this paper is to present a simple and…
We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed…
The main goal of the paper is to establish time semidiscrete and space-time fully discrete maximal parabolic regularity for the lowest order time discontinuous Galerkin solution of linear parabolic equations with time-dependent…
The Interior-Point Methods are a class for solving linear programming problems that rely upon the solution of linear systems. At each iteration, it becomes important to determine how to solve these linear systems when the constraint matrix…
There has been a growing interest in parallel strategies for solving trajectory optimization problems. One key step in many algorithmic approaches to trajectory optimization is the solution of moderately-large and sparse linear systems.…
Recently, the ParaOpt algorithm was proposed as an extension of the time-parallel Parareal method to optimal control. ParaOpt uses quasi-Newton steps that each require solving a system of matching conditions iteratively. The…