Universität Stuttgart
Permanent URI for this communityhttps://elib.uni-stuttgart.de/handle/11682/1
Browse
9 results
Search Results
Item Open Access Analysis of target data-dependent greedy kernel algorithms : convergence rates for f-, f· P- and f/P-greedy(2022) Wenzel, Tizian; Santin, Gabriele; Haasdonk, BernardData-dependent greedy algorithms in kernel spaces are known to provide fast converging interpolants, while being extremely easy to implement and efficient to run. Despite this experimental evidence, no detailed theory has yet been presented. This situation is unsatisfactory, especially when compared to the case of the data-independent P-greedy algorithm, for which optimal convergence rates are available, despite its performances being usually inferior to the ones of target data-dependent algorithms. In this work, we fill this gap by first defining a new scale of greedy algorithms for interpolation that comprises all the existing ones in a unique analysis, where the degree of dependency of the selection criterion on the functional data is quantified by a real parameter. We then prove new convergence rates where this degree is taken into account, and we show that, possibly up to a logarithmic factor, target data-dependent selection strategies provide faster convergence. In particular, for the first time we obtain convergence rates for target data adaptive interpolation that are faster than the ones given by uniform points, without the need of any special assumption on the target function. These results are made possible by refining an earlier analysis of greedy algorithms in general Hilbert spaces. The rates are confirmed by a number of numerical examples.Item Open Access Well-scaled, a-posteriori error estimation for model order reduction of large second-order mechanical systems(2019) Grunert, Dennis; Fehr, Jörg; Haasdonk, BernardModel Order Reduction is used to vastly speed up simulations but it also introduces an error to the simulation results, which needs to be controlled. The performance of the general to use, a-posteriori error estimator of Ruiner et al. for second-order systems is analyzed and a bottleneck is found in the offline stage making it unusable for larger models. We use the spectral theorem, power series expansions, monotonicity properties, and self-tailored algorithms to speed up the offline stage largely by one polynomial order both in terms of computation time as well as storage complexity. All properties are proven rigorously. This eliminates the aforementioned bottleneck. Hence, the error estimator of Ruiner et al. can finally be used for large, linear, second-order mechanical systems reduced by any model reduction method based on Petrov-Galerkin reduction. The examples show speedups of up to 28.000 and the ability to compute much larger systems with a fixed amount of memory.Item Open Access Symplectic model order reduction with non-orthonormal bases(2019) Buchfink, Patrick; Bhatt, Ashish; Haasdonk, BernardParametric high-fidelity simulations are of interest for a wide range of applications. But the restriction of computational resources renders such models to be inapplicable in a real-time context or in multi-query scenarios. Model order reduction (MOR) is used to tackle this issue. Recently, MOR is extended to preserve specific structures of the model throughout the reduction, e.g. structure-preserving MOR for Hamiltonian systems. This is referred to as symplectic MOR. It is based on the classical projection-based MOR and uses a symplectic reduced order basis (ROB). Such a ROB can be derived in a data-driven manner with the Proper Symplectic Decomposition (PSD) in the form of a minimization problem. Due to the strong nonlinearity of the minimization problem, it is unclear how to efficiently find a global optimum. In our paper, we show that current solution procedures almost exclusively yield suboptimal solutions by restricting to orthonormal ROBs. As new methodological contribution, we propose a new method which eliminates this restriction by generating non-orthonormal ROBs. In the numerical experiments, we examine the different techniques for a classical linear elasticity problem and observe that the non-orthonormal technique proposed in this paper shows superior results with respect to the error introduced by the reduction.Item Open Access Port-Hamiltonian fluid-structure interaction modelling and structure-preserving model order reduction of a classical guitar(2023) Rettberg, Johannes; Wittwar, Dominik; Buchfink, Patrick; Brauchler, Alexander; Ziegler, Pascal; Fehr, Jörg; Haasdonk, BernardItem Open Access Greedy kernel methods for approximating breakthrough curves for reactive flow from 3D porous geometry data(2024) Herkert, Robin; Buchfink, Patrick; Wenzel, Tizian; Haasdonk, Bernard; Toktaliev, Pavel; Iliev, OlegWe address the challenging application of 3D pore scale reactive flow under varying geometry parameters. The task is to predict time-dependent integral quantities, i.e., breakthrough curves, from the given geometries. As the 3D reactive flow simulation is highly complex and computationally expensive, we are interested in data-based surrogates that can give a rapid prediction of the target quantities of interest. This setting is an example of an application with scarce data, i.e., only having a few available data samples, while the input and output dimensions are high. In this scarce data setting, standard machine learning methods are likely to fail. Therefore, we resort to greedy kernel approximation schemes that have shown to be efficient meshless approximation techniques for multivariate functions. We demonstrate that such methods can efficiently be used in the high-dimensional input/output case under scarce data. Especially, we show that the vectorial kernel orthogonal greedy approximation (VKOGA) procedure with a data-adapted two-layer kernel yields excellent predictors for learning from 3D geometry voxel data via both morphological descriptors or principal component analysis.Item Open Access Efficient parametric analysis of the chemical master equation through model order reduction(2012) Waldherr, Steffen; Haasdonk, BernardBACKGROUND: Stochastic biochemical reaction networks are commonly modelled by the chemical master equation, and can be simulated as first order linear differential equations through a finite state projection. Due to the very high state space dimension of these equations, numerical simulations are computationally expensive. This is a particular problem for analysis tasks requiring repeated simulations for different parameter values. Such tasks are computationally expensive to the point of infeasibility with the chemical master equation.RESULTS:In this article, we apply parametric model order reduction techniques in order to construct accurate low-dimensional parametric models of the chemical master equation. These surrogate models can be used in various parametric analysis task such as identifiability analysis, parameter estimation, or sensitivity analysis. As biological examples, we consider two models for gene regulation networks, a bistable switch and a network displaying stochastic oscillations. CONCLUSIONS: The results show that the parametric model reduction yields efficient models of stochastic biochemical reaction networks, and that these models can be useful for systems biology applications involving parametric analysis problems such as parameter exploration, optimization, estimation or sensitivity analysis.Item Open Access Rigorous and effective a-posteriori error bounds for nonlinear problems : application to RB methods(2020) Schmidt, Andreas; Wittwar, Dominik; Haasdonk, BernardQuantifying the error that is induced by numerical approximation techniques is an important task in many fields of applied mathematics. Two characteristic properties of error bounds that are desirable are reliability and efficiency. In this article, we present an error estimation procedure for general nonlinear problems and, in particular, for parameter-dependent problems. With the presented auxiliary linear problem (ALP)-based error bounds and corresponding theoretical results, we can prove large improvements in the accuracy of the error predictions compared with existing error bounds. The application of the procedure in parametric model order reduction setting provides a particularly interesting setup, which is why we focus on the application in the reduced basis framework. Several numerical examples illustrate the performance and accuracy of the proposed method.Item Open Access Dictionary-based online-adaptive structure-preserving model order reduction for parametric Hamiltonian systems(2024) Herkert, Robin; Buchfink, Patrick; Haasdonk, BernardClassical model order reduction (MOR) for parametric problems may become computationally inefficient due to large sizes of the required projection bases, especially for problems with slowly decaying Kolmogorov n -widths. Additionally, Hamiltonian structure of dynamical systems may be available and should be preserved during the reduction. In the current presentation, we address these two aspects by proposing a corresponding dictionary-based, online-adaptive MOR approach. The method requires dictionaries for the state-variable, non-linearities, and discrete empirical interpolation (DEIM) points. During the online simulation, local basis extensions/simplifications are performed in an online-efficient way, i.e., the runtime complexity of basis modifications and online simulation of the reduced models do not depend on the full state dimension. Experiments on a linear wave equation and a non-linear Sine-Gordon example demonstrate the efficiency of the approach.Item Open Access Hermite kernel surrogates for the value function of high-dimensional nonlinear optimal control problems(2024) Ehring, Tobias; Haasdonk, BernardNumerical methods for the optimal feedback control of high-dimensional dynamical systems typically suffer from the curse of dimensionality. In the current presentation, we devise a mesh-free data-based approximation method for the value function of optimal control problems, which partially mitigates the dimensionality problem. The method is based on a greedy Hermite kernel interpolation scheme and incorporates context knowledge by its structure. Especially, the value function surrogate is elegantly enforced to be 0 in the target state, non-negative and constructed as a correction of a linearized model. The algorithm allows formulation in a matrix-free way which ensures efficient offline and online evaluation of the surrogate, circumventing the large-matrix problem for multivariate Hermite interpolation. Additionally, an incremental Cholesky factorization is utilized in the offline generation of the surrogate. For finite time horizons, both convergence of the surrogate to the value function and for the surrogate vs. the optimal controlled dynamical system are proven. Experiments support the effectiveness of the scheme, using among others a new academic model with an explicitly given value function. It may also be useful for the community to validate other optimal control approaches.