Chebyshev Polynomials and Generalized Complex Numbers

The generalized complex numbers can be realized in terms of 2 × 2 or higher-order matrices and can be exploited to get different ways of looking at the trigonometric functions. Since Chebyshev polynomials are linked to the power of matrices and to trigonometric functions, we take the quite natural step to discuss them in the context of the theory of generalized complex numbers.We also briefly discuss the two-variable Chebyshev polynomials and their link with the third-order Hermite polynomials.     

A characterization of minimal left or right ideals of matrix algebras

The algebra of m×m matrices over real numbers, complex numbers or quaternions is equipped with the standard inner product Re tr(xy ^*) Work done in part during the Summer Research Institute of the Canadian Mathematical Congress, 1971.). It is easy to see that the left ideals of this algebra have the property that the projections of unitary matrices on them have constant length. of course, the right ideals have the same property. This property and a condition on dimension give a characterization of minimal left or right ideals of this algebra. We use this characterization to determine all orthogonal transformations of this algebra which preserve unitary matrices.     

The algebraic degree of semidefinite programming

Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically, this degree counts the critical points attained by a linear functional on a fixed rank locus in a linear space of symmetric matrices. We determine this degree using methods from complex algebraic geometry, such as projective duality, determinantal varieties, and their Chern classes.     

Hurwitz numbers and products of random matrices

We study multimatrix models, which may be viewed as integrals of products of tau functions depending on the eigenvalues of products of random matrices. We consider tau functions of the two-component Kadomtsev–Petviashvili (KP) hierarchy (semi-infinite relativistic Toda lattice) and of the B-type KP (BKP) hierarchy introduced by Kac and van de Leur. Such integrals are sometimes tau functions themselves. We consider models that generate Hurwitz numbers H^E,F, where E is the Euler characteristic of the base surface and F is the number of branch points. We show that in the case where the integrands contain the product of n > 2 matrices, the integral generates Hurwitz numbers with E ≤ 2 and F ≤ n+2. Both the numbers E and F depend both on n and on the order of the factors in the matrix product. The Euler characteristic E can be either an even or an odd number, i.e., it can match both orientable and nonorientable (Klein) base surfaces depending on the presence of the tau function of the BKP hierarchy in the integrand. We study two cases, the products of complex and the products of unitary matrices.     

Matrix paraphrases

A matrix paraphrase of a certain body of facts dealing with real or complex numbers is a translation of these facts into matrix algebra in which the numbers are replaced by matrices. In two recent papers we developed matrix paraphrases of the Gaussian periods and the Klooster-mann sums. In this paper we paraphrase the theory of finite Fourier series and apply these results to Kloostermann matrices.     

Antiderivations on the exterior algebras

A matrix paraphrase of a certain body of facts dealing with real or complex numbers is a translation of these facts into matrix algebra in which the numbers are replaced by matrices. In two recent papers we developed matrix paraphrases of the Gaussian periods and the Klooster-mann sums. In this paper we paraphrase the theory of finite Fourier series and apply these results to Kloostermann matrices.     

On the similarity of matrices of even order

We study invariants of simultaneous similarity of a pair of matrices of even order 2k over the field of complex numbers for the case in which all elementary divisors of the corresponding characteristic polynomial matrix are identical and their number is k.     

Kapranov rank vs. tropical rank

We show that determining Kapranov rank of tropical matrices is not only NP-hard over any infinite field, but if solving Diophantine equations over the rational numbers is undecidable, then determining Kapranov rank over the rational numbers is also undecidable. We prove that Kapranov rank of tropical matrices is not bounded in terms of tropical rank, answering a question of Develin, Santos, and Sturmfels.

     

Canonical forms for normal matrices that commute with their complex conjugate

We consider the class of normal complex matrices that commute with their complex conjugate. We show that such matrices are real orthogonally similar to a canonical direct sum of 1-by-1 and certain 2-by-2 matrices. A canonical form for quasi-real normal matrices is obtained as a special case. We also exhibit a special form of the spectral theorem for normal matrices that commute with their conjugate.     

Quantum Hilbert matrices and orthogonal polynomials

Using the notion of quantum integers associated with a complex number q≠0, we define the quantum Hilbert matrix and various extensions. They are Hankel matrices corresponding to certain little q-Jacobi polynomials when |q|<1, and for the special value they are closely related to Hankel matrices of reciprocal Fibonacci numbers called Filbert matrices. We find a formula for the entries of the inverse quantum Hilbert matrix.     

Similarity transformations of decomposable matrix polynomials and related questions

A relationship is found between the similarity transformations of decomposable matrix polynomials with relatively prime elementary divisors and the equivalence transformations of the corresponding matrices with scalar entries. Matrices with scalar entries are classified with respect to equivalence transformations based on direct sums of lower triangular almost Toeplitz matrices. This solves the similarity problem for a special class of finite matrix sets over the field of complex numbers. Eventually, this problem reduces to the one of special diagonal equivalence between matrices. Invariants of this equivalence are found.     

