A block bidiangonal form for block companion matrices

The problem of the linear factorization of a polynomial matrix is related with a similarity condition linking the block companion matrix and a block upper bidiagonal matrix constructed from a chain of solvents. This result is the applied to the solution of differential and difference linear matrix equations.     

Three-way companion matrices of three-variable polynomials

The existence of the companion matrices of three-variable polynomials is investigated. A theorem giving necessary and sufficient conditions for the existence of a three-way companion matrix is stated and proved. The construction of such a matrix is given too. The problem of the factorization of three-variable polynomials is also solved.     

Riemann‐Hilbert problem and matrix discrete Painlevé II systems

Matrix Szeg? biorthogonal polynomials for quasi‐definite matrices of Hölder continuous weights are studied. A Riemann‐Hilbert problem is uniquely solved in terms of the matrix Szeg? polynomials and its Cauchy transforms. The Riemann‐Hilbert problem is given as an appropriate framework for the discussion of the Szeg? matrix and the associated Szeg? recursion relations for the matrix orthogonal polynomials and its Cauchy transforms. Pearson‐type differential systems characterizing the matrix of weights are studied. These are linear systems of ordinary differential equations that are required to have trivial monodromy. Linear ordinary differential equations for the matrix Szeg? polynomials and its Cauchy transforms are derived. It is shown how these Pearson systems lead to nonlinear difference equations for the Verblunsky matrices and two examples, of Fuchsian and non‐Fuchsian type, are considered. For both cases, a new matrix version of the discrete Painlevé II equation for the Verblunsky matrices is found. Reductions of these matrix discrete Painlevé II systems presenting locality are discussed.     

Error analysis of signal zeros from a related companion matrix eigenvalue problem

An error analysis of the so-called signal zeros of polynomials linked to exponentially damped signals is performed and error bounds are derived. The analysis uses the link between polynomials and companion matrices and allows us to show that the related companion matrix eigenvalue problem is governed by the condition number of a rectangular Vandermonde matrix which has the zeros of interest as nodes. Conditions under which the zeros are well conditioned are discussed.     

A noncommutative spectral theorem for operator entried companion matrices

The scalar entries of the classical companion matrix are replaced by certain operator polynomials defined on an infinite dimensional Hilbert space and the spectrum of the resulting operator entried matrix is determined.     

Fiedler companion linearizations for rectangular matrix polynomials

The development of new classes of linearizations of square matrix polynomials that generalize the classical first and second Frobenius companion forms has attracted much attention in the last decade. Research in this area has two main goals: finding linearizations that retain whatever structure the original polynomial might possess, and improving properties that are essential for accurate numerical computation, such as eigenvalue condition numbers and backward errors. However, all recent progress on linearizations has been restricted to square matrix polynomials. Since rectangular polynomials arise in many applications, it is natural to investigate if the new classes of linearizations can be extended to rectangular polynomials. In this paper, the family of Fiedler linearizations is extended from square to rectangular matrix polynomials, and it is shown that minimal indices and bases of polynomials can be recovered from those of any linearization in this class via the same simple procedures developed previously for square polynomials. Fiedler linearizations are one of the most important classes of linearizations introduced in recent years, but their generalization to rectangular polynomials is nontrivial, and requires a completely different approach to the one used in the square case. To the best of our knowledge, this is the first class of new linearizations that has been generalized to rectangular polynomials.     

Use of an orthoexponential transformation in the study of the non-stationary equations of thermoelasticity and thermoviscoelasticity

A system of orthoexponential polynomials (OEP) orthogonal in the interval t ε [0, ∞) representing a special case of the orthoexponential Jacobi polynomials /1/ is studied. It is proposed to use the OEP as the kernels of an integral transformation (the OEP transformation) in time, since, compared with Laplace transformations, its use simplifies the procedure for obtaining the originals of the quantities required. The OEP transformation is used to solve the non-stationary equations of thermoelasticity and thermoviscoelasticity. The initial equations are reduced to the corresponding systems of ordinary triangular differential equations, and their general solutions are constructed.     

Algebraic multilevel iteration method for Stieltjes matrices

