The Lanczos-Arnoldi algorithm and controllability
The controllable subspace of linear systems described by the mathematical model \(\dot x=Ax+Bu\) is usually determined by the so-called staircase algorithm. In order to apply this method, it is necessary to store the matrix A as a full matrix, even if it is large and sparse. With the algorithms described in the paper equivalent results are obtained with reduced storage requirements. The methods are based on orthogonalizing the Krylov-sequences. The main difference to the staircase method consists in the proposed orthogonalization procedure. Results from numerical experiments are presented.
- A Modified Method for Reconstructing Periodic Jacobi Matrices
- scientific article; zbMATH DE number 3668422 (Why is no real title available?)
- scientific article; zbMATH DE number 3633705 (Why is no real title available?)
- scientific article; zbMATH DE number 3435336 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3339820 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Mathematical Description of Linear Dynamical Systems
- Properties of numerical algorithms related to computing controllability
- Residual Bounds on Approximate Eigensystems of Nonnormal Matrices
- The generalized eigenstructure problem in linear system theory
- The principle of minimized iterations in the solution of the matrix eigenvalue problem
- The Lanczos algorithm and Hankel matrix factorization
- 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
- Transpose-free multiple Lanczos and its application in Padé approximation
- Krylov space methods on state-space control models
- Parallel and large-scale matrix computations in control: Some ideas
- A block GMRES method augmented with eigenvectors
- A fully adaptive rational global Arnoldi method for the model-order reduction of second-order MIMO systems with proportional damping
- Convergence properties of block GMRES and matrix polynomials
- Controllability properties of numerical eigenvalue algorithms
- Algebraic characterization of controllability subspaces in the current base and its practical computation
- A block varaint of the GMRES method for unsymmetric linear systems
- scientific article; zbMATH DE number 1131741 (Why is no real title available?)
- A parameterised model order reduction method for parametric systems based on Laguerre polynomials
- The nonsymmetric Lanczos algorithm and controllability
- Arnoldi methods for large Sylvester-like observer matrix equations, and an associated algorithm for partial spectrum assignment
- Dimensionally reduced Krylov subspace model reduction for large scale systems
This page was built for publication: The Lanczos-Arnoldi algorithm and controllability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799621)
