Methods and algorithms of solving spectral problems for polynomial and rational matrices

In the present paper, methods and algorithms for numerical solution of spectral problems and some problems in algebra related to them for one- and two-parameter polynomial and rational matrices are considered. A survey of known methods of solving spectral problems for polynomial matrices that are based on the rank factorization of constant matrices, i.e., that apply the singular value decomposition (SVD) and the normalized decomposition (the QR factorization), is given. The approach to the construction of methods that makes use of rank factorization is extended to one- and two-parameter polynomial and rational matrices. Methods and algorithms for solving some parametric problems in algebra based on ideas of rank factorization are presented. Bibliography: 326titles.

[1]  V. Kublanovskaya,et al.  An approach to solving nonlinear algebraic systems , 1990 .

[2]  Ji-guang Sun.  Perturbation Analysis for the Generalized Singular Value Problem , 1983 .

[3]  S. Wold,et al.  The Collinearity Problem in Linear Regression. The Partial Least Squares (PLS) Approach to Generalized Inverses , 1984 .

[4]  Dianne P. O'Leary,et al.  Data-flow algorithms for parallel matrix computation , 1985, CACM.

[5]  G. Stewart.  Introduction to matrix computations , 1973 .

[6]  Spectral problems for rational matrices. Methods and algorithms. IV , 1991 .

[7]  Paul Van Dooren,et al.  Minimal cascade factorization of real and complex rational transfer matrices , 1981 .

[8]  Å. Björck.  Least squares methods , 1990 .

[9]  A. Neumaier.  RESIDUAL INVERSE ITERATION FOR THE NONLINEAR EIGENVALUE PROBLEM , 1985 .

[10]  J. Cruz,et al.  RELATIONSHIP BETWEEN SENSITIVITY AND STABILITY OF MULTIVARIABLE FEEDBACK SYSTEMS. , 1981 .

[11]  Burton S. Garbow.  Remark on “Algorithm 535: The QZ Algorithm to Solve the Generalized Eigenvalue Problem” , 1982, TOMS.

[12]  Axel Ruhe.  ALGORITHMS FOR THE NONLINEAR EIGENVALUE PROBLEM , 1973 .

[13]  P. Dooren,et al.  The eigenstructure of an arbitrary polynomial matrix : Computational aspects , 1983 .

[14]  Computation of eigenpairs of Ax = γBx for vibrations of spinning deformable bodies☆ , 1984 .

[15]  Avner Friedman,et al.  Nonlinear eigenvalue problems , 1968 .

[16]  S. Campbell.  The Numerical Solution of Higher Index Linear Time Varying Singular Systems of Differential Equations , 1985 .

[17]  T. Chan.  Rank revealing QR factorizations , 1987 .

[18]  C. Loan.  Generalizing the Singular Value Decomposition , 1976 .

[19]  Axel Rune,et al.  Numerical Path Following and Eigenvalue Criteria for Branch Switching , 1986 .

[20]  B. McMillan.  Introduction to formal realizability theory — II , 1952 .

[21]  G. Stewart.  On the perturbation of LU, Cholesky, and QR factorizations , 1993 .

[22]  Jack Dongarra,et al.  LINPACK Users' Guide , 1987 .

[23]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[24]  Axel Ruhe,et al.  The spectral transformation Lánczos method for the numerical solution of large sparse generalized symmetric eigenvalue problems , 1980 .

[25]  H. K. Wimmer.  A Jordan factorization theorem for polynomial matrices , 1979 .

[26]  Axel Ruhe.  methods for the eigenvalue problem with large sparse matrices , 1974 .

[27]  M. A. Kaashoek,et al.  Minimal Factorization of Matrix and Operator Functions , 1980 .

[28]  James M. Ortega,et al.  Iterative solution of nonlinear equations in several variables , 2014, Computer science and applied mathematics.

[29]  T. Ya. Kon'kova,et al.  Inversion of polynomial and rational matrices , 1996 .

[30]  James Demmel,et al.  The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I: theory and algorithms , 1993, TOMS.

[31]  H. Rosenbrock.  Structural properties of linear dynamical systems , 1974 .

[32]  Axel Ruhe.  Numerical aspects of gram-schmidt orthogonalization of vectors , 1983 .

