arXiv subjects

Mario Ohlberger

Publications and source records attributed to Mario Ohlberger.

At least 55 records · Page 3Linked to original sources

arXiv2016

True Error Control for the Localized Reduced Basis Method for Parabolic Problems

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.

math.NA↗

arXiv2016

ArbiLoMod: Local Solution Spaces by Random Training in Electrodynamics

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).

math.NA↗

arXiv2016

ArbiLoMod, a Simulation Technique Designed for Arbitrary Local Modifications

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.

math.NA↗

arXiv2016

Localized Reduced Basis Approximation of a Nonlinear Finite Volume Battery Model with Resolved Electrode Geometry

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.

math.NA↗

arXiv2016

Cross-Gramian-Based Model Reduction: A Comparison

As an alternative to the popular balanced truncation method, the cross Gramian matrix induces a class of balancing model reduction techniques. Besides the classical computation of the cross Gramian by a Sylvester matrix equation, an empirical cross Gramian can be computed based on simulated trajectories. This work assesses the cross Gramian and its empirical Gramian variant for state-space reduction on a procedural benchmark based to the cross Gramian itself.

math.OC↗

arXiv2016

Approximation of skewed interfaces with tensor-based model reduction procedures: application to the reduced basis hierarchical model reduction approach

In this article we introduce a procedure, which allows to recover the potentially very good approximation properties of tensor-based model reduction procedures for the solution of partial differential equations in the presence of interfaces or strong gradients in the solution which are skewed with respect to the coordinate axes. The two key ideas are the location of the interface either by solving a lower-dimensional partial differential equation or by using data functions and the subsequent removal of the interface of the solution by choosing the determined interface as the lifting function of the Dirichlet boundary conditions. We demonstrate in numerical experiments for linear elliptic equations and the reduced basis-hierarchical model reduction approach that the proposed procedure locates the interface well and yields a significantly improved convergence behavior even in the case when we only consider an approximation of the interface.

math.NA↗

arXiv2016

Model Reduction for Multiscale Lithium-Ion Battery Simulation

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.

math.NA↗

arXiv2016

Problem adapted Hierarchical Model Reduction for the Fokker-Planck equation

In this paper we introduce a new hierarchical model reduction framework for the Fokker-Planck equation. We reduce the dimension of the equation by a truncated basis expansion in the velocity variable, obtaining a hyperbolic system of equations in space and time. Unlike former methods like the Legendre moment models, the new framework generates a suitable problem-dependent basis of the reduced velocity space that mimics the shape of the solution in the velocity variable. To that end, we adapt the framework of [M. Ohlberger and K. Smetana. A dimensional reduction approach based on the application of reduced basis methods in the framework of hierarchical model reduction. SIAM J. Sci. Comput., 36(2):A714-A736, 2014] and derive initially a parametrized elliptic partial differential equation (PDE) in the velocity variable. Then, we apply ideas of the Reduced Basis method to develop a greedy-algorithm that selects the basis from solutions of the parametrized PDE. Numerical experiments demonstrate the potential of this new method.

math.NA↗

arXiv2016

Hierarchical model reduction of nonlinear partial differential equations based on the adaptive empirical projection method and reduced basis techniques

In this paper we extend the hierarchical model reduction framework based on reduced basis techniques for the application to nonlinear partial differential equations. The major new ingredient to accomplish this goal is the introduction of the adaptive empirical projection method, which is an adaptive integration algorithm based on the (generalized) empirical interpolation method. Different from other partitioning concepts for the empirical interpolation method we perform an adaptive decomposition of the spatial domain. We project both the variational formulation and the range of the nonlinear operator onto reduced spaces. Those reduced spaces combine the full dimensional (finite element) space in an identified dominant spatial direction and a reduction space or collateral basis space spanned by modal orthonormal basis functions in the transverse direction. Both the reduction and the collateral basis space are constructed in a highly nonlinear fashion by introducing a parametrized problem in the transverse direction and associated parametrized operator evaluations, and by applying reduced basis methods to select the bases from the corresponding snapshots. Rigorous a priori and a posteriori error estimators, which do not require additional regularity of the nonlinear operator are proven for the adaptive empirical projection method and then used to derive a rigorous a posteriori error estimator for the resulting hierarchical model reduction approach. Numerical experiments for an elliptic nonlinear diffusion equation demonstrate a fast convergence of the proposed dimensionally reduced approximation to the solution of the full-dimensional problem. Runtime experiments verify a close to linear scaling of the reduction method in the number of degrees of freedom used for the computations in the dominant direction.

math.NA↗

arXiv2016

Reduced Basis Methods: Success, Limitations and Future Challenges

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.

math.NA↗

arXiv2015

A Note on the Cross Gramian for Non-Symmetric Systems

The cross gramian matrix is a tool for model reduction and system identification, but it is only computable for square control systems. For symmetric systems the cross gramian possesses a useful relation to the system's associated Hankel singular values. Yet, many real-life models are neither square nor symmetric. In this work, concepts from decentralized control are used to approximate a cross gramian for non-symmetric and non-square systems. To illustrate this new non-symmetric cross gramian, it is applied in the context of model order reduction.

math.OC↗

arXiv2015

A new Heterogeneous Multiscale Method for time-harmonic Maxwell's equations based on divergence-regularization

