Related papers: Implicit Dynamical Tensor Train Approximation for …
Matrix differential Riccati equation (DRE) typically exhibits transient and steady-state phases, posing challenges for fixed-step time integration methods, which may lack accuracy during transients or oversample in steady regimes. In this…
We study a general, high-order, fully explicit numerical method for simulating kinetic equations with a BGK-type collision model with multiple relaxation times. In that case, the problem is stiff and its spectrum consists of multiple…
Dynamics simulation with frictional contacts is important for a wide range of applications, from cloth simulation to object manipulation. Recent methods using smoothed lagged friction forces have enabled robust and differentiable simulation…
The Fokker-Planck equation describing the transport of energetic particles interacting with turbulence is difficult to solve analytically. Numerical solutions are of course possible but they are not always useful for applications. In the…
We present the quantitative method of the recent work arXiv:2209.09340 in a simple setting, together with a compactness argument that was not included in arXiv:2209.09340 and has interest per se. We are concerned with the exponential…
Computing the invariant probability measure of a randomly perturbed dynamical system usually means solving the stationary Fokker-Planck equation. This paper studies several key properties of a novel data-driven solver for low-dimensional…
Cohesive fracture is among the few techniques able to model complex fracture nucleation and propagation with a sharp (nonsmeared) representation of the crack. Implicit time-stepping schemes are often favored in mechanics due to their…
We present a novel yet simple deep learning approach, called input gradient annealing neural network (IGANN), for solving stationary Fokker-Planck equations. Traditional methods, such as finite difference and finite elements, suffer from…
An implicit mass-matrix penalization (IMMP) of Hamiltonian dynamics is proposed, and associated dynamical integrators, as well as sampling Monte-Carlo schemes, are analyzed for systems with multiple time scales. The penalization is based on…
Tensor train (TT) factorization and corresponding TT rank, which can well express the low-rankness and mode correlations of higher-order tensors, have attracted much attention in recent years. However, TT factorization based methods are…
We study a discrete-time random feature method for nonlinear, time-dependent partial differential equations. In contrast to continuous-time formulations that treat time as an additional input variable, the method advances the solution step…
The Nystr\"om method offers an effective way to obtain low-rank approximation of SPD matrices, and has been recently extended and analyzed to nonsymmetric matrices (leading to the generalized Nystr\"om method). It is a randomized,…
In this work we study different Implicit-Explicit (IMEX) schemes for incompressible flow problems with variable viscosity. Unlike most previous work on IMEX schemes, which focuses on the convective part, we here focus on treating parts of…
The Tensor-Train (TT) format is a highly compact low-rank representation for high-dimensional tensors. TT is particularly useful when representing approximations to the solutions of certain types of parametrized partial differential…
We propose second-order implicit-explicit (IMEX) time-stepping schemes for nonlinear fractional differential equations with fractional order $0<\beta<1$. From the known structure of the non-smooth solution and by introducing corresponding…
Neural networks have achieved tremendous success in a large variety of applications. However, their memory footprint and computational demand can render them impractical in application settings with limited hardware or energy resources. In…
This paper proposes a novel formulation of the tensor completion problem to impute missing entries of data represented by tensors. The formulation is introduced in terms of tensor train (TT) rank which can effectively capture global…
In many applications, the governing PDE to be solved numerically contains a stiff component. When this component is linear, an implicit time stepping method that is unencumbered by stability restrictions is often preferred. On the other…
We introduce a deep neural network-based numerical method for solving kinetic Fokker Planck equations, including both linear and nonlinear cases. Building upon the conservative dissipative structure of Vlasov-type equations, we formulate a…
We consider dynamical low-rank approximation (DLRA) for the numerical simulation of Vlasov--Poisson equations based on separation of space and velocity variables, as proposed in several recent works. The standard approach for the time…