[33]  V. Kublanovskaya.  Solution of systems of nonlinear algebraic equations in three variables. Methods and algorithms. 3 , 1998 .

[34]  C. Loan.  Computing the CS and the generalized singular value decompositions , 1985 .

[35]  Axel Ruhe.  Rational Krylov sequence methods for eigenvalue computation , 1984 .

[36]  Garry H. Rodrigue,et al.  A gradient method for the matrix eigenvalue problemAx=λBx , 1974 .

[37]  Peter Lancaster,et al.  Inversion of lambda-matrices and application to the theory of linear vibrations , 1960 .

[38]  C. Paige.  Computing the generalized singular value decomposition , 1986 .

[39]  Gerald L. Thompson,et al.  Roots of Matrix Pencils: The Generalized Eigenvalue Problem [F2] (Algorithm 405) , 1971, Commun. ACM.

[40]  P. Dooren.  The generalized eigenstructure problem in linear system theory , 1981 .

[41]  R. Kálmán.  Irreducible realizations and the degree of a rational matrix. , 1965 .

[42]  Israel Gohberg,et al.  Factorizations of Transfer Functions , 1980 .

[43]  D. Scott,et al.  Solving Symmetric-Definite Quadratic $\lambda $-Matrix Problems without Factorization , 1982 .

[44]  R. F. Hoskins,et al.  Computational Methods in Linear Algebra , 1976, The Mathematical Gazette.

[45]  William C. Waterhouse.  The codimension of singular matrix pairs , 1984 .

[46]  King-Wah Eric Chu.  Exclusion theorems and the perturbation analysis of the generalized eigenvalue problem , 1987 .

[47]  Adam W. Bojanczyk,et al.  Periodic Schur decomposition: algorithms and applications , 1992, Optics & Photonics.

[48]  Linda Kaufman.  Some Thoughts on the QZ Algorithm for Solving the Generalized Eigenvalue Problem , 1977, TOMS.

[49]  G. Stewart.  On the Sensitivity of the Eigenvalue Problem $Ax = \lambda Bx$ , 1972 .

[50]  Burton S. Garbow,et al.  Algorithm 535: The QZ algorithm to solve the generalized eigenvalue problem for complex matrices [F2] , 1978, TOMS.

[51]  Axel Ruhe,et al.  On the closeness of eigenvalues and singular values for almost normal matrices , 1975 .

[52]  Axel Ruhe.  An algorithm for numerical determination of the structure of a general matrix , 1970 .

[53]  Daniel Boley,et al.  Computing the controllability - observability decomposition of a linear time-invariant dynamic system, a numerical approach , 1981 .

[54]  H. Rosenbrock,et al.  State-space and multivariable theory, , 1970 .

[55]  G. Stewart.  Computing theCS decomposition of a partitioned orthonormal matrix , 1982 .

[56]  Bo Kågström,et al.  Distributed and Shared Memory Block Algorithms for the Triangular Sylvester Equation with øperatornamesep - 1 Estimators , 1992, SIAM J. Matrix Anal. Appl..

[57]  G. A. Thurston.  Roots of Lambda Matrices , 1978 .

[58]  G. Peters,et al.  $Ax = \lambda Bx$ and the Generalized Eigenproblem , 1970 .

[59]  Axel Ruhe.  Iterative Eigenvalue Algorithms for Large Symmetric Matrices , 1974 .

[60]  Observer design for singular systems using canonical forms , 1986, 1986 25th IEEE Conference on Decision and Control.

[61]  Axel Ruhe.  Rational Krylov Algorithms for Nonsymmetric Eigenvalue Problems , 1994 .

[62]  R. Natarajan.  An Arnoldi-based iterative scheme for nonsymmetric matrix pencils arising in finite element stability problems , 1992 .

[63]  Solving sparse symmetric definite quadraticλ-matrix problems , 1981 .

[64]  Bo Kågström,et al.  RGSD an algorithm for computing the Kronecker structure and reducing subspaces of singular A-lB pencils , 1986 .

[65]  P. Turán.  On the latent roots of λ matrices , 1975 .

[66]  L. Hayes,et al.  Solution of Non-linear Eigenvalue Problems by the Continuation Method , 1976 .

