Hessenberg matrix for sums of Hermitian positive definite matrices and weighted shifts

In this work, we introduce an algebraic operation between bounded Hessenberg matrices and we analyze some of its properties. We call this operation m-sum and we obtain an expression for it that involves the Cholesky factorization of the corresponding Hermitian positive definite matrices associated with the Hessenberg components.This work extends a method to obtain the Hessenberg matrix of the sum of measures from the Hessenberg matrices of the individual measures, introduced recently by the authors for subnormal matrices, to matrices which are not necessarily subnormal.Moreover, we give some examples and we obtain the explicit formula for the m-sum of a weighted shift. In particular, we construct an interesting example: a subnormal Hessenberg matrix obtained as the m-sum of two not subnormal Hessenberg matrices.     

Functions of a matrix and Krylov matrices

For a given nonderogatory matrix A, formulas are given for functions of A in terms of Krylov matrices of A. Relations between the coefficients of a polynomial of A and the generating vector of a Krylov matrix of A are provided. With the formulas, linear transformations between Krylov matrices and functions of A are introduced, and associated algebraic properties are derived. Hessenberg reduction forms are revisited equipped with appropriate inner products and related properties and matrix factorizations are given.     

The generalized relations among the code elements for Fibonacci coding theory

We have considered a class of square Fibonacci matrix of order (p + 1) whose elements are based on the Fibonacci p numbers with determinant equal to +1 or −1. There is a relation between Fibonacci numbers with initial terms which is known as cassini formula. Fibonacci series and the golden mean plays a very important role in the construction of a relatively new space–time theory, which is known as E-infinity theory. An original Fibonacci coding/decoding method follows from the Fibonacci matrices. There already exists a relation between the code matrix elements for the case p = 1 [Stakhov AP. Fibonacci matrices, a generalization of the cassini formula and a new coding theory. Chaos, Solitons and Fractals 2006;30:56–66.]. In this paper, we have established generalized relations among the code matrix elements for all values of p. For p = 2, the correct ability of the method is 99.80%. In general, correct ability of the method increases as p increases.     

Computing the Hessenberg matrix associated with a self-similar measure

We introduce in this paper a method to calculate the Hessenberg matrix of a sum of measures from the Hessenberg matrices of the component measures. Our method extends the spectral techniques used by G. Mantica to calculate the Jacobi matrix associated with a sum of measures from the Jacobi matrices of each of the measures.We apply this method to approximate the Hessenberg matrix associated with a self-similar measure and compare it with the result obtained by a former method for self-similar measures which uses a fixed point theorem for moment matrices. Results are given for a series of classical examples of self-similar measures.Finally, we also apply the method introduced in this paper to some examples of sums of (not self-similar) measures obtaining the exact value of the sections of the Hessenberg matrix.     

Fast Givens rotations for orthogonal similarity transformations

Summary Fast Givens rotations with half as many multiplications are proposed for orthogonal similarity transformations and a matrix notation is introduced to describe them more easily. Applications are proposed and numerical results are examined for the Jacobi method, the reduction to Hessenberg form and the QR-algorithm for Hessenberg matrices. It can be seen that in general fast Givens rotations are competitive with Householder reflexions and offer distinct advantages for sparse matrices.     

Properties of a matrix,inverse to a Hessenberg matrix

One describes the matrices which are inverses to nonsingular irreducible Hessenberg matrices.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Institute im. V. A. Steklova AN SSSR, Vol. 111, pp. 177–179, 1981.     

Interpolation algorithm of Leverrier–Faddev type for polynomial matrices

We investigated an interpolation algorithm for computing outer inverses of a given polynomial matrix, based on the Leverrier–Faddeev method. This algorithm is a continuation of the finite algorithm for computing generalized inverses of a given polynomial matrix, introduced in [11]. Also, a method for estimating the degrees of polynomial matrices arising from the Leverrier–Faddeev algorithm is given as the improvement of the interpolation algorithm. Based on similar idea, we introduced methods for computing rank and index of polynomial matrix. All algorithms are implemented in the symbolic programming language MATHEMATICA , and tested on several different classes of test examples.     

求非亏损矩阵特征值的一种数值计算方法

借助相似变换将非亏损矩阵转为Hessenberg矩阵,通过获得确定Hessenberg矩阵特征多项式系数的方法,利用特征值与特征多项式系数间的关系,给出求非亏损矩阵特征值的一种数值算法。     

A class of test Hessenberg matrices

We present a class of parametric Hessenberg matrices, intended for testing linear-algebraic procedures. Their eigenvalues and subdiagonal elements are arbitrarily prescribed, while the eigenvector and the inverse matrices are computed.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 111, pp. 89–92, 1981.     

Divisibility and one-sided equivalence of polynomial matrices

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.     

A quasiseparable approach to five-diagonal CMV and Fiedler matrices

Recent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as others. Hence working with the class of quasiseparable matrices provides new results which generalize and unify classical results.Previous work has focused on characterizing (H,1)-quasiseparable matrices, matrices with order-one quasiseparable structure that are also upper Hessenberg. In this paper, the authors introduce the concept of a twist transformation, and use such transformations to explain the relationship between (H,1)-quasiseparable matrices and the subclass of (1,1)-quasiseparable matrices (without the upper Hessenberg restriction) which are related to the same systems of polynomials. These results generalize the discoveries of Cantero, Fiedler, Kimura, Moral and Velázquez of five-diagonal matrices related to Horner and Szegö polynomials in the context of quasiseparable matrices.     

Polynomials with respect to a general basis. I. Theory

