510 Mathematik
Refine
Departments, institutes and facilities
Document Type
- Article (24)
- Conference Object (17)
- Part of a Book (10)
- Report (9)
- Book (monograph, edited volume) (6)
- Preprint (5)
- Doctoral Thesis (1)
Year of publication
Keywords
- Method of lines (5)
- Cutting sticks-Problem (3)
- Rosenbrock-Wanner Methods (3)
- Teilsummenaufteilung (3)
- Applications in Energy Transport (2)
- Approximated Jacobian (2)
- Complex Systems Modeling and Simulation (2)
- Cutting sticks problem (2)
- Exchangeable pairs (2)
- Lehrbuch (2)
- Mengenpartitionsproblem (2)
- Network simulation (2)
- Non-linear systems (2)
- Order reduction (2)
- Peer methods (2)
- Semi-Lagrangian (2)
- Set partition problem (2)
- Shallow water equations (2)
- Statistik (2)
- Stein’s method (2)
- W methods (2)
- W-Methods (2)
- Wirtschaftsmathematik (2)
- differential-algebraic equations (2)
- Aircraft (1)
- Annuity calculation (1)
- Application in electrochemistry (1)
- Approximate Matrix Factorization (1)
- Augmented Lagrangian (1)
- Automatic Differentiation (1)
- B-splines (1)
- BDF methods (1)
- Binomialverteilung (1)
- Blume–Capel model (1)
- Blume–Emery–Griffith model (1)
- Buch (1)
- CPACS (1)
- Complementarity Problem (1)
- Complex systems modeling and simulation (1)
- Compressible (1)
- Computational fluid dynamics (1)
- Constrained mechanical system (1)
- Contingency analysis (1)
- Coupling mechanism (1)
- Critical temperature (1)
- Cubature (1)
- Curie–Weiss–Potts models (1)
- Datenerhebung (1)
- Deskriptive Statistik (1)
- Diagramm (1)
- Differential Variational Inequality (1)
- Differential algebraic equations (1)
- Differential calculus (1)
- Differential-algebraic equations (1)
- ENO-schemes (1)
- Economic functions (1)
- Einführung (1)
- Electric circuit analysis (1)
- Exponential Methods (1)
- Exponential Rosenbrock Methods (1)
- Financial mathematics (1)
- First-order phase transition (1)
- Flow and transport in rivers (1)
- Forecast models (1)
- Forklifts (1)
- Free boundary problem (1)
- Gas transport simulation (1)
- Gauss–Hermite quadrature (1)
- Geometry (1)
- Gordon surface (1)
- Grundlagen (1)
- Grundwissen (1)
- High-performance computing (1)
- Historical remarks (1)
- Hydrogen (1)
- Hydrogen storage (1)
- Hypothesentest (1)
- Immersed interface method (1)
- Index notions (1)
- Index-1 DAEs (1)
- Index-one DAEs (1)
- Integral calculus (1)
- Integrated modelling (1)
- Investment calculation (1)
- Julia package Differential Equations (1)
- Lattice Boltzmann Method (1)
- Lattice Boltzmann Method Code (1)
- Machine learning (1)
- Measure differential Inclusion (1)
- Mengenpartitionierungsproblem (1)
- Metal hydride storage (1)
- Moreau–Jean time stepping (1)
- Multirate Methods (1)
- Network approach (1)
- Neural networks (1)
- Non-linear optimization (1)
- Non-zero external field (1)
- Off-lattice Boltzmann (1)
- Optimisation of linear models (1)
- Order conditions (1)
- PDEs with Mixed Derivative Terms (1)
- Parabolic and hyperbolic systems in one dimension (1)
- Parameter identification (1)
- Partial Differential Equations (1)
- Partial differential-algebraic equations (1)
- Pytorch (1)
- ROW methods (1)
- Regressionsanalyse (1)
- River alarm systems (1)
- River flow simulation (1)
- Rodas5 (1)
- Rosenbrock methods (1)
- Rosenbrock–Wanner methods (1)
- Runge-Kutta methods (1)
- Second-order phase transition (1)
- Shallow-water equations (1)
- Simulations (1)
- Sinking fund calculation (1)
- Statistik Formeln (1)
- Stochastik (1)
- Studium (1)
- The Peren Theorem (1)
- Theory of Rooted Trees (1)
- Topological reduction (1)
- Tricritical point (1)
- Two-step W-methods (1)
- Unilateral Constraints (1)
- Unstructured grid (1)
- Visual Computing (1)
- WENO schemes (1)
- WENO-schemes (1)
- Wahrscheinlichkeitsrechnung (1)
- Water level forecast (1)
- Water supply networks (1)
- Water supply systems (1)
- beschreibende Statistik (1)
- integrale Statistik (1)
- schließende Statistik (1)
- statistische Anwendung (1)
A Method of Lines Flux-Difference Splitting Finite Volume Approach for 1D and 2D River Flow Problems
(2001)
Solving differential-algebraic equations (DAEs) efficiently by means of appropriate numerical schemes for time-integration is an ongoing topic in applied mathematics. In this context, especially when considering large systems that occur with respect to many fields of practical application effective computation becomes relevant. In particular, corresponding examples are given when having to simulate network structures that consider transport of fluid and gas or electrical circuits. Due to the stiffness properties of DAEs, time-integration of such problems generally demands for implicit strategies. Among the schemes that prove to be an adequate choice are linearly implicit Rung-Kutta methods in the form of Rosenbrock-Wanner (ROW) schemes. Compared to fully implicit methods, they are easy to implement and avoid the solution of non-linear equations by including Jacobian information within their formulation. However, Jacobian calculations are a costly operation. Hence, necessity of having to compute the exact Jacobian with every successful time-step proves to be a considerable drawback. To overcome this drawback, a ROW-type method is introduced that allows for non-exact Jacobian entries when solving semi-explicit DAEs of index one. The resulting scheme thus enables to exploit several strategies for saving computational effort. Examples include using partial explicit integration of non-stiff components, utilizing more advantageous sparse Jacobian structures or making use of time-lagged Jacobian information. In fact, due to the property of allowing for non-exact Jacobian expressions, the given scheme can be interpreted as a generalized ROW-type method for DAEs. This is because it covers many different ROW-type schemes known from literature. To derive the order conditions of the ROW-type method introduced, a theory is developed that allows to identify occurring differentials and coefficients graphically by means of rooted trees. Rooted trees for describing numerical methods were originally introduced by J.C. Butcher. They significantly simplify the determination and definition of relevant characteristics because they allow for applying straightforward procedures. In fact, the theory presented combines strategies used to represent ROW-type methods with exact Jacobian for DAEs and ROW-type methods with non-exact Jacobian for ODEs. For this purpose, new types of vertices are considered in order to describe occurring non-exact elementary differentials completely. The resulting theory thus automatically comprises relevant approaches known from literature. As a consequence, it allows to recognize order conditions of familiar methods covered and to identify new conditions. With the theory developed, new sets of coefficients are derived that allow to realize the ROW-type method introduced up to orders two and three. Some of them are constructed based on methods known from literature that satisfy additional conditions for the purpose of avoiding effects of order reduction. It is shown that these methods can be improved by means of the new order conditions derived without having to increase the number of internal stages. Convergence of the resulting methods is analyzed with respect to several academic test problems. Results verify the theory determined and the order conditions found as only schemes satisfying the order conditions predicted preserve their order when using non-exact Jacobian expressions.
Solving transport network problems can be complicated by non-linear effects. In the particular case of gas transport networks, the most complex non-linear elements are compressors and their drives. They are described by a system of equations, composed of a piecewise linear ‘free’ model for the control logic and a non-linear ‘advanced’ model for calibrated characteristics of the compressor. For all element equations, certain stability criteria must be fulfilled, providing the absence of folds in associated system mapping. In this paper, we consider a transformation (warping) of a system from the space of calibration parameters to the space of transport variables, satisfying these criteria. The algorithm drastically improves stability of the network solver. Numerous tests on realistic networks show that nearly 100% convergence rate of the solver is achieved with this approach.
Seit vielen Jahren ist der Übergang von der Schule zur Hochschule eines der zentralen Themen für didaktische Theorien, empirische Untersuchungen und bildungspolitische Diskussionen. Ein dabei identifiziertes großes Problem vieler Studierender ist, dass mit dem Abitur „eine Lebensphase mit meist klar definierten Zielen in überschaubaren räumlichen, familiären und schulischen Strukturen endet“.1) Entscheidet man sich als Studierender gegen die nicht akademische Laufbahn und nimmt ein Hochschulstudium auf, trifft man auf Studienstrukturen und -bedingungen, die einem fremd und chaotisch vorkommen können. Der Weg an die Hochschulen ermöglicht den Individuen eine Reihe von Optionen, ist aber leider auch immer mit Risiken und Unsicherheiten behaftet. Entscheidungen müssen nun selbstständig vorbereitet und getroffen werden und dies in einem Umfeld, das sehr unterschiedlich im Vergleich zur bekannten Schulstruktur sein kann.
Das Cutting sticks-Problem ist in seiner allgemeinen Formulierung ein NP-vollständiges Problem mit Anwendungspotenzialen im Bereich der Logistik. Unter der Annahme, dass P ungleich NP (P != NP) ist, existieren keine effizienten, d.h. polynomiellen Algorithmen zur Lösung des allgemeinen Problems.
In diesem Papier werden Ansätze aufgezeigt, mit denen bestimmte Instanzen des Problems effizient berechnet werden können. Für die Berechnung wichtige Parameter werden charakterisiert und deren Beziehung untereinander analysiert.
Das Cutting sticks-Problem ist ein NP-vollständiges Problem mit Anwendungspotenzialen im Bereich der Logistik. Es werden grundlegende Definitionen für die Behandlung sowie bisherige Ansätze zur Lösung des Problems aufgearbeitet und durch einige neue Aussagen ergänzt. Insbesondere stehen Ideen für eine algorithmische Lösung des Problems bzw. von Varianten des Problems im Fokus.
Rosenbrock–Wanner methods for systems of stiff ordinary differential equations are well known since the seventies. They have been continuously developed and are efficient for differential-algebraic equations of index-1, as well. Their disadvantage that the Jacobian matrix has to be updated in every time step becomes more and more obsolete when automatic differentiation is used. Especially the family of Rodas methods has proven to be a standard in the Julia package DifferentialEquations. However, the fifth-order Rodas5 method undergoes order reduction for certain problem classes. Therefore, the goal of this paper is to compute a new set of coefficients for Rodas5 such that this order reduction is reduced. The procedure is similar to the derivation of the methods Rodas4P and Rodas4P2. In addition, it is possible to provide new dense output formulas for Rodas5 and the new method Rodas5P. Numerical tests show that for higher accuracy requirements Rodas5P always belongs to the best methods within the Rodas family.
Novel methods for contingency analysis of gas transport networks are presented. They are motivated by the transition of our energy system where hydrogen plays a growing role. The novel methods are based on a specific method for topological reduction and so-called supernodes. Stationary Euler equations with advanced compressor thermodynamics and a gas law allowing for gas compositions with up to 100% hydrogen are used. Several measures and plots support an intuitive comparison and analysis of the results. In particular, it is shown that the newly developed methods can estimate locations and magnitudes of additional capacities (injection, buffering, storage etc.) with a reasonable performance for networks of relevant composition and size.
Off-lattice Boltzmann methods increase the flexibility and applicability of lattice Boltzmann methods by decoupling the discretizations of time, space, and particle velocities. However, the velocity sets that are mostly used in off-lattice Boltzmann simulations were originally tailored to on-lattice Boltzmann methods. In this contribution, we show how the accuracy and efficiency of weakly and fully compressible semi-Lagrangian off-lattice Boltzmann simulations is increased by velocity sets derived from cubature rules, i.e. multivariate quadratures, which have not been produced by the Gauß-product rule. In particular, simulations of 2D shock-vortex interactions indicate that the cubature-derived degree-nine D2Q19 velocity set is capable to replace the Gauß-product rule-derived D2Q25. Likewise, the degree-five velocity sets D3Q13 and D3Q21, as well as a degree-seven D3V27 velocity set were successfully tested for 3D Taylor–Green vortex flows to challenge and surpass the quality of the customary D3Q27 velocity set. In compressible 3D Taylor–Green vortex flows with Mach numbers on-lattice simulations with velocity sets D3Q103 and D3V107 showed only limited stability, while the off-lattice degree-nine D3Q45 velocity set accurately reproduced the kinetic energy provided by literature.
Demand forecast
(2020)
Differential-Algebraic Equations and Beyond: From Smooth to Nonsmooth Constrained Dynamical Systems
(2018)
The present article presents a summarizing view at differential-algebraic equations (DAEs) and analyzes how new application fields and corresponding mathematical models lead to innovations both in theory and in numerical analysis for this problem class. Recent numerical methods for nonsmooth dynamical systems subject to unilateral contact and friction illustrate the topicality of this development.
Differential-Algebraic Equations and Beyond: From Smooth to Nonsmooth Constrained Dynamical Systems
(2022)
An Universitäten und Fachhochschulen ist die Mathematik-Ausbildung eines der Nadelöhre für angehende Ingenieurinnen und Ingenieure. Viele Studierende der Ingenieurwissenschaften scheitern in den ersten Studiensemestern an den Anforderungen der Mathematik. Lehrende, Fach- und Hochschuldidaktiker/innen und zunehmend auch Fachvertretungen und Verbände stellen sich die Frage, was an den Fakultäten und Fachbereichen getan werden kann, damit Studierende ihre mathematischen Fähigkeiten vergrößern und den anspruchsvollen Studienweg zur Ingenieurin oder zum Ingenieur meistern können.
Das Cutting sticks-Problem ist in seiner allgemeinen Formulierung ein NP-vollständiges Problem mit Anwendungspotenzialen im Bereich der Logistik. Unter der Annahme, dass P ungleich NP (P != NP) ist, existieren keine effizienten, d.h. polynomiellen Algorithmen zur Lösung des allgemeinen Problems.
In diesem Papier werden für eine Reihe von Instanzen effiziente Lösungen angegeben.