[67]  P. Dooren.  The generalized eigenstructure problem applications in linear system theory , 1979 .

[68]  Ji-guang Sun,et al.  Perturbation analysis for the generalized eigenvalue and the generalized singular value problem , 1983 .

[69]  G. Stewart,et al.  Matrix Perturbation Theory , 1990 .

[70]  V. Klema.  LINPACK user's guide , 1980 .

[71]  James Demmel,et al.  Accurate solutions of ill-posed problems in control theory , 1988 .

[72]  L. B. Rall,et al.  The solution of characteristic value-vector problems by Newton's method , 1968 .

[73]  On Kublanovskaya''s approach to the solution of the generalized latent value problem for functional , 1983 .

[74]  Axel Ruhe.  Fitting Empirical Data by Positive Sums of Exponentials , 1980 .

[75]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[76]  R. D. Murphy,et al.  Iterative solution of nonlinear equations , 1994 .

[77]  Gene H. Golub,et al.  Matrix computations , 1983 .

[78]  Y. S. Hung,et al.  ANALYTIC PROPERTIES OF THE SINGULAR VALUES OF A RATIONAL MATRIX. , 1983 .

[79]  Axel Ruhe,et al.  The method of conjugate gradients used in inverse iteration , 1972 .

[80]  Wei H. Yang,et al.  A method for eigenvalues of sparse λ-matrices , 1983 .

[81]  TheAB-algorithm and its properties , 1983 .

[82]  George J. Davis.  Numerical Solution of a Quadratic Matrix Equation , 1981 .

[83]  J. Varah.  On the Separation of Two Matrices , 1979 .

[84]  Paul Van Dooren,et al.  Computation of zeros of linear multivariable systems , 1980, Autom..

[85]  Peter Lancaster,et al.  A Fundamental Theorem on Lambda-Matrices with Applications -I. Ordinary Differential Equations with Constant Coefficients , 1977 .

[86]  S. Bhattacharyya,et al.  Pole assignment via Sylvester's equation , 1982 .

[87]  M. Vidyasagar.  Control System Synthesis : A Factorization Approach , 1988 .

[88]  F. Lewis.  Fundamental, reachability, and observability matrices for discrete descriptor systems , 1985 .

[89]  Tgj Theo Beelen.  New algorithms for computing the Kronecker structure of a pencil with applications to systems and control theory , 1987 .

[90]  Bo Kågström,et al.  An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix , 1980, TOMS.

[91]  W. Wolovich.  Linear multivariable systems , 1974 .

[92]  W. Kratz,et al.  Numerical Solution of Matrix Polynomial Equations by Newton's Method , 1987 .

[93]  B. Kågström,et al.  Generalized Schur methods with condition estimators for solving the generalized Sylvester equation , 1989 .

[94]  T. Kailath,et al.  A generalized state-space for singular systems , 1981 .

[95]  G. Golub,et al.  A Hessenberg-Schur method for the problem AX + XB= C , 1979 .

[96]  Joseph F. Traub,et al.  Algorithms for solvents of matrix polynomials , 1978 .

[97]  V. Kublanovskaya,et al.  On irreducible factorizations of rational matrices and their applications , 1997 .

[98]  James Hardy Wilkinson,et al.  Kronecker''s canonical form and the QZ algorithm , 1979 .

[99]  Biswa Nath Datta,et al.  Parallel and large-scale matrix computations in control: some ideas , 1989 .

[100]  V. Kublanovskaya.  On an Approach to the Solution of the Generalized Latent Value Problem for $\lambda $-Matrices , 1970 .

[101]  Axel Ruhe.  Perturbation bounds for means of eigenvalues and invariant subspaces , 1970 .

[102]  Axel Ruhe,et al.  Algorithms for separable nonlinear least squares problems , 1980 .

[103]  Bo Kågström,et al.  Distributed Block Algorithms for the Triangular Sylvester Equation with Condition Estimator , 1989, PPSC.

[104]  A. Pokrzywa,et al.  On perturbations and the equivalence orbit of a matrix pencil , 1986 .

[105]  Charles Van Loan,et al.  A General Matrix Eigenvalue Algorithm , 1975 .