The numerical solution of elliptic selfadjoint second-order boundary value problems leads to a class of linear systems of equations with symmetric, positive definite, large and sparse matrices which can be solved iteratively using a preconditioned version of some algorithm. Such differential equations originate from various applications such as heat conducting and electromagnetics. Systems of equations of similar type can also arise in the finite element analysis of structures. We discuss a recursive method constructing preconditioners to a symmetric, positive definite matrix. An algebraic multilevel technique based on partitioning of the matrix in two by two matrix block form, approximating some of these by other matrices with more simple sparsity structure and using the corresponding Schur complement as a matrix on the lower level, is considered. The quality of the preconditioners is improved by special matrix polynomials which recursively connect the preconditioners on every two adjoining levels. Upper and lower bounds for the degree of the polynomials are derived as conditions for a computational complexity of optimal order for each level and for an optimal rate of convergence, respectively. The method is an extended and more accurate algebraic formulation of a method for nine-point and mixed five- and nine-point difference matrices, presented in some previous papers.     

Asymptotic behaviour of the solutions of a nonautonomous linear delay difference system

It is proved under appropriate assumptions that the solutions of a linear system of nonautonomous delay difference equations have finite limit at infinity. The results are based on a transformation of the delay difference system into a first-step recursion, where the companion matrices are well treatable from our point of view. Our theory is illustrated by examples, including a class of linear delay difference equations with unbounded coefficients.     

Decomposability of matrix polynomials with commuting coefficients into a product of linear factors

The list of known sets of factorizable matrix polynomials is supplemented by new sets of polynomials of this sort. The known set of nonfactorizable matrix polynomials is extended. These results can be applied to the study of polynomial equations and systems of differential equations with constant coefficients.     

An analysis of the Eddy current problem by the least-squares finite element in 2-D

This report discusses an analysis of least-squares finite element for a steady electromagnetic field in 2-D. The Maxwell equations for the magnetic field strength H are written into a first-order linear system of PDE. The analysis shows that the regular finite element spaces with piecewise linear polynomials can be chosen to represent the H and the conducted electric density J. The error of the numerical results in H-1 norm should be bounded by Ch.     

Pseudozeros of polynomials and pseudospectra of companion matrices

Summary. It is well known that the zeros of a polynomial are equal to the eigenvalues of the associated companion matrix . In this paper we take a geometric view of the conditioning of these two problems and of the stability of algorithms for polynomial zerofinding. The is the set of zeros of all polynomials obtained by coefficientwise perturbations of of size ; this is a subset of the complex plane considered earlier by Mosier, and is bounded by a certain generalized lemniscate. The is another subset of defined as the set of eigenvalues of matrices with ; it is bounded by a level curve of the resolvent of $A$. We find that if $A$ is first balanced in the usual EISPACK sense, then and are usually quite close to one another. It follows that the Matlab ROOTS algorithm of balancing the companion matrix, then computing its eigenvalues, is a stable algorithm for polynomial zerofinding. Experimental comparisons with the Jenkins-Traub (IMSL) and Madsen-Reid (Harwell) Fortran codes confirm that these three algorithms have roughly similar stability properties. Received June 15, 1993     

Outputs and time lags for linear bioreactors

Linear systems of convection reaction-diffusion equations for bioreactors are shown to have a structure which allows a geometric factorization of steady state problems giving a significant reduction in their dimensionality. Moreover, convection dominated linear systems with quasisymmetric reaction terms may be further simplified by matrix transformations, which uncouple the differential equations. The boundary conditions are also uncoupled when the diagonal diffusivity matrix D governing diffusion in the bioparticle is a scalar multiple of the corresponding matrix H describing the diffusivity characteristic of the fluid boundary layers around the bioparticles. The dominant transient behaviour of the systems may be handled by establishing an analogous system of time independent equations for mean action time variables and higher moments. These equations have the same amenable structure. Outputs, time lags and various mean residence and first passage times, associated with establishing steady outputs from a concentration free initial state, can be expressed in terms of the steady state solutions and mean action time variables.     

A framework for polynomial preconditioners based on fast transforms II: PDE applications

The solution of systems of equations arising from systems of time-dependent partial differential equations (PDEs) is considered. Primarily, first-order PDEs are studied, but second-order derivatives are also accounted for. The discretization is performed using a general finite difference stencil in space and an implicit method in time. The systems of equations are solved by a preconditioned Krylov subspace method. The preconditioners exploit optimal and superoptimal approximations by low-degree polynomials in a normal basis matrix, associated with a fast trigonometric transform. Numerical experiments for high-order accurate discretizations are presented. The results show that preconditioners based on fast transforms yield efficient solution algorithms, even for large quotients between the time and space steps. Utilizing a spatial grid ratio less than one, the arithmetic work per grid point is bounded by a constant as the number of grid points increases. This research was supported by the Swedish National Board for Industrial and Technical Development (NUTEK) and by the U.S. National Science Foundation under grant ASC-8958544.     

