Related papers: Schwarz Iterative Methods: Infinite Space Splittin…
We study the convergence properties of an overlapping Schwarz decomposition algorithm for solving nonlinear optimal control problems (OCPs). The algorithm decomposes the time domain into a set of overlapping subdomains, and solves all…
A typical procedure to integrate numerically the time dependent Schr\"o\-din\-ger equation involves two stages. In the first one carries out a space discretization of the continuous problem. This results in the linear system of differential…
We prove mean-square convergence of a novel numerical method, the tamed-splitting method, for a generalized Ait-Sahalia interest rate model. The method is based on a Lamperti transform, splitting and applying a tamed numerical method for…
We develop a new least squares method for solving the second-order elliptic equations in non-divergence form. Two least-squares-type functionals are proposed for solving the equations in two steps. We first obtain a numerical approximation…
We present an accelerated greedy strategy for training of projection-based reduced-order models for parametric steady and unsteady partial differential equations. Our approach exploits hierarchical approximate proper orthogonal…
We analyze overlapping multiplicative Schwarz methods as smoothers in the geometric multigrid solution of two-dimensional anisotropic diffusion problems. For diffusion equations, it is well known that the smoothing properties of point-wise…
We analyse a class of time discretizations for solving the nonlinear Schr\"odinger equation with non-smooth potential and at low-regularity on an arbitrary Lipschitz domain $\Omega \subset \mathbb{R}^d$, $d \le 3$. We show that these…
The approximation of a discrete probability distribution $\mathbf{t}$ by an $M$-type distribution $\mathbf{p}$ is considered. The approximation error is measured by the informational divergence $\mathbb{D}(\mathbf{t}\Vert\mathbf{p})$, which…
We consider the problem of approximating a given element $f$ from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the…
Over the last two decades, classical Schwarz methods have been extended to systems of hyperbolic partial differential equations, and it was observed that the classical Schwarz method can be convergent even without overlap in certain cases.…
We consider large-scale nonlinear least squares problems with sparse residuals, each of them depending on a small number of variables. A decoupling procedure which results in a splitting of the original problems into a sequence of…
There has been significant interest and progress recently in algorithms that solve regression problems involving tall and thin matrices in input sparsity time. These algorithms find shorter equivalent of a n*d matrix where n >> d, which…
In this paper, we prove the decay and scattering in the energy space for nonlinear Schr\"odinger equations with regular potentials in $\Bbb R^d$ namely, $i{\partial _t}u + \Delta u - V(x)u + \lambda |u|^{p - 1}u = 0$. We will prove decay…
We present an optimize-then-discretize framework for solving linear-quadratic optimal control problems (OCP) governed by time-inhomogeneous ordinary differential equations (ODEs). Our method employs a modified overlapping Schwarz…
This paper proposes a two-level restricted additive Schwarz (RAS) method for multiscale PDEs, built on top of a multiscale spectral generalized finite element method (MS-GFEM). The method uses coarse spaces constructed from optimal local…
In this paper we analyze a greedy procedure to approximate a linear functional defined in a Reproducing Kernel Hilbert Space by nodal values. This procedure computes a quadrature rule which can be applied to general functionals, including…
In this paper, we examine regularity estimates for solutions to fully nonlinear, degenerated elliptic equations, at interior vanishing source points. At these points, we obtain Schauder-type regularity estimates, which depend on the…
Differential equations are derived for a continuous limit of iterated Schwarzian reflection of analytic curves, and solutions are interpreted as geodesics in an infinite-dimensional symmetric space geometry.
We study an algorithm which has been proposed by Chinesta et al. to solve high-dimensional partial differential equations. The idea is to represent the solution as a sum of tensor products and to compute iteratively the terms of this sum.…
When solving PDEs, classical numerical solvers are often computationally expensive, while machine learning methods can suffer from spectral bias, failing to capture high-frequency components. Designing an optimal hybrid iterative…