A Class of Constrained Inverse Eigenproblem and Associated Approximation Problem for Symmetric Reflexive Matrices

Let S∈Rn×n be a symmetric and nontrival involution matrix. We say that A∈E R n×n is a symmetric reflexive matrix if AT = A and SAS = A. Let S R r n×n(S)={A|A= AT,A = SAS, A∈Rn×n}. This paper discusses the following two problems. The first one is as follows. Given Z∈Rn×m (m < n),∧= diag(λ1,...,λm)∈Rm×m, andα,β∈R withα<β. Find a subset (?)(Z,∧,α,β) of SRrn×n(S) such that AZ = Z∧holds for any A∈(?)(Z,∧,α,β) and the remaining eigenvaluesλm 1 ,...,λn of A are located in the interval [α,β], Moreover, for a given B∈Rn×n, the second problem is to find AB∈(?)(Z,∧,α,β) such that where ||.|| is the Frobenius norm. Using the properties of symmetric reflexive matrices, the two problems are essentially decomposed into the same kind of subproblems for two real symmetric matrices with smaller dimensions, and then the expressions of the general solution for the two problems are derived.     

COMPUTING THE NEAREST BISYMMETRIC POSITIVE SEMIDEFINITE MATRIX UNDER THE SPECTRAL RESTRICTION

Let A and C denote real n × n matrices. Given real n-vectors x1, ... ,xm, m ≤ n, and a set of numbers L = {λ1,λ2,... ,λm}. We describe (I) the set (?) of all real n × n bisymmetric positive seidefinite matrices A such that Axi is the "best" approximate to λixi, i = 1,2,...,m in Frobenius norm and (II) the Y in set (?) which minimize Frobenius norm of ||C - Y||.An existence theorem of the solutions for Problem I and Problem II is given and the general expression of solutions for Problem I is derived. Some sufficient conditions under which Problem I and Problem II have an explicit solution is provided. A numerical algorithm of the solution for Problem II has been presented.     

ON THE MULTIPLICATIVE INVERSE EIGENVALUE PROBLEMS

We present new sufficient conditions on the solvability and numerical methods for the following multiplicative inverse eigenvalue problem: Given an n x n real matrix A and n real numbers λ1 , λ2,..., λn, find n real numbers c1, c2,..., cn such that the matrix diag(c1,c2,...,cn)A has eigenvalues λ1,λ2,..., λn.     

反中心对称矩阵的广义特征值反问题

Given matrix X and diagonal matrix A , the anti-centrosymmetric solutions (A, B) and its optimal approximation of inverse generalized eigenvalue problem AX = BXA have been considered. The general form of such solutions is given and the expression of the optimal approximation solution to a given matrix is derived. The algorithm and one numerical example for solving optimal approximation solution are included.     

单圈图的无符号狄利克雷谱半径

Let G be a simple connected graph with pendant vertex set ?V and nonpendant vertex set V_0. The signless Laplacian matrix of G is denoted by Q(G). The signless Dirichlet eigenvalue is a real number λ such that there exists a function f ≠ 0 on V(G) such that Q(G)f(u) = λf(u) for u ∈ V_0 and f(u) = 0 for u ∈ ?V. The signless Dirichlet spectral radiusλ(G) is the largest signless Dirichlet eigenvalue. In this paper, the unicyclic graphs with the largest signless Dirichlet spectral radius among all unicyclic graphs with a given degree sequence are characterized.     

Dependent sets of a family of relations of full measure on a probability space

For a probability space (X, B,μ) a subfamily F of theσ-algebra B is said to be a regular base if every B∈B can be arbitrarily approached by some member of F which contains B in the sense of the measure theory. Assume that {γr}γ∈Γis a countable family of relations of the full measure on a probability space (X,B,μ), i.e. for everyγ∈Γthere is a positive integer sγsuch that Rγ(?)Xsγwithμsγ(Rγ) = 1. In the present paper we show that if (X, B,μ) has a regular base, the cardinality of which is not greater than the cardinality of the continuum, then there exists a set K(?)X withμ*(K) = 1 such that (x1,...,xsγ)∈γr for anyγ∈Γand for any sγdistinct elements x1,..., xsγof K, whereμ* is the outer measure induced by the measureμ. Moreover, an application of the result mentioned above is given to the dynamical systems determined by the iterates of measure-preserving transformations.     

THE INVERSE EIGENPROBLEM WITH RANK-ONE UPDATING AND ITS STABLITY

Let ∑, Г be two n-by-n diagonal matrices with σi,γi as their diagonals. For the inverse eigenvalue problem: look for y∈Rn such that Г + yyT is similar to ∑, we prove thatu also the sufficient condition for the solvability of this inverse problem. Its solution (set) is given explicitly. In some case, the problem is unstable. But we prove that the sums of the square of some contigious components keep stable, i.e., small sum keeps small, large sum has a small relative perturbation, see Theorem 3.     

Solution to an Extremal Problem on Bigraphic Pairs with a Z_3-connected Realization

