Related papers: An O(N) Direct Solver for Integral Equations on th…
A high-order accurate adjoint-based optimization framework is presented for unsteady multiphysics problems. The fully discrete adjoint solver relies on the high-order, linearly stable, partitioned solver introduced in [1], where different…
When a system of first order linear ordinary differential equations has eigenvalues of large magnitude, its solutions exhibit complicated behaviour, such as high-frequency oscillations, rapid growth or rapid decay. The cost of representing…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
We present a methodology for numerically integrating ordinary differential equations containing rapidly oscillatory terms. This challenge is distinct from that for differential equations which have rapidly oscillatory solutions: here the…
In this paper we present a non-recursive direct solver, based on the Bartels-Stewart algorithm, for $N$-dimensional Sylvester tensor equations. The method relies only on Schur decompositions of the coefficient matrices and reduces the…
Factorization of large dense matrices are ubiquitous in engineering and data science applications, e.g. preconditioners for iterative boundary integral solvers, frontal matrices in sparse multifrontal solvers, and computing the determinant…
Numerically solving ordinary differential equations (ODEs) is a naturally serial process and as a result the vast majority of ODE solver software are serial. In this manuscript we developed a set of parallelized ODE solvers using…
The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x…
We study stochastic optimization from a joint continuous-discrete point of view. Starting from a second-order stochastic differential equation interpreted as a noisy accelerated gradient flow, we discretize the dynamics by a fully implicit…
Computational modeling of charged species transport has enabled the analysis, design, and optimization of a diverse array of electrochemical and electrokinetic devices. These systems are represented by the Poisson-Nernst-Planck (PNP)…
We introduce and compare new compression approaches to obtain regularized solutions of large linear systems which are commonly encountered in large scale inverse problems. We first describe how to approximate matrix vector operations with a…
This paper considers a large class of linear operator equations, including linear boundary value problems for partial differential equations, and treats them as linear recovery problems for objects from their data. Well-posedness of the…
We develop a fast and reliable method for solving large-scale optimal transport (OT) problems at an unprecedented combination of speed and accuracy. Built on the celebrated Douglas-Rachford splitting technique, our method tackles the…
We present and analyze a new iterative solver for implicit discretizations of a simplified Boltzmann-Poisson system. The algorithm builds on recent work that incorporated a sweeping algorithm for the Vlasov-Poisson equations as part of…
A method for approximating sixth-order ordinary differential equations is proposed, which utilizes a deep learning feedforward artificial neural network, referred to as a neural solver. The efficacy of this unsupervised machine learning…
Several problems in magnetically confined fusion, such as the computation of exterior vacuum fields or the decomposition of the total magnetic field into separate contributions from the plasma and the external sources, are best formulated…
We apply topological methods to obtain global continuation results for harmonic solutions of some periodically perturbed ordinary differential equations on a $k$-dimensional differentiable manifold $M \subseteq \mathbb{R}^m$. We assume that…
Hierarchical matrices provide a highly memory-efficient way of storing dense linear operators arising, for example, from boundary element methods, particularly when stored in the H^2 format. In such data-sparse representations, iterative…
The simplicity and the efficiency of a quasi-analytical method for solving nonlinear ordinary differential equations (ODE), is illustrated on the study of anharmonic oscillators (AO) with a potential $V(x) =\beta x^{2}+x^{2m}$ ($m>0$). The…
We propose a family of reliable symplectic integrators adapted to the Discrete Non-Linear Schr\"odinger equation; based on an idea of Yoshida (H. Yoshida, Construction of higher order symplectic integrators, Physics Letters A, 150, 5,6,7,…