A generalized minimal partial realization problem
This paper is part of a series of papers which develop a methodology to solve different kinds of interpolation problems: scalar, vector, and matrix rational interpolation problems, Padé, Padé-Hermite, simultaneous Padé approximation, etc. The matrix rational interpolation problem solved here is a generalization of the minimal partial realization problem. To solve this problem, it is linearized and interpreted as a polynomial vector interpolation problem at \(\infty\). The algorithm to compute a basis matrix for this problem is given. It allows to write down all polynomial vector solutions with limited complexity in an easy way.
- A behavioral approach to linear exact modeling
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- A look-ahead method for computing vector Padé-Hermite approximants
- A lookahead algorithm for the solution of block Toeplitz systems
- A new approach to the rational interpolation problem
- A new approach to the rational interpolation problem: The vector case
- A new formal approach to the rational interpolation problem
- A reliable method for computing M-Padé approximants on arbitrary staircases
- A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- A Weakly Stable Algorithm for Padé Approximants and the Inversion of Hankel Matrices
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems I: Near Inversion of Generalized Sylvester Matrices
- Computation of Numerical Padé–Hermite and Simultaneous Padé Systems II: A Weakly Stable Algorithm
- Fast projection methods for minimal design problems in linear system theory
- scientific article; zbMATH DE number 653111 (Why is no real title available?)
- scientific article; zbMATH DE number 671995 (Why is no real title available?)
- scientific article; zbMATH DE number 686840 (Why is no real title available?)
- On recursiveness and related topics in linear systems
- On the theory and computation of nonperfect Padé-Hermite approximants
- Stable row recurrences for the Padé table and generically superfast lookahead solvers for non-Hermitian Toeplitz systems
- The computation of non-perfect Padé-Hermite approximants
- An algebraic approach to the partial realization problem
- Partial realization of symmetric matrix rational functions
- An algebraic method to solve the minimal partial realization problem for scalar sequences
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- On an alternative parametrization of the solutions of the partial realization problem
- Minimal partial realization from generalized orthonormal basis function expansions
- A canonical matrix continued fraction solution of the minimal (partial) realization problem
- A Lattice-Based Minimal Partial Realization Algorithm
- The matrix partial realization problem: an algebraic approach
- scientific article; zbMATH DE number 4011112 (Why is no real title available?)
- scientific article; zbMATH DE number 4082199 (Why is no real title available?)
- A lattice-based minimal partial realization algorithm for matrix sequences of varying length
- Minimal realization in the max algebra is an extended linear complementarity problem
- A general module theoretic framework for vector M-Padé and matrix rational interpolation
- Rational interpolation and state-variable realizations
- Minimal vector Padé approximation
- A framework for the solution of the generalized realization problem
This page was built for publication: A generalized minimal partial realization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677934)
