58.2NAJun 1
A Parareal Algorithm with Low-Rank Coarse SolversMartin J. Gander, Mario Ohlberger, Stephan Rave
We consider a new class of Parareal algorithms, which use ideas from localized reduced basis methods to construct the coarse solver from truncated SVD approximations of the transfer operators mapping initial values for a given time interval to the solution at the end of the interval. By leveraging randomized singular value decompositions, these low-rank approximations are obtained embarrassingly parallel by computing local fine solutions for random initial values. We show a priori and a posteriori error bounds in terms of the computed singular values of the transfer operators. Our numerical experiments demonstrate that our approach can significantly outperform Parareal with single-step coarse solvers. At the same time, it permits to further increase parallelism in Parareal by trading global iterations for a larger number of independent local solves.
MSMar 31, 2016Code
pyMOR - Generic Algorithms and Interfaces for Model Order ReductionRené Milk, Stephan Rave, Felix Schindler
Reduced basis methods are projection-based model order reduction techniques for reducing the computational complexity of solving parametrized partial differential equation problems. In this work we discuss the design of pyMOR, a freely available software library of model order reduction algorithms, in particular reduced basis methods, implemented with the Python programming language. As its main design feature, all reduction algorithms in pyMOR are implemented generically via operations on well-defined vector array, operator and discretization interface classes. This allows for an easy integration with existing open-source high-performance partial differential equation solvers without adding any model reduction specific code to these solvers. Besides an in-depth discussion of pyMOR's design philosophy and architecture, we present several benchmark results and numerical examples showing the feasibility of our approach.
NAJan 8, 2016
Reduced Basis Methods: Success, Limitations and Future ChallengesMario Ohlberger, Stephan Rave
Parametric model order reduction using reduced basis methods can be an effective tool for obtaining quickly solvable reduced order models of parametrized partial differential equation problems. With speedups that can reach several orders of magnitude, reduced basis methods enable high fidelity real-time simulations of complex systems and dramatically reduce the computational costs in many-query applications. In this contribution we analyze the methodology, mainly focussing on the theoretical aspects of the approach. In particular we discuss what is known about the convergence properties of these methods: when they succeed and when they are bound to fail. Moreover, we highlight some recent approaches employing nonlinear approximation techniques which aim to overcome the current limitations of reduced basis methods.
NAMar 8, 2018
MULTIBAT: Unified workflow for fast electrochemical 3D simulations of lithium-ion cells combining virtual stochastic microstructures, electrochemical degradation models and model order reductionJulian Feinauer, Simon Hein, Stephan Rave et al.
We present a simulation workflow for efficient investigations of the interplay between 3D lithium-ion electrode microstructures and electrochemical performance, with emphasis on lithium plating. Our approach addresses several challenges. First, the 3D microstructures of porous electrodes are generated by a parametric stochastic model, in order to significantly reduce the necessity of tomographic imaging. Secondly, we integrate a consistent microscopic, 3D spatially-resolved physical model for the electrochemical behavior of the lithium-ion cells taking lithium plating and stripping into account. This highly non-linear mathematical model is solved numerically on the complex 3D microstructures to compute the transient cell behavior. Due to the complexity of the model and the considerable size of realistic microstructures even a single charging cycle of the battery requires several hours computing time. This renders large scale parameter studies extremely time consuming. Hence, we develop a mathematical model order reduction scheme. We demonstrate how these aspects are integrated into one unified workflow, which is a step towards computer aided engineering for the development of more efficient lithium-ion cells.
NAJul 30, 2014
A numerically stable a posteriori error estimator for reduced basis approximations of elliptic equationsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
The Reduced Basis (RB) method is a well established method for the model order reduction of problems formulated as parametrized partial differential equations. One crucial requirement for the application of RB schemes is the availability of an a posteriori error estimator to reliably estimate the error introduced by the reduction process. However, straightforward implementations of standard residual based estimators show poor numerical stability, rendering them unusable if high accuracy is required. In this work we propose a new algorithm based on representing the residual with respect to a dedicated orthonormal basis, which is both easy to implement and requires little additional computational overhead. A numerical example is given to demonstrate the performance of the proposed algorithm.
NANov 29, 2016
ArbiLoMod, a Simulation Technique Designed for Arbitrary Local ModificationsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
Engineers manually optimizing a structure using Finite Element based simulation software often employ an iterative approach where in each iteration they change the structure slightly and resimulate. Standard Finite Element based simulation software is usually not well suited for this workflow, as it restarts in each iteration, even for tiny changes. In settings with complex local microstructure, where a fine mesh is required to capture the geometric detail, localized model reduction can improve this workflow. To this end, we introduce ArbiLoMod, a method which allows fast recomputation after arbitrary local modifications. It employs a domain decomposition and a localized form of the Reduced Basis Method for model order reduction. It assumes that the reduced basis on many of the unchanged domains can be reused after a localized change. The reduced model is adapted when necessary, steered by a localized error indicator. The global error introduced by the model order reduction is controlled by a robust and efficient localized a posteriori error estimator, certifying the quality of the result. We demonstrate ArbiLoMod for a coercive, parameterized example with changing structure.
NAFeb 29, 2016
Model Reduction for Multiscale Lithium-Ion Battery SimulationMario Ohlberger, Stephan Rave, Felix Schindler
In this contribution we are concerned with efficient model reduction for multiscale problems arising in lithium-ion battery modeling with spatially resolved porous electrodes. We present new results on the application of the reduced basis method to the resulting instationary 3D battery model that involves strong non-linearities due to Buttler-Volmer kinetics. Empirical operator interpolation is used to efficiently deal with this issue. Furthermore, we present the localized reduced basis multiscale method for parabolic problems applied to a thermal model of batteries with resolved porous electrodes. Numerical experiments are given that demonstrate the reduction capabilities of the presented approaches for these real world applications.
NADec 8, 2016
True Error Control for the Localized Reduced Basis Method for Parabolic ProblemsMario Ohlberger, Stephan Rave, Felix Schindler
We present an abstract framework for a posteriori error estimation for approximations of scalar parabolic evolution equations, based on elliptic reconstruction techniques [10, 9, 3, 5]. In addition to its original application (to derive error estimates on the discretization error), we extend the scope of this framework to derive offline/online decomposable a posteriori estimates on the model reduction error in the context of Reduced Basis (RB) methods. In addition, we present offline/online decomposable a posteriori error estimates on the full approximation error (including discretization as well as model reduction error) in the context of the localized RB method [14]. Hence, this work generalizes the localized RB method with true error certification to parabolic problems. Numerical experiments are given to demonstrate the applicability of the approach.
NAFeb 21, 2018
Hierarchical Approximate Proper Orthogonal DecompositionChristian Himpe, Tobias Leibner, Stephan Rave
Proper Orthogonal Decomposition (POD) is a widely used technique for the construction of low-dimensional approximation spaces from high-dimensional input data. For large-scale applications and an increasing amount of input data vectors, however, computing the POD often becomes prohibitively expensive. This work presents a generic, easy-to-implement approach to compute an approximate POD based on arbitrary tree hierarchies of worker nodes, where each worker computes a POD of only a small amount of input vectors. The tree hierarchy can be freely adapted to optimally suit the available computational resources. In particular, this hierarchical approximate POD (HAPOD) allows for both simple parallelization with low communication overhead, as well as live sequential POD computation under restricted memory capacities. Rigorous error estimates ensure the reliability of our approach, and extensive numerical examples underline its performance.
NADec 5, 2016
ArbiLoMod: Local Solution Spaces by Random Training in ElectrodynamicsAndreas Buhr, Christian Engwer, Mario Ohlberger et al.
The simulation method ArbiLoMod has the goal to provide users of Finite Element based simulation software with quick re-simulation after localized changes to the model under consideration. It generates a Reduced Order Model (ROM) for the full model without ever solving the full model. To this end, a localized variant of the Reduced Basis method is employed, solving only small localized problems in the generation of the reduced basis. The key to quick re-simulation lies in recycling most of the localized basis vectors after a localized model change. In this publication, ArbiLoMod's local training algorithm is analyzed numerically for the non-coercive problem of time harmonic Maxwell's equations in 2D, formulated in H(curl).
NAJun 16, 2016
Localized Reduced Basis Approximation of a Nonlinear Finite Volume Battery Model with Resolved Electrode GeometryMario Ohlberger, Stephan Rave
In this contribution we present first results towards localized model order reduction for spatially resolved, three-dimensional lithium-ionbattery models. We introduce a localized reduced basis scheme based on non-conforming local approximation spaces stemming from a finite volume discretizationof the analytical model and localized empirical operator interpolation for the approximation of the model's nonlinearities. Numerical examples are provided indicating the feasibility of our approach.
NAMay 4, 2018
Mass Conservative Reduced Order Modeling of a Free Boundary Osmotic Cell Swelling ProblemChristoph Lehrenfeld, Stephan Rave
We consider model order reduction for a free boundary problem of an osmotic cell that is parameterized by material parameters as well as the initial shape of the cell. Our approach is based on an Arbitrary-Lagrangian-Eulerian description of the model that is discretized by a mass-conservative finite element scheme. Using reduced basis techniques and empirical interpolation, we construct a parameterized reduced order model in which the mass conservation property of the full-order model is exactly preserved. Numerical experiments are provided that highlight the performance of the resulting reduced order model.
NAMar 21, 2019
A locally conservative reduced flux reconstruction for elliptic problemsStephan Rave, Felix Schindler
In the context of model order reduction of parametric elliptic problems, we present a methodology to reconstruct a conforming flux from a given reduced solution, that is locally conservative with respect to the underlying finite element grid. All components of the procedure depend separably on the parameter and allow for further use in offline/online decomposed computations, for instance in the context of a posterior error estimation or flow problems.
GLApr 27, 2020
An Environment for Sustainable Research Software in Germany and Beyond: Current State, Open Challenges, and Call for ActionHartwig Anzt, Felix Bach, Stephan Druskat et al.
Research software has become a central asset in academic research. It optimizes existing and enables new research methods, implements and embeds research knowledge, and constitutes an essential research product in itself. Research software must be sustainable in order to understand, replicate, reproduce, and build upon existing research or conduct new research effectively. In other words, software must be available, discoverable, usable, and adaptable to new needs, both now and in the future. Research software therefore requires an environment that supports sustainability. Hence, a change is needed in the way research software development and maintenance are currently motivated, incentivized, funded, structurally and infrastructurally supported, and legally treated. Failing to do so will threaten the quality and validity of research. In this paper, we identify challenges for research software sustainability in Germany and beyond, in terms of motivation, selection, research software engineering personnel, funding, infrastructure, and legal aspects. Besides researchers, we specifically address political and academic decision-makers to increase awareness of the importance and needs of sustainable research software practices. In particular, we recommend strategies and measures to create an environment for sustainable research software, with the ultimate goal to ensure that software-driven research is valid, reproducible and sustainable, and that software is recognized as a first class citizen in research. This paper is the outcome of two workshops run in Germany in 2019, at deRSE19 - the first International Conference of Research Software Engineers in Germany - and a dedicated DFG-supported follow-up workshop in Berlin.
GLSep 19, 2019
Sustainable Research Software Hand-OverJörg Fehr, Christian Himpe, Stephan Rave et al.
Scientific software projects evolve rapidly in their initial development phase, yet at the end of a funding period, the completion of a research project, thesis, or publication, further engagement in the project may slow down or cease completely. To retain the invested effort for the sciences, this software needs to be preserved or handed over to a succeeding developer or team, such as the next generation of (PhD) students. Comparable guides provide top-down recommendations for project leads. This paper intends to be a bottom-up approach for sustainable hand-over processes from a developer's perspective. An important characteristic in this regard is the project's size, by which this guideline is structured. Furthermore, checklists are provided, which can serve as a practical guide for implementing the proposed measures.