IDEAS home Printed from https://ideas.repec.org/a/taf/nmcmxx/v17y2010i4p423-442.html
   My bibliography  Save this article

A training set and multiple bases generation approach for parameterized model reduction based on adaptive grids in parameter space

Author

Listed:
  • Bernard Haasdonk
  • Markus Dihlmann
  • Mario Ohlberger

Abstract

Modern simulation scenarios require real-time or many-query responses from a simulation model. This is the driving force for increased efforts in model order reduction for high-dimensional dynamical systems or partial differential equations. This demand for fast simulation models is even more critical for parameterized problems. Several snapshot-based methods for basis construction exist for parameterized model order reduction, for example, proper orthogonal decomposition or reduced basis methods. They require the careful choice of samples for generation of the reduced model. In this article we address two types of grid-based adaptivity that can be beneficial in such basis generation procedures. First, we describe an approach for training set adaptivity . Second, we introduce an approach for multiple bases on adaptive parameter domain partitions . Due to the modularity, both methods also can easily be combined. They result in efficient reduction schemes with accelerated training times, improved approximation properties and control on the reduced basis size. We demonstrate the applicability of the approaches for instationary partial differential equations and parameterized dynamical systems.

Suggested Citation

  • Bernard Haasdonk & Markus Dihlmann & Mario Ohlberger, 2010. "A training set and multiple bases generation approach for parameterized model reduction based on adaptive grids in parameter space," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 17(4), pages 423-442, November.
  • Handle: RePEc:taf:nmcmxx:v:17:y:2010:i:4:p:423-442
    DOI: 10.1080/13873954.2011.547674
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873954.2011.547674
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/13873954.2011.547674?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:nmcmxx:v:17:y:2010:i:4:p:423-442. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/NMCM20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.