Fast and stable recursive algorithms for continuous-time and discrete- time model conversions
Consider a continuous-time system \(\dot x=Ax+Bu\) and its equivalent discrete-time model \(x(k+1)=Gx(k)+Hu(k)\) for a fixed sampling period \(T<\pi /\omega_ s\), where \(\omega_ s\) is the highest frequency component of continuous-time model. The non-recursive algorithms such as the scaling, squaring, continued-fraction method for finding A, B from G, H and the square root, scaling, continued-fraction method for finding G, H from A, B are summarized including their truncation errors. New rapidly convergent and numerically stable algorithms for finding A from G and G from A are derived. These algorithms are based on the relaxation of the constraints imposed on the existing model conversion algorithms. The numerical stability of both algorithms is proved. An example is supplied.
- scientific article; zbMATH DE number 475564
- High-performance conversions between continuous- and discrete-time systems
- Conversion of discrete-time time-invariant linear systems into continuous systems
- Model conversions of uncertain linear systems using the Pade and inverse-Pade method
- Continuous to discrete model conversion for the system with a singular system matrix based on matrix sign function
- A fast method for computing the principal \(n\)-th roots of complex matrices
- A unified treatment of recursive digital filtering
- Choice of the sampling interval for the identification of continuous-time systems from samples of input/output data
- Computation of the principal nth roots of complex matrices
- Design of optimal input signals for the identification of distributed parameter systems †
- Discrete-continuous model conversion
- scientific article; zbMATH DE number 4055449 (Why is no real title available?)
- Identification of continuous-time multivariable systems from sampled data†
- Model simplification and digital design of multivariable sampled-data control systems via a dominant-data matching method
- Newton's Method for the Matrix Square Root
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Solutions to the nonlinear Schrödinger equation with sequences of initial data converging to a Dirac mass
- Some properties of matrix sign functions derived from continued fractions
- Using discrete models with continuous design packages
- scientific article; zbMATH DE number 1188867 (Why is no real title available?)
- scientific article; zbMATH DE number 475564 (Why is no real title available?)
- High-performance conversions between continuous- and discrete-time systems
- Continuous to discrete model conversion for the system with a singular system matrix based on matrix sign function
This page was built for publication: Fast and stable recursive algorithms for continuous-time and discrete- time model conversions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1103336)
