Fast and stable recursive algorithms for continuous-time and discrete- time model conversions
From MaRDI portal
Publication:1103336
DOI10.1016/0898-1221(87)90188-XzbMath0645.65034MaRDI QIDQ1103336
Publication date: 1987
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Numerical optimization and variational techniques (65K10) Discrete-time control/observation systems (93C55) Linear systems in control theory (93C05)
Cites Work
- Unnamed Item
- Solutions to the nonlinear Schrödinger equation with sequences of initial data converging to a Dirac mass
- Model simplification and digital design of multivariable sampled-data control systems via a dominant-data matching method
- A fast method for computing the principal \(n\)-th roots of complex matrices
- Discrete-continuous model conversion
- Using discrete models with continuous design packages
- Some properties of matrix sign functions derived from continued fractions
- Choice of the sampling interval for the identification of continuous-time systems from samples of input/output data
- Identification of continuous-time multivariable systems from sampled data†
- Design of optimal input signals for the identification of distributed parameter systems †
- Nineteen Dubious Ways to Compute the Exponential of a Matrix
- Newton's Method for the Matrix Square Root
- Computation of the principal nth roots of complex matrices
- A unified treatment of recursive digital filtering
This page was built for publication: Fast and stable recursive algorithms for continuous-time and discrete- time model conversions
