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)
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.
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.
Since being introduced in the sixties and seventies, semi-implicit RosenbrockWanner (ROW) methods have become an important tool for the timeintegration of ODE and DAE problems. Over the years, these methods have been further developed in order to save computational effort by regarding approximations with respect to the given Jacobian [5], reduce effects of order reduction by introducing additional conditions [2, 4] or use advantages of partial explicit integration by considering underlying Runge-Kutta formulations [1]. As a consequence, there is a large number of different ROW-type schemes with characteristic properties for solving various problem formulations given in literature today.
Wissenschaftliches Rechnen
(1999)
Wissenschaftliches Rechnen
(1999)