Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

A blackbox reduced-basis output bound method for noncoercive linear problems

Patera, Adolf, Rovas Dimitrios, Maday, Yvon, 1957-

Full record


URI: http://purl.tuc.gr/dl/dias/273BE9BB-E03F-475A-8F0D-BD447E27678F
Year 2002
Type of Item Peer-Reviewed Journal Publication
License
Details
Bibliographic Citation Y. Maday, A.T. Patera, D.V. Rovas ," A blackbox reduced-basis output bound method for noncoercive linear problems," Studies in Math. and Its Appl.,vol.31,2002. doi: 10.1016/S0168-2024(02)80025-X https://doi.org/10.1016/S0168-2024(02)80025-X
Appears in Collections

Summary

We present a reduced-basis output bound method for noncoercive linear problems and linear output functionals. The method is based upon (i) an enriched reduced basis comprising not only primal and dual solutions but also infimizers of the inf-sup condition associated with the bilinear form, (ii) {\sl either} a Galerkin {\sl or} a (more stable) two-space minimum-residual discretization, and (iii) an output error estimator formed from the dual norms of the primal and dual residuals and an approximation to the inf-sup parameter. The necessary calculations are effected by a blackbox superposition approach which exploits special (affine) parametric structure in the underlying operator: the operation count for the ``on-line" stage of the computational procedure depends only on the dimension of the reduced-basis space and the complexity of the parametric representation. For the minimum-residual formulation we can prove the optimality of the output approximation as well as the optimality and asymptotic bounding property of the output error estimator; thanks to the latter, only a minimal number of modes may be {\sl (safely)} retained. Numerical results are presented for a particular application: the Helmholtz equation.

Services

Statistics