Related papers: The Schur complements for $SDD_{1}$ matrices and t…
We initiate a study of solving a row/column diagonally dominant (RDD/CDD) linear system $Mx=b$ in sublinear time, with the goal of estimating $t^{\top}x^*$ for a given vector $t\in R^n$ and a specific solution $x^*$. This setting naturally…
Square matrices of the form $\widetilde{\mathbf{A}} =\mathbf{A} + \mathbf{e}D \mathbf{f}^*$ are considered. An explicit expression for the inverse is given, provided $\widetilde{\mathbf{A}}$ and $D$ are invertible with…
We consider Calder\'{o}n's inverse boundary value problems for a class of nonlinear Helmholtz Schr\"{o}dinger equations and Maxwell's equations in a bounded domain in $\R^n$. The main method is the higher-order linearization of the…
Fourth-order variational inequalities are encountered in various scientific and engineering disciplines, including elliptic optimal control problems and plate obstacle problems. In this paper, we consider additive Schwarz methods for…
We develop a unified nonparametric framework for sharp partial identification and inference on inequality indices when the data contain coarsened observations of the variable of interest. We characterize the extremal allocations for all…
We investigate additive Schwarz methods for semilinear elliptic problems with convex energy functionals, which have wide scientific applications. A key observation is that the convergence rates of both one- and two-level additive Schwarz…
We continue the study of real polynomials acting entrywise on matrices of fixed dimension to preserve positive semidefiniteness, together with the related analysis of order properties of Schur polynomials. Previous work has shown that,…
This paper introduces the application of the asynchronous iterations theory within the framework of the primal Schur domain decomposition method. A suitable relaxation scheme is designed, which asynchronous convergence is established under…
We present solutions to the matrix completion problems proposed by the Alignment Research Center that have a polynomial dependence on the precision $\varepsilon$. The motivation for these problems is to enable efficient computation of…
We have recently presented a method to solve an overdetermined linear system of equations with multiple right hand side vectors, where the unknown matrix is to be symmetric and positive definite. The coefficient and the right hand side…
In this paper we develop a Neumann-Neumann type domain decomposition method for elliptic problems on metric graphs. We describe the iteration in the continuous and discrete setting and rewrite the latter as a preconditioner for the Schur…
The main result of this paper is the extension of the Schur-Horn Theorem to infinite sequences: For two nonincreasing nonsummable sequences x and y that converge to 0, there exists a compact operator A with eigenvalue list y and diagonal…
Most recent results in matrix completion assume that the matrix under consideration is low-rank or that the columns are in a union of low-rank subspaces. In real-world settings, however, the linear structure underlying these models is…
In this paper, we demonstrate how a class of advanced matrix concentration inequalities, introduced in \cite{brailovskaya2024universality}, can be used to eliminate the dimensional factor in the convergence rate of matrix completion. This…
We consider a number of linear and non-linear boundary value problems involving generalized Schr\"odinger equations. The model case is $-\Delta u=Vu$ for $u\in W_0^{1,2}(D)$ with $D$ a bounded domain in ${\bf R^n}$. We use the Sobolev…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…
Schur decompositions and the corresponding Schur forms of a single matrix, a pair of matrices, or a collection of matrices associated with the periodic eigenvalue problem are frequently used and studied. These forms are upper-triangular…
Originally developed for imputing missing entries in low rank, or approximately low rank matrices, matrix completion has proven widely effective in many problems where there is no reason to assume low-dimensional linear structure in the…
In this paper, we present and analyze methods for solving a system of linear equations over idempotent semifields. The first method is based on the pseudo-inverse of the system matrix. We then present a specific version of Cramer's rule…