Related papers: Efficient $1$-Laplacian Solvers for Well-Shaped Si…
In this paper, we address the challenge of solving large-scale graph-structured nonlinear programs (gsNLPs) in a scalable manner. GsNLPs are problems in which the objective and constraint functions are associated with nodes on a graph and…
Fueled by many applications in random processes, imaging science, geophysics, etc., fractional Laplacians have recently received significant attention. The key driving force behind the success of this operator is its ability to capture…
Our previous multiscale graph basis dictionaries/graph signal transforms -- Generalized Haar-Walsh Transform (GHWT); Hierarchical Graph Laplacian Eigen Transform (HGLET); Natural Graph Wavelet Packets (NGWPs); and their relatives -- were…
We suggest a numerical integration procedure for solving the equations of motion of certain classical spin systems which preserves the underlying symplectic structure of the phase space. Such symplectic integrators have been successfully…
Non-linear least squares solvers are used across a broad range of offline and real-time model fitting problems. Most improvements of the basic Gauss-Newton algorithm tackle convergence guarantees or leverage the sparsity of the underlying…
We introduce a new algorithm and software for solving linear equations in symmetric diagonally dominant matrices with non-positive off-diagonal entries (SDDM matrices), including Laplacian matrices. We use pre-conditioned conjugate gradient…
We propose and analyze a Vanka-type multigrid solver for solving a sequence of complex-shifted Laplacian systems arising in diagonalization-based parallel-in-time algorithms for evolutionary equations. Under suitable assumption, local…
In the past years, the phenomenon of fractional regularity has been addressed for a large class of linear and/or quasilinear differential operators, mostly, in terms of certain Besov spaces. As it turned out, for equations governed by the…
Augmented Lagrangian (AL) methods are a well known class of algorithms for solving constrained optimization problems. They have been extended to the solution of saddle-point systems of linear equations. We study an AL (SPAL) algorithm for…
Efficient solutions of large-scale, ill-conditioned and indefinite algebraic equations are ubiquitously needed in numerous computational fields, including multiphysics simulations, machine learning, and data science. Because of their…
This paper proposes two efficient approximation methods to solve high-dimensional fully nonlinear partial differential equations (NPDEs) and second-order backward stochastic differential equations (2BSDEs), where such high-dimensional fully…
We study variational problems for curves approximated by B-spline curves. We show that, one can obtain discrete Euler-Lagrange equations, for the data describing the approximated curves. Our main application is to the curve completion…
We present a dimensionally split method for computing solutions to the compressible Navier-Stokes equations on Cartesian cut cell meshes. The method is globally second order accurate in the L1 norm, fully conservative, and allows the use of…
In this paper two new families of arbitrary high order accurate spectral DG finite element methods are derived on staggered Cartesian grids for the solution of the inc.NS equations in two and three space dimensions. Pressure and velocity…
For uncertainty propagation of highly complex and/or nonlinear problems, one must resort to sample-based non-intrusive approaches [1]. In such cases, minimizing the number of function evaluations required to evaluate the response surface is…
We develop all of the components needed to construct an adaptive finite element code that can be used to approximate fractional partial differential equations, on non-trivial domains in $d\geq 1$ dimensions. Our main approach consists of…
Deep models have achieved impressive progress in solving partial differential equations (PDEs). A burgeoning paradigm is learning neural operators to approximate the input-output mappings of PDEs. While previous deep models have explored…
This paper presents an efficient and concise double fast algorithm to solve high dimensional time-space fractional diffusion problems with spectral fractional Laplacian. We first establish semi-discrete scheme of time-space fractional…
We study higher order tangents and higher order Laplacians on p.c.f. self-similar sets with fully symmetric structures, such as $D3$ or $D4$ symmetric fractals. Firstly, let $x$ be a vertex point in the graphs that approximate the fractal,…
In recent years, there has been a surge of interest in studying different ways to reformulate nonconvex optimization problems, especially those that involve binary variables. This interest surge is due to advancements in computing…