AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS
This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a model reduction procedure. Specifically, starting with a te...
Gespeichert in:
Veröffentlicht in: | SIAM journal on numerical analysis 2014-01, Vol.52 (4), p.1928-1952 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1952 |
---|---|
container_issue | 4 |
container_start_page | 1928 |
container_title | SIAM journal on numerical analysis |
container_volume | 52 |
creator | PENG, LIQIAN MOHSENI, KAMRAN |
description | This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a model reduction procedure. Specifically, starting with a test solution, the method solves a reduced model to obtain a more precise solution, and it repeats this process until sufficient accuracy is achieved. The reduced model is obtained by projecting the full model onto a subspace that is spanned by the dominant modes of an extended data ensemble. The extended data ensemble in this article contains not only the state vectors of some snapshots of the approximate solution from the previous iteration but also the associated tangent vectors. Therefore, the proposed manifold learning method takes advantage of the information of the original dynamical system to reduce the dynamics. Moreover, the learning procedure is computed in the online stage, as opposed to being computed offline, which is used in many projection-based model reduction techniques that require prior calculations or experiments. After providing an error bound of the classical POD-Galerkin method in terms of the projection error and the initial condition error, we prove that the sequence of approximate solutions converge to the actual solution of the original system as long as the vector field of the full model is locally Lipschitz on an open set that contains the solution trajectory. Good accuracy of the proposed method has been demonstrated in two numerical examples, from a linear advection-diffusion equation to a non-linear Burgers equation. In order to save computational cost, the SIRM method is extended to a local model reduction approach by partitioning the entire time domain into several subintervals and obtaining a series of local reduced models of much lower dimensionality. The accuracy and efficiency of the local SIRM are shown through the numerical simulation of the Navier–Stokes equation in a lid-driven cavity flow problem. |
doi_str_mv | 10.1137/130927723 |
format | Article |
fullrecord | <record><control><sourceid>jstor_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_1567137884</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>24512175</jstor_id><sourcerecordid>24512175</sourcerecordid><originalsourceid>FETCH-LOGICAL-c284t-720d6ad17c9715e525c3750f9d31b393e2eb74984238b4984e6f7d0bebf1b9733</originalsourceid><addsrcrecordid>eNo90D1vwjAQBmCraqVS2qE_oJLHdkjrs-NcPEb5gEj5QAEGpigfjgSChsYw9N83iIrpvZOeu-El5BXYJ4DALxBMcUQu7sgEmJIWArJ7MmFMOBbYXD2SJ2N2bNxdEBOSehnNsyTOQjqOcZQnAU1Cr8jibEa9xaLIPX9Oo7ygaR6ECS3CYO2v4ny8imiwybw09r2ELjfLVZgun8lDV-2NfvnPKVlH4cqfW0k-uzir4a59spCz1qlawEYhSC25bARK1qlWQC2U0FzXaCvX5sKtL6mdDltW67qDWqEQU_J-_Xsc-p-zNqfysDWN3u-rb92fTQnSwbEN17VH-nGlzdAbM-iuPA7bQzX8lsDKS2XlrbLRvl3tzpz64Qa5LYEDSvEHOIdebw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1567137884</pqid></control><display><type>article</type><title>AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS</title><source>SIAM Journals Online</source><source>JSTOR Mathematics & Statistics</source><source>Jstor Complete Legacy</source><creator>PENG, LIQIAN ; MOHSENI, KAMRAN</creator><creatorcontrib>PENG, LIQIAN ; MOHSENI, KAMRAN</creatorcontrib><description>This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a model reduction procedure. Specifically, starting with a test solution, the method solves a reduced model to obtain a more precise solution, and it repeats this process until sufficient accuracy is achieved. The reduced model is obtained by projecting the full model onto a subspace that is spanned by the dominant modes of an extended data ensemble. The extended data ensemble in this article contains not only the state vectors of some snapshots of the approximate solution from the previous iteration but also the associated tangent vectors. Therefore, the proposed manifold learning method takes advantage of the information of the original dynamical system to reduce the dynamics. Moreover, the learning procedure is computed in the online stage, as opposed to being computed offline, which is used in many projection-based model reduction techniques that require prior calculations or experiments. After providing an error bound of the classical POD-Galerkin method in terms of the projection error and the initial condition error, we prove that the sequence of approximate solutions converge to the actual solution of the original system as long as the vector field of the full model is locally Lipschitz on an open set that contains the solution trajectory. Good accuracy of the proposed method has been demonstrated in two numerical examples, from a linear advection-diffusion equation to a non-linear Burgers equation. In order to save computational cost, the SIRM method is extended to a local model reduction approach by partitioning the entire time domain into several subintervals and obtaining a series of local reduced models of much lower dimensionality. The accuracy and efficiency of the local SIRM are shown through the numerical simulation of the Navier–Stokes equation in a lid-driven cavity flow problem.</description><identifier>ISSN: 0036-1429</identifier><identifier>EISSN: 1095-7170</identifier><identifier>DOI: 10.1137/130927723</identifier><language>eng</language><publisher>Society for Industrial and Applied Mathematics</publisher><subject>Accuracy ; Burger equation ; Cauchy problem ; Dynamical systems ; Eigenfunctions ; Error rates ; Internal flow ; Iterative methods ; Iterative solutions ; Learning ; Manifolds ; Mathematical models ; Matrices ; Model reduction ; Simulations ; Subspaces ; Vector fields</subject><ispartof>SIAM journal on numerical analysis, 2014-01, Vol.52 (4), p.1928-1952</ispartof><rights>Copyright ©2014 Society for Industrial and Applied Mathematics</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c284t-720d6ad17c9715e525c3750f9d31b393e2eb74984238b4984e6f7d0bebf1b9733</citedby><cites>FETCH-LOGICAL-c284t-720d6ad17c9715e525c3750f9d31b393e2eb74984238b4984e6f7d0bebf1b9733</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/24512175$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://www.jstor.org/stable/24512175$$EHTML$$P50$$Gjstor$$H</linktohtml><link.rule.ids>314,776,780,799,828,3170,27903,27904,57995,57999,58228,58232</link.rule.ids></links><search><creatorcontrib>PENG, LIQIAN</creatorcontrib><creatorcontrib>MOHSENI, KAMRAN</creatorcontrib><title>AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS</title><title>SIAM journal on numerical analysis</title><description>This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a model reduction procedure. Specifically, starting with a test solution, the method solves a reduced model to obtain a more precise solution, and it repeats this process until sufficient accuracy is achieved. The reduced model is obtained by projecting the full model onto a subspace that is spanned by the dominant modes of an extended data ensemble. The extended data ensemble in this article contains not only the state vectors of some snapshots of the approximate solution from the previous iteration but also the associated tangent vectors. Therefore, the proposed manifold learning method takes advantage of the information of the original dynamical system to reduce the dynamics. Moreover, the learning procedure is computed in the online stage, as opposed to being computed offline, which is used in many projection-based model reduction techniques that require prior calculations or experiments. After providing an error bound of the classical POD-Galerkin method in terms of the projection error and the initial condition error, we prove that the sequence of approximate solutions converge to the actual solution of the original system as long as the vector field of the full model is locally Lipschitz on an open set that contains the solution trajectory. Good accuracy of the proposed method has been demonstrated in two numerical examples, from a linear advection-diffusion equation to a non-linear Burgers equation. In order to save computational cost, the SIRM method is extended to a local model reduction approach by partitioning the entire time domain into several subintervals and obtaining a series of local reduced models of much lower dimensionality. The accuracy and efficiency of the local SIRM are shown through the numerical simulation of the Navier–Stokes equation in a lid-driven cavity flow problem.</description><subject>Accuracy</subject><subject>Burger equation</subject><subject>Cauchy problem</subject><subject>Dynamical systems</subject><subject>Eigenfunctions</subject><subject>Error rates</subject><subject>Internal flow</subject><subject>Iterative methods</subject><subject>Iterative solutions</subject><subject>Learning</subject><subject>Manifolds</subject><subject>Mathematical models</subject><subject>Matrices</subject><subject>Model reduction</subject><subject>Simulations</subject><subject>Subspaces</subject><subject>Vector fields</subject><issn>0036-1429</issn><issn>1095-7170</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo90D1vwjAQBmCraqVS2qE_oJLHdkjrs-NcPEb5gEj5QAEGpigfjgSChsYw9N83iIrpvZOeu-El5BXYJ4DALxBMcUQu7sgEmJIWArJ7MmFMOBbYXD2SJ2N2bNxdEBOSehnNsyTOQjqOcZQnAU1Cr8jibEa9xaLIPX9Oo7ygaR6ECS3CYO2v4ny8imiwybw09r2ELjfLVZgun8lDV-2NfvnPKVlH4cqfW0k-uzir4a59spCz1qlawEYhSC25bARK1qlWQC2U0FzXaCvX5sKtL6mdDltW67qDWqEQU_J-_Xsc-p-zNqfysDWN3u-rb92fTQnSwbEN17VH-nGlzdAbM-iuPA7bQzX8lsDKS2XlrbLRvl3tzpz64Qa5LYEDSvEHOIdebw</recordid><startdate>20140101</startdate><enddate>20140101</enddate><creator>PENG, LIQIAN</creator><creator>MOHSENI, KAMRAN</creator><general>Society for Industrial and Applied Mathematics</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7U5</scope><scope>8FD</scope><scope>H8D</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20140101</creationdate><title>AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS</title><author>PENG, LIQIAN ; MOHSENI, KAMRAN</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c284t-720d6ad17c9715e525c3750f9d31b393e2eb74984238b4984e6f7d0bebf1b9733</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Accuracy</topic><topic>Burger equation</topic><topic>Cauchy problem</topic><topic>Dynamical systems</topic><topic>Eigenfunctions</topic><topic>Error rates</topic><topic>Internal flow</topic><topic>Iterative methods</topic><topic>Iterative solutions</topic><topic>Learning</topic><topic>Manifolds</topic><topic>Mathematical models</topic><topic>Matrices</topic><topic>Model reduction</topic><topic>Simulations</topic><topic>Subspaces</topic><topic>Vector fields</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>PENG, LIQIAN</creatorcontrib><creatorcontrib>MOHSENI, KAMRAN</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>SIAM journal on numerical analysis</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>PENG, LIQIAN</au><au>MOHSENI, KAMRAN</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS</atitle><jtitle>SIAM journal on numerical analysis</jtitle><date>2014-01-01</date><risdate>2014</risdate><volume>52</volume><issue>4</issue><spage>1928</spage><epage>1952</epage><pages>1928-1952</pages><issn>0036-1429</issn><eissn>1095-7170</eissn><abstract>This article discusses a newly developed online manifold learning method, subspace iteration using reduced models (SIRM), for the dimensionality reduction of dynamical systems. This method may be viewed as subspace iteration combined with a model reduction procedure. Specifically, starting with a test solution, the method solves a reduced model to obtain a more precise solution, and it repeats this process until sufficient accuracy is achieved. The reduced model is obtained by projecting the full model onto a subspace that is spanned by the dominant modes of an extended data ensemble. The extended data ensemble in this article contains not only the state vectors of some snapshots of the approximate solution from the previous iteration but also the associated tangent vectors. Therefore, the proposed manifold learning method takes advantage of the information of the original dynamical system to reduce the dynamics. Moreover, the learning procedure is computed in the online stage, as opposed to being computed offline, which is used in many projection-based model reduction techniques that require prior calculations or experiments. After providing an error bound of the classical POD-Galerkin method in terms of the projection error and the initial condition error, we prove that the sequence of approximate solutions converge to the actual solution of the original system as long as the vector field of the full model is locally Lipschitz on an open set that contains the solution trajectory. Good accuracy of the proposed method has been demonstrated in two numerical examples, from a linear advection-diffusion equation to a non-linear Burgers equation. In order to save computational cost, the SIRM method is extended to a local model reduction approach by partitioning the entire time domain into several subintervals and obtaining a series of local reduced models of much lower dimensionality. The accuracy and efficiency of the local SIRM are shown through the numerical simulation of the Navier–Stokes equation in a lid-driven cavity flow problem.</abstract><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/130927723</doi><tpages>25</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0036-1429 |
ispartof | SIAM journal on numerical analysis, 2014-01, Vol.52 (4), p.1928-1952 |
issn | 0036-1429 1095-7170 |
language | eng |
recordid | cdi_proquest_miscellaneous_1567137884 |
source | SIAM Journals Online; JSTOR Mathematics & Statistics; Jstor Complete Legacy |
subjects | Accuracy Burger equation Cauchy problem Dynamical systems Eigenfunctions Error rates Internal flow Iterative methods Iterative solutions Learning Manifolds Mathematical models Matrices Model reduction Simulations Subspaces Vector fields |
title | AN ONLINE MANIFOLD LEARNING APPROACH FOR MODEL REDUCTION OF DYNAMICAL SYSTEMS |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-23T17%3A55%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=AN%20ONLINE%20MANIFOLD%20LEARNING%20APPROACH%20FOR%20MODEL%20REDUCTION%20OF%20DYNAMICAL%20SYSTEMS&rft.jtitle=SIAM%20journal%20on%20numerical%20analysis&rft.au=PENG,%20LIQIAN&rft.date=2014-01-01&rft.volume=52&rft.issue=4&rft.spage=1928&rft.epage=1952&rft.pages=1928-1952&rft.issn=0036-1429&rft.eissn=1095-7170&rft_id=info:doi/10.1137/130927723&rft_dat=%3Cjstor_proqu%3E24512175%3C/jstor_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1567137884&rft_id=info:pmid/&rft_jstor_id=24512175&rfr_iscdi=true |