实对称五对角矩阵的两类广义特征值反问题

讨论了如下两类广义特征值反问题:(i)由给定的三个互异的特征对和给定的实对称正定五对角矩阵构造一个实对称五对角矩阵;(ii)由给定的三个互异特征对和给定的全对称正定五对角矩阵构造一个全对称五对角矩阵.利用线性方程组理论、对称向量和反对称向量的性质,分别得到了两类反问题存在唯一解的充要条件,并给出了解的表达式和数值算法;最后通过数值例子说明了算法的有效性.     

一种矩阵特征反问题

本文讨论了对称三对角矩阵的性质,提出了一类由特征值、特征向量来构造对称三对角矩阵的特征反问题,并给出了该反问题可解的一个充分条件及算法,还分析了数值结果。     

实对称五对角矩阵Procrustes问题

本文研究了实对称五对角矩阵Procrustes.利用矩阵的奇异值分解简化问题,得到了实对称五对角矩阵X极小化,最后给出数值算例说明方法的有效性.     

实对称区间矩阵特征值确界的交错定理及其应用

本文将实对称矩阵特征值的交错定理推广到实对称区间矩阵,给出了实对称区间矩阵特征值确界的交错定理,并应用该定理构造了估计实对称三对角区间矩阵特征值界的算法.文中数值例子表明,本文所给算法与一些现有算法相比在使用范围、计算精度和计算量等方面都具有一定的优越性.     

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

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

由三个特殊次序向量对构造三对角对称矩阵

讨论利用给定的三个特殊次序向量对构造不可约三对角矩阵、Jacobi矩阵和负Jacobi矩阵的反问题.在求解方法中,将已知的一些关系式等价地转化为线性方程组,利用线性方程组有解的条件,得到了所研究问题有惟一解的充要条件,并给出了数值算法和例子.     

实对称五对角矩阵逆特征值问题

1 引 言 对于n阶实对称矩阵A=(aij),r是一个正整数,且1≤r≤n-1,当|i-j|>r时,aij=0(i,j=1,2,…,n),至少有一个i使得ai,i+r≠0,则称矩阵A是带宽为2r+1的实对称带状矩阵.特别地,当r=1时,称A为实对称三对角矩阵;当r=2时,称A为实对称五对角矩阵. 实对称带状矩阵逆特征值问题应用十分广泛,这类问题不仅来自微分方程逆特征值问     

一类三对角矩阵的特征值和特征向量的研究

讨论了一种三对角矩阵的特征值和特征向量.按矩阵右下角对角元素的参数分为两类,得出特征值和特征向量的结论或数值算法.举例说明了算法的有效性.     

带比例关系的实带状矩阵特征值反问题

研究了通过矩阵A的顺序主子矩阵A_((k))=(aij)_(i,j=1)^(n-k+1)的特征值{λ_i(n-k+1)的特征值{λ_i^((k)))}_(i=1)((k)))}_(i=1)^(n-k+1)k=1,2,…,r+1来构造一个带比例关系的实带状矩阵的特征值反问题.对当特征值{λ_i(n-k+1)k=1,2,…,r+1来构造一个带比例关系的实带状矩阵的特征值反问题.对当特征值{λ_i^((k))}_(i=1)((k))}_(i=1)^(n-k+1)中有多重特征值出现时,应当如何来构造这类矩阵进行了讨论,并给出了问题的具体算法及数值例子.     

关于Jacobi矩阵的特征值反问题可解的充分必要条件的一个注记 (英)

本文讨论一类具有特殊结构的Jacobi矩阵的特征值反问题,该问题由描述变截面杆的微分方程离散化得到．我们得到了这个问题有解的一些必要条件,并且通过一些数值例子,说明了L．Lu和K．Michael给出的充分条件和算法在矩阵的阶数高于3的时候是错误的。     

由主子阵和特殊次序缺损特征对构造Jacobi矩阵

In this paper,an inverse eigenvalue problem of constructing a Jacobian matrix from its prescribed specially ordered defective eigenpairs and a principal subma-trix is considered.The necessary and sufficient conditions for the existence and uniqueness of the solution are derived.Two numerical algorithms and two numer-ical examples are given.     

A Jacobi matrix inverse eigenvalue problem with mixed data

In this paper, the inverse eigenvalue problem of reconstructing a Jacobi matrix from part of its eigenvalues and its leading principal submatrix is considered. The necessary and sufficient conditions for the existence and uniqueness of the solution are derived. Furthermore, a numerical algorithm and some numerical examples are given.     

一类广义特征值反问题

本文提出了一个实对称带状矩阵的广义特征值反问题,并且证明了对于Jacobi矩阵和一般对称矩阵,问题的存在性.     

一类对称正交反对称矩阵反问题的最佳逼近

讨论了一类对称正交反对称反问题的最佳逼近.利用对称正交反对称矩阵的特殊性质,给出了矩阵方程AX=B有对称正交反对称解的充要条件以及解的一般表达式;证明最佳逼近解的存在惟一性并给出其表达式;最后给出计算任意矩阵的最佳逼近解的数值方法及算例.     

On solution uniqueness of elliptic boundary value problems

In this paper, we consider the problem of solution uniqueness for the second order elliptic boundary value problem, by looking at its finite element or finite difference approximations. We derive several equivalent conditions, which are simpler and easier than the boundedness of the entries of the inverse matrix given in Yamamoto et al., [T. Yamamoto, S. Oishi, Q. Fang, Discretization principles for linear two-point boundary value problems, II, Numer. Funct. Anal. Optim. 29 (2008) 213–224]. The numerical experiments are provided to support the analysis made. Strictly speaking, the uniqueness of solution is equivalent to the existence of nonzero eigenvalues in the corresponding eigenvalue problem, and this condition should be checked by solving the corresponding eigenvalue problems. An application of the equivalent conditions is that we may discover the uniqueness simultaneously, while seeking the approximate solutions of elliptic boundary equations.     

Solution of a regularized problem for a stationary magnetic field in a nonhomogeneous conducting medium by a finite element method

The use of a vector finite element method for solving a regularized stationary magnetic field problem, which is formulated in terms of a vector magnetic potential, is validated. A generalized solutionis approximated using first-order Nedelec vector elements of the second kind on tetrahedrons. The existence and uniqueness of the solution to a discrete regularized problem and its convergence to the generalized solution for the case of an inhomogeneous (in the electromagnetic properties) domain are justified. Some issues of the numerical solution to the discrete regularized problem are discussed. Approaches to optimize the algorithms are shown on a series of numerical experiments.     

振动杆有限差分模型的一类特征值反问题

1引言杆是重要的工程构件之一,具有分布质量的杆的纵向振动由下面的偏微分方程描述:     

Computing a Nearest P-Symmetric Nonnegative Definite Matrix Under Linear Restriction

Let $P$ be an $n\times n$ symmetric orthogonal matrix. A real $n\times n$ matrix $A$ is called P-symmetric nonnegative definite if $A$ is symmetric nonnegative definite and $(PA)^T=PA$. This paper is concerned with a kind of inverse problem for P-symmetric nonnegative definite matrices: Given a real $n\times n$ matrix $\widetilde{A}$, real $n\times m$ matrices $X$ and $B$, find an $n\times n$ P-symmetric nonnegative definite matrix $A$ minimizing $||A-\widetilde{A}||_F$ subject to $AX =B$. Necessary and sufficient conditions are presented for the solvability of the problem. The expression of the solution to the problem is given. These results are applied to solve an inverse eigenvalue problem for P-symmetric nonnegative definite matrices.