共查询到20条相似文献,搜索用时 421 毫秒
1.
通过以λ为变量的多项式f(λ)定义了矩阵多项式f(A),并将矩阵多项式的计算方法推广到矩阵函数.同时给出了矩阵函数f(A)的又一种计算方法. 相似文献
2.
When is a monic polynomial the characteristic polynomial of a symmetric matrix over an integral domain D? Known necessary conditions are shown to be insufficient when D is the field of 2-adic numbers and when D is the rational integers. The latter counterexamples lead to totally real cubic extensions of the rationals whose difierents are not narrowly equivalent to squares. Furthermorex3-4x+1 is the characteristic polynomial of a rational symmetric matrix and is the characteristic polynomial of an integral symmetric p-adic matrix for every prime p, but is not the characteristic polynomial of a rational integral symmetric matrix. 相似文献
3.
V. M. Prokip 《Ukrainian Mathematical Journal》1990,42(9):1077-1082
A criterion is established for the one-sided equivalence of polynomial matrices; over an arbitrary field. If B(x) is a polynomial matrix of maximal rank, then a condition for the divisibility of a polynomial matrix A(x) by B(x) without a remainder, is indicated. For a square polynomial matrix, necessary and sufficient conditions for the one-sided equivalence of it to a unitary polynomial matrix are presented, and also a method is proposed for its construction.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 9, pp. 1213–1219, September, 1990. 相似文献
4.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2004,121(4):2519-2529
The notion of a complete polynomial of a multiparameter polynomial matrix, generalizing that of an invariant polynomial of a one-parameter polynomial matrix, is introduced. Methods for computing complete polynomials are suggested. Applications of these methods to various spectral problems for polynomial matrices are considered. Bibliography: 7 titles. 相似文献
5.
A Fibonacci–Hessenberg matrix with Fibonacci polynomial determinant is referred to as a polynomial Fibonacci–Hessenberg matrix. Several classes of polynomial Fibonacci–Hessenberg matrices are introduced. The notion of two-dimensional Fibonacci polynomial array is introduced and three classes of polynomial Fibonacci–Hessenberg matrices satisfying this property are given. 相似文献
6.
《Linear algebra and its applications》2006,412(2-3):412-440
The topic of the paper is spectral factorization of rectangular and possibly non-full-rank polynomial matrices. To each polynomial matrix we associate a matrix pencil by direct assignment of the coefficients. The associated matrix pencil has its finite generalized eigenvalues equal to the zeros of the polynomial matrix. The matrix dimensions of the pencil we obtain by solving an integer linear programming (ILP) minimization problem. Then by extracting a deflating subspace of the pencil we come to the required spectral factorization. We apply the algorithm to most general-case of inner–outer factorization, regardless continuous or discrete time case, and to finding the greatest common divisor of polynomial matrices. 相似文献
7.
线性时不变系统两种描述的等价性 总被引:1,自引:0,他引:1
自从Kalman提出了用状态空间方法描述系统后,Rosenbrock与Wolovich等又提出了用微分算子描述系统的方法。这两种描述方法,利用各自表示方法的特点,在多变量系统理论的研究上,都取得了很大的进展。 本文利用Yokoyama标准形与多项式矩阵之间的关系,把上述两种描述联系起来,给出了它们之间等价的转换形式。这样就可以把在一种描述方法上得到的结果,等价地搬到另一种描述方法的系统上去。 相似文献
8.
9.
This work is concerned with eigenvalue problems for structured matrix polynomials, including complex symmetric, Hermitian, even, odd, palindromic, and anti-palindromic matrix polynomials. Most numerical approaches to solving such eigenvalue problems proceed by linearizing the matrix polynomial into a matrix pencil of larger size. Recently, linearizations have been classified for which the pencil reflects the structure of the original polynomial. A question of practical importance is whether this process of linearization significantly increases the eigenvalue sensitivity with respect to structured perturbations. For all structures under consideration, we show that this cannot happen if the matrix polynomial is well scaled: there is always a structured linearization for which the structured eigenvalue condition number does not differ much. This implies, for example, that a structure-preserving algorithm applied to the linearization fully benefits from a potentially low structured eigenvalue condition number of the original matrix polynomial. 相似文献
10.
V. N. Kublanovskaya 《Journal of Mathematical Sciences》2006,132(2):214-223
The paper continues the investigation of methods for factorizing q-parameter polynomial matrices and considers their applications
to solving multiparameter problems of algebra. An extension of the AB-algorithm, suggested earlier as a method for solving
spectral problems for matrix pencils of the form A - λB, to the case of q-parameter (q ≥ 1) polynomial matrices of full rank
is proposed. In accordance with the AB-algorithm, a finite sequence of q-parameter polynomial matrices such that every subsequent
matrix provides a basis of the null-space of polynomial solutions of its transposed predecessor is constructed. A certain
rule for selecting specific basis matrices is described. Applications of the AB-algorithm to computing complete polynomials
of a q-parameter polynomial matrix and exhausting them from the regular spectrum of the matrix, to constructing irreducible
factorizations of rational matrices satisfying certain assumptions, and to computing “free” bases of the null-spaces of polynomial
solutions of an arbitrary q-parameter polynomial matrix are considered. Bibliography: 7 titles.
__________
Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 309, 2004, pp. 127–143. 相似文献
11.
借助相似变换将非亏损矩阵转为Hessenberg矩阵,通过获得确定Hessenberg矩阵特征多项式系数的方法,利用特征值与特征多项式系数间的关系,给出求非亏损矩阵特征值的一种数值算法。 相似文献
12.
13.
14.
A. Melman 《Linear and Multilinear Algebra》2013,61(2):183-195
We derive two ovals of Cassini, each containing all the zeros of a polynomial. The computational cost to obtain these ovals is similar to that of the Brauer set for the companion matrix of a polynomial, although they are frequently smaller. Their derivation is based on the Gershgorin set for an appropriate polynomial of the companion matrix. 相似文献
15.
Mario Faliva 《Linear and Multilinear Algebra》2013,61(5):541-556
A solution to the problem of a closed-form representation for the inverse of a matrix polynomial about a unit root is provided by resorting to a Laurent expansion in matrix notation, whose principal-part coefficients turn out to depend on the non-null derivatives of the adjoint and the determinant of the matrix polynomial at the root. Some basic relationships between principal-part structure and rank properties of algebraic function of the matrix polynomial at the unit root as well as informative closed-form expressions for the leading coefficient matrices of the matrix-polynomial inverse are established. 相似文献
16.
系统地论证了二次自伴矩阵多项式特征值,特征向量的性质.给出了二次自伴矩阵多项式特征值与任一非零向量所对应的二次多项式根之间的大小关系;精确地给出了二次自伴矩阵多项式是负定时参数的界;简化了二次自伴矩阵多项式的符号特征是正(负)的特征值对应特征向量间可以是线性无关等定理的证明. 相似文献
17.
《Mathematical and Computer Modelling》2002,35(9-10):1061-1076
This paper deals with initial value problems for Lipschitz continuous coefficient matrix Riccati equations. Using Chebyshev polynomial matrix approximations the coefficients of the Riccati equation are approximated by matrix polynomials in a constructive way. Then using the Fröbenius method developed in [1], given an admissible error ϵ > 0 and the previously guaranteed existence domain, a rational matrix polynomial approximation is constructed so that the error is less than ϵ in all the existence domain. The approach is also considered for the construction of matrix polynomial approximations of nonhomogeneous linear differential systems avoiding the integration of the transition matrix of the associated homogeneous problem. 相似文献
18.
V. M. Prokip 《Ukrainian Mathematical Journal》1993,45(6):884-889
Conditions are established under which the unital divisor extracted from a matrix polynomial over an arbitrary field is determined uniquely by its characteristic polynomial. The result obtained is applied to the problem of solving matrix polynomial equations.Translated from Ukrainskii Matematicheskii Zhumal, Vol. 45, No. 6, pp. 803–808, June, 1993. 相似文献
19.
The traditional polynomial expansion method is deemed to be not suitable for solving two- and three-dimensional problems. The system matrix is usually singular and highly ill-conditioned due to large powers of polynomial basis functions. And the inverse of the coefficient matrix is not guaranteed for the evaluation of derivatives of polynomial basis functions with respect to the differential operator of governing equations. To avoid these troublesome issues, this paper presents an improved polynomial expansion method for the simulation of plate bending vibration problems. At first, the particular solutions using polynomial basis functions are derived analytically. Then these polynomial particular solutions are employed as basis functions instead of the original polynomial basis functions in the method of particular solutions for the approximated solutions. To alleviate the conditioning of the resultant matrix, we employ the multiple-scale method. Numerical experiments compared with analytical solutions, solutions by the Kansa’s method, and reference solutions in references confirm the efficiency and accuracy of the proposed method in the solution of Winkler and thin plate bending problems including irregular shapes. 相似文献