[106]  Paul Van Dooren,et al.  Algorithm 590: DSUBSP and EXCHQZ: FORTRAN Subroutines for Computing Deflating Subspaces with Specified Spectrum , 1982, TOMS.

[107]  Ji-guang Sun.  Perturbation bounds for the Cholesky andQR factorizations , 1991 .

[108]  G. Stewart,et al.  Gershgorin Theory for the Generalized Eigenvalue Problem Ax — \ Bx , 2010 .

[109]  P. Dooren.  Reducing subspaces: Definitions, properties and algorithms , 1983 .

[110]  K. Hannabuss,et al.  MATRICES AND INDEFINITE SCALAR PRODUCTS (Operator Theory: Advances and Applications, 8) , 1984 .

[111]  G. Stewart,et al.  An Algorithm for Generalized Matrix Eigenvalue Problems. , 1973 .

[112]  M. Saunders,et al.  Towards a Generalized Singular Value Decomposition , 1981 .

[113]  A. Laub.  A schur method for solving algebraic Riccati equations , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.

[114]  A. Jennings,et al.  Simultaneous Iteration for Partial Eigensolution of Real Matrices , 1975 .

[115]  K. Bathe,et al.  An accelerated subspace iteration method , 1980 .

[116]  Bo Kågström,et al.  The generalized singular value decomposition and the general (A-λB)-problem , 1984 .

[117]  Jacques Huitfeldt,et al.  A New Algorithm for Numerical Path Following Applied to an Example from Hydrodynamical Flow , 1990, SIAM J. Sci. Comput..

[118]  Ian Postlethwaite,et al.  A Complex Variable Approach to the Analysis of Linear Multivariable Feed Back Systems , 1979 .

[119]  Thomas Ericsson,et al.  Implementation and applications of the spectral transformation lanczos algorithm , 1983 .

[120]  George J. Davis.  Algorithm 598: an algorithm to compute solvent of the matrix equation AX2 + BX + C = 0 , 1983, TOMS.

[121]  Axel Ruhe,et al.  Lanczos algorithms and field of value rotations for symmetric matrix pencils , 1987 .

[122]  T. Kailath,et al.  Properties of the system matrix of a generalized state-space system , 1978 .

[123]  G. Stewart.  A method for computing the generalized singular value decomposition , 1983 .

[124]  Bo Kågström,et al.  On computing the Kronecker canonical form of regular (A-λB)-pencils , 1983 .

[125]  W. Kahan.  Numerical Linear Algebra , 1966, Canadian Mathematical Bulletin.

[126]  G. Stewart.  Perturbation Bounds for the $QR$ Factorization of a Matrix , 1977 .

[127]  V. Kublanovskaya,et al.  Spectral problems for matrix pencils. Methods and algorithms. III. , 1988 .

[128]  P. Dooren,et al.  An improved algorithm for the computation of Kronecker's canonical form of a singular pencil , 1988 .

[129]  G. Stewart.  Error and Perturbation Bounds for Subspaces Associated with Certain Eigenvalue Problems , 1973 .

[130]  James Demmel,et al.  Accurate Singular Values of Bidiagonal Matrices , 1990, SIAM J. Sci. Comput..

[131]  J. Bunch.  The weak and strong stability of algorithms in numerical linear algebra , 1987 .

[132]  Y. Saad,et al.  Chebyshev acceleration techniques for solving nonsymmetric eigenvalue problems , 1984 .

[133]  James S. Thorp,et al.  The singular pencil of a linear dynamical system , 1973 .

[134]  R. Eising.  Polynomial matrices and feedback , 1985 .

[135]  V. Kublanovskaya.  AB-Algorithm and its modifications for the spectral problems of linear pencils of matrices , 1984 .

[136]  G. Stewart,et al.  An Algorithm for Computing Reducing Subspaces by Block Diagonalization. , 1979 .

[137]  Gerald L. Thompson,et al.  THE ROOTS OF MATRIX PENCILS (Ay = Lambda By): EXISTENCE, CALCULATIONS, AND RELATIONS TO GAME THEORY. , 1972 .

[138]  G. Stewart.  The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators , 1980 .

