A Toeplitz algorithm for polynomial J-spectral factorization
DOI10.1016/J.AUTOMATICA.2006.02.011zbMATH Open1120.65053OpenAlexW2149814879MaRDI QIDQ856523FDOQ856523
Authors: Juan Carlos Zúñiga, Didier Henrion
Publication date: 7 December 2006
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2006.02.011
Recommendations
algorithmsnumerical examplesspectral factorizationcomputer-aided control system designblock Toeplitz algorithmHermitian polynomial matrix
Eigenvalues, singular values, and eigenvectors (15A18) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Matrices over function rings in one or more variables (15A54)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast projection methods for minimal design problems in linear system theory
- Title not available (Why is that?)
- The Riccati equation
- The quadratic eigenvalue problem
- Title not available (Why is that?)
- An Algorithm for Generalized Matrix Eigenvalue Problems
- Factorization of Matrix Polynomials with Symmetries
- New algorithms for polynomial \(J\)-spectral factorization
- On polynomial matrix spectral factorization by symmetric extraction
- Title not available (Why is that?)
- Constructive methods of Wiener-Hopf factorization
- Polynomial J-spectral factorization
- Computer Algorithm for Spectral Factorization of Rational Matrices
- On self-adjoint matrix polynomials with constant signature
- Polynomial \(J\)-spectral factorization in minimal state space.
- Necessary and sufficient conditions for existence of \(J\)-spectral factorization for para-Hermitian rational matrix functions
- Discrete \(J\)-spectral factorization of possibly singular polynomial matrices
- Factorization of selfadjoint matrix polynomials with constant signature
- Reliable numerical methods for polynomial matrix triangularization
- An algorithm for polynomial matrix factor extraction
Cited In (6)
- Factorization of Singular Matrix Polynomials and Matrices with Circular Higher Rank Numerical Ranges
- Algorithm of J-spectral factorization of polynomial matrices
- Detecting rigid convexity of bivariate polynomials
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Polynomial J-spectral factorization
- On the Stability of the Bareiss and Related Toeplitz Factorization Algorithms
Uses Software
This page was built for publication: A Toeplitz algorithm for polynomial \(J\)-spectral factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856523)