Related papers: Convergence analysis of oversampled collocation bo…
A general analysis framework is presented in this paper for many different types of finite element methods (including various discontinuous Galerkin methods). For second order elliptic equation, this framework employs $4$ different…
In this paper we establish best approximation property of fully discrete Galerkin solutions of second order parabolic problems on convex polygonal and polyhedral domains in the $L^\infty(I;W^{1,\infty}(\Om))$ norm. The discretization method…
Many data-fitting applications require the solution of an optimization problem involving a sum of large number of functions of high dimensional parameter. Here, we consider the problem of minimizing a sum of $n$ functions over a convex…
An efficient $hp$-multigrid scheme is presented for local discontinuous Galerkin (LDG) discretizations of elliptic problems, formulated around the idea of separately coarsening the underlying discrete gradient and divergence operators. We…
This paper develops and analyzes some interior penalty discontinuous Galerkin methods using piecewise linear polynomials for the Helmholtz equation with the first order absorbing boundary condition in the two and three dimensions. It is…
The construction of high order entropy stable collocation schemes on quadrilateral and hexahedral elements has relied on the use of Gauss-Legendre-Lobatto collocation points and their equivalence with summation-by-parts (SBP) finite…
This work presents a novel stabilization strategy for the Galerkin formulation of the incompressible Navier-Stokes equations, developed to achieve high accuracy while ensuring convergence and compatibility with high-order elements on…
We propose a mixed discontinuous Galerkin method for the bending problem of Naghdi shell, and present an analysis for its accuracy. The error estimate shows that when components of the curvature tensor and Christoffel symbols are piecewise…
The proximal Galerkin finite element method is a high-order, low-iteration complexity, nonlinear numerical method that preserves the geometric and algebraic structure of point-wise bound constraints in infinite-dimensional function spaces.…
In this paper we investigate the superconvergence properties of the discontinuous Galerkin method based on the upwind-biased flux for linear time-dependent hyperbolic equations. We prove that for even-degree polynomials, the method is…
This work extends the concepts of algebraic flux correction and convex limiting to continuous high-order Bernstein finite element discretizations of scalar hyperbolic problems. Using an array of adjustable diffusive fluxes, the standard…
Finite element methods for symmetric linear hyperbolic systems using unstructured advancing fronts (satisfying a causality condition) are considered in this work. Convergence results and error bounds are obtained for mapped tent pitching…
In this work we analyze the inverse problem of recovering the space-dependent potential coefficient in an elliptic / parabolic problem from distributed observation. We establish novel (weighted) conditional stability estimates under very…
We propose a new randomized optimization method for high-dimensional problems which can be seen as a generalization of coordinate descent to random subspaces. We show that an adaptive sampling strategy for the random subspace significantly…
The double-exponential Sinc-collocation method is known as a super-accurate method for solving initial value problems of ordinary differential equations, for which the error decreases almost exponentially as a function of the number of…
Generalized sampling is a recently developed linear framework for sampling and reconstruction in separable Hilbert spaces. It allows one to recover any element in any finite-dimensional subspace given finitely many of its samples with…
It is often unnoticed that the predominant way to use collocation methods is fundamentally flawed when applied to optimal control in robotics. Such methods assume that the system dynamics is given by a first order ODE, whereas robots are…
This work investigates the accuracy and numerical stability of CUR decompositions with oversampling. The CUR decomposition approximates a matrix using a subset of columns and rows of the matrix. When the number of columns and the rows are…
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…
Maxwell's equations are considered with transparent boundary conditions, for initial conditions and inhomogeneity having support in a bounded, not necessarily convex three-dimensional domain or in a collection of such domains. The numerical…