The Superalgebra spl(p,q) and Differential Operators

Series of finite-dimensional representations of the superalgebrasspl(p,q) can be formulated in terms of linear differentialoperators acting on a suitable space of polynomials. We sketch the generalingredients necessary to construct these representations and presentexamples related to spl(2,1) and spl(2,2). By revisiting the products ofprojectivised representations of sl(2), we are able to construct new sets ofdifferential operators preserving some space of polynomials in two or morevariables. In particular, this allows us to express the representation ofspl(2,1) in terms of matrix differential operators in two variables. Thecorresponding operators provide the building blocks for the construction ofquasi-exactly solvable systems of two and four equations in two variables.We also present a quommutator deformation of spl(2,1) which, by constructionprovides an appropriate basis for analyzing the quasi exactly solvablesystems of finite difference equations.     

Representations of orthogonal polynomials

Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computers recurrence and differential equations for hyperexponential integrals. Further versions of this algorithm allow the computation of recurrence and differential equations from Rodrigues type formulas and from generating functions. In particular, these algorithms can be used to compute the differential/difference and recurrence equations for the classical continuous and discrete orthogonal polynomials from their hypergeometric representations, and from their Rodrigues representations and generating functions.In recent work, we used an explicit formula for the recurrence equation of families of classical continuous and discrete orthogonal polynomials, in terms of the coefficients of their differential/difference equations, to give an algorithm to identify the polynomial system from a given recurrence equation.In this article we extend these results by presenting a collection of algorithms with which any of the conversions between the differential/difference equation, the hypergeometric representation, and the recurrence equation is possible.The main technique is again to use explicit formulas for structural identities of the given polynomial systems.     

复微分-差分方程组的超越整函数解

利用亚纯函数的Nevanlinna值分布理论, 我们主要研究了一类复微分-差分方程和一类复微分-差分方程组的有限级超越整函数解的存在形式, 得到两个有趣的结论. 将复微分(差分)方程的一些结论推广到复微分-差分方程(组)中.     

Block companion Singer cycles, primitive recursive vector sequences, and coprime polynomial pairs over finite fields

We discuss a conjecture concerning the enumeration of nonsingular matrices over a finite field that are block companion and whose order is the maximum possible in the corresponding general linear group. A special case is proved using some recent results on the probability that a pair of polynomials with coefficients in a finite field is coprime. Connection with an older problem of Niederreiter about the number of splitting subspaces of a given dimension are outlined and an asymptotic version of the conjectural formula is established. Some applications to the enumeration of nonsingular Toeplitz matrices of a given size over a finite field are also discussed.     

Accurate spectral solutions for the parabolic and elliptic partial differential equations by the ultraspherical tau method

We present a double ultraspherical spectral methods that allow the efficient approximate solution for the parabolic partial differential equations in a square subject to the most general inhomogeneous mixed boundary conditions. The differential equations with their boundary and initial conditions are reduced to systems of ordinary differential equations for the time-dependent expansion coefficients. These systems are greatly simplified by using tensor matrix algebra, and are solved by using the step-by-step method. Numerical applications of how to use these methods are described. Numerical results obtained compare favorably with those of the analytical solutions. Accurate double ultraspherical spectral approximations for Poisson's and Helmholtz's equations are also noted. Numerical experiments show that spectral approximation based on Chebyshev polynomials of the first kind is not always better than others based on ultraspherical polynomials.     

A Taylor polynomial approach for solving the most general linear Fredholm integro‐differential‐difference equations

In this study, a matrix method is developed to solve approximately the most general higher order linear Fredholm integro‐differential‐difference equations with variable coefficients under the mixed conditions in terms of Taylor polynomials. This technique reduces the problem into the linear algebraic system. The method is valid for any combination of differential, difference and integral equations. An initial value problem and a boundary value problem are also presented to illustrate the accuracy and efficiency of the method. Copyright © 2012 John Wiley & Sons, Ltd.