@article {2017, title = {Reduced Basis Methods for Uncertainty Quantification}, journal = {SIAM/ASA Journal on Uncertainty Quantification}, volume = {5}, year = {2017}, month = {08/2017}, pages = {869}, type = {reviewed}, chapter = {813}, abstract = {

In this work we review a reduced basis method for the solution of uncertainty quantification problems. Based on the basic setting of an elliptic partial differential equation with random input, we introduce the key ingredients of the reduced basis method, including proper orthogonal decomposition and greedy algorithms for the construction of the reduced basis functions, a priori and a posteriori error estimates for the reduced basis approximations, as well as its computational advantages and weaknesses in comparison with a stochastic collocation method [I. Babu{\v s}ka, F. Nobile, and R. Tempone,\ SIAM Rev., 52 (2010), pp. 317--355]. We demonstrate its computational efficiency and accuracy for a benchmark problem with parameters ranging from a few to a few hundred dimensions. Generalizations to more complex models and applications to uncertainty quantification problems in risk prediction, evaluation of statistical moments, Bayesian inversion, and optimal control under uncertainty are also presented to illustrate how to use the reduced basis method in practice. Further challenges, advancements, and research opportunities are outlined.


Read More:\ http://epubs.siam.org/doi/abs/10.1137/151004550

}, author = {Peng Chen and Alfio Quarteroni and Gianluigi Rozza} } @article {2015, title = {Reduced basis method and domain decomposition for elliptic problems in networks and complex parametrized geometries}, journal = {Computers and Mathematics with Applications }, volume = {71}, year = {2016}, month = {01/2016}, pages = {430}, publisher = {Elsevier}, chapter = {408}, abstract = {The aim of this work is to solve parametrized partial differential equations in computational domains represented by networks of repetitive geometries by combining reduced basis and domain decomposition techniques. The main idea behind this approach is to compute once, locally and for few reference shapes, some representative finite element solutions for different values of the parameters and with a set of different suitable boundary conditions on the boundaries: these functions will represent the basis of a reduced space where the global solution is sought for. The continuity of the latter is assured by a classical domain decomposition approach. Test results on Poisson problem show the flexibility of the proposed method in which accuracy and computational time may be tuned by varying the number of reduced basis functions employed, or the set of boundary conditions used for defining locally the basis functions. The proposed approach simplifies the pre-computation of the reduced basis space by splitting the global problem into smaller local subproblems. Thanks to this feature, it allows dealing with arbitrarily complex network and features more flexibility than a classical global reduced basis approximation where the topology of the geometry is fixed.}, author = {Laura Iapichino and Alfio Quarteroni and Gianluigi Rozza} } @conference {IapichinoQuarteroniRozzaVolkwein2014, title = {Reduced basis method for the Stokes equations in decomposable domains using greedy optimization}, booktitle = {ECMI 2014 proceedings}, year = {2014}, pages = {1{\textendash}7}, author = {Laura Iapichino and Alfio Quarteroni and Gianluigi Rozza and Volkwein, Stefan} } @book {2014, title = {Reduced Order Methods for Modeling and Computational Reduction}, series = {MS\&A}, volume = {9}, year = {2014}, pages = {334}, publisher = {Springer}, organization = {Springer}, edition = {1}, address = {Milano}, abstract = {

This monograph addresses the state of the art of reduced order methods for modeling and computational reduction of complex parametrized systems, governed by ordinary and/or partial differential equations, with a special emphasis on real time computing techniques and applications in computational mechanics, bioengineering and computer graphics.

Several topics are covered, including: design, optimization, and control theory in real-time with applications in engineering; data assimilation, geometry registration, and parameter estimation with special attention to real-time computing in biomedical engineering and computational physics; real-time visualization of physics-based simulations in computer science; the treatment of high-dimensional problems in state space, physical space, or parameter space; the interactions between different model reduction and dimensionality reduction approaches; the development of general error estimation frameworks which take into account both model and discretization effects.

This book is primarily addressed to computational scientists interested in computational reduction techniques for large scale differential problems.

}, keywords = {reduced order methods, MOR, ROM, POD, RB, greedy, CFD, Numerical Analysis}, issn = {978-3-319-02089-1}, doi = {10.1007/978-3-319-02090-7}, author = {Alfio Quarteroni and Gianluigi Rozza} } @article {NegriRozzaManzoniQuarteroni2013, title = {Reduced basis method for parametrized elliptic optimal control problems}, journal = {SIAM Journal on Scientific Computing}, volume = {35}, number = {5}, year = {2013}, pages = {A2316{\textendash}A2340}, abstract = {We propose a suitable model reduction paradigm-the certified reduced basis method (RB)-for the rapid and reliable solution of parametrized optimal control problems governed by partial differential equations. In particular, we develop the methodology for parametrized quadratic optimization problems with elliptic equations as a constraint and infinite-dimensional control variable. First, we recast the optimal control problem in the framework of saddle-point problems in order to take advantage of the already developed RB theory for Stokes-type problems. Then, the usual ingredients of the RB methodology are called into play: a Galerkin projection onto a low-dimensional space of basis functions properly selected by an adaptive procedure; an affine parametric dependence enabling one to perform competitive offline-online splitting in the computational procedure; and an efficient and rigorous a posteriori error estimate on the state, control, and adjoint variables as well as on the cost functional. Finally, we address some numerical tests that confirm our theoretical results and show the efficiency of the proposed technique.}, doi = {10.1137/120894737}, author = {Federico Negri and Gianluigi Rozza and Andrea Manzoni and Alfio Quarteroni} } @article {2013, title = {A Reduced Computational and Geometrical Framework for Inverse Problems in Haemodynamics}, number = {SISSA preprint;15/2013/MATE}, year = {2013}, institution = {SISSA}, author = {Toni Lassila and Andrea Manzoni and Alfio Quarteroni and Gianluigi Rozza} } @article {2013, title = {A reduced-order strategy for solving inverse Bayesian identification problems in physiological flows}, number = {SISSA preprint;14/2013/MATE}, year = {2013}, institution = {SISSA}, author = {Toni Lassila and Andrea Manzoni and Alfio Quarteroni and Gianluigi Rozza} }