Related papers: The Schur complements for $SDD_{1}$ matrices and t…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
This paper considers the matrix completion problem. We show that it is not necessary to assume joint incoherence, which is a standard but unintuitive and restrictive condition that is imposed by previous studies. This leads to a sample…
In this paper, we present a unified analysis of matrix completion under general low-dimensional structural constraints induced by {\em any} norm regularization. We consider two estimators for the general problem of structured matrix…
We consider the one-dimensional nonlinear Schr\"odinger equation $$ iu_t + u_{xx} + \mathcal{N}(u)u=0, \quad x,t \in \mathbb R, $$ with the nonlinearity term that is expressed as a sum of powers, possibly infinite: $$ \mathcal{N}(u) = \sum…
The Schur decomposition of a square matrix $A$ is an important intermediate step of state-of-the-art numerical algorithms for addressing eigenvalue problems, matrix functions, and matrix equations. This work is concerned with the following…
We consider the problem of efficiently solving large-scale linear least squares problems that have one or more linear constraints that must be satisfied exactly. Whilst some classical approaches are theoretically well founded, they can face…
We establish a relationship between an inverse optimization spectral problem for N-dimensional Schr\"odinger equation $ -\Delta \psi+q\psi=\lambda \psi $ and a solution of the nonlinear boundary value problem $-\Delta u+q_0 u=\lambda u-…
We present the first parallel algorithm for solving systems of linear equations in symmetric, diagonally dominant (SDD) matrices that runs in polylogarithmic time and nearly-linear work. The heart of our algorithm is a construction of a…
We systematically introduce an approach to the analysis and (numerical) solution of a broad class of nonlinear unconstrained optimal control problems, involving ordinary and distributed systems. Our approach relies on exact representations…
The problem of computing spectra of operators is arguably one of the most investigated areas of computational mathematics. However, the problem of computing spectra of general bounded infinite matrices has only recently been solved. We…
A system of semi-discrete coupled nonlinear Schr\"{o}dinger equations is studied. To show the complete integrability of the model with multiple components, we extend the discrete version of the inverse scattering method for the…
We solve inverse scattering problem for Schr\"odinger operators with compactly supported potentials on the half line. We discretize S-matrix: we take the value of the S-matrix on some infinite sequence of positive real numbers. Using this…
In this paper, we introduce a novel and robust approach to Quantized Matrix Completion (QMC). First, we propose a rank minimization problem with constraints induced by quantization bounds. Next, we form an unconstrained optimization problem…
Semidefinite programming (SDP) is a unifying framework that generalizes both linear programming and quadratically-constrained quadratic programming, while also yielding efficient solvers, both in theory and in practice. However, there exist…
Pairwise comparison matrices are increasingly used in settings where some pairs are missing. However, there exist few inconsistency indices for similar incomplete data sets and no reasonable measure has an associated threshold. This paper…
We compare the distribution function and the maximum of solutions of nonlinear elliptic equations defined in general domains with solutions of similar problems defined in a ball using Schwarz symmetrization. As an application, we prove the…
We propose a new formulation for the bundle adjustment problem which relies on nullspace marginalization of landmark variables by QR decomposition. Our approach, which we call square root bundle adjustment, is algebraically equivalent to…
Let $\mathcal{M}$ be a square matrix over a commutative ring and let $\mathcal{A}$ be a principal submatrix. We give relations between the determinants of $\mathcal{M}$ and $\mathcal{A}$ based on an annihilating polynomial for one of them.…
In this paper, we first introduce R0-W and SSM-W properties for the set of matrices which is a generalization of R0 and the strictly semimonotone matrix. We then prove some existence results for the extended horizontal linear…
We study the spectral properties of infinitely smooth multivariate kernel matrices when the nodes form a single cluster. We show that the geometry of the nodes plays an important role in the scaling of the eigenvalues of these kernel…