In this paper, we suggest a new heterogeneous multiscale method (HMM) for the time-harmonic Maxwell equations in locally periodic media. The method is constructed by using a divergence-regularization in one of the cell problems. This allows us to introduce fine-scale correctors that are not subject to a cumbersome divergence-free constraint and which can hence easily be implemented. To analyze the method, we first revisit classical homogenization theory for time-harmonic Maxwell equations and derive a new homogenization result that makes use of the divergence-regularization in the two-scale homogenized equation. We then show that the HMM is equivalent to a discretization of this equation. In particular, writing both problems in a fully coupled two-scale formulation is the crucial starting point for a corresponding numerical analysis of the method. With this approach we are able to prove rigorous a priori error estimates in the $\mathbf{H}(\mbox{curl})$- and the $H^{-1}$-norm and we derive reliable and efficient localized residual-based a posteriori error estimates.

math.NA↗

arXiv2015

Error control for the localized reduced basis multi-scale method with adaptive on-line enrichment

In this contribution we consider localized, robust and efficient a-posteriori error estimation of the localized reduced basis multi-scale (LRBMS) method for parametric elliptic problems with possibly heterogeneous diffusion coefficient. The numerical treatment of such parametric multi-scale problems are characterized by a high computational complexity, arising from the multi-scale character of the underlying differential equation and the additional parameter dependence. The LRBMS method can be seen as a combination of numerical multi-scale methods and model reduction using reduced basis (RB) methods to efficiently reduce the computational complexity with respect to the multi-scale as well as the parametric aspect of the problem, simultaneously. In contrast to the classical residual based error estimators currently used in RB methods, we are considering error estimators that are based on conservative flux reconstruction and provide an efficient and rigorous bound on the full error with respect to the weak solution. In addition, the resulting error estimator is localized and can thus be used in the on-line phase to adaptively enrich the solution space locally where needed. The resulting certified LRBMS method with adaptive on-line enrichment thus guarantees the quality of the reduced solution during the on-line phase, given any (possibly insufficient) reduced basis that was generated during the offline phase. Numerical experiments are given to demonstrate the applicability of the resulting algorithm with online enrichment to single phase flow in heterogeneous media.

math.NA↗

arXiv2014

Adaptive Heterogeneous Multiscale Methods for immiscible two-phase flow in porous media

In this contribution we present the first formulation of a heterogeneous multiscale method for an incompressible immiscible two-phase flow system with degenerate permeabilities. The method is in a general formulation which includes oversampling. We do not specify the discretization of the derived macroscopic equation, but we give two examples of possible realizations, suggesting a finite element solver for the fine scale and a vertex centered finite volume method for the effective coarse scale equations. Assuming periodicity, we show that the method is equivalent to a discretization of the homogenized equation. We provide an a-posteriori estimate for the error between the homogenized solutions of the pressure and saturation equations and the corresponding HMM approximations. The error estimate is based on the results recently achieved in [C. Canc{è}s, I. S. Pop, and M. Vohral\'ık. An a posteriori error estimate for vertex-centered finite volume discretizations of immiscible incompressible two-phase flow. Math. Comp., 2014].

math.NA↗

arXiv2014

A numerically stable a posteriori error estimator for reduced basis approximations of elliptic equations

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.

math.NA↗

arXiv2014

A-posteriori error estimates for the localized reduced basis multi-scale method

We present a localized a-posteriori error estimate for the localized reduced basis multi-scale (LRBMS) method [Albrecht, Haasdonk, Kaulmann, Ohlberger (2012): The localized reduced basis multiscale method]. The LRBMS is a combination of numerical multi-scale methods and model reduction using reduced basis methods to efficiently reduce the computational complexity of parametric multi-scale problems with respect to the multi-scale parameter $\varepsilon$ and the online parameter $μ$ simultaneously. We formulate the LRBMS based on a generalization of the SWIPDG discretization presented in [Ern, Stephansen, Vohralik (2010): Guaranteed and robust discontinuous Galerkin a posteriori error estimates for convection-diffusion-reaction problems] on a coarse partition of the domain that allows for any suitable discretization on the fine triangulation inside each coarse grid element. The estimator is based on the idea of a conforming reconstruction of the discrete diffusive flux, that can be computed using local information only. It is offline/online decomposable and can thus be efficiently used in the context of model reduction.

math.NA↗

arXiv2014

The Localized Reduced Basis Multiscale method for two-phase flows in porous media

In this work, we propose a novel model order reduction approach for two-phase flow in porous media by introducing a formulation in which the mobility, which realizes the coupling between phase saturations and phase pressures, is regarded as a parameter to the pressure equation. Using this formulation, we introduce the Localized Reduced Basis Multiscale method to obtain a low-dimensional surrogate of the high-dimensional pressure equation. By applying ideas from model order reduction for parametrized partial differential equations, we are able to split the computational effort for solving the pressure equation into a costly offline step that is performed only once and an inexpensive online step that is carried out in every time step of the two-phase flow simulation, which is thereby largely accelerated. Usage of elements from numerical multiscale methods allows us to displace the computational intensity between the offline and online step to reach an ideal runtime at acceptable error increase for the two-phase flow simulation.

math.NA↗

arXiv2014

Cross-Gramian-Based Combined State and Parameter Reduction for Large-Scale Control Systems

This work introduces the empirical cross gramian for multiple-input-multiple-output systems. The cross gramian is a tool for reducing the state space of control systems, which conjoins controllability and observability information into a single matrix and does not require balancing. Its empirical gramian variant extends the application of the cross gramian to nonlinear systems. Furthermore, for parametrized systems, the empirical gramians can also be utilized for sensitivity analysis or parameter identification and thus for parameter reduction. This work also introduces the empirical joint gramian, which is derived from the empirical cross gramian. The joint gramian not only allows a reduction of the parameter space, but also the combined state and parameter space reduction, which is tested on a linear and a nonlinear control system. Controllability- and observability-based combined reduction methods are also presented, which are benchmarked against the joint gramian.

math.OC↗