Differentiation of generalized inverses for rational and polynomial matrices

Our basic motivation is a direct method for computing the gradient of the pseudo-inverse of well-conditioned system with respect to a scalar, proposed in [13] by Layton. In the present paper we combine the Layton’s method together with the representation of the Moore-Penrose inverse of one-variable polynomial matrix from [24] and developed an algorithm for computing the gradient of the Moore-Penrose inverse for one-variable polynomial matrix. Moreover, using the representation of various types of pseudo-inverses from [26], based on the Grevile’s partitioning method, we derive more general algorithms for computing {1}, {1, 3} and {1, 4} inverses of one-variable rational and polynomial matrices. Introduced algorithms are implemented in the programming language MATHEMATICA. Illustrative examples on analytical matrices are presented.     

Minimal factorizations of rational matrix functions in terms of polynomial models

The problem of minimal factorization of rational bicausal matrices is considered, using polynomial models. The factors are given explicity in terms of polynomial matrices.     

Integral-valued rational functions on valued fields

Let K be a field and a non-trivial valuation ring of K withm as its maximal ideal. Denote by and the rings of polynomials f∈K[X] and rational functions f∈K(X) resp. such that . We prove that for one variable X we have if and only if the completion of (K, ) is locally compact or algebraically closed. In the second case—i.e. if K is dense in the algebraic closure of (K, )—we even get for any number of variables X=(X₁,...,X_n). This work contains parts of the second author's thesis [Ri] written under the supervision of the first author.     

Generalized pseudoinverses of matrix valued functions

We define the pseudoinverse (resp. a generalized pseudoinverse) of a matrix-valued functionF to be the functionF ^x such that, for each in the domain ofF, F ^x () is the inverse (resp. a generalized inverse) of the matrixF(). We derive a state space formula for a generalized pseudoinverse of a rational matrix function without a pole or zero at infinity. This derivation makes use of the theorem characterizing the factorization of a nonregular rational matrix functionW in terms of the decomposition of the state space of a realization ofW. We also give a formula for a generalized pseudoinverse of an arbitrary rational matrix function in the form of a centered realization. We indicate some applications of generalized pseudoinverses of matrix valued functions.     

Computing generalized inverses of a rational matrix and applications

In this paper we investigate symbolic implementation of two modifications of the Leverrier-Faddeev algorithm, which are applicable in computation of the Moore-Penrose and the Drazin inverse of rational matrices. We introduce an algorithm for computation of the Drazin inverse of rational matrices. This algorithm represents an extension of the papers [11] and [14]. and a continuation of the papers [15, 16]. The symbolic implementation of these algorithms in the package mathEmatica is developed. A few matrix equations are solved by means of the Drazin inverse and the Moore-Penrose inverse of rational matrices.     

Basis problems for matrix valued functions

Basis problems for self-adjoint matrix valued functions are studied. We suggest a new and nonstandard method to solve basis problems both in finite and infinite dimensional spaces. Although many results in this paper are given for operator functions in infinite dimensional Hilbert spaces, but to demonstrate practicability of this method and to present a full solution of basis problems, in this paper we often restrict ourselves to matrix valued functions which generate Rayleigh systems on the n-dimensional complex space Cn. The suggested method is an improvement of an approach given recently in our paper [M. Hasanov, A class of nonlinear equations in Hilbert space and its applications to completeness problems, J. Math. Anal. Appl. 328 (2007) 1487-1494], which is based on the extension of the resolvent of a self-adjoint operator function to isolated eigenvalues and the properties of quadratic forms of the extended resolvent. This approach is especially useful for nonanalytic and nonsmooth operator functions when a suitable factorization formula fails to exist.     

Extensions of band matrices with band inverses

Let R_ij be a given set of μ_i× μ_j matrices for i, j=1,…, n and |i?j| ?m, where 0?m?n?1. Necessary and sufficient conditions are established for the existence and uniqueness of an invertible block matrix =[F_ij], i,j=1,…, n, such that F_ij=R_ij for |i?j|?m, F admits either a left or right block triangular factorization, and (F^?1)_ij=0 for |i?j|>m. The well-known conditions for an invertible block matrix to admit a block triangular factorization emerge for the particular choice m=n?1. The special case in which the given R_ij are positive definite (in an appropriate sense) is explored in detail, and an inequality which corresponds to Burg's maximal entropy inequality in the theory of covariance extension is deduced. The block Toeplitz case is also studied.     

