Efficient split algorithms for continuous-time and discrete-time systems
From MaRDI portal
Publication:2277421
Recommendations
- scientific article; zbMATH DE number 17433
- A splitting iterative method for the discrete dynamic linear systems
- Optimal partitioning method for stability analysis of continuous/discrete delay systems
- Non-stationary parallel multisplitting algorithms for almost linear systems
- Asynchronous multisplitting methods for linear and nonlinear systems
- Iterative algorithms for the split problem and its convergence analysis
- Algorithmic approach to the split problems
- Splitting methods for non-autonomous separable dynamical systems
- scientific article; zbMATH DE number 4156289
- Linear time split decomposition revisited
Cites work
- scientific article; zbMATH DE number 3843619 (Why is no real title available?)
- A geometrical interpretation of the Routh test
- A stability test for continuous systems
- A unifying frame for stability-test algorithms for continuous-time systems
- Common setting for some classical z-domain algorithms in linear system theory
- Direct bilinear Routh stability criteria for discrete systems
- Introduction to stochastic control theory
- On the role of the Nevanlinna–Pick problem in circuit and system theory
- Splitting of some s-domain stability-test algorithms
Cited in
(5)- Splitting of some s-domain stability-test algorithms
- scientific article; zbMATH DE number 4170812 (Why is no real title available?)
- scientific article; zbMATH DE number 18085 (Why is no real title available?)
- scientific article; zbMATH DE number 17433 (Why is no real title available?)
- �ber die Anzahl der Wurzeln einer algebraischen Gleichung in einem Kreise
This page was built for publication: Efficient split algorithms for continuous-time and discrete-time systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2277421)
