Computational algorithms for linear control systems: a brief survey
From MaRDI portal
Numerical optimization and variational techniques (65K10) Research exposition (monographs, survey articles) pertaining to systems and control theory (93-02) Controllability (93B05) Observability (93B07) Canonical structure (93B10) Synthesis problems (93B50) Pole and zero placement problems (93B55) Linear systems in control theory (93C05) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05)
Cites work
- A Hessenberg-Schur method for the problem AX + XB= C
- A numerical algorithm to solve<tex>A^{T}XA - X = Q</tex>
- A Schur decomposition for Hamiltonian matrices
- A Schur method for pole assignment
- A Schur method for solving algebraic Riccati equations
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- Algorithm 517: A Program for Computing the Condition Numbers of Matrix Eigenvalues Without Computing Eigenvectors [F2]
- An Algorithm for Computing Reducing Subspaces by Block Diagonalization
- An Algorithm for Generalized Matrix Eigenvalue Problems
- An Algorithm for Numerical Computation of the Jordan Normal Form of a Complex Matrix
- An algorithm for pole assignment of time invariant linear systems†
- An algorithm for solving the matrix equationX = FXFT+S
- An efficient Schur method to solve the stabilizing problem
- Comments on "On the numerical solution of the discrete-time algebraic Riccati equation"
- Computation of supremal (A,B)-invariant and controllability subspaces
- Computation of zeros of linear multivariable systems
- scientific article; zbMATH DE number 3744404 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Ill-Conditioned Eigensystems and the Computation of the Jordan Canonical Form
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Matrix eigensystem routines. EISPACK guide extension
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Numerical Computation of the Matrix Exponential with Accuracy Estimate
- Numerical Solution of the Stable, Non-negative Definite Lyapunov Equation Lyapunov Equation
- On the numerical solution of the discrete-time algebraic Riccati equation
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Properties of numerical algorithms related to computing controllability
- Synthesis of linear systems with desired equivalent form
- The generalized eigenstructure problem in linear system theory
- The Sensitivity of the Matrix Exponential
- The singular value decomposition: Its computation and some applications
- The structure of robust observers
- Truncation and round-off errors in computation of matrix exponentials
Cited in
(11)- Optimization in the Hardy space and the problem of the parametrization of controllers
- Automated linear analysis of continuous control systems
- Efficient eigenvalue assignments for general linear MIMO systems
- An iterative approach to eigenvalue assignment for nonlinear systems
- Singular perturbation modelling of large-scale systems with multi-time-scale property
- scientific article; zbMATH DE number 50954 (Why is no real title available?)
- Matrix bidiagonal form
- An iterative approach to eigenvalue assignment for nonlinear systems
- Algorithms for symbolic/numeric control of affine dynamical systems
- Zur Analyse linearer Regelkreise mit Hilfe von digitalen Rechenmaschinen
- Frequency-domain design of optimal controllers
This page was built for publication: Computational algorithms for linear control systems: a brief survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3675988)
