Extremal eigenvalue intervals of symmetric tridiagonal interval matrices

Computing the extremal eigenvalue bounds of interval matrices is non‐deterministic polynomial‐time (NP)‐hard. We investigate bounds on real eigenvalues of real symmetric tridiagonal interval matrices and prove that for a given real symmetric tridiagonal interval matrices, we can achieve its exact range of the smallest and largest eigenvalues just by computing extremal eigenvalues of four symmetric tridiagonal matrices.     

Upper (lower) bounds of the eigenvalues,spread and the open problems for the real symmetric interval matrices

This work is concerned with exploring the upper bounds and lower bounds of the eigenvalues of real symmetric matrices of order n whose entries are in a given interval. It gives the maximum and minimum of the eigenvalues and the upper bounds of spread of real symmetric interval matrices in all cases. It also gives the answers of the open problems for the maximum and minimum of the eigenvalues of real symmetric interval matrices. Copyright © 2012 John Wiley & Sons, Ltd.     

The fan-pall imbedding theorem over formally real fields

The converse of the Cauchy interlacing theorem, relating eigenvalues of a symmetric real matrix and eigenvalues of a principal submatrix, first proved by Fan and Pall, is extended to the case of symmetric matrices with entries in an arbitrary formally real field.     

Inertia‐based spectrum slicing for symmetric quadratic eigenvalue problems

In the quadratic eigenvalue problem (QEP) with all coefficient matrices symmetric, there can be complex eigenvalues. However, some applications need to compute real eigenvalues only. We propose a Lanczos‐based method for computing all real eigenvalues contained in a given interval of large‐scale symmetric QEPs. The method uses matrix inertias of the quadratic polynomial evaluated at different shift values. In this way, for hyperbolic problems, it is possible to make sure that all eigenvalues in the interval have been computed. We also discuss the general nonhyperbolic case. Our implementation is memory‐efficient by representing the computed pseudo‐Lanczos basis in a compact tensor product representation. We show results of computational experiments with a parallel implementation in the SLEPc library.     

Convergences of splitting iterative methods for symmetric indefinite linear systems

In this paper, we generalize the saddle point problem to general symmetric indefinite systems, we also present a kind of convergent splitting iterative methods for the symmetric indefinite systems. A special divergent splitting is introduced. The sufficient condition is discussed that the eigenvalues of the iteration matrix are real. The spectral radius of the iteration matrix is discussed in detail, the convergence theories of the splitting iterative methods for the symmetric indefinite systems are obtained. Finally, we present a preconditioner and discuss the eigenvalues of preconditioned matrix.     

实对称带状矩阵逆特征值问题

研究了一类实对称带状矩阵逆特征值问题：给定三个互异实数λ,μ和v及三个非零实向量x,y和z,分别构造实对称五对角矩阵T和实对称九对角矩阵A,使其都具有特征对(λ,x),(μ,y)和(v,z)．给出了此类问题的两种提法,研究了问题的可解性以及存在惟一解的充分必要条件,最后给出了数值算法和数值例子．     

The higher-order derivatives of spectral functions

We are interested in higher-order derivatives of functions of the eigenvalues of real symmetric matrices with respect to the matrix argument. We describe a formula for the k-th derivative of such functions in two general cases.The first case concerns the derivatives of the composition of an arbitrary (not necessarily symmetric) k-times differentiable function with the eigenvalues of symmetric matrices at a symmetric matrix with distinct eigenvalues.The second case describes the derivatives of the composition of a k-times differentiable separable symmetric function with the eigenvalues of symmetric matrices at an arbitrary symmetric matrix. We show that the formula significantly simplifies when the separable symmetric function is k-times continuously differentiable.As an application of the developed techniques, we re-derive the formula for the Hessian of a general spectral function at an arbitrary symmetric matrix. The new tools lead to a shorter, cleaner derivation than the original one.To make the exposition as self contained as possible, we have included the necessary background results and definitions. Proofs of the intermediate technical results are collected in the appendices.     

Invariant theoretic characterization of subdiscriminants of matrices

An invariant theoretic characterization of subdiscriminants of matrices is given. The structure as a module over the special orthogonal group of the minimal degree non-zero homogeneous component of the vanishing ideal of the variety of real symmetric matrices with a bounded number of different eigenvalues is investigated. These results are applied to the study of sum of squares presentations of subdiscriminants of real symmetric matrices.     

The variation of the eigenvalues of a real symmetric tridiagonal matrix upon the variation of some of its elements

Separation, monotonicity, and growth rate theorems are obtained for the eigenvalues of a real symmetric tridiagonal matrix when some of its elements are varying.     

