Dynamical system decomposition for efficient, sparse analysis

@article{Anderson2010DynamicalSD,
  title={Dynamical system decomposition for efficient, sparse analysis},
  author={James Anderson and Antonis Papachristodoulou},
  journal={49th IEEE Conference on Decision and Control (CDC)},
  year={2010},
  pages={6565-6570}
}
We describe a system decomposition approach that allows for the efficient analysis of dynamical systems in the sum of squares (SOS) programming framework. The motivation is to break high-dimensional systems into lower-order interacting subsystems and to find a stability certificate for each of the subsystems. The certificates can be integrated at the end and used to determine the stability of the original large-scale system. Implicit in the decomposition approach is the requirement that each of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Polynomial equations and convex polytopes

  • B. Sturmfels
  • American Mathematical Monthly, vol. 105, no. 10…
  • 1998
Highly Influential
12 Excerpts

Input-output systems analysis using sum of squares programming: A decomposition approach

  • ——
  • Proceedings of the 19th International Symposium…
  • 2010
1 Excerpt

Similar Papers

Loading similar papers…