Gauss-Manin connections for arrangements, III Formal connections

We study the Gauss-Manin connection for the moduli space of an arrangement of complex hyperplanes in the cohomology of a complex rank one local system. We define formal Gauss-Manin connection matrices in the Aomoto complex and prove that, for all arrangements and all local systems, these formal connection matrices specialize to Gauss-Manin connection matrices.

     

Pattern Avoidance in Alternating Sign Matrices

We generalize the definition of a pattern from permutations to alternating sign matrices. The number of alternating sign matrices avoiding 132 is proved to be counted by the large Schr?der numbers, 1, 2, 6, 22, 90, 394, .... We give a bijection between 132-avoiding alternating sign matrices and Schr?der paths, which gives a refined enumeration. We also show that the 132-, 123-avoiding alternating sign matrices are counted by every second Fibonacci number. Received January 2, 2007     

Construction of Matrices with Prescribed Singular Values and Eigenvalues

Two issues concerning the construction of square matrices with prescribe singular values an eigenvalues are addressed. First, a necessary and sufficient condition for the existence of an n × n complex matrix with n given nonnegative numbers as singular values an m ( n) given complex numbers to be m of the eigenvalues is determined. This extends the classical result of Weyl and Horn treating the case when m = n. Second, an algorithm is given to generate a triangular matrix with prescribe singular values an eigenvalues. Unlike earlier algorithms, the eigenvalues can be arranged in any prescribe order on the diagonal. A slight modification of this algorithm allows one to construct a real matrix with specified real an complex conjugate eigenvalues an specified singular values. The construction is done by multiplication by diagonal unitary matrices, permutation matrices and rotation matrices. It is numerically stable and may be useful in developing test software for numerical linear algebra packages.     

Data Perturbations of Matrices of Pairwise Comparisons

This paper deals with data perturbations of pairwise comparison matrices (PCM). Transitive and symmetrically reciprocal (SR) matrices are defined. Characteristic polynomials and spectral properties of certain SR perturbations of transitive matrices are presented. The principal eigenvector components of some of these PCMs are given in explicit form. Results are applied to PCMs occurring in various fields of interest, such as in the analytic hierarchy process (AHP) to the paired comparison matrix entries of which are positive numbers, in the dynamic input–output analysis to the matrix of economic growth elements of which might become both positive and negative and in vehicle system dynamics to the input spectral density matrix whose entries are complex numbers.     

抛物问题的拉格朗日乘子区域分解法

１．引言 近年来,一类新的非重叠区域分解方法一非匹配网格区域分解法,日益引起人们的广泛兴趣,并已成为当今区域分解方法研究的热门课题。这类区域分解方法的特点是：相邻子区域在公共边（或面）上的结点可以不重合,从而能解决许多传统区域分解方法不便解决的问题（如变动网格问题）．目前主要有两类方法来处理这种区域分解的强非协调性：Ｍｏｒｔａｒ无法（见［１－２］和［９－１０］）和拉格朗日乘子法（见［５］,［８］,［１１］和［１２］）．拉格朗日乘子法比Ｍｏｒｔａｒ无法有明显的优点：（１）界面变量（即拉格朗日乘子）…     

抛物问题的拉格朗日乘子区域分解法

In this paper we consider domain decomposition methods with Lagrangian multipliers, which are applied to solving parabolic problems. We shall estimate condition numbers of the resulting interface matrices, and construct two kinds of simple preconditioners for the corresponding interface equations. It will be shown that the condition numbers of the resulting preconditioned interface matrices are almost optimal.     

The modern origin of matrices and their applications

This paper deals with the modern development of matrices, linear transformations, quadratic forms and their applications to geometry and mechanics, eigenvalues, eigenvectors and characteristic equations with applications. Included are the representations of real and complex numbers, and quaternions by matrices, and isomorphism in order to show that matrices form a ring in abstract algebra. Some special matrices, including Hilbert’s matrix, Toeplitz’s matrix, Pauli’s and Dirac’s matrices in quantum mechanics, and Einstein’s Pythagorean formula are discussed to illustrate diverse applications of matrix algebra. Included also is a modern piece of information that puts mathematics, science and mathematics education professionals at the forefront of advanced study and research on linear algebra and its applications.     

On the Properties of Accretive-Dissipative Matrices

Let A be a complex n × n matrix, and let A = B + iC, B = B*, C = C* be its Toeplitz decomposition. Then A is said to be (strictly) accretive if B > 0 and (strictly) dissipative if C > 0. We study the properties of matrices that satisfy both these conditions, in other words, of accretive-dissipative matrices. In many respects, these matrices behave as numbers in the first quadrant of the complex plane. Some other properties are natural extensions of the corresponding properties of Hermitian positive-definite matrices.__________Translated from Matematicheskie Zametki, vol. 77, no. 6, 2005, pp. 832–843.Original Russian Text Copyright ©2005 by A. George, Kh. D. Ikramov.