Related papers: Incremental SVD Compression for Nonlinear Oldroyd …
This work considers the subdiffusion problem with non-positive memory, which not only arises from physical laws with memory, but could be transformed from sophisticated models such as subdiffusion or subdiffusive Fokker-Planck equation with…
Engineering simulations are usually based on complex, grid-based, or mesh-free methods for solving partial differential equations. The results of these methods cover large fields of physical quantities at very many discrete spatial…
We analyze a Crank-Nicolson finite difference discretization for the perturbed (2+1)D nonlinear Schr\"odinger equation with saturable nonlinearity and a perturbation of cubic loss. We show the boundedness, the existence and uniqueness of a…
In this article we study the numerical approximation of incompressible miscible displacement problems with a linearised Crank-Nicolson time discretisation, combined with a mixed finite element and discontinuous Galerkin method. At the heart…
The incremental singular value decomposition (SVD) updates a truncated SVD as new columns arrive, replacing a single large SVD with a sequence of small ones. In floating-point arithmetic, each update multiplies the running singular basis by…
The Nystr\"{o}m method is routinely used for out-of-sample extension of kernel matrices. We describe how this method can be applied to find the singular value decomposition (SVD) of general matrices and the eigenvalue decomposition (EVD) of…
Embedding nonlinear dynamical systems into artificial neural networks is a powerful new formalism for machine learning. By parameterizing ordinary differential equations (ODEs) as neural network layers, these Neural ODEs are…
In this paper we consider a mass- and energy--conserving Crank-Nicolson time discretization for a general class of nonlinear Schr\"odinger equations. This scheme, which enjoys popularity in the physics community due to its conservation…
Recent advances in nonlinear dynamical systems theory provide a new insight into numerical properties of discrete algorithms developed to solve nonlinear initial value problems. Basic features like accuracy and stability are well pointed…
We study the discretisation of a uniaxial (rank-one) reduction of the Oldroyd-B model for dilute polymer solutions, in which the conformation tensor is represented as $\sig = \vec b \otimes \vec b$. Building on structural analogies with…
Maximizing a submodular function is a fundamental task in machine learning and in this paper we study the deletion robust version of the problem under the classic matroids constraint. Here the goal is to extract a small size summary of the…
We provide a posteriori error estimates in the $L^\infty(L^2)-$norm for relaxation time discrete and fully discrete schemes for a class of evolution nonlinear Schr\"odinger equations up to the critical exponent. In particular for the…
A major problem of kernel-based methods (e.g., least squares support vector machines, LS-SVMs) for solving linear/nonlinear ordinary differential equations (ODEs) is the prohibitive $O(an^3)$ ($a=1$ for linear ODEs and 27 for nonlinear…
The paper presents a strategy to construct an incremental Singular Value Decomposition (SVD) for time-evolving, spatially 3D discrete data sets. A low memory access procedure for reducing and deploying the snapshot data is presented.…
Spectral embedding based on the Singular Value Decomposition (SVD) is a widely used "preprocessing" step in many learning tasks, typically leading to dimensionality reduction by projecting onto a number of dominant singular vectors and…
In this paper, we study the Crank-Nicolson method for temporal dimension and the piecewise quadratic polynomial collocation method for spatial dimensions of time-dependent nonlocal problems. The new theoretical results of such…
Compressed indexing is a powerful technique that enables efficient querying over data stored in compressed form, significantly reducing memory usage and often accelerating computation. While extensive progress has been made for…
Scale-resolving flow simulations often feature several million [thousand] spatial [temporal] discrete degrees of freedom. When storing or re-using these data, e.g., to subsequently train some sort of data-based surrogate or compute…
We consider a 1D-2V Vlasov-Fokker-Planck multi-species ionic description coupled to fluid electrons. We address temporal stiffness with implicit time stepping, suitably preconditioned. To address temperature disparity in time and space, we…
We present a numerical method to compute non-equilibrium memory kernels based on experimental data or molecular dynamics simulations. The procedure uses a recasting of the non-stationary generalized Langevin equation, in which we expand the…