A unified least squares approach to identify and to reduce continuous asymptotically stable systems
From MaRDI portal
Publication:996321
DOI10.1016/j.laa.2007.05.042zbMath1128.93026OpenAlexW1980477072MaRDI QIDQ996321
Dieter Prätzel-Wolters, Sven Feldmann, Patrick M. Lang
Publication date: 14 September 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2007.05.042
System identification (93B30) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Linear systems in control theory (93C05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Padé techniques for model reduction in linear system theory: a survey
- Downdating of Szegö polynomials and data-fitting applications
- A least squares approach to reduce stable discrete linear systems preserving their stability.
- A superfast method for solving Toeplitz linear least squares problems.
- High performance algorithms for Toeplitz and block Toeplitz matrices
- Consideration on computing real logarithms of matrices, Hamiltonian logarithms, and skew-symmetric logarithms
- Approximating the Logarithm of a Matrix to Specified Accuracy
- A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems
- Superfast Solution of Real Positive Definite Toeplitz Systems
- New Fast Algorithms for Structured Linear Least Squares Problems
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- A Schur--Fréchet Algorithm for Computing the Logarithm and Exponential of a Matrix
- Floquet Theory for Time Scales and Putzer Representations of Matrix Logarithms
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Computational Techniques for Real Logarithms of Matrices
- Conditioning and Padé Approximation of the Logarithm of a Matrix
- Logarithms of Matrices
