Related papers: Efficient $1$-Laplacian Solvers for Well-Shaped Si…
We study nonlinear elliptic equations for operators corresponding to non-stable L\'evy diffusions. We include a sum of fractional Laplacians of different orders. Such operators are infinitesimal generators of non-stable (i.e., non…
Lagrangian coherent structures (LCS) in fluid flows appear as co-dimension one ridges of the finite time Lyapunov exponent (FTLE) field. In three- dimensions this means two-dimensional ridges. A fast algorithm is presented here to locate…
We introduce a collection of benchmark problems in 2D and 3D (geometry description and boundary conditions), including simple cases with known analytic solution, classical experimental setups, and complex geometries with fabricated…
We introduce a numerical method for approximating arbitrary differential operators on vector fields in the weak form given point cloud data sampled randomly from a $d$ dimensional manifold embedded in $\mathbb{R}^n$. This method generalizes…
For the fractional Laplacian of variable order, an efficient and accurate numerical evaluation in multi-dimension is a challenge for the nature of a singular integral. We propose a simple and easy-to-implement finite difference scheme for…
Multigrid methods are one of the most efficient techniques for solving linear systems arising from Partial Differential Equations (PDEs) and graph Laplacians from machine learning applications. One of the key components of multigrid is…
This paper considers a high-dimensional linear regression problem where there are complex correlation structures among predictors. We propose a graph-constrained regularization procedure, named Sparse Laplacian Shrinkage with the Graphical…
In this paper, we develop two fast implicit difference schemes for solving a class of variable-coefficient time-space fractional diffusion equations with integral fractional Laplacian (IFL). The proposed schemes utilize the graded $L1$…
We present a simple spectral approach to the well-studied constrained clustering problem. It captures constrained clustering as a generalized eigenvalue problem with graph Laplacians. The algorithm works in nearly-linear time and provides…
The fractional Laplacian $(-\Delta)^{\alpha/2}$ is the prototypical non-local elliptic operator. While analytical theory has been advanced and understood for some time, there remain many open problems in the numerical analysis of the…
In this paper, we bring the techniques of the Laplacian paradigm to the congested clique, while further restricting ourselves to deterministic algorithms. In particular, we show how to solve a Laplacian system up to precision $\epsilon$ in…
We provide novel linear combination of unitaries decompositions for a class of discrete elliptic differential operators. Specifically, Poisson problems augmented with periodic, Dirichlet, Neumann, Robin, and mixed boundary conditions are…
We present a numerical method for obtaining high-accuracy numerical solutions of spatially localized time-periodic excitations on a nonlinear Hamiltonian lattice. We compare these results with analytical considerations of the spatial decay.…
Modified Hamiltonians are used in the field of geometric numerical integration to show that symplectic schemes for Hamiltonian systems are accurate over long times. For nonlinear systems the series defining the modified Hamiltonian usually…
The primary emphasis of this work is the development of a finite element based space-time discretization for solving the stochastic Lagrangian averaged Navier-Stokes (LANS-$\alpha$) equations of incompressible fluid turbulence with…
Semi-implicit time-stepping schemes for atmosphere and ocean models require elliptic solvers that work efficiently on modern supercomputers. This paper reports our study of the potential computational savings when using mixed precision…
The computation of Lagrangian coherent structures (LCS) has established itself as a prominent means to reveal significant geometric structures in time-dependent vector fields. Their characterization, however, requires the selection of a…
This paper introduces a smoothed proximal Lagrangian method for minimizing a nonconvex smooth function over a convex domain with additional explicit convex nonlinear constraints. Two key features are 1) the proposed method is single-looped,…
In this paper, we consider a class of highly oscillatory Hamiltonian systems which involve a scaling parameter $\varepsilon\in(0,1]$. The problem arises from many physical models in some limit parameter regime or from some time-compressed…
The symmetric binary perceptron ($\mathrm{SBP}_{\kappa}$) problem with parameter $\kappa : \mathbb{R}_{\geq1} \to [0,1]$ is an average-case search problem defined as follows: given a random Gaussian matrix $\mathbf{A} \sim…