Extensions de demi-groupes inverses

We study the general problem of extension of one inverse semigroup by an another inverse semigroup. Any inverse semigroup can be rebuilt from its quotient by any congruence.     

Analysis of symmetric matrix valued functions I

For any symmetric function f:Rⁿ?Rⁿ$f:{\mathbb{R}}^n?{\mathbb{R}}^n$, one can define a corresponding function on the space of n×n$n\times n$ real symmetric matrices by applying f$f$ to the eigenvalues of the spectral decomposition. We show that this matrix valued function inherits from f$f$ the properties of continuity, Lipschitz continuity, strict continuity, directional differentiability, Frechet differentiability, continuous differentiability.     

Left inverses of matrices with polynomial decay

It is known that the algebra of Schur operators on ?² (namely operators bounded on both ?¹ and ?^∞) is not inverse-closed. When ?²=?²(X) where X is a metric space, one can consider elements of the Schur algebra with certain decay at infinity. For instance if X has the doubling property, then Q. Sun has proved that the weighted Schur algebra Aω(X) for a strictly polynomial weight ω is inverse-closed. In this paper, we prove a sharp result on left-invertibility of the these operators. Namely, if an operator A∈Aω(X) satisfies ‖Afp_‖?‖fp_‖, for some 1?p?∞, then it admits a left-inverse in Aω(X). The main difficulty here is to obtain the above inequality in ?². The author was both motivated and inspired by a previous work of Aldroubi, Baskarov and Krishtal (2008) [1], where similar results were obtained through different methods for X=Zd, under additional conditions on the decay.     

Indicial rational functions of linear ordinary differential equations with polynomial coefficients

The notion of indicial rational function is introduced for ordinary differential equations with polynomial coefficients and polynomial right-hand sides, and algorithms for its construction are proposed.     

Quasicomplete factorizations of rational matrix functions

It is shown that within the class ofn×n rational matrix functions which are analytic at infinity with valueW()=I _n, any rational matrix functionW is the productW=W ₁...W _p of rational matrix functionsW ₁,...,W _p of McMillan degree one. Furthermore, such a factorization can be established with a number of factors not exceeding 2(W)–1, where (W) denotes the McMillan degree ofW.     

Schur-Nevanlinna-Potapov sequences of rational matrix functions

We study particular sequences of rational matrix functions with poles outside the unit circle. These Schur-Nevanlinna-Potapov sequences are recursively constructed based on some complex numbers with norm less than one and some strictly contractive matrices. The main theme of this paper is a thorough analysis of the matrix functions belonging to the sequences in question. Essentially, such sequences are closely related to the theory of orthogonal rational matrix functions on the unit circle. As a further crosslink, we explain that the functions belonging to Schur-Nevanlinna-Potapov sequences can be used to describe the solution set of an interpolation problem of Nevanlinna-Pick type for matricial Schur functions.     

Norm bounds for rational matrix functions

Summary If the field of values of a matrixA is contained in the left complex halfplaneH and a functionf mapsH into the unit disc then f(A)₂1 by a theorem of J.v. Neumann. We prove a theorem of this type, only the field of values ofA is used for functions which are absolutely bounded by one in only part ofH. An extension can be used to show norm-stability of single step methods for stiff differential equations. The results are applicable among others to several subdiagonal Padé approximations which are notA-stable.     

Smooth factorizations of matrix valued functions and their derivatives

Summary In this paper we study the numerical factorization of matrix valued functions in order to apply them in the numerical solution of differential algebraic equations with time varying coefficients. The main difficulty is to obtain smoothness of the factors and a numerically accessible form of their derivatives. We show how this can be achieved without numerical differentiation if the derivative of the given matrix valued function is known. These results are then applied in the numerical solution of differential algebraic Riccati equations. For this a numerical algorithm is given and its properties are demonstrated by a numerical example.