Let S =(a_1...,a_m;b_1,...,b_n),where a_1,...,a_m and b_1,...,b_n are two nonincreasing sequences of nonnegative integers. The pair S =(a_1,..., a_m; b_1,..., b_n) is said to be a bigraphic pair if there is a simple bipartite graph G =(X U Y, E) such that a_1...,a_m and b_1,...b_n are the degrees of the vertices in X and Y, respectively. Let Z3 be the cyclic group of order 3. Define a(Z_3,m,n) to be the minimum integer k such that every bigraphic pair S =(a_1,..., a_m; b_1,..., b_n) with a_m,b_n≥2 and σ(S) = a_1+…+a_m≥k has a Z_3-connected realization. For n =m, Yin [Discrete Math.,339, 2018-2026(2016)] recently determined the values of σ(Z_3,m,m) for m≥ 4. In this paper, we completely determine the values of a(Z_3,m,n) for m ≥n≥4.     

TO SOLVE MATRIX EQUATION sum (A~iXBi=c) BY THE SMITH NORMAL FORM

§ 1　IntroductionLet F be a field,F[λ] be the polynomial ring over F,Fm× n( or Fm× n[λ] ) be the setofall m×n matrices over F( or F[λ] ) .Let M(i) be the ith column of M∈Fm× m[λ] ,i=1 ,...,n.A g-inverse of M∈Fm× n will be denoted by M- and understood as a matrix for whichMM- M=M.In this paper,we discuss the linear matrix equation ki=0Ai XBi =C, ( 1 )where A∈Fm× m,Bi∈Fn× q,i=0 ,1 ,...,k,and C∈Fm× q.Equation( 1 ) is called universally solvable if ithas a solution f…     

对称正交对称矩阵反问题的最小二乘解

Let P ∈ Rn×n be a symmetric orthogonal matrix. A∈Rn×n is called a symmetric orthogonal symmetric matrix if AT = A and (PA) T = PA. The set of all n × n symmetric orthogonal symmetric matrices is denoted by SRnxnp. This paper discusses the following problems: Problem I. Given X,B∈ Rn×m, find A ∈SRn×np such that||AX - B|| = min Problem II. Given A∈ Rn×n, find A∈SL such thatwhere ||·|| is the Frobenius norm, and SL is the solution set of Problem I.The general form of SL is given. The solvability conditions for the inverseproblem AX = B in SRn×nP are obtained. The expression of the solution toProblem II is presented.     

HGAH矩阵的逆特征值问题

In this paper, the inverse eigenvalue problem of Hermitian generalized anti-Hamihonian matrices and relevant optimal approximate problem are considered. The necessary and sufficient conditions of the solvability for inverse eigenvalue problem and an expression of the general solution of the problem are derived. The solution of the relevant optimal approximate problem is given.     

A NOTE ON THE BACKWARD ERRORS FOR INVERSE EIGENVALUE PROBLEMS

In this note,we consider the backward errors for more general inverse eigenvalus prob-lems by extending Sun‘‘‘‘s approach.The optimal backward errors defined for diagonal-ization matrix inverse eigenvalue problem with respect to an approximate solution,and the upper and lower bounds are derived for the optimal backward errors.The results may be useful for testing the stability of practical algorithms.     

The solvability conditions for the inverse eigenvalue problems of reflexive matrices

This paper involves related inverse eigenvalue problems of reflexive matrices and their optimal approximation, the sufficient and necessary conditions under which the solvable problems of inverse eigenvalue, and the general provided form of the solution. Furthermore, the algorithm to compute the optimal approximate solution and some numerical experiments are given.     

Local and parallel finite element method for solving the biharmonic eigenvalue problem of plate vibration

In this paper, we establish a new local and parallel finite element discrete scheme based on the shifted‐inverse power method for solving the biharmonic eigenvalue problem of plate vibration. We prove the local error estimation of finite element solution for the biharmonic equation/eigenvalue problem and prove the error estimation of approximate solution obtained by the local and parallel scheme. When the diameters of three grids satisfy H⁴ = ?(w²) = ?(h), the approximate solutions obtained by our schemes can achieve the asymptotically optimal accuracy. The numerical experiments show that the computational schemes proposed in this paper are effective to solve the biharmonic eigenvalue problem of plate vibration.     

The constrained inverse eigenvalue problem and its approximation for normal matrices

In this paper, the constrained inverse eigenvalue problem and associated approximation problem for normal matrices are considered. The solvability conditions and general solutions of the constrained inverse eigenvalue problem are presented, and the expression of the solution for the optimal approximation problem is obtained.     

An inverse eigenvalue problem and an associated approximation problem for generalized K-centrohermitian matrices

A partially described inverse eigenvalue problem and an associated optimal approximation problem for generalized K-centrohermitian matrices are considered. It is shown under which conditions the inverse eigenproblem has a solution. An expression of its general solution is given. In case a solution of the inverse eigenproblem exists, the optimal approximation problem can be solved. The formula of its unique solution is given.     

谱约束下对称正交对称矩阵束的最佳逼近

讨论了对称正交对称矩阵的广义逆特征值问题，得到了通解表达式和最佳解的表达式。     

Backward errors for the inverse eigenvalue problem

Backward errors for the symmetric matrix inverse eigenvalue problem with respect to an approximate solution are defined, and explicit expressions of the backward errors are derived. The expressions may be useful for testing the stability of practical algorithms. Received August 4, 1997 / Revised version received May 11, 1998     

A backward error for the inverse singular value problem

A backward error for inverse singular value problems with respect to an approximate solution is defined, and an explicit expression for the backward error is derived by extending the approach described in [J.G. Sun, Backward errors for the inverse eigenvalue problem, Numer. Math. 82 (1999) 339-349]. The expression may be useful for testing the stability of practical algorithms.