相关论文: A unified error analysis of HDG methods for the st…
The numerical solution of an ordinary differential equation can be interpreted as the exact solution of a nearby modified equation. Investigating the behaviour of numerical solutions by analysing the modified equation is known as backward…
We propose and analyze a hybridizable discontinuous Galerkin (HDG) method for solving a mixed magnetic advection-diffusion problem within a more general Friedrichs system framework. With carefully constructed numerical traces, we introduce…
We provide new complexity information for the convergence of the Hybrid Steepest Descent Method for solving the Variational Inequality Problem for a strict contraction on Hilbert space over a closed convex set C given either as the fixed…
We study convergence rates of the classic proximal bundle method for a variety of nonsmooth convex optimization problems. We show that, without any modification, this algorithm adapts to converge faster in the presence of smoothness or a…
The Hessian discretisation method (HDM) for fourth order linear elliptic equations provides a unified convergence analysis framework based on three properties namely coercivity, consistency, and limit-conformity. Some examples that fit in…
In this paper we propose a new method to stabilise non-symmetric indefinite problems. The idea is to solve a forward and an adjoint problem simultaneously using a suitable stabilised finite element method. Both stabilisation of the element…
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the…
This paper proposes a mode multigrid (MMG) method, and applies it to accelerate the convergence of the steady state flow on unstructured grids. The dynamic mode decomposition (DMD) technique is used to analyze the convergence process of…
We develop a family of $H(\mathrm{div})$-conforming hybridizable discontinuous Galerkin methods for the steady Stokes equations based on BDM and RT velocity spaces with either discontinuous or continuous hybrid traces. In contrast to our…
Approximations of optimization problems arise in computational procedures and sensitivity analysis. The resulting effect on solutions can be significant, with even small approximations of components of a problem translating into large…
We present a new stability and error analysis of fully discrete approximation schemes for the transient Stokes equation. For the spatial discretization, we consider a wide class of Galerkin finite element methods which includes both inf-sup…
We consider Hamilton-Jacobi equations in one space dimension with Hamiltonians of the form $H(p,x,\omega) = G(p) + \beta V(x,\omega)$, where $V(\cdot,\omega)$ is a stationary and ergodic potential of unit amplitude. The homogenization of…
With the regular decomposition technique, we decompose the space $\mathbf{H}_0^s(\mathbf{curl}; \Omega)$ into the sum of a vector potential space and the gradient of a scalar space, both possessing higher regularity. Based on this new high…
In this paper, we study Newton-conjugate gradient (Newton-CG) methods for minimizing a nonconvex function $f$ whose Hessian is $(H_f,\nu)$-H\"older continuous with modulus $H_f>0$ and exponent $\nu\in(0,1]$. Recently proposed Newton-CG…
We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-forward, and…
We propose a high order unfitted finite element method for solving timeharmonic Maxwell interface problems. The unfitted finite element method is based on a mixed formulation in the discontinuous Galerkin framework on a Cartesian mesh with…
We consider minimization of composite functions of the form $f(g(x))+h(x)$, where $f$ and $h$ are convex functions (which can be nonsmooth) and $g$ is a smooth vector mapping. In addition, we assume that $g$ is the average of finite number…
This note focuses on a simple approach to the unified analysis of SGD-type methods from (Gorbunov et al., 2020) for strongly convex smooth optimization problems. The similarities in the analyses of different stochastic first-order methods…
This paper introduces new discretization schemes for time-harmonic Maxwell equations in a connected domain by using the weak Galerkin (WG) finite element method. The corresponding WG algorithms are analyzed for their stability and…
Two Hybridizable Discontinuous Galerkin (HDG) schemes for the solution of Maxwell's equations in the time domain are presented. The first method is based on an electromagnetic diffusion equation, while the second is based on Faraday's and…