Related papers: A robust second-order low-rank BUG integrator base…
This paper describes a fourth-order integration algorithm for the gravitational N-body problem based on discrete Lagrangian mechanics. When used with shared timesteps, the algorithm is momentum conserving and symplectic. We generalize the…
We design and analyze a new adaptive stabilized finite element method. We construct a discrete approximation of the solution in a continuous trial space by minimizing the residual measured in a dual norm of a discontinuous test space that…
This paper is concerned with the strong approximation of a semi-linear stochastic wave equation with strong damping, driven by additive noise. Based on a spatial discretization performed by a spectral Galerkin method, we introduce a kind of…
This paper proposes a framework of L-BFGS based on the (approximate) second-order information with stochastic batches, as a novel approach to the finite-sum minimization problems. Different from the classical L-BFGS where stochastic batches…
In this paper, we describe a framework to compute expected convergence rates for residuals based on the Calder\'on identities for general second order differential operators for which fundamental solutions are known. The idea is that these…
Including the effect of thermal fluctuations in traditional computational fluid dynamics requires developing numerical techniques for solving the stochastic partial differential equations of fluctuating hydrodynamics. These Langevin…
This paper is concerned with developing accurate and efficient numerical methods for one-dimensional fully nonlinear second order elliptic and parabolic partial differential equations (PDEs). In the paper we present a general framework for…
Dynamic systems have a fundamental relevance in the description of physical phenomena. The search for more accurate and faster numerical integration methods for the resolution of such systems is, therefore, an important topic of research.…
We prove the inf-sup stability of a discontinuous Galerkin scheme for second order elliptic operators in (unbalanced) mesh-dependent norms for quasi-uniform meshes for all spatial dimensions. This results in a priori error bounds in these…
Low rank approximation is a commonly occurring problem in many computer vision and machine learning applications. There are two common ways of optimizing the resulting models. Either the set of matrices with a given rank can be explicitly…
Dynamical low-rank algorithms are a class of numerical methods that compute low-rank approximations of dynamical systems. This is accomplished by projecting the dynamics onto a low-dimensional manifold and writing the solution directly in…
In many applications, one needs to learn a dynamical system from its solutions sampled at a finite number of time points. The learning problem is often formulated as an optimization problem over a chosen function class. However, in the…
Finding robot poses and trajectories represents a foundational aspect of robot motion planning. Despite decades of research, efficiently and robustly addressing these challenges is still difficult. Existing approaches are often plagued by…
Recent advances in Bayesian learning with large-scale data have witnessed emergence of stochastic gradient MCMC algorithms (SG-MCMC), such as stochastic gradient Langevin dynamics (SGLD), stochastic gradient Hamiltonian MCMC (SGHMC), and…
In a dual weighted residual method based on the finite element framework, the Galerkin orthogonality is an issue that prevents solving the dual equation in the same space as the one for the primal equation. In the literature, there have…
A systematic numerical study on weak Galerkin (WG) finite element method for second order linear parabolic problems is presented by allowing polynomial approximations with various degrees for each local element. Convergence of both…
In this paper we apply implicit two-derivative multistage time integrators to viscous conservation laws in one and two dimensions. The one dimensional solver discretizes space with the classical discontinuous Galerkin (DG) method, and the…
We leverage the proximal Galerkin algorithm (Keith and Surowiec, Foundations of Computational Mathematics, 2024, DOI: 10.1007/s10208-024-09681-8), a recently introduced mesh-independent algorithm, to obtain a high-order finite element…
Dynamical low-rank approximation in the Tucker tensor format of given large time-dependent tensors and of tensor differential equations is the subject of this paper. In particular, a discrete time integration method for rank-constrained…
This paper presents a hybridized formulation for the weak Galerkin finite element method for the biharmonic equation. The hybridized weak Galerkin scheme is based on the use of a Lagrange multiplier defined on the element boundaries. The…