A note on refining eigenelements of symmetric matrices

By means of a Fixed Slope Inexact Newton Method we define an Iterative Refinement Process for approximating eigenvalues and eigenvectors of real symmetric matrices.     

Eigenvalue distribution of certain ray patterns

In this paper, the eigenvalue distribution of complex matrices with certain ray patterns is investigated. Cyclically real ray patterns and ray patterns that are signature similar to real sign patterns are characterized, and their eigenvalue distribution is discussed. Among other results, the following classes of ray patterns are characterized: ray patterns that require eigenvalues along a fixed line in the complex plane, ray patterns that require eigenvalues symmetric about a fixed line, and ray patterns that require eigenvalues to be in a half-plane. Finally, some generalizations and open questions related to eigenvalue distribution are mentioned.     

Inverse eigenvalue problems for Jacobi matrices

It is proved that a real symmetric tridiagonal matrix with positive codiagonal elements is uniquely determined by its eigenvalues and the eigenvalues of the largest leading principal submatrix, and can be constructed from these data. The matrix depends continuously on the data, but because of rounding errors the investigated algorithm might in practice break down for large matrices.     

Diagonal elements and eigenvalues of a real symmetric matrix

A simple and constructive proof is given for the existence of a real symmetric matrix with prescribed diagonal elements and eigenvalues. Numerically implementable algorithms for constructing such a matrix are discussed.     

Numerical Determination of a Canonical Form of a Symplectic Matrix

We propose an algorithm that transforms a real symplectic matrix with a stable structure to a block diagonal form composed of three main blocks. The two extreme blocks of the same size are associated respectively with the eigenvalues outside and inside the unit circle. Moreover, these eigenvalues are symmetric with respect to the unit circle. The central block is in turn composed of several diagonal blocks whose eigenvalues are on the unit circle and satisfy a modification of the Krein-Gelfand-Lidskii criterion. The proposed algorithm also gives a qualitative criterion for structural stability.     

Estimates for the Eigenvalues of Matrices

For matrices whose eigenvalues are real (such as Hermitian or real symmetric matrices), we derive simple explicit estimates for the maximal (λ_max) and the minimal (λ_min) eigenvalues in terms of determinants of order less than 3. For 3 × 3 matrices, we derive sharper estimates, which use det A but do not require to solve cubic equations.     

-inclusion sets for eigenvalues of a tensor

In this paper, we mainly focus on new inclusion sets for eigenvalues of a tensor. First, we propose new inclusion sets for eigenvalues of a tensor, which are sharper than some existing inclusion sets, and obtain the law of distribution of the number of eigenvalues for a tensor. Second, two new classes of tensors are introduced. Third, some bounds on the spectral radii for nonnegative tensors are given. Fourth, some checkable sufficient conditions for the positive definiteness (positive semidefiniteness) of some classes of even-order real symmetric tensors are obtained.     

A modified bisection algorithm for the determination of the eigenvalues of a symmetric tridiagonal matrix

Summary A modification to the well known bisection algorithm [1] when used to determine the eigenvalues of a real symmetric matrix is presented. In the new strategy the terms in the Sturm sequence are computed only as long as relevant information on the required eigenvalues is obtained. The resulting algorithm usingincomplete Sturm sequences can be shown to minimise the computational work required especially when only a few eigenvalues are required.The technique is also applicable to other computational methods which use the bisection process.     

由谱数据数值稳定地构造实对称带状矩阵

§1.引言 设r,n是正整数并且0r有a_(ij)=0.     

A projective method for the construction of solutions of the problem of normal symmetric oscillations of viscous liquid

We propose a variational formulation of the spectral problem of normal symmetric oscillations of viscous liquid. On the basis of this formulation, we construct a projective method for the determination of real eigenvalues of the problem. We present the numerical realization of this method in the case of a spherical cavity.     

Hermitian matrices with a bounded number of eigenvalues

Conjugation covariants of matrices are applied to study the real algebraic variety consisting of complex Hermitian matrices with a bounded number of distinct eigenvalues. A minimal generating system of the vanishing ideal of degenerate three by three Hermitian matrices is given, and the structure of the corresponding coordinate ring as a module over the special unitary group is determined. The method applies also for degenerate real symmetric three by three matrices. For arbitrary n   partial information on the minimal degree component of the vanishing ideal of the variety of n×n$n\times n$ Hermitian matrices with a bounded number of eigenvalues is obtained, and some known results on sum of squares presentations of subdiscriminants of real symmetric matrices are extended to the case of complex Hermitian matrices.