As n × n Hessenberg matrix A is defined whose characteristic polynomial is relative to an arbitrary basis. This generalizes the companion, colleague, and comrade matrices when the bases are, respectively, power, Chebyshev, and orthogonal, so the term “confederate” matrix is suggested. Some properties of A are derived, including an algorithm for computing powers of A. A scheme is given for inverting the transformation matrix between the arbitrary and power bases. A Vandermonde-type matrix associated with A and a block confederate matrix are defined.     

A generalization of Fibonacci and Lucas matrices

We define the matrix of type s, whose elements are defined by the general second-order non-degenerated sequence and introduce the notion of the generalized Fibonacci matrix , whose nonzero elements are generalized Fibonacci numbers. We observe two regular cases of these matrices (s=0 and s=1). Generalized Fibonacci matrices in certain cases give the usual Fibonacci matrix and the Lucas matrix. Inverse of the matrix is derived. In partial case we get the inverse of the generalized Fibonacci matrix and later known results from [Gwang-Yeon Lee, Jin-Soo Kim, Sang-Gu Lee, Factorizations and eigenvalues of Fibonaci and symmetric Fibonaci matrices, Fibonacci Quart. 40 (2002) 203–211; P. Staˇnicaˇ, Cholesky factorizations of matrices associated with r-order recurrent sequences, Electron. J. Combin. Number Theory 5 (2) (2005) #A16] and [Z. Zhang, Y. Zhang, The Lucas matrix and some combinatorial identities, Indian J. Pure Appl. Math. (in press)]. Correlations between the matrices , and the generalized Pascal matrices are considered. In the case a=0,b=1 we get known result for Fibonacci matrices [Gwang-Yeon Lee, Jin-Soo Kim, Seong-Hoon Cho, Some combinatorial identities via Fibonacci numbers, Discrete Appl. Math. 130 (2003) 527–534]. Analogous result for Lucas matrices, originated in [Z. Zhang, Y. Zhang, The Lucas matrix and some combinatorial identities, Indian J. Pure Appl. Math. (in press)], can be derived in the partial case a=2,b=1. Some combinatorial identities involving generalized Fibonacci numbers are derived.     

REPRINT OF: A quasiseparable approach to five-diagonal CMV and Fiedler matrices

Recent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as others. Hence working with the class of quasiseparable matrices provides new results which generalize and unify classical results.Previous work has focused on characterizing (H,1)-quasiseparable matrices, matrices with order-one quasiseparable structure that are also upper Hessenberg. In this paper, the authors introduce the concept of a twist transformation, and use such transformations to explain the relationship between (H,1)-quasiseparable matrices and the subclass of (1,1)-quasiseparable matrices (without the upper Hessenberg restriction) which are related to the same systems of polynomials. These results generalize the discoveries of Cantero, Fiedler, Kimura, Moral and Velázquez of five-diagonal matrices related to Horner and Szegö polynomials in the context of quasiseparable matrices.     

Schubert polynomials and classes of Hessenberg varieties

Regular semisimple Hessenberg varieties are a family of subvarieties of the flag variety that arise in number theory, numerical analysis, representation theory, algebraic geometry, and combinatorics. We give a “Giambelli formula” expressing the classes of regular semisimple Hessenberg varieties in terms of Chern classes. In fact, we show that the cohomology class of each regular semisimple Hessenberg variety is the specialization of a certain double Schubert polynomial, giving a natural geometric interpretation to such specializations. We also decompose such classes in terms of the Schubert basis for the cohomology ring of the flag variety. The coefficients obtained are nonnegative, and we give closed combinatorial formulas for the coefficients in many cases. We introduce a closely related family of schemes called regular nilpotent Hessenberg schemes, and use our results to determine when such schemes are reduced.     

求鳞状循环因子矩阵的极小多项式的算法

提出了任意域上鳞状循环因子矩阵 ,利用多项式环的理想的Go bner基的算法给出了任意域上鳞状循环因子矩阵的极小多项式和公共极小多项式的一种算法 .同时给出了这类矩阵逆矩阵的一种求法 .在有理数域或模素数剩余类域上 ,这一算法可由代数系统软件Co CoA4 .0实现 .数值例子说明了算法的有效性     

Semiscalar equivalence and the smith normal form of polynomial matrices

We give conditions under which a set of polynomial matrices over a finite field can be simultaneously reduced by means of semiscalar equivalent transformations to a special triangular form with invariant factors on the principal diagonals. We investigate multiplicative properties of the Smith normal form of polynomial matrices and in particular we identify a class of polynomial matrices for which the Smith normal form of the product matrix is equal to the product of the Smith normal forms of the factor matrices.Translated from Matematicheskie Metody i Fiziko-mekhanicheskie Polya, No. 26, pp. 13–16, 1987.     

On the Order of Convergence of a Determinantal Family of Root-Finding Methods

Recently, we have shown that for each natural number m greater than one, and each natural number k less than or equal to m, there exists a root-finding iteration function, defined as the ratio of two determinants that depend on the first m - k derivatives of the given function. For each k the corresponding matrices are upper Hessenberg matrices. Additionally, for k = 1 these matrices are Toeplitz matrices. The goal of this paper is to analyze the order of convergence of this fundamental family. Newton's method, Halley's method, and their multi-point versions are members of this family. In this paper we also derive these special cases. We prove that for fixed m, as k increases, the order of convergence decreases from m to the positive root of the characteristic polynomial of generalized Fibonacci numbers of order m. For fixed k, the order of convergence increases in m. The asymptotic error constant is also derived in terms of special determinants.     

An identity between the determinant and the permanent of Hessenberg-type matrices

In this short note we provide an extension of the notion of Hessenberg matrix and observe an identity between the determinant and the permanent of such matrices. The celebrated identity due to Gibson involving Hessenberg matrices is consequently generalized.