Related papers: Interpolatory dynamical low-rank approximation for…
Low-rank approximation is a technique to approximate a tensor or a matrix with a reduced rank to reduce the memory required and computational cost for simulation. Its broad applications include dimension reduction, signal processing,…
In this work, we introduce high-order Basis-Update & Galerkin (BUG) integrators based on explicit Runge-Kutta methods for large-scale matrix differential equations. These dynamical low-rank integrators extend the BUG integrator to arbitrary…
In this work, we present an asymptotic-preserving semi-Lagrangian discontinuous Galerkin scheme for the Boltzmann equation that effectively handles multi-scale transport phenomena. The main challenge lies in designing appropriate moments…
In this paper, we propose a high-order domain decomposition method for the ES-BGK model of the Boltzmann equation, which dynamically detects regions of equilibrium and non-equilibrium. Our implementation automatically switches between Euler…
In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of…
We propose a new randomized method for solving systems of nonlinear equations, which can find sparse solutions or solutions under certain simple constraints. The scheme only takes gradients of component functions and uses Bregman…
We propose a family of high-order local discontinuous Galerkin (LDG) methods, built on a parametric representation and coupled with a semi-implicit backward Euler time discretization, for isotropic and anisotropic curve-shortening flows.…
We devise a space-time tensor method for the low-rank approximation of linear parabolic evolution equations. The proposed method is a stable Galerkin method, uniformly in the discretization parameters, based on a Minimal Residual…
Quantized tensor trains (QTTs) are a low-rank and multiscale framework that allows for efficient approximation and manipulation of multi-dimensional, high resolution data. One area of active research is their use in numerical simulation of…
In this paper we present a new ultra efficient numerical method for solving kinetic equations. In this preliminary work, we present the scheme in the case of the BGK relaxation operator. The scheme, being based on a splitting technique…
Solving the Boltzmann-BGK equation with traditional numerical methods suffers from high computational and memory costs due to the curse of dimensionality. In this paper, we propose a novel accuracy-preserved tensor-train (APTT) method to…
We present a dynamical low-rank (DLR) method for the Vlasov-Poisson-Fokker-Planck (VPFP) system. Our main contributions are two-fold: (i) a conservative spatial discretization of the Fokker-Planck operator that factors into velocity-only…
Adaptive lattice Boltzmann methods (LBMs) are based on velocity discretizations that self-adjust to local macroscopic conditions such as velocity and temperature. While this feature improves the accuracy and the stability of LBMs for large…
The Boltzmann equation, an integro-differential equation for the molecular distribution function in the physical and velocity phase space, governs the fluid flow behavior at a wide range of physical conditions, including compressible,…
We propose a new method, the continuous Galerkin method with globally and locally supported basis functions (CG-GL), to address the parametric robustness issues of reduced-order models (ROMs) by incorporating solution-based adaptivity with…
We propose a novel framework of generalised Petrov-Galerkin Dynamical Low Rank Approximations (DLR) in the context of random PDEs. It builds on the standard Dynamical Low Rank Approximations in their Dynamically Orthogonal formulation. It…
A classical approach for solving discrete time nonlinear control on a finite horizon consists in repeatedly minimizing linear quadratic approximations of the original problem around current candidate solutions. While widely popular in many…
We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and…
This work is devoted to the study of a posteriori error estimation and adaptivity in parabolic problems with a particular focus on spatial discontinuous Galerkin (dG) discretisations. We begin by deriving an a posteriori error estimator for…
In this paper, we develop an adaptive Generalized Multiscale Discontinuous Galerkin Method (GMs-DGM) for a class of high-contrast flow problems, and derive a-priori and a-posteriori error estimates for the method. Based on the a-posteriori…