Global inverse spectral problems for rational matrix functions

Given rational matrix functions ψ₁(λ) = I_m + C₁(λI_n1 − A₁)⁻¹B₁ and ψ₂(λ) = I_m + C₂(λI_n2 − A₂)⁻¹B₂ which are analytic and invertible on the unit circle, we characterize in terms of the operators A₁,B₁,C₁,A₂,B₂,C₂ when there exists a single rational matrix function W(λ) = I_m + C(λI_n − A)⁻¹B such that WH²_m^⊥ = ψ ₁H²_m^⊥and WH²_m = ψ₂H²_m. When this is the case, we give explicit formulae for A,B,C in terms of A₁,B₁,C₁,A₂,B₂,C₂. Applications include Wiener-Hopf factorization, J- inner-outer factorization, and coprime factorization. The results on J-inner-outer factorization have application to a model reduction problem for discrete time linear systems.     

Triangular Cm interpolation by rational functions

Two general local C^m triangular interpolation schemes by rational functions from C^m data are proposed for any nonnegative integer m. The schemes can have either 2m+1 order algebraic precision if the required data are given on vertices and edges, or m+E[m/2]+1 or m+1 order algebraic precision if the data are given only at vertices. The orders of the interpolation error are estimated. Examples that show the correctness and effectiveness of the scheme are presented. Supported partially by NSFC under Project 1967108 and Croucher Foundation of Hong Kong; Supported also by FRG of Hong Kong Paptist University.     

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.     

Zero cancellation for general rational matrix functions

The problem of cancelling a specified part of the zeros of a completely general rational matrix function by multiplication with an appropriate invertible rational matrix function is investigated from different standpoints. Firstly, the class of all factors that dislocate the zeros and feature minimal McMillan degree are derived. Further, necessary and sufficient existence conditions together with the construction of solutions are given when the factor fulfills additional assumptions like being J-unitary, or J-inner, either with respect to the imaginary axis or to the unit circle. The main technical tool are centered realizations that deliver a sufficiently general conceptual support to cope with rational matrix functions which may be polynomial, proper or improper, rank deficient, with arbitrary poles and zeros including at infinity. A particular attention is paid to the numerically-sound construction of solutions by employing at each stage unitary transformations, reliable numerical algorithms for eigenvalue assignment and efficient Lyapunov equation solvers.     

Simultaneous rational approximation to binomial functions

We apply Padé approximation techniques to deduce lower bounds for simultaneous rational approximation to one or more algebraic numbers. In particular, we strengthen work of Osgood, Fel´dman and Rickert, proving, for example, that

for (where the latter is an effective constant). Some of the Diophantine consequences of such bounds will be discussed, specifically in the direction of solving simultaneous Pell's equations and norm form equations.

     

Triangular Cm interpolation by rational functions

Two general local C^m triangular interpolation schemes by rational functions from C^m data are proposed for any nonnegative integer m. The schemes can have either 2m+1 order algebraic precision if the required data are given on vertices and edges, or m+E[m/2]+1 or m+1 order algebraic precision if the data are given only at vertices. The orders of the interpolation error are estimated. Examples that show the correctness and effectiveness of the scheme are presented.     

J-inner matrix functions, interpolation and inverse problems for canonical systems, I: Foundations

This is the first of a planned sequence of papers on inverse problems for canonical systems of differential equations. It is devoted largely to foundational material (much of which is of independent interest) on the theory of assorted classes of meromorphic matrix valued functions. Particular attention is paid to the structure of J-inner functions and connections with bitangential interpolation problems and reproducing kernel Hilbert spaces. Some new characterizations of regular, singular and strongly regular J-inner functions in terms of the associated reproducing kernel Hilbert spaces are presented.D. Z. Arov wishes to thank the Weizmann Institute of Science for hospitality and support; H. Dym wishes to thank Renee and Jay Weiss for endowing the chair which supports his research.     

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.     

Short rational generating functions for lattice point problems

We prove that for any fixed the generating function of the projection of the set of integer points in a rational -dimensional polytope can be computed in polynomial time. As a corollary, we deduce that various interesting sets of lattice points, notably integer semigroups and (minimal) Hilbert bases of rational cones, have short rational generating functions provided certain parameters (the dimension and the number of generators) are fixed. It follows then that many computational problems for such sets (for example, finding the number of positive integers not representable as a non-negative integer combination of given coprime positive integers ) admit polynomial time algorithms. We also discuss a related problem of computing the Hilbert series of a ring generated by monomials.

     

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.     

Zero data and interpolation problems for rectangular matrix polynomials

Zero data of rectangular matrix polynomials are described in various forms. The basic interpolation problem of constructing rectangular matrix polynomials from their zero data is solved. Certain rectangular factorizations are analyzed in terms of spectral data.