This book provides a thorough introduction to the mathematical and algorithmic aspects of certified reduced basis methods for parametrized partial differential equations. Central aspects ranging from model construction, error estimation and computational efficiency to empirical interpolation methods are discussed in detail for coercive problems. More advanced aspects associated with time-dependent problems, non-compliant and non-coercive problems and applications with geometric variation are also discussed as examples.

This book provides a basic introduction to reduced basis (RB) methods for problems involving the repeated solution of partial differential equations (PDEs) arising from engineering and applied sciences, such as PDEs depending on several parameters and PDE-constrained optimization. The book presents a general mathematical formulation of RB methods, analyzes their fundamental theoretical properties, discusses the related algorithmic and implementation aspects, and highlights their built-in algebraic and geometric structures. More specifically, the authors discuss alternative strategies for constructing accurate RB spaces using greedy algorithms and proper orthogonal decomposition techniques, investigate their approximation properties and analyze offline-online decomposition strategies aimed at the reduction of computational complexity. Furthermore, they carry out both a priori and a posteriori error analysis. The whole mathematical presentation is made more stimulating by the use of representative examples of applicative interest in the context of both linear and nonlinear PDEs. Moreover, the inclusion of many pseudocodes allows the reader to easily implement the algorithms illustrated throughout the text. The book will be ideal for upper undergraduate students and, more generally, people interested in scientific computing. All these pseudocodes are in fact implemented in a MATLAB package that is freely available at https://github.com/redbkit

Many physical, chemical, biomedical, and technical processes can be described by partial differential equations or dynamical systems. In spite of increasing computational capacities, many problems are of such high complexity that they are solvable only with severe simplifications, and the design of efficient numerical schemes remains a central research challenge. This book presents a tutorial introduction to recent developments in mathematical methods for model reduction and approximation of complex systems. Model Reduction and Approximation: Theory and Algorithms contains three parts that cover (I) sampling-based methods, such as the reduced basis method and proper orthogonal decomposition, (II) approximation of high-dimensional problems by low-rank tensor techniques, and (III) system-theoretic methods, such as balanced truncation, interpolatory methods, and the Loewner framework. It is tutorial in nature, giving an accessible introduction to state-of-the-art model reduction and approximation methods. It also covers a wide range of methods drawn from typically distinct communities (sampling based, tensor based, system-theoretic).?? This book is intended for researchers interested in model reduction and approximation, particularly graduate students and young researchers.

The maximum principle induces an order structure for partial differential equations, and has become an important tool in nonlinear analysis. This book is the first of two volumes to systematically introduce the applications of order structure in certain nonlinear partial differential equation problems.The maximum principle is revisited through the use of the Krein-Rutman theorem and the principal eigenvalues. Its various versions, such as the moving plane and sliding plane methods, are applied to a variety of important problems of current interest. The upper and lower solution method, especially its weak version, is presented in its most up-to-date form with enough generality to cater for wide applications. Recent progress on the boundary blow-up problems and their applications are discussed, as well as some new symmetry and Liouville type results over half and entire spaces. Some of the results included here are published for the first time.

An increasing complexity of models used to predict real-world systems leads to the need for algorithms to replace complex models with far simpler ones, while preserving the accuracy of the predictions. This two-volume handbook covers methods as well as applications. This second volume focuses on applications in engineering, biomedical engineering, computational physics and computer science.