Related papers: Block subspace expansions for eigenvalues and eige…
This paper has proposed the GMRES that augments Krylov subspaces with a set of approximate right singular vectors. The proposed method suppresses the error norms of a linear system of equations. Numerical experiments comparing the proposed…
We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…
We study the problem of approximating the cone of positive semidefinite (PSD) matrices with a cone that can be described by smaller-sized PSD constraints. Specifically, we ask the question: "how closely can we approximate the set of…
Subspace methods are commonly used for finding approximate eigenvalues and singular values of large-scale matrices. Once a subspace is found, the Rayleigh-Ritz method (for symmetric eigenvalue problems) and Petrov-Galerkin projection (for…
A mathematical framework is constructed for the sum of the lowest N eigenvalues of a potential. Exactness is illustrated on several model systems (harmonic oscillator, particle in a box, and Poschl-Teller well). Its order-by-order…
Given (orthonormal) approximations $\tilde{U}$ and $\tilde{V}$ to the left and right subspaces spanned by the leading singular vectors of a matrix $A$, we discuss methods to approximate the leading singular values of $A$ and study their…
An emerging theory of "linear-algebraic pseudorandomness" aims to understand the linear-algebraic analogs of fundamental Boolean pseudorandom objects where the rank of subspaces plays the role of the size of subsets. In this work, we study…
We consider the problem of estimating the spectrum of a symmetric bounded entry (not necessarily PSD) matrix via entrywise sampling. This problem was introduced by [Bhattacharjee, Dexter, Drineas, Musco, Ray '22], where it was shown that…
Krylov subspace methods are a ubiquitous tool for computing near-optimal rank $k$ approximations of large matrices. While "large block" Krylov methods with block size at least $k$ give the best known theoretical guarantees, block size one…
We consider $N\times N$ Hermitian random band matrices $H=(H_{xy})$, whose entries are centered complex Gaussian random variables. The indices $x,y$ range over the $d$-dimensional discrete torus $(\mathbb Z/L\mathbb Z)^d$ with $d\in…
We determine, up to lower-order terms in the exponent, the best possible deterministic polynomial-time approximation ratio for the permanent of a Hermitian positive semidefinite matrix. If $A\succeq 0$ has no zero diagonal entry,…
Consider $n$ linearly independent vectors in $\mathbb{C}^n$ which form columns of a matrix $A$. The recursive evaluation of eigen directions (normalized eigenvectors) of $A$ is the solution of an eigenvalue problem of the form…
We consider an approximate computation of several minimal eigenpairs of large Hermitian matrices which come from high--dimensional problems. We use the tensor train format (TT) for vectors and matrices to overcome the curse of…
We study expansions near the boundary of solutions to the Dirichlet problem for the constant mean curvature equation in the hyperbolic space. With a characterization of remainders of the expansion by multiple integrals, we establish optimal…
Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…
We show that every matrix $A \in \mathbb{R}^{n\times n}$ is at least $\delta$$\|A\|$-close to a real matrix $A+E \in \mathbb{R}^{n\times n}$ whose eigenvectors have condition number at most $\tilde{O}_{n}(\delta^{-1})$. In fact, we prove…
We study three types of fourth-order Steklov eigenvalue problems. For the first two of them, we derive the asymptotic expansion of their spectra on Euclidean annular domains $\mathbb{B}^n_1\setminus \overline{\mathbb{B}^n_\epsilon}$ as…
This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control…
The sum of the first $n \geq 1$ eigenvalues of the Laplacian is shown to be maximal among triangles for the equilateral triangle, maximal among parallelograms for the square, and maximal among ellipses for the disk, provided the ratio…
There exist many ways to build an orthonormal basis of $\mathbb{R}^N$, consisting of the eigenvectors of the discrete Fourier transform (DFT). In this paper we show that there is only one such orthonormal eigenbasis of the DFT that is…