Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations Corbinian Schlosser, Milan Korda This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6513566/v1 This work is licensed under a CC BY 4.0 License Status: Under Review Version 1 posted 10 You are reading this latest preprint version Abstract We propose a general sparse decomposition of dynamical systems provided that the vector field and constraint set possess certain sparse structures, which we call subsystems. This notion is based on causal dependence in the dynamics between the different states. It gives rise to sparse descriptions for fundamental problems from nonlinear dynamical systems: The characterization of the region of attraction, the maximum positively invariant set, and the global attractor. The decompositions can be paired with any method for computing (outer) approximations of these sets, and reduce the task to lower dimensional systems. We illustrate this by methods from previous work based on infinite-dimensional linear programming. This exhibits one example where the curse of dimensionality is present and hence dimension reduction is crucial. In this context, for polynomial dynamics, we show that these problems admit convergent sparse sum-of-squares (SOS) approximations. We illustrate the computational benefit with numerical toy examples. nonlinear control large-scale optimization sparsity decomposition network control sum-of-squares Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Under Review Version 1 posted Editorial decision: Revision requested 15 Jul, 2025 Reviews received at journal 01 Jul, 2025 Reviews received at journal 27 May, 2025 Reviewers agreed at journal 05 May, 2025 Reviewers agreed at journal 02 May, 2025 Reviewers agreed at journal 02 May, 2025 Reviewers invited by journal 02 May, 2025 Editor assigned by journal 25 Apr, 2025 Submission checks completed at journal 24 Apr, 2025 First submitted to journal 23 Apr, 2025 You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6513566","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":451870612,"identity":"ccf44e82-7abc-41c7-aca1-5dcb0da17ec8","order_by":0,"name":"Corbinian Schlosser","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAABFElEQVRIiWNgGAWjYHACNoYEBgkwi5mhAEwzPgASPHzEaTGA0CCKhw2fFhiAaWGTQBVHBfztvc8ePNxhIW/OwP7wc4GBjb08UKTya46dDBsD88NHNzC1SJw5bm6QeEbCcGcDj7H0DIO0xA1njpvdlt2WDHQYm7FxDqYWA4k0NonENgnGDQd42Jh5DA4ngERuS25jBmrhYZPGo8V+wwH2ZyAt9vLzn7EVS26rJ6glccMBBjOQFsaGG2xsjB+3HcapReLMMXYDoJbkDYeBfuEB+yWNWZpx23GgO7H7hb+9je3hz7Y62w3H2x9+5qkAhdgxxo8/t1Xb87M3P3yMRQsCMCOzedBFCALGH6SoHgWjYBSMguEOAN39VUiN9m2OAAAAAElFTkSuQmCC","orcid":"","institution":"Inria Paris","correspondingAuthor":true,"prefix":"","firstName":"Corbinian","middleName":"","lastName":"Schlosser","suffix":""},{"id":451870613,"identity":"34ccd89c-56b8-42a0-936a-269b9dc72cd9","order_by":1,"name":"Milan Korda","email":"","orcid":"","institution":"Laboratory for Analysis and Architecture of Systems","correspondingAuthor":false,"prefix":"","firstName":"Milan","middleName":"","lastName":"Korda","suffix":""}],"badges":[],"createdAt":"2025-04-23 14:23:37","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6513566/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6513566/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":82140415,"identity":"9ac8dbc3-2daa-49f5-aacb-9f959bca293e","added_by":"auto","created_at":"2025-05-07 06:30:23","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1282959,"visible":true,"origin":"","legend":"","description":"","filename":"SparsesystemdecompositionsubmissionMCSS.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6513566/v1_covered_14553c83-33c3-4849-bdc3-a1f7490479c0.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"
[email protected]","identity":"mathematics-of-control-signals-and-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"mcss","sideBox":"Learn more about [Mathematics of Control, Signals, and Systems](http://link.springer.com/journal/498)","snPcode":"498","submissionUrl":"https://submission.nature.com/new-submission/498/3","title":"Mathematics of Control, Signals, and Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"nonlinear control, large-scale optimization, sparsity, decomposition, network control, sum-of-squares","lastPublishedDoi":"10.21203/rs.3.rs-6513566/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6513566/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"We propose a general sparse decomposition of dynamical systems provided that the vector field and constraint set possess certain sparse structures, which we call subsystems. This notion is based on causal dependence in the dynamics between the different states. It gives rise to sparse descriptions for fundamental problems from nonlinear dynamical systems: The characterization of the region of attraction, the maximum positively invariant set, and the global attractor. The decompositions can be paired with any method for computing (outer) approximations of these sets, and reduce the task to lower dimensional systems. We illustrate this by methods from previous work based on infinite-dimensional linear programming. This exhibits one example where the curse of dimensionality is present and hence dimension reduction is crucial. In this context, for polynomial dynamics, we show that these problems admit convergent sparse sum-of-squares (SOS) approximations. We illustrate the computational benefit with numerical toy examples.","manuscriptTitle":"Sparse decompositions of nonlinear dynamical systems and applications to moment-sum-of-squares relaxations","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-05-07 06:22:16","doi":"10.21203/rs.3.rs-6513566/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"decision","content":"Revision requested","date":"2025-07-15T08:23:20+00:00","index":"","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-07-01T04:26:43+00:00","index":"hide","fulltext":""},{"type":"editorInvitedReview","content":"","date":"2025-05-27T09:07:35+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"195257398042218514614224464780601379272","date":"2025-05-05T06:13:39+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"334131621684787403701475175756072419812","date":"2025-05-02T09:42:46+00:00","index":"hide","fulltext":""},{"type":"reviewerAgreed","content":"229859793297267094151536849428040677711","date":"2025-05-02T08:39:33+00:00","index":"hide","fulltext":""},{"type":"reviewersInvited","content":"","date":"2025-05-02T08:35:22+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2025-04-25T11:37:17+00:00","index":"","fulltext":""},{"type":"checksComplete","content":"","date":"2025-04-24T11:40:56+00:00","index":"","fulltext":""},{"type":"submitted","content":"Mathematics of Control, Signals, and Systems","date":"2025-04-23T14:21:59+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"
[email protected]","identity":"mathematics-of-control-signals-and-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"mcss","sideBox":"Learn more about [Mathematics of Control, Signals, and Systems](http://link.springer.com/journal/498)","snPcode":"498","submissionUrl":"https://submission.nature.com/new-submission/498/3","title":"Mathematics of Control, Signals, and Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"345ad1f8-c4fe-4c64-a69f-2bedd07c46a9","owner":[],"postedDate":"May 7th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"under-review","subjectAreas":[],"tags":[],"updatedAt":"2025-11-03T18:38:26+00:00","versionOfRecord":[],"versionCreatedAt":"2025-05-07 06:22:16","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6513566","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6513566","identity":"rs-6513566","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}
Text is read by the "Ask this paper" AI Q&A widget below.
Extraction quality varies by source — PMC NXML preserves structure
cleanly, OA-HTML may include some navigation residue, and OA-PDF can
have broken hyphenation. The publisher copy
(via DOI)
is the canonical version.