Related papers: Local Multilevel Preconditioners for Elliptic Equa…
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…
In this paper we construct and analyse a level-dependent coarsegrid correction scheme for indefinite Helmholtz problems. This adapted multigrid method is capable of solving the Helmholtz equation on the finest grid using a series of…
A cascadic multigrid method is proposed for eigenvalue problems based on the multilevel correction scheme. With this new scheme, an eigenvalue problem on the finest space can be solved by smoothing steps on a series of multilevel finite…
In this paper we consider Yamabe type problem for higher order curvatures on manifolds with totally geodesic boundaries. We prove local gradient and second derivative estimates for solutions to the fully nonlinear elliptic equations…
Stochastic PDE eigenvalue problems are useful models for quantifying the uncertainty in several applications from the physical sciences and engineering, e.g., structural vibration analysis, the criticality of a nuclear reactor or photonic…
This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the…
In this paper we study convergence estimates for a multigrid algorithm with smoothers of successive subspace correction (SSC) type, applied to symmetric elliptic PDEs. First, we revisit a general convergence analysis on a class of multigrid…
We are given a uniformly elliptic coefficient field that we regard as a realization of a stationary and finite-range (say, range unity) ensemble of coefficient fields. Given a (deterministic) right-hand-side supported in a ball of size…
The discontinuous Galerkin time-stepping method has many advantageous properties for solving parabolic equations. However, it requires the solution of a large nonsymmetric system at each time-step. This work develops a fully robust and…
Bilevel optimization reveals the inner structure of otherwise oblique optimization problems, such as hyperparameter tuning, neural architecture search, and meta-learning. A common goal in bilevel optimization is to minimize a…
Local and global weighted norm estimates involving Muckenhoupt weights are obtained for gradient of solutions to linear elliptic Dirichlet boundary value problems in divergence form over a Lipschitz domain $\Omega$. The gradient estimates…
We propose an optimization proxy in terms of iterative implicit gradient methods for solving constrained optimization problems with nonconvex loss functions. This framework can be applied to a broad range of machine learning settings,…
In this paper, we study the problem of solving a simple bilevel optimization problem, where the upper-level objective is minimized over the solution set of the lower-level problem. We focus on the general setting in which both the upper-…
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…
We consider the solution of large-scale nonlinear algebraic Hermitian eigenproblems of the form $T(\lambda)v=0$ that admit a variational characterization of eigenvalues. These problems arise in a variety of applications and are…
We develop multilevel methods for interface-driven multiphysics problems that can be coupled across dimensions and where complexity and strength of the interface coupling deteriorates the performance of standard methods. We focus on solvers…
We investigate several robust preconditioners for solving the saddle-point linear systems that arise from spatial discretization of unsteady and steady variable-coefficient Stokes equations on a uniform staggered grid. Building on the…
In this article, we establish optimality of the Bramble-Pasciak-Xu (BPX) norm equivalence and optimality of the wavelet modified (or stabilized) hierarchical basis (WHB) preconditioner in the setting of local 3D mesh refinement. In the…
We consider adaptive finite element methods (AFEMs) with inexact algebraic solvers for second-order symmetric linear elliptic diffusion problems. Optimal complexity of AFEM, i.e., optimal convergence rates with respect to the overall…
Stochastic sampling methods are arguably the most direct and least intrusive means of incorporating parametric uncertainty into numerical simulations of partial differential equations with random inputs. However, to achieve an overall error…