Properties of numerical algorithms related to computing controllability
From MaRDI portal
Publication:3914832
Cited in
(69)- Minimal representations of implicit linear systems
- A pole-assignment algorithm for linear state feedback
- A reduced order observer for descriptor systems
- Computing rank-deficiency of rectangular matrix pencils
- A measure for the decentralized assignability of eigenvalues
- An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
- A direct algorithm for pole assignment of time-invariant multi-input linear systems using state feedback
- A numerical method for deadbeat control of generalized state-space systems
- Controllability and stability radii for companion form systems
- On the quantitative characterization of approximate decentralized fixed modes using transmission zeros
- Direct block tridiagonalization of single-input single-output systems
- An algorithm for computing the distance to uncontrollability
- A global minimum search algorithm for estimating the distance to uncontrollability
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- More on pseudospectra for polynomial eigenvalue problems and applications in control theory
- On quantitatively measuring controllability of complex networks
- Parallel and large-scale matrix computations in control: Some ideas
- Computation of minimal-order realizations of generalized state-space systems
- Construction and parametrization of a class of minimum-time deadbeat controllers
- Perturbation analysis of system Hessenberg and Hessenberg-triangular forms
- On computing critical delay for fixed mode radius: centralized and decentralized control
- The feedback search algorithm: estimating the distance of semi-explicit systems to \(\mathcal{R}\)-uncontrollability
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- Controllability analysis and eigenvalue assignment for generalized state- space systems
- Inheritance properties of Krylov subspace methods for continuous-time algebraic Riccati equations
- Krylov subspace methods for discrete-time algebraic Riccati equations
- On the robust, flexible and consistent implementation of time domain impedance boundary conditions for compressible flow simulations
- Computing the distance to uncontrollability via LMIs: lower bound computation with exactness verification
- Parallel and Heterogeneous m--Hessenberg--Triangular--Triangular Reduction
- Numerical algorithms with condition and accuracy estimates for linear systems design
- scientific article; zbMATH DE number 4179235 (Why is no real title available?)
- Eigenvalue assignment in an upper Hessenberg matrix
- A new look at least-squares dynamic system identification
- Pole placement in single-input linear descriptor systems
- Computation of transfer-function matrices of generalized state-space models
- Computational algorithms for linear control systems: a brief survey
- A Perturbation Result for Linear Control Problems
- Hessenberg and Hessenberg/triangular forms in linear system thcory†
- Algorithm to compute the complex stability radius
- Canonical model transformations via long division and continued fraction methods
- An algorithm for pole assignment of time invariant linear systems†
- Optimal chained aggregation for reduced-order modeling†
- Pole placement in multi-input systems via elementary transformations
- A quotient method for designing nonlinear controllers
- Computing the radius of controllability for state space systems
- Model reduction via near-uncontrollability and near-unobservability decomposition
- scientific article; zbMATH DE number 1977010 (Why is no real title available?)
- Approximate controllability for abstract measure differential systems
- Numerical Rank Deficiency in Matrix Products
- Implications of the degree of controllability of controlled plants in the sense of LQR optimal control
- Recursive eigenstructure assignment in linear systems
- Two-dimensional measures of reachability for linear time-invariant systems
- Fast Interpolation-Based Globality Certificates for Computing Kreiss Constants and the Distance to Uncontrollability
- Degree of controllability for linear unstable systems
- Locating a nearest matrix with an eigenvalue of prespecified algebraic multiplicity
- Special issue on the use of computer algebra systems for computer aided control system design
- Pole assignment, a new proof and algorithm
- Perturbation analysis of orthogonal canonical forms
- Pole assignment, a new proof and algorithm
- On real structured controllability/stabilizability/stability radius: complexity and unified rank-relaxation based methods
- Distance to the loss of structural properties for linear systems under parametric uncertainties
- Controllability measure for disturbance rejection capabilities of control systems with undamped flexible structures
- Estimating the distance to uncontrollability: A fast method and a slow one
- Efficient algorithm for simultaneous reduction to the \(m\)-Hessenberg-triangular-triangular form
- On eigenvalue and canonical form assignments
- Between controllable and uncontrollable
- The Lanczos-Arnoldi algorithm and controllability
- Numerical computation of decentralized fixed modes
This page was built for publication: Properties of numerical algorithms related to computing controllability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3914832)