[139]  Bo Kågström,et al.  A Perturbation Analysis of the Generalized Sylvester Equation $(AR - LB, DR - LE) = (C, F)$ , 1994 .

[140]  Paul Van Dooren,et al.  Factorization of transfer functions , 1980 .

[141]  Lars Pernebo,et al.  Algebraic Control Theory for Linear Multivariable Systems , 1978 .

[142]  Singular functions of polynomial matrices , 1992 .

[143]  G. Stewart.  Gershgorin theory for the generalized eigenvalue problem , 1975 .

[144]  P. Dooren.  The Computation of Kronecker's Canonical Form of a Singular Pencil , 1979 .

[145]  R. Byers.  A LINPACK-style condition estimator for the equation AX-XB^{T} = C , 1984 .

[146]  Axel Rune.  Iterative eigenvalue algorithms based on convergent splittings , 1975 .

[147]  P. Lancaster.  On eigenvalues of matrices dependent on a parameter , 1964 .

[148]  B. Kågström,et al.  A Direct Method for Reordering Eigenvalues in the Generalized Real Schur form of a Regular Matrix Pair (A, B) , 1993 .

[149]  P. Dooren.  A Generalized Eigenvalue Approach for Solving Riccati Equations , 1980 .

[150]  Gene H. Golub,et al.  The Lanczos-Arnoldi algorithm and controllability , 1984 .

[151]  Jr. G. Forney,et al.  Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems , 1975 .

[152]  P. Van Dooren,et al.  A class of fast staircase algorithms for generalized state-space systems , 1986, 1986 American Control Conference.

[153]  V. Kublanovskaya,et al.  An approach to solving the spectral problem of A-λB , 1983 .

[154]  Leon O. Chua,et al.  Introduction to nonlinear network theory , 1969 .

[155]  Jack J. Dongarra,et al.  Numerical Considerations in Computing Invariant Subspaces , 1992, SIAM J. Matrix Anal. Appl..

[156]  C. W. Gear,et al.  Differential/algebraic systems and matrix pencils , 1983 .

[157]  P. Dooren.  Reducing subspaces : computational aspects and applications in linear system theory , 1982 .

[158]  J. Demmel.  Computing stable eigendecompositions of matrices , 1986 .

[159]  H. Rutishauser.  Computational aspects of F. L. Bauer's simultaneous iteration method , 1969 .

[160]  J. Berlioz.  A propos de l’algorithme $QZ$ , 1979 .

[161]  P. Van Dooren.  Erratum: A Generalized Eigenvalue Approach for Solving Riccati Equations , 1983 .

[162]  J. Cassels.  Factorization of polynomials in several variables , 1969 .

[163]  Spectral problem for polynomial pencils of matrices , 1985 .

[164]  Deflation in spectral problems for matrix pencils , 1987 .

[165]  James Hardy Wilkinson,et al.  Linear Differential Equations and Kronecker's Canonical Form , 1978 .

[166]  Nicholas J. Higham,et al.  Experience with a Matrix Norm Estimator , 1990, SIAM J. Sci. Comput..

[167]  C. Paige.  Properties of numerical algorithms related to computing controllability , 1981 .

[168]  J. Demmel.  The condition number of equivalence transformations that block diagonalize matrix pencils , 1983 .

[169]  L. S. Jennings,et al.  Generalized Eigenvalue Problems for Rectangular Matrices , 1977 .

[170]  Ji-guang Sun.  Componentwise perturbation bounds for some matrix decompositions , 1992 .

[171]  W. Kahan,et al.  The Rotation of Eigenvectors by a Perturbation. III , 1970 .

[172]  Joseph F. Traub,et al.  The Algebraic Theory of Matrix Polynomials , 1976 .

[173]  Axel Ruhe.  Accelerated Gauss-Newton algorithms for nonlinear least squares problems , 1979 .

[174]  Axel Ruhe.  The two-sided arnoldi algorithm for nonsymmetric eigenvalue problems , 1983 .

[175]  P. Lancaster,et al.  Zur Theorie der ?-Matrizen , 1975 .

[176]  T. Kailath,et al.  Generalized state-space systems , 1978, 1978 IEEE Conference on Decision and Control including the 17th Symposium on Adaptive Processes.