A priori convergence of the Greedy algorithm for the parametrized reduced basis method
The convergence and efficiency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elements that constitute the "reduced basis". The purpose of this paper is to analyze the a prior...
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
Cambridge University Press,
2013-07-10T19:53:50Z.
|
Subjects: | |
Online Access: | Get fulltext |