Related papers: Smaller Gershgorin disks for multiple eigenvalues …
For self maps of the disk, it can be shown that under the right conditions one can embed a discrete iteration of the map into a continuous semigroup. In this article we extend these results to two complex variables for maps of the unit ball…
The structured pseudospectra of a matrix A are sets of complex numbers that are eigenvalues of matrices X which are near to A and have the same entries as A at a fixed set of places. The sum of multiplicities of the eigenvalues of X inside…
We present a proof of the existence of real eigenvalues of real symmetric matrices which does not rely on any limit or compactness arguments, but only uses the notions of "sup", "inf".
We consider multiple Geronimus transformations and show that they lead to discrete (non-diagonal) Sobolev type inner products. Moreover, it is shown that every discrete Sobolev inner product can be obtained as a multiple Geronimus…
Generalized matrix approximation plays a fundamental role in many machine learning problems, such as CUR decomposition, kernel approximation, and matrix low rank approximation. Especially with today's applications involved in larger and…
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…
We consider nonnormal matrix-valued dynamical systems with discrete time. For an eigenvalue of matrix, the number of times it appears as a root of the characteristic polynomial is called the algebraic multiplicity. On the other hand, the…
Given a closed Riemannian manifold of dimenion less than eight, we prove a compactness result for the space of closed, embedded minimal hypersurfaces satisfying a volume bound and a uniform lower bound on the first eigenvalue of the…
Using the minors in Hessian matrices, we introduce new graded algebras associated to a homogeneous polynomial. When the associated projective hypersurface has isolated singularities, these algebras are related to some new local algebras…
We generalize the bounds on the inverses of diagonally dominant matrices obtained in [16] from scalar to block tridiagonal matrices. Our derivations are based on a generalization of the classical condition of block diagonal dominance of…
We introduce a nonsymmetric real matrix which contains all the information that the usual Hermitian density matrix does, and which has exactly the same tensor product structure. The properties of this matrix are analyzed in detail in the…
We present some new results on the joint distribution of an arbitrary subset of the ordered eigenvalues of complex Wishart, double Wishart, and Gaussian hermitian random matrices of finite dimensions, using a tensor pseudo-determinant…
Positive semi-definite matrices commonly occur as normal matrices of least squares problems in statistics or as kernel matrices in machine learning and approximation theory. They are typically large and dense. Thus algorithms to solve…
In this paper we shed more light on determinants of interval matrices. Computing the exact bounds on a determinant of an interval matrix is an NP-hard problem. Therefore, attention is first paid to approximations. NP-hardness of both…
We realize Stasheff's multiplihedron geometrically as the moduli space of stable quilted disks. This generalizes the geometric realization of the associahedron as the moduli space of stable disks. We show that this moduli space is the…
V.I. Arnold [Russian Math. Surveys 26(2) (1971) 29-43] constructed a miniversal deformation of a square complex matrix under similarity; that is, a simple normal form to which not only a given square matrix A but all matrices B close to it…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
In this paper I survey some recent results on finite determination, convergence, and approximation of formal mappings between real submanifolds in complex spaces. A number of conjectures are also given.
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent real entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on…