Efficient split algorithms for continuous-time and discrete-time systems
From MaRDI portal
Publication:2277421
DOI10.1016/0016-0032(91)90009-RzbMATH Open0725.93058OpenAlexW2063667421MaRDI QIDQ2277421FDOQ2277421
Authors: Antonio Lepschy, Gian Antonio Mian, U. Viaro 
Publication date: 1991
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0016-0032(91)90009-r
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
- Linear time split decomposition revisited
Cites Work
- Introduction to stochastic control theory
- On the role of the Nevanlinna–Pick problem in circuit and system theory
- A geometrical interpretation of the Routh test
- Title not available (Why is that?)
- Direct bilinear Routh stability criteria for discrete systems
- A stability test for continuous systems
- Splitting of some s-domain stability-test algorithms
- A unifying frame for stability-test algorithms for continuous-time systems
- Common setting for some classical z-domain algorithms in linear system theory
Cited In (5)
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)
