Related papers: Extending Elman's Bound for GMRES
We investigate Lawruk elliptic boundary-value problems for homogeneous differential equations in a two-sided refined Sobolev scale. These problems contain additional unknown functions in the boundary conditions of arbitrary orders. The…
We consider the solution of linear systems with tensor product structure using a GMRES algorithm. In order to cope with the computational complexity in large dimension both in terms of floating point operations and memory requirement, our…
A full multigrid finite element method is proposed for semilinear elliptic equations. The main idea is to transform the solution of the semilinear problem into a series of solutions of the corresponding linear boundary value problems on the…
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…
We introduce an alternative closed form lower bound on the Gaussian process ($\mathcal{GP}$) likelihood based on the R\'enyi $\alpha$-divergence. This new lower bound can be viewed as a convex combination of the Nystr\"om approximation and…
This paper examines inverse Cauchy problems that are governed by a kind of elliptic partial differential equation. The inverse problems involve recovering the missing data on an inaccessible boundary from the measured data on an accessible…
We study boundary value problems posed in a semistrip for the elliptic sine-Gordon equation, which is the paradigm of an elliptic integrable PDE in two variables. We use the method introduced by one of the authors, which provides a…
We present a general numerical method for computing guaranteed two-sided bounds for principal eigenvalues of symmetric linear elliptic differential operators. The approach is based on the Galerkin method, on the method of a priori-a…
Suppose $A \in \mathbb{R}^{n \times n}$ is invertible and we are looking for the solution of $Ax = b$. Given an initial guess $x_1 \in \mathbb{R}$, we show that by reflecting through hyperplanes generated by the rows of $A$, we can generate…
We study a class of optimization problems including matrix scaling, matrix balancing, multidimensional array scaling, operator scaling, and tensor scaling that arise frequently in theory and in practice. Some of these problems, such as…
We study the problem of bounding the posterior distribution of discrete probabilistic programs with unbounded support, loops, and conditioning. Loops pose the main difficulty in this setting: even if exact Bayesian inference is possible,…
We bound the condition number of the Jacobian in pseudo arclength continuation problems, and we quantify the effect of this condition number on the linear system solution in a Newton GMRES solve. In pseudo arclength continuation one…
When the CG method for solving linear algebraic systems was formulated about 70 years ago by Lanczos, Hestenes, and Stiefel, it was considered an iterative process possessing a mathematical finite termination property. CG was placed into a…
Explicit formulas expressing the solution to non-autonomous differential equations are of great importance in many application domains such as control theory or numerical operator splitting. In particular, intrinsic formulas allowing to…
Bilateral trade models the problem of intermediating between two rational agents -- a seller and a buyer -- both characterized by a private valuation for an item they want to trade. We study the online learning version of the problem, in…
In computational inverse problems, it is common that a detailed and accurate forward model is approximated by a computationally less challenging substitute. The model reduction may be necessary to meet constraints in computing time when…
The demands of accuracy in measurements and engineering models today, renders the condition number of problems larger. While a corresponding increase in the precision of floating point numbers ensured a stable computing, the uncertainty in…
We investigate the qualitative properties of solution to the Zaremba type problem in unbounded domain for the non-divergence elliptic equation with possible degeneration at infinity. The main result is Phragm\'en-Lindel\"of type principle…
Reverse Mathematics is a program in the foundations of mathematics which provides an elegant classification of theorems of ordinary mathematics based on computability. Our aim is to provide an alternative classification of theorems based on…
Hybrid inverse problems are based on the interplay of two types of waves, in order to allow for imaging with both high resolution and high contrast. The inversion procedure often consists of two steps: first, internal measurements involving…