Related papers: Well-conditioned eigenvalue problems that overflow
We propose a new iterative algorithm for generating a subset of eigenvalues and eigenvectors of large matrices which generalizes the method of optimal relaxations. We also give convergence criteria for the iterative process, investigate its…
A generalized Wigner matrix perturbed by a finite-rank deterministic matrix is considered. The fluctuations of the largest eigenvalues, which emerge outside the bulk of the spectrum, and the corresponding eigenvectors, are studied. Under…
We consider the set $\mathcal{M}_n(\mathbb{Z}; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper and lower bounds on the number of distinct irreducible characteristic polynomials which correspond to…
In this paper, a full (nested) multigrid scheme is proposed to solve eigenvalue problems. The idea here is to use the multilevel correction method to transform the solution of eigenvalue problem to a series of solutions of the corresponding…
A new family of asymmetric matrices of Walsh-Hadamard type is introduced. We study their properties and, in particular, compute their determinants and discuss their eigenvalues. The invertibility of these matrices implies that certain…
Evaluation of the eigenvectors of symmetric tridiagonal matrices is one of the most basic tasks in numerical linear algebra. It is a widely known fact that, in the case of well separated eigenvalues, the eigenvectors can be evaluated with…
Composite optimization problems involve minimizing the composition of a smooth map with a convex function. Such objectives arise in numerous data science and signal processing applications, including phase retrieval, blind deconvolution,…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
We consider the eigenvalues and eigenvectors of small rank perturbations of random $N\times N$ matrices. We allow the rank of perturbation $M$ increases with $N$, and the only assumption is $M=o(N)$. In both additive and multiplicative…
Solving sparse linear systems from discretized PDEs is challenging. Direct solvers have in many cases quadratic complexity (depending on geometry), while iterative solvers require problem dependent preconditioners to be robust and…
An upper bound on operator norms of compound matrices is presented, and special cases that involve the $\ell_1$, $\ell_2$ and $\ell_\infty$ norms are investigated. The results are then used to obtain bounds on products of the largest or…
In this paper, we review the problem of matrix completion and expose its intimate relations with algebraic geometry, combinatorics and graph theory. We present the first necessary and sufficient combinatorial conditions for matrices of…
We consider optimization problems with manifold-valued constraints. These generalize classical equality and inequality constraints to a setting in which both the domain and the codomain of the constraint mapping are smooth manifolds. We…
Consider an N x N matrix A for which zero is a defective eigenvalue. In this case, the algebraic multiplicity of the zero eigenvalue is greater than the geometric multiplicity. We show how an inflated (N+1) x (N+1) matrix L can be…
In many high-dimensional problems,polynomial-time algorithms fall short of achieving the statistical limits attainable without computational constraints. A powerful approach to probe the limits of polynomial-time algorithms is to study the…
Computing more than one eigenvalue for (large sparse) one-parameter polynomial and general nonlinear eigenproblems, as well as for multiparameter linear and nonlinear eigenproblems, is a much harder task than for standard eigenvalue…
We give necessary and sufficient conditions to have measurable and continuous eigenfunctions for linearly recurrent Cantor dynamical systems. We also construct explicitly an example of linearly recurrent system with nontrivial Kronecker…
The problem of extracting a well conditioned submatrix from any rectangular matrix (with normalized columns) has been studied for some time in functional and harmonic analysis; see…
This paper analyzes the structure of the set of nodal solutions of a class of one-dimensional superlinear indefinite boundary values problems with an indefinite weight functions in front of the spectral parameter. Quite astonishingly, the…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…