Related papers: Analysis of eigenvalue condition numbers for a cla…
Consider a $N\times n$ random matrix $Z_n=(Z^n_{j_1 j_2})$ where the individual entries are a realization of a properly rescaled stationary gaussian random field. The purpose of this article is to study the limiting empirical distribution…
We study the problem of minimizing the average of a large number of smooth convex functions penalized with a strongly convex regularizer. We propose and analyze a novel primal-dual method (Quartz) which at every iteration samples and…
We consider a quadratic operator pencil with a small periodic perturbation multiplied by the spectral parameter. It is motivated, in particular, by a one-dimensional Klein-Gordon equation with a time-parity-symmetric perturbation. We study…
Sensitivity of an eigenvalue $\lambda_i$ to the perturbation of matrix elements is controlled by the eigenvalue condition number defined as $\kappa_i = \sqrt{\left< L_i | L_i\right> \left< R_i|R_i \right> }$, where $\left<L_i\right|$ and…
We characterize the eigenvalues and eigenvectors of a class of complex valued tridiagonal $n$ by $n$ matrices subject to arbitrary boundary conditions, i.e. with arbitrary elements on the first and last rows of the matrix. %By boundary…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
We use techniques from finite free probability to analyze matrix processes related to eigenvalues, singular values, and generalized singular values of random matrices. The models we use are quite basic and the analysis consists entirely of…
We consider the eigenvalues and eigenvectors of matrices of the form M + P, where M is an n by n Wigner random matrix and P is an arbitrary n by n deterministic matrix with low rank. In general, we show that none of the eigenvalues of M + P…
A recent area of interest is the development and study of eigenvalue problems arising in scattering theory that may provide potential target signatures for use in nondestructive testing of materials. We consider a generalization of the…
This article can be considered as the first version of a book which the author plans to write about half-range problems in operator theory. It consists of two parts. The first part is based on lectures which the author delivered at…
In this paper we extend the novel approach to discrete Painlev\'e equations initiated in our previous work [2]. A classification scheme for discrete Painlev\'e equations proposed by Sakai interprets them as birational isomorphisms between…
Let $A$ be a full ranked $ n\times n$ matrix, with singular values $\sigma_1 (A) \ge \dots \ge \sigma_n (A) >0$. The condition number $\kappa(A):= \sigma_1(A)/\sigma_n(A)=\|A\|\cdot \|A\|^{-1}$ is a key parameter in the analysis of…
We study Hermitian random matrix models with an external source matrix which has equispaced eigenvalues, and with an external field such that the limiting mean density of eigenvalues is supported on a single interval as the dimension tends…
We consider a class of self-adjoint Sturm-Liouville problems with rational functions of the spectral parameter in the boundary conditions. The uniform stability for direct and inverse spectral problems is proved for the first time for…
We study the backward stability of running a backward stable eigenstructure solver on a pencil $S(\lambda)$ that is a strong linearization of a rational matrix $R(\lambda)$ expressed in the form $R(\lambda)=D(\lambda)+ C(\lambda…
In a random unitary matrix model at large N, we study the properties of the expectation value of the character of the unitary matrix in the rank k symmetric tensor representation. We address the problem of whether the standard semiclassical…
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…
The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…
We develop new techniques for proving lower bounds on the least singular value of random matrices with limited randomness. The matrices we consider have entries that are given by polynomials of a few underlying base random variables. This…
In this paper we characterise the indeterminate case by the eigenvalues of the Hankel matrices being bounded below by a strictly positive constant. An explicit lower bound is given in terms of the orthonormal polynomials and we find…