An efficient method for construction of J-unitary matrix polynomials is proposed, associated with companion functions the last row which a polynomial in 1/t. The relies on Wiener-Hopf factorization theory and stems from recently developed J-spectral algorithm certain Hermitian functions.

We study the chromatic polynomials (= zero-temperature antiferromagnetic Potts-model partition functions) PG(q) for m × n rectangular subsets of the square lattice, with m ≤ 8 (free or periodic transverse boundary conditions) and n arbitrary (free longitudinal boundary conditions), using a transfer matrix in the Fortuin-Kasteleyn representation. In particular, we extract the limiting curves of ...

A matrix has an ordinary inverse only if it is square, and even then only if it is nonsingular or, inother words, if its columns (or rows) are linearly independent. In recent years needs have been felt innumerous areas of applied mathematics for some kind of partial inverse of a matrix that is singularor even rectangular. In this paper, some results on the Quasi-commuting inverses, are given an...

alternative legendre polynomials (alps) are used to approximate the solution of a class of nonlinear volterra-hammerstein integral equations. for this purpose, the operational matrices of integration and the product for alps are derived. then, using the collocation method, the considered problem is reduced into a set of nonlinear algebraic equations. the error analysis of the method is given an...

In this paper we derive a fast O(n) algorithm for solving linear systems where the coefficient matrix is a polynomial-Vandermonde matrix VR(x) = [rj−1(xi)] with polynomials {rk(x)} related to a Hessenberg quasiseparable matrix. The result generalizes the well-known Björck-Pereyra algorithm for classical Vandermonde systems involving monomials. It also generalizes the algorithms of [RO91] for VR...

We show that any regular quadratic matrix polynomial can be reduced to an upper triangular quadratic matrix polynomial over the complex numbers preserving the finite and infinite elementary divisors. We characterize the real quadratic matrix polynomials that are triangularizable over the real numbers and show that those that are not triangularizable are quasi-triangularizable with diagonal bloc...

In this paper we prove that a vertex-centered automorphism of a tree gives a proper factor of the characteristic polynomial of its distance or adjacency matrix. We also show that the characteristic polynomial of the distance matrix of any graph always has a factor of degree equal to the number of vertex orbits of the graph. These results are applied to full k-ary trees and some other problems. ...

In this paper, we introduce a family of fractional-order Chebyshev functions based on the classical Chebyshev polynomials. We calculate and derive the operational matrix of derivative of fractional order $gamma$ in the Caputo sense using the fractional-order Chebyshev functions. This matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...

In this paper, a method based on Chebyshev polynomials is developed for examination of geometrically nonlinear behaviour of thin rectangular composite laminated plates under end-shortening strain. Different boundary conditions and lay-up configurations are investigated and classical laminated plate theory is used for developing the equilibrium equations. The equilibrium equations are solved dir...