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

Multi-parameter polynomial order reduction of linear finite element models

Author

Listed:
  • Ortwin Farle
  • Volker Hill
  • Pär Ingelström
  • Romanus Dyczij-Edlinger

Abstract

In this paper we present a numerically stable method for the model order reduction of finite element (FE) approximations to passive microwave structures parameterized by polynomials in several variables. The proposed method is a projection-based approach using Krylov subspaces and extends the works of Gunupudi etal . (P. Gunupudi, R. Khazaka and M. Nakhla, Analysis of transmission line circuits using multidimensional model reduction techniques , IEEE Trans. Adv. Packaging 25 (2002), pp. 174--180) and Slone etal . (R.D. Slone, R. Lee and J.-F. Lee, Broadband model order reduction of polynomial matrix equations using single-point well-conditioned asymptotic waveform evaluation: derivations and theory , Int. J. Numer. Meth. Eng. 58 (2003), pp. 2325--2342). First, we present the multivariate Krylov space of higher order associated with a parameter-dependent right-hand-side vector and derive a general recursion for generating its basis. Next, we propose an advanced algorithm to compute such basis in a numerically stable way. Finally, we apply the Krylov basis to construct a reduced order model of the moment-matching type. The resulting single-point method requires one matrix factorization only. Numerical examples demonstrate the efficiency and reliability of our approach.

Suggested Citation

  • Ortwin Farle & Volker Hill & Pär Ingelström & Romanus Dyczij-Edlinger, 2007. "Multi-parameter polynomial order reduction of linear finite element models," Mathematical and Computer Modelling of Dynamical Systems, Taylor & Francis Journals, vol. 14(5), pages 421-434, July.
    • Handle: RePEc:taf:nmcmxx:v:14:y:2007:i:5:p:421-434
    DOI: 10.1080/13873950701844220
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/13873950701844220
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/13873950701844220?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:14:y:2007:i:5:p:421-434. 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.