Refine
Has Fulltext
- yes (231)
Is part of the Bibliography
- yes (231)
Year of publication
Document Type
- Doctoral Thesis (131)
- Journal article (78)
- Book (5)
- Other (4)
- Report (4)
- Master Thesis (3)
- Conference Proceeding (2)
- Preprint (2)
- Book article / Book chapter (1)
- Review (1)
Keywords
- Optimale Kontrolle (12)
- Optimierung (9)
- Extremwertstatistik (8)
- optimal control (8)
- Nash-Gleichgewicht (7)
- Newton-Verfahren (7)
- Mathematik (6)
- Nichtlineare Optimierung (6)
- Finite-Elemente-Methode (5)
- Mathematikunterricht (5)
- Stabilität (5)
- Differentialgleichung (4)
- Elliptische Differentialgleichung (4)
- Extremwerttheorie (4)
- MPEC (4)
- Nichtglatte Optimierung (4)
- Partielle Differentialgleichung (4)
- Pontryagin maximum principle (4)
- SAS <Programm> (4)
- SQH method (4)
- Zeitreihenanalyse (4)
- A-priori-Wissen (3)
- Copula (3)
- Differentialgeometrie (3)
- Eigenwert (3)
- Euler equations (3)
- Finite-Volumen-Methode (3)
- Fokker-Planck-Gleichung (3)
- Galerkin-Methode (3)
- Gaussian approximation (3)
- Kombinatorik (3)
- Konfidenzintervall (3)
- Ljapunov-Funktion (3)
- Magnetoelastizität (3)
- Monodromie (3)
- Nichtkonvexe Optimierung (3)
- Numerisches Verfahren (3)
- Pareto-Verteilung (3)
- Spieltheorie (3)
- Statistik (3)
- Variationsrechnung (3)
- Zetafunktion (3)
- count time series (3)
- extreme value theory (3)
- global convergence (3)
- mathematical modelling (3)
- multi-fluid mixture (3)
- nonsmooth optimization (3)
- proximal gradient method (3)
- Abelsche Gruppe (2)
- Analysis (2)
- Anaphylaxis (2)
- Angewandte Mathematik (2)
- Anwendungssoftware (2)
- Argumentation (2)
- Audit sampling (2)
- BGK approximation (2)
- Belyi map (2)
- Biholomorphe Abbildung (2)
- Binomialverteilung (2)
- Box-Jenkins-Verfahren (2)
- Box–Jenkins Program (2)
- Cayley graph (2)
- Code examples (2)
- Controllability (2)
- D-Norm (2)
- Darstellungsmatrix (2)
- Deformationsquantisierung (2)
- Dirichlet-Reihe (2)
- Extreme Value Theory (2)
- Finanzmathematik (2)
- Fokker–Planck equation (2)
- Frequency Domain (2)
- Funktionentheorie (2)
- Galois-Theorie (2)
- Gamma-Konvergenz (2)
- Generalized Nash Equilibrium Problem (2)
- Gleichverteilung (2)
- Grundvorstellung (2)
- HIV (2)
- Homogener Raum (2)
- Hurwitz-Raum (2)
- Innere-Punkte-Methode (2)
- Inzidenzmatrix (2)
- Kohomologie (2)
- Kompakte Lie-Gruppe (2)
- Komplementaritätsproblem (2)
- Kontrolltheorie (2)
- Konvergenz (2)
- Kopula <Mathematik> (2)
- Lie groups (2)
- Lineare Algebra (2)
- Ljapunov-Stabilitätstheorie (2)
- Loewner theory (2)
- Loewner-Theorie (2)
- Lyapunov functions (2)
- Magnetohydrodynamik (2)
- Mathematica <Programm> (2)
- Mathematische Modellierung (2)
- Mehrgitterverfahren (2)
- Mikromagnetismus (2)
- Newton Methods (2)
- Newton's method (2)
- Nichtlineare Kontrolltheorie (2)
- Nikaido-Isoda function (2)
- Numerical analysis (2)
- Numerische Mathematik (2)
- Numerische Strömungssimulation (2)
- Optimale Steuerung (2)
- Origami (2)
- PDE (2)
- Prediction interval (2)
- Prior information (2)
- Projektive Ebene (2)
- Regressionsanalyse (2)
- Regulator (2)
- Regulator <Mathematik> (2)
- Riemann zeta-function (2)
- Riemannsche Zetafunktion (2)
- SAS (2)
- Schlichte Funktion (2)
- Simulation (2)
- Stability (2)
- State-Space Models (2)
- Stochastischer Prozess (2)
- Systemisches Risiko (2)
- Testinstrument (2)
- Time Series Analysis (2)
- Time series analyses (2)
- Torsionsfreie Abelsche Gruppe (2)
- Verallgemeinertes Nash-Gleichgewichtsproblem (2)
- Weibull-Verteilung (2)
- Zahlentheorie (2)
- Zustandsraummodelle (2)
- augmented Lagrangian method (2)
- basic mental models (2)
- cardinality constraints (2)
- conservation laws (2)
- deformation quantization (2)
- estimation error (2)
- extreme value distribution (2)
- fast vollständig zerlegbare Gruppe (2)
- finite elements (2)
- generalized Pareto distribution (2)
- globale Konvergenz (2)
- incidence matrix (2)
- jump-diffusion processes (2)
- kinetic model (2)
- low Mach number (2)
- mathematics (2)
- mean curvature (2)
- multigrid (2)
- nonlinear systems (2)
- numerical analysis (2)
- optimal control theory (2)
- optimization (2)
- ordinary differential equations (2)
- pedagogical content knowledge (2)
- prime number (2)
- regulator (2)
- relaxation method (2)
- representations up to homotopy (2)
- representing matrix (2)
- semismooth Newton method (2)
- stability (2)
- stability analysis (2)
- state constraints (2)
- stochastic processes (2)
- trabeculectomy (2)
- viral load (2)
- Überlagerung <Mathematik> (2)
- (0 (1)
- (approximate) functional equation (1)
- *-algebra (1)
- 1)-Matrix (1)
- 1)-matrix (1)
- 1-fach-Origami (1)
- 1655-1705> (1)
- 5-fluorouracil (1)
- ADMM (1)
- AIDS (1)
- Abbildungseigenschaften (1)
- Abelsche p-Gruppe (1)
- Abhängigkeitsmaß (1)
- Ableitung (1)
- Abstiegsverfahren (1)
- Abstoßungsphänomen (1)
- Acoustic equations (1)
- Adolf Hurwitz (1)
- Affine Skalierungsverfahren (1)
- Affinminimalfläche (1)
- Affinnormal (1)
- Aggregation (1)
- Algebraic Curves (1)
- Algebraic signal processing (1)
- Algebraische Kurve (1)
- Algebraische Signalverarbeitung (1)
- Algebraische Zahlentheorie (1)
- Algebraischer Funktionenkörper (1)
- Analogie (1)
- Analogiebildung (1)
- Analytische Funktion (1)
- Analytische Zahlentheorie (1)
- Angewandte Geowissenschaften (1)
- Angular Density (1)
- Anpassungstest (1)
- Approximation (1)
- Approximationstheorie (1)
- Arbitrary Lagrangian-Eulerian (1)
- Archimedean copula (1)
- Aspekte professioneller Kompetenz (1)
- Asymptotic Preserving (1)
- Asymptotic independence (1)
- Atmosphäre (1)
- Augmented Lagrangian (1)
- Augmented Lagrangian methods (1)
- Automorphismengruppe (1)
- Axiom (1)
- Axiomatisieren (1)
- B-Spline (1)
- Babuska Brezzi Bedingung (1)
- Babuska Brezzi condition (1)
- Banach-Raum (1)
- Bayesian approach (1)
- Bayesian inverse problems (1)
- Beatty sequence (1)
- Bedingte Unabhängigkeit (1)
- Belyi-Funktionen (1)
- Beobachter (1)
- Berechnung (1)
- Bernoulli (1)
- Bernoulli Raum (1)
- Bernoulli Space (1)
- Bernstein (1)
- Bernstein-type inequality (1)
- Berstein (1)
- Beweistheorie (1)
- Bi-Fidelity method (1)
- Bildrekonstruktion (1)
- Bilinear differential games (1)
- Black Scholes equation (1)
- Blinear Quantum Control Systems (1)
- Bloch's Principle (1)
- Blochsches Prinzip (1)
- Blockplan (1)
- Bloom setting (1)
- Box-Restriktionen (1)
- Bregman distance (1)
- Brittle fracture (1)
- Brockett (1)
- Brüder Hurwitz (1)
- Burgers-Gleichung (1)
- Butler group (1)
- Butlergruppe (1)
- CSF (1)
- CSIDH (1)
- Calculus of Variations (1)
- Calculus of variations (1)
- Caputo fractional derivative (1)
- Carbon dioxide capture (1)
- Cardinality Constraints (1)
- Carleson embedding theorem (1)
- Cartan's Theorem (1)
- Cauchy-Born rule (1)
- Central limit theorem under dependence (1)
- Charakteranalyse (1)
- Code Examples (1)
- Coisotropic reduction (1)
- Complex Continued Fractions (1)
- Complex Fluids (1)
- Composite optimization problems (1)
- Compressed Sensing (1)
- Computerunterstützter Unterricht (1)
- Confidence interval (1)
- Confidence intervals (1)
- Conformal Metrics (1)
- Conjugate function (1)
- Conjugate gradient method (1)
- Conservation Laws (1)
- Constrained optimization (1)
- Constraint-Programmierung (1)
- Continuous Sample Path (1)
- Convergence (1)
- Copula <Mathematik> (1)
- Counterparty Risk (1)
- Credibility interval (1)
- Curvature Equation (1)
- D-Norms (1)
- D-norm (1)
- DAT (1)
- DC optimization (1)
- DNA replication (1)
- Darstellung vonPseudo-Metriken (1)
- Data Exploration (1)
- Deformation (1)
- Deformationsgradient (1)
- Derivation (1)
- Deskriptive Statistik (1)
- Dichtefunktionalformalismus (1)
- Differential Games (1)
- Differentialgleichungssystem (1)
- Digitale Signalverarbeitung (1)
- Dimension reduction (1)
- Diophantine approximation (1)
- Dirichlet-Problem (1)
- Discontinuous Galerkin method (1)
- Discrete to continuum (1)
- Discrete-to-continuum limits (1)
- Diskrepanz (1)
- Double sensitization (1)
- Drug allergy (1)
- Drug reaction (1)
- Dual gap function (1)
- Dualität (1)
- Dualitätstheorie (1)
- Dynamic Geometry Environment (1)
- Dynamic representations (1)
- Dynamical Systems (1)
- Dynamical system (1)
- Dynamische Geometriesysteme (1)
- Dynamische Optimierung (1)
- Dynamische Repräsentation (1)
- Dynamisches System (1)
- E-Learning (1)
- EJMA-D-19-00287 (1)
- Eigenmode (1)
- Elastizität (1)
- Elliptic equations (1)
- Elliptische Kurve (1)
- Endliche Geometrie (1)
- Ensemble optimal control (1)
- Entropiebedingung (1)
- Entropielösung (1)
- Entropy admissibility condition (1)
- Epidemiologie (1)
- Epstein zeta-function (1)
- Epstein, Paul (1)
- Erhaltungsgleichungen (1)
- Estimation (1)
- Euler system (1)
- Eulersche Differentialgleichung (1)
- Euler–Bernoulli damped beam (1)
- Exact-controllability (1)
- Exceedance Stability (1)
- Existenz schwacher Lösungen (1)
- Existenz und Eindeutigkeit (1)
- Explicit Computation (1)
- Explizite Berechnung (1)
- Exponential smoothing (1)
- Exponential smoothing with covariates (1)
- Extremal–I–Verteilung (1)
- Extreme value copula (1)
- Extremwert (1)
- Extremwertregelung (1)
- Extremwertverteilung (1)
- Falten (1)
- Faltung (1)
- Faltungscode (1)
- Fast vollständig zerlegbare Gruppe (1)
- Fermentation (1)
- Festkörper (1)
- Field sting (1)
- Filter-SQPEC Verfahren (1)
- Financial Networks (1)
- Finanzielle Netzwerke (1)
- Finite Elemente (1)
- Finite Elemente Methode (1)
- Finite support distributions (1)
- Firmwert (1)
- Fixpunktsatz (1)
- Flachfaltbarkeit (1)
- Flat-foldability (1)
- Fluid (1)
- Fluid-Partikel-Strömung (1)
- Fluid-Struktur-Wechselwirkung (1)
- Fluid-structure interaction (1)
- Fluidnetzwerk (1)
- Flüssigkeit (1)
- Flüssigkristall (1)
- Fokalmannigfaltigkeit (1)
- Fokker-Planck (1)
- Fokker-Planck optimality systems (1)
- Formoptimierung (1)
- Fragility Index (1)
- Fragilitätsindex (1)
- Freies Randwertproblem (1)
- Fréchet spaces (1)
- Fréchet-Raum (1)
- Frécheträume (1)
- Function Fields (1)
- Functional differential equations (1)
- Functions with Primitive (1)
- Funktion von beschränkter Variation (1)
- Funktionen mit Stammfunktion (1)
- Funktionenkörper (1)
- GPD (1)
- GPD-Flow (1)
- Galois theory (1)
- Galois-Erweiterung (1)
- Galois-Feld (1)
- Galoistheorie (1)
- Gamma-convergence (1)
- Gasgemisch (1)
- Gebäude (1)
- Generalized Nash Equilibrium (1)
- Generalized Nash equilibrium (1)
- Generalized Pareto Distribution (1)
- Generalized Pareto copula (1)
- GeoGebra (1)
- Geometric constraints (1)
- Geometrie (1)
- Geschaltete Systeme (1)
- Gesetz der kleinen Zahlen (1)
- Gestaltoptimierung (1)
- Gewöhnliche Differentialgleichung (1)
- Gewöhnliche Differentialgleichungen (1)
- Gleichmäßige Konvergenz (1)
- Gleichungssysteme (1)
- Globale Analysis (1)
- Glättungsverfahren (1)
- Goodness-of-Fit Test (1)
- Gram points (1)
- Gram’s law (1)
- Graph (1)
- Graph eigenvalues (1)
- Graph products (1)
- Graph spectrum (1)
- Graphnullity (1)
- Grassmann Manifold (1)
- Grassmann-Mannigfaltigkeit (1)
- Gravitationsfeld (1)
- Guignard CQ (1)
- Gumbel-Verteilung (1)
- HAND (1)
- HDL (1)
- HIV infections (1)
- Hamilton Systeme (1)
- Hamilton Sytstems (1)
- Hamilton-Jacobi-Differentialgleichung (1)
- Hautus test (1)
- Hecke L-functions (1)
- Hecke eigenforms (1)
- Hierarchische Matrix (1)
- High-frequency data (1)
- Hilbert-Raum (1)
- Hilfe-System (1)
- Hochschuldidaktik (1)
- Hochschule+Lehre (1)
- Homicidal Chauffeur game (1)
- Homogenisierung <Mathematik> (1)
- Homologische Algebra (1)
- Honey bee (1)
- Hurwitz spaces (1)
- Hurwitz zeta function (1)
- Hybrid Dynamical Systems (1)
- Hybridsystem (1)
- Hydrodynamische Grenzwerte (1)
- Hymenoptera venom (1)
- Hyperbolic Partial Differential Equations (1)
- Hyperbolische Differentialgleichung (1)
- Hypertranscendence (1)
- Hüllenbildung (1)
- IMEX scheme (1)
- Ignorance (1)
- Ignoranz (1)
- Image Registration (1)
- Immunotherapy (1)
- Incompressibility (1)
- Infinite Optimierung (1)
- Inkompressibilität (1)
- Innere-Punkte-Verfahren (1)
- Integral graph (1)
- Integralgleichung (1)
- Integrodifferentialgleichung (1)
- Interactive Help System (1)
- Interconnection (1)
- Invarianter Unterraum (1)
- Inverse Iteration (1)
- Isomorphie (1)
- Isomorphieklasse (1)
- Isoparametrische Hyperfläche (1)
- Jacobi-Eigenwert-Verfahren (1)
- Jacobi-type eigenvalue methods (1)
- Jacobi-ähnliches Verfahren (1)
- Jacobsthal function (1)
- Jakob <Mathematiker (1)
- Julia line (1)
- Julius Hurwitz (1)
- Kanzow, C. Y. Cui, J.-S. Pang: “Modern Nonconvex Nondifferentiable Optimization” (1)
- Kapitalverflechtung (1)
- Kapitalverflechtungen (1)
- Karush-Kuhn-Tucker-Bedingungen (1)
- Kegelgebiet (1)
- Keller–Segel model (1)
- Kettenbruch (1)
- Klassifikation (1)
- Kloosterman sum (1)
- Koenigs function (1)
- Kollinearität (1)
- Kombinatorische Optimierung (1)
- Kombinatorische Zahlentheorie (1)
- Komplexe Flüssigkeiten (1)
- Komprimierte Abtastung (1)
- Kondition <Mathematik> (1)
- Konforme Abbildungen (1)
- Konforme Metrik (1)
- Konjugierte-Gradienten-Methode (1)
- Konstruktionsmethoden (1)
- Kontinuitätsgleichung (1)
- Kontinuumsmechanik (1)
- Kontrollsystem (1)
- Konvergenz bei quadratischem Eigenwertproblem (1)
- Konvexe Analysis (1)
- Korrekt gestelltes Problem (1)
- Korrelation (1)
- Krylow matrix (1)
- Kryptologie (1)
- Kurdyka--{\L}ojasiewicz property (1)
- LPEC (1)
- Ladyzhenskaya Konstante (1)
- Ladyzhenskaya constant (1)
- Lagrange-Methode (1)
- Landau type theorem (1)
- Langschrittmethoden (1)
- Laplace approximation (1)
- Laser (1)
- Lasersimulation (1)
- Least Action Principle (1)
- Least squares estimation (1)
- Lehrerbildung (1)
- Lennard-Jones-Potenzial (1)
- Lerch zeta function (1)
- Lie bialgebroids (1)
- Lie n-algebroids (1)
- Lie-Gruppe (1)
- Liegruppen (1)
- Lindblad-Kossakowski Master Equation (1)
- Lineare Funktionalanalysis (1)
- Lineare Regression (1)
- Linearer Operator (1)
- Lineares System (1)
- Liouville and transport equations (1)
- Local Lipschitz continuity (1)
- Local rings (1)
- Lotka-Volterra models (1)
- Lyapunov Funktion (1)
- Lyapunov Stability (1)
- Lückenreihe (1)
- Lückenreihen (1)
- M-Stationär (1)
- M-stationarity (1)
- MHD (1)
- MIND estimator (1)
- MPCC (1)
- MPVC (1)
- MSC 11M35 (1)
- Machzahl (1)
- Magnetic Resonance Imaging (1)
- Magnetoelasticity (1)
- Magnetohydrodynamics (1)
- Magnetoviscoelastic Fluids (1)
- Magnetoviskoelastische Flüsse (1)
- Mapping Properties (1)
- Martensit (1)
- Master-Gleichung (1)
- Mastocytosis (1)
- Mathematical modeling (1)
- Mathematikdidaktik (1)
- Mathematiklernen (1)
- Mathematisches Modell (1)
- Matrix (1)
- Matrixpolynom (1)
- Matrizenpolynom (1)
- Matrizenzerlegung (1)
- Maximal (1)
- Maximale (1)
- Maximum Dissipation Principle (1)
- Maße für Quantenverschränkung (1)
- Medical image reconstruction (1)
- Mehragentensystem (1)
- Mehrdimensionale Signalverarbeitung (1)
- Mehrgitter (1)
- Mehrskalenmodell (1)
- Metakognition (1)
- Metrologie (1)
- Minimal surfaces (1)
- Minimalfläche (1)
- Minimalflächen (1)
- Minimalkurven (1)
- Minimizing movements (1)
- Minimum Information Probability Distribution (1)
- Minimum Information Wahrscheinlichkeitsverteilung (1)
- Mittlere Krümmung (1)
- Mobiler Roboter (1)
- Modeling (1)
- Modellierung (1)
- Moment <Stochastik> (1)
- Monodromy (1)
- Monte Carlo Simulation (1)
- Moving mesh method (1)
- Multi-agent systems (1)
- Multi-dimensional SPDEs (1)
- Multiple Repräsentationen (1)
- Multiple representations (1)
- Multivariate Generalized Pareto Distributions (1)
- Multivariate order statistics (1)
- Multivariate statistics (1)
- Multivariate verallgemeine Pareto-Verteilungen (1)
- NCP-Funktionen (1)
- NCP-functions (1)
- Nash Equilibrium Problem (1)
- Nash bargaining problem (1)
- Nash equilibria (1)
- Nash equilibrium (1)
- Navier-Stokes equations (1)
- Navier-Stokes-Gleichung (1)
- Near-Isomorphie (1)
- Nematic Liquid Crystals (1)
- Nematische Flüssigkristalle (1)
- Neue Medien (1)
- Newton method (1)
- Newton methods (1)
- Newton-Raphson Method (1)
- Newton-Raphson Verfahren (1)
- Newtonsches Kräftegleichgewicht (1)
- Newtonverfahren (1)
- Nichtglatte Analysis (1)
- Nichtlineare Funktionalgleichung (1)
- Nichtlinearer Operator (1)
- Nichtlineares System (1)
- Nichtparametrische Statistik (1)
- Nikaido-Isoda Funktion (1)
- Niveaustufen des Beweises (1)
- Non-smooth optimal control (1)
- Non-steroidal anti-inflammatory drug (1)
- Nonlinear systems (1)
- Nonparametric Inference (1)
- Nonsmooth optimization (1)
- Nullstelle (1)
- Numerical Asset Valuation (1)
- Numerical Methods (1)
- Numerik (1)
- One-dimensional SPDEs (1)
- Operatortheorie (1)
- Optimal Control (1)
- Optimal control problem (1)
- Optimalitätsbedingung (1)
- Optimierung / Nebenbedingung (1)
- Optimierung auf Mannigfaltigkeiten (1)
- Optimierungsproblem (1)
- Optimization on Lie Groups (1)
- Order Statistics (1)
- Overstatement models (1)
- PDEs (1)
- Paper-folding (1)
- Papierfalten (1)
- Parabolic equations (1)
- Parabolische Differentialgleichung (1)
- Parametric inference (1)
- Parametric optimization (1)
- Parametrische Optimierung (1)
- Parametrisierung (1)
- Partielle Differentialgleichungen (1)
- Peaks over Threshold (1)
- Penalized Least Squares Method (1)
- Penalized Least Squares Methode (1)
- Periodic homogenization (1)
- Phasenumwandlung (1)
- Piecewise Polynomial Function (1)
- Plasma (1)
- Poisson Gleichung (1)
- Poisson algebras (1)
- Poisson equation (1)
- Poisson-Gleichung (1)
- Poisson-Prozess (1)
- Polyatomare Verbindungen (1)
- Polynomial matrices (1)
- Pontrjagin-Maximumprinzip (1)
- Pontryagin Maximum Principle (1)
- Pontryagin Maximum Prinzip (1)
- Pontryagins's maximum principle (1)
- Post-Quantum-Kryptografie (1)
- Prediction Procedure (1)
- Primzahl (1)
- Probability theory (1)
- Problemlösen (1)
- Prognose (1)
- Projection Theorem (1)
- Projektionssatz (1)
- Proof (1)
- Proving Level (1)
- Proximal Method (1)
- Proximal-Punkt-Verfahren (1)
- Präkonditionierung (1)
- Pseudo-allergy (1)
- Pseudogeodätische (1)
- Pseudometrik (1)
- Quadratischer Zahlkörper (1)
- Quantenmechanik (1)
- Quantenmechanisches System (1)
- Quantum control (1)
- Quasi-Variational Inequality (1)
- Quasi-Variationsungleichung (1)
- Quasi-variational inequalities (1)
- Quasibases (1)
- Quasibasis (1)
- Quasiconformal automorphism (1)
- Quasikonforme Abbildung (1)
- Randomness (1)
- Rangstatistik (1)
- Razumikhin method (1)
- Reachability matrix (1)
- Reelle Funktion (1)
- Registrierung <Bildverarbeitung> (1)
- Regularisation Methods (1)
- Regularisierung (1)
- Regularisierungsverfahren (1)
- Regularized gap function (1)
- Reine Untergruppen (1)
- Rekord (1)
- Relapse (1)
- Relativnormale (1)
- Relaxation method (1)
- Restklasse (1)
- Rezension (1)
- Ridge-Regression (1)
- Riemann Hypothesis (1)
- Riemann hypothesis (1)
- Riemannian manifolds (1)
- Riemannian optimization (1)
- Riemannsche Geometrie (1)
- Riemannsche Mannigfaltigkeiten (1)
- Riemannsche Optimierung (1)
- Risikomanagement (1)
- Risk factor (1)
- Rothe method (1)
- Runge-type Theorems (1)
- STEM classroom (1)
- STEM education (1)
- STEM integration (1)
- Satz von Cartan (1)
- Scheme for solving optimal control problems (1)
- Schnelle Fourier-Transformation (1)
- Schur ring (1)
- Schwache Kompaktheit (1)
- Schwache Lösungen (1)
- Sekundarstufe (1)
- Selberg Class (1)
- Selberg Klasse (1)
- Selbergsche L-Reihe (1)
- Semidefinite Optimierung (1)
- Semidefinite Programme (1)
- Semidualität (1)
- Semidualtität (1)
- Semismooth Newton Method (1)
- Sequential Quadratic Hamiltonian scheme (1)
- Sequential quadratic Hamiltonian scheme (1)
- Set-valued mapping (1)
- Shape Optimization (1)
- Simulieren (1)
- Singulärfunktionen (1)
- Skalierungsfunktion (1)
- Small-Gain Theorem (1)
- Softwareentwicklung (1)
- Sparsity (1)
- Spektraltheorie (1)
- Sphäre (1)
- Spin systems (1)
- Spinsystem (1)
- Spiralflächen (1)
- Spiraltypfläche (1)
- Spiraltypflächen (1)
- Spline (1)
- Stabilitätsanalyse (1)
- Starke Kopplung (1)
- Steuerbarkeit (1)
- Stochastic Algorithms (1)
- Stochastic Process (1)
- Stochastic homogenization (1)
- Stochastik (1)
- Stochastische Optimierung (1)
- Stochastische partielle Differentialgleichung (1)
- Stochastisches System (1)
- Stokes Gleichung (1)
- Stokes equation (1)
- Stokes-Gleichung (1)
- Structrual Model (1)
- Struktur (1)
- Strömung (1)
- Stückweise Polynomiale Funktion (1)
- Symmetrie (1)
- Symmetrien (1)
- Symmetrische Konfiguration (1)
- Symplektische Geometrie (1)
- System von partiellen Differentialgleichungen (1)
- Systemhalbgruppen (1)
- Systemic Risk (1)
- Systemsemigroups (1)
- Sätze (1)
- T3s (1)
- TD Kohn-Sham equations (1)
- TDDFT (1)
- Tail-behavior (1)
- Teaching (1)
- Testen (1)
- Theorems (1)
- Topologieoptimierung (1)
- Torsion-free abelian groups (1)
- Torsionsfreie abelsche Gruppe (1)
- Total Variation (1)
- Totale Variation (1)
- Toulmin Modell (1)
- Transitive Lie Groups (1)
- Transportkoeffizient (1)
- Treatment failure (1)
- Ulm-Kaplansky Invarianten (1)
- Ulm-Kaplansky invariants (1)
- Uncertainty (1)
- Uniform distribution modulo one (1)
- Uniform topology (1)
- Universal Functions (1)
- Universality (1)
- Universalität (1)
- Unsicherheit (1)
- Untergruppe (1)
- Unternehmensbewertung (1)
- Unterraumsuche (1)
- Unterräume (1)
- Uzawa Verfahren (1)
- Uzawa iteration (1)
- Value at Risk (1)
- Value ranges (1)
- Vandermonde matrix (1)
- Variationsungleichung (1)
- Verfahren der konjugierten Gradienten (1)
- Vespula (1)
- Volumen (1)
- Von Mises conditions (1)
- Vorhersagbarkeit (1)
- Vorhersagetheorie (1)
- Vorhersageverfahren (1)
- Vorkonditionierer (1)
- Wahrscheinlichkeitsrechnung (1)
- Wahrscheinlichkeitstheorie (1)
- Wahrscheinlichkeitsverteilung (1)
- Walsh (1)
- Warteschlangennetz (1)
- Weak Solutions (1)
- Weibull distribution (1)
- Weibull type density (1)
- Wein (1)
- Well-Balanced (1)
- Well-posedness (1)
- Wettbewerbsdesign (1)
- ZRP (1)
- Zeitdiskrete Approximation (1)
- Zeitoptimale Regelung (1)
- Zero Range Prozess (1)
- Zero-divisor graph (1)
- Zero-divisor graphs (1)
- Zero-inflation (1)
- Zeta-Functions (1)
- Zeta-function (1)
- Zufall (1)
- Zwei-Ebenen-Optimierung (1)
- a-point distribution (1)
- a-posteriori error estimates (1)
- abelian groups (1)
- accuracy estimate (1)
- adaptive intervention competence (1)
- adaptive refinement (1)
- adjoint and coadjoint representations (1)
- affine minimal surface (1)
- affine normal (1)
- affine scaling methods (1)
- algebraic aggregation (1)
- algebraic degree (1)
- algebraic function field (1)
- algebraische Aggregation (1)
- almost completely decomosable group (1)
- almost completely decomposable group (1)
- almost completely decomposable groups (1)
- analytical continuation (1)
- analytische Fortsetzung (1)
- approaches in textbooks (1)
- asthma (1)
- asymptotic analysis (1)
- asymptotic sufficiency (1)
- asymptotically flat ends (1)
- atomistic models (1)
- augmented Lagrange method (1)
- augmented Lagrangian (1)
- avoidance (1)
- backward orbit (1)
- basic mental model (1)
- beispielsbasiertes Lernen (1)
- bevacizumab (1)
- bi-steerable robot (1)
- bias (1)
- bicommutators (1)
- bilinear evolution model (1)
- black box (1)
- bleb failure (1)
- bleb scarring (1)
- block design (1)
- blood (1)
- body weight (1)
- bound constraints (1)
- bounded input bounded output stability (1)
- branch- and-bound Verfahren (1)
- branch-and-bound algorithm (1)
- buildings (1)
- canal surgery (1)
- canaloplasty (1)
- cancer (1)
- cataract surgery (1)
- centroaffine normal (1)
- chlamydia (1)
- chlamydia infection (1)
- chlamydia trachomatis (1)
- chordal Loewner equation (1)
- circular arc polygon domain (1)
- circumferential viscodilation (1)
- co-extremality coefficient (1)
- coherent forecasting (1)
- cohomology (1)
- coisotropic reduction (1)
- collinearity (1)
- combinatorial theory (1)
- comma category (1)
- companion matrix (1)
- complementary problems (1)
- complex polynomials (1)
- composite optimization (1)
- composition of functions (1)
- compressible fluid (1)
- computational biology and bioinformatics (1)
- condenser capacity (1)
- conecontinuity type constraint qualification (1)
- conewise linear systems (1)
- confidence interval (1)
- conformal mapping (1)
- conformal pseudo-metrics (1)
- conical domain (1)
- conservation law (1)
- continuum limit (1)
- convergence (1)
- convergence for quadratic eigenvalue problems (1)
- convergent star product (1)
- converse Lyapunov theorems (1)
- convolution (1)
- convolutional code (1)
- copula (1)
- correction (1)
- coverings (1)
- critical line (1)
- cross-ownership (1)
- cubic-monoclinic martensites (1)
- cyclic matrix (1)
- deformation theory (1)
- degrees of freedom in internal energy (1)
- derivation (1)
- derivative (1)
- design (1)
- diagnosis (1)
- differential games (1)
- differential graded Lie algebra (1)
- differential graded modules (1)
- differential nash games (1)
- diffuse interface models (1)
- digital technologies (1)
- digital tools (1)
- digitale Werkzeuge (1)
- discontinuous coefficient functions (1)
- discrete systems (1)
- discrete-time systems (1)
- discrete-to-continuum (1)
- distribution modulo one (1)
- dopamine (1)
- double Lie algebroids (1)
- double Lie groupoids (1)
- drug adherence (1)
- duality (1)
- dyadic product BMO (1)
- echocardiography (1)
- eigenmode (1)
- elliptic PDE (1)
- elliptic curves (1)
- elliptic problems (1)
- empirical evidence (1)
- empirical investigation (1)
- enatnglement measure (1)
- ensemble optimal control problems (1)
- ensemble reachability (1)
- entropy inequality (1)
- entropy minimization (1)
- epidemiology (1)
- equivariant cohomology (1)
- ergodic transformation (1)
- error estimate (1)
- erstes Randwertproblem in PDE (1)
- euclidean normal (1)
- euklidische Normale (1)
- example based learning (1)
- examples and counterexamples (1)
- exceedance counts (1)
- exchangeable D-norms (1)
- existence of solutions (1)
- expected shortfall (1)
- expectiles (1)
- explicit discontinuous Galerkin (1)
- exponent pairs (1)
- exponential growth (1)
- extremal coefficient (1)
- extremal exchangeable D-norms (1)
- extreme order statistics (1)
- extremum seeking control (1)
- filter-SQPEC algorithm (1)
- financial network (1)
- finanzielles Netzwerk (1)
- finite differences (1)
- finite element method (1)
- finite fields (1)
- finite groups (1)
- finite projective plane (1)
- finite volume method (1)
- finite volume methods (1)
- firm valuation (1)
- first boundary value problem in PDE (1)
- flexible microcatheter (1)
- fluid networks (1)
- fluid–structure interaction model (1)
- foliation (1)
- fracture (1)
- fredholm operator (1)
- freies Randwertproblem (1)
- function identification (1)
- functional D-norm (1)
- functional thinking (1)
- galois extensions (1)
- gamma-convergence (1)
- gap power series (1)
- generalized quadrangles (1)
- generator of D-norm (1)
- geometric control (1)
- geometrically linear elasticity (1)
- geometrisch lineare Elastizitätstheorie (1)
- geometrische Kontrolltheorie (1)
- geometry (1)
- gewichtete Gleichverteilung modulo eins (1)
- gewichtete Sobolevräume (1)
- gewöhnliche Differentialgleichungen (1)
- glaucoma (1)
- glaucoma surgery (1)
- global attractor (1)
- globalized proximal Newton-type method (1)
- gradient-like systems (1)
- gradientenähnliche Systeme (1)
- green energy (1)
- growth models (1)
- halbeinfache Lie Algebren (1)
- harmonic measure (1)
- hierarchical matrix (1)
- higher order methods (1)
- highly-active antiretroviral therapy (1)
- homogene Raüme (1)
- homogeneous spaces (1)
- homogenization (1)
- homogenous parameter-depedent systems (1)
- hydrodynamic limits (1)
- hyperbolic area (1)
- hyperbolic systems (1)
- image denoising (1)
- imaginary quadratic field (1)
- immune activation (1)
- impulsive systems (1)
- infeasible interior point paths (1)
- infinite dimensional optimization (1)
- infinite-dimensional systems (1)
- infinitesimal ideal systems (1)
- input-to-state stability (1)
- integral (1)
- integral graph (1)
- integration (1)
- interior point methods (1)
- intermediate order statistics (1)
- inverse Iteration (1)
- inverse problems (1)
- isogeny-based cryptography (1)
- isomorph (1)
- isomorphic (1)
- isomorpism (1)
- kinetic chemotaxis equation (1)
- kinetic description of gases (1)
- konforme Pseudo-Metriken (1)
- kubisch-monokliner Phasenübergang (1)
- large-scale (1)
- large-time behaviour (1)
- laser simulation (1)
- linear system (1)
- literature review (1)
- local asymptotic normality (1)
- local classes (1)
- local existence (1)
- local input-to-state stability (1)
- long step methods (1)
- lonlinear reaction-diffusion equations (1)
- lyapunov methods (1)
- macrophages (1)
- magnetic fluids (1)
- matched pairs (1)
- mathematical biology (1)
- mathematical paperfolding (1)
- mathematics classrooms (1)
- mathematisches Modellieren (1)
- mathematisches Papierfalten (1)
- matrix decomposition (1)
- max-linear model (1)
- max-stable process (1)
- mid quantiles (1)
- minimal curves (1)
- minimal surface (1)
- mitomycin C (1)
- mittlere Krümmung (1)
- monodromy groups (1)
- months follow-up (1)
- morbid obesity (1)
- multigrid schemes (1)
- multiply connected domain (1)
- multiscale methods (1)
- multiscale modeling (1)
- multivariate Extreme Value Distribution (1)
- multivariate Gaussian distribution (1)
- multivariate exceedance (1)
- multivariate extreme value theory (1)
- multivariate generalized Pareto distribution (1)
- multivariate max-domain of attraction (1)
- multivariate statistical process control (SPC) (1)
- mutually permutable (1)
- near-isomorph (1)
- near-isomorphic (1)
- near-isomorphism (1)
- new media (1)
- nichtglatt (1)
- nichtglatte Newton-artige Verfahren (1)
- nichtholonomes System (1)
- nichtlineare & gemischte Komplementaritätsprobleme (1)
- nichtlineare Optimierung (1)
- non-Lipschitz optimization (1)
- non-convex optimal control problems (1)
- non-smooth and non-convex optimization (1)
- non-smooth large-scale optimisation (1)
- non-smooth optimal control problems (1)
- non-smooth optimization (1)
- nonconvex optimization (1)
- nonconvex smooth term (1)
- nonderogatory matrix (1)
- nonholonomic system (1)
- nonlinear and mixed complementarity problems (1)
- nonlinear inverse problems (1)
- nonlinear least squares reformulation (1)
- nonlinear optimization (1)
- normal families (1)
- normale Familien (1)
- numerical approximations (1)
- numerical finance (1)
- numerical methods (1)
- obesity (1)
- observer (1)
- one-fold-origami (1)
- open-angle glaucoma (1)
- operative principle (1)
- optimal control problem (1)
- optimal control problems (1)
- optimal solution mapping (1)
- optimization on manifolds (1)
- order of growth (1)
- over-determined problem (1)
- p-Gruppen (1)
- p-groups (1)
- p-soluble groups (1)
- p-supersolubility (1)
- parametrization (1)
- partial differential equation (1)
- partial differential equations (1)
- partial differetial equations (1)
- partial integro-differential Fokker-Planck Equation (1)
- partial integro-differential equations (1)
- partielle Differentialgleichungen (1)
- pedestrian motion (1)
- petal (1)
- phacocanaloplasty (1)
- phacotrabeculectomy (1)
- phase I (1)
- phase II (1)
- plasma modelling (1)
- plasma physics (1)
- polyatomic molecules (1)
- polymerase chain reaction (1)
- polymorphism (1)
- polynomial chaos (1)
- pontryagin maximum principle (1)
- pre-service teacher (1)
- preconditioning (1)
- prediction interval (1)
- predictive performance (1)
- professional competence (1)
- projective plane (1)
- projektive Ebene (1)
- proximal Newton method (1)
- proximal method (1)
- proximal methods (1)
- pseudo geodesics (1)
- pulmonary function (1)
- pulmonary hypertension (1)
- pure subgroups (1)
- quadratic convergence (1)
- quadratic number field (1)
- quadratische Konvergenz (1)
- quantile forecasts (1)
- quantum evolution models (1)
- quasi-continuum (1)
- quasinormality constraint qualification (1)
- queueing networks (1)
- radial Loewner equation (1)
- random walk (1)
- reaction-diffusion (1)
- reduced residues (1)
- regression (1)
- regularization (1)
- regulating (1)
- regulating subgroup (1)
- regulierend (1)
- regulierende Untergruppen (1)
- relative normal (1)
- repelling phenomenon (1)
- representation of pseudo-metrics (1)
- ridge regression (1)
- robustness (1)
- role of mathematics in STEM (1)
- secondary education (1)
- semi-convex hulls (1)
- semi-konvexe Hüllen (1)
- semidefinite Komplementaritätsprobleme (1)
- semidefinite complementarity problems (1)
- semidefinite programming (1)
- semiduality (1)
- semigroup of holomorphic functions (1)
- semilinear elliptic operators (1)
- semisimple Lie algebras (1)
- semismooth (1)
- semismooth Newton-type methods (1)
- sequential optimality condition (1)
- sequential quadratic hamiltonian method (1)
- series (1)
- simulation (1)
- singular functions (1)
- singularly perturbed problem (1)
- singulär gestörtes Problem (1)
- smoothing-type methods (1)
- sparse control problems (1)
- special sweeps (1)
- spectral theory (1)
- spezielle Sweep-Methoden (1)
- spiral surfaces (1)
- spiral type surfaces (1)
- star products (1)
- stationarity (1)
- stochastischer Prozess (1)
- structural model (1)
- structure (1)
- structured normal form problem (1)
- strukturierte Normalformprobleme (1)
- subspace clustering (1)
- subspaces (1)
- successive approximations strategy (1)
- sufficient optimality conditions (1)
- surgical outcomes (1)
- switched systems (1)
- symmetric configuration (1)
- symmetries (1)
- symplectic geometry (1)
- systemic risk (1)
- systems biology (1)
- tail conditional expectation (1)
- tail dependence (1)
- task design (1)
- teacher education (1)
- technology (1)
- tensor rank (1)
- test instrument (1)
- therapy (1)
- tight (1)
- time-optimal control (1)
- time-varying (1)
- time‐varying delay (1)
- torsionfree abelian groups (1)
- torsionsfreie abelsche Gruppen (1)
- total variation (1)
- transport coefficients (1)
- typically real functions (1)
- uncertain volatility (1)
- uncertainty quantification (1)
- univalent functions (1)
- universality (1)
- unstetige Koeffizientenfunktionen (1)
- unzulässige Innere-Punkte-Pfade (1)
- value at risk (1)
- value-distribution (1)
- variational estimation (1)
- variational fracture (1)
- velocity jump process (1)
- velocity-dependent collision frequency (1)
- verallgemeinerte Vierecke (1)
- viral replication (1)
- volume (1)
- vorticity preserving (1)
- weight loss (1)
- weighted Sobolev spaces (1)
- weighted uniform distribution modulo one (1)
- well posedness (1)
- well-balanced (1)
- well-balancing (1)
- wine fermentation (1)
- zeitoptimale Steuerung (1)
- zentroaffine Normale (1)
- zero-finding (1)
- zeta-functions (1)
- zweiachsgelenkter Roboter (1)
- Überschreitungen (1)
- Überschreitungsanzahl (1)
- Čebyšev-Polynome (1)
Institute
- Institut für Mathematik (231) (remove)
Sonstige beteiligte Institutionen
ResearcherID
- C-2593-2016 (1)
EU-Project number / Contract (GA) number
- 304617 (2)
We analyze the mathematical models of two classes of physical phenomena. The first class of phenomena we consider is the interaction between one or more insulating rigid bodies and an electrically conducting fluid, inside of which the bodies are contained, as well as the electromagnetic fields trespassing both of the materials. We take into account both the cases of incompressible and compressible fluids. In both cases our main result yields the existence of weak solutions to the associated system of partial differential equations, respectively. The proofs of these results are built upon hybrid discrete-continuous approximation schemes: Parts of the systems are discretized with respect to time in order to deal with the solution-dependent test functions in the induction equation. The remaining parts are treated as continuous equations on the small intervals between consecutive discrete time points, allowing us to employ techniques which do not transfer to the discretized setting. Moreover, the solution-dependent test functions in the momentum equation are handled via the use of classical penalization methods.
The second class of phenomena we consider is the evolution of a magnetoelastic material. Here too, our main result proves the existence of weak solutions to the corresponding system of partial differential equations. Its proof is based on De Giorgi's minimizing movements method, in which the system is discretized in time and, at each discrete time point, a minimization problem is solved, the associated Euler-Lagrange equations of which constitute a suitable approximation of the original equation of motion and magnetic force balance. The construction of such a minimization problem is made possible by the realization that, already on the continuous level, both of these equations can be written in terms of the same energy and dissipation potentials. The functional for the discrete minimization problem can then be constructed on the basis of these potentials.
In this thesis, a variety of Fokker--Planck (FP) optimal control problems are investigated. Main emphasis is put on a first-- and second--order analysis of different optimal control problems, characterizing optimal controls, establishing regularity results for optimal controls, and providing a numerical analysis for a Galerkin--based numerical scheme.
The Fokker--Planck equation is a partial differential equation (PDE) of linear parabolic type deeply connected to the theory of stochastic processes and stochastic differential equations. In essence, it describes the evolution over time of the probability distribution of the state of an object or system of objects under the influence of both deterministic and stochastic forces.
The FP equation is a cornerstone in understanding and modeling phenomena ranging from the diffusion and motion of molecules in a fluid to the fluctuations in financial markets.
Two different types of optimal control problems are analyzed in this thesis. On the one hand, Fokker--Planck ensemble optimal control problems are considered that have a wide range of applications in controlling a system of multiple non--interacting objects. In this framework, the goal is to collectively drive each object into a desired state.
On the other hand, tracking--type control problems are investigated, commonly used in parameter identification problems or stemming from the field of inverse problems.
In this framework, the aim is to determine certain parameters or functions of the FP equation, such that the resulting probability distribution function takes a desired form, possibly observed by measurements.
In both cases, we consider FP models where the control functions are part of the drift, arising only from the deterministic forces of the system. Therefore, the FP optimal control problem has a bilinear control structure.
Box constraints on the controls may be present, and the focus is on time--space dependent controls for ensemble--type problems and on only time--dependent controls for tracking--type optimal control problems.
In the first chapter of the thesis, a proof of the connection between the FP equation and stochastic differential equations is provided. Additionally, stochastic optimal control problems, aiming to minimize an expected cost value, are introduced, and the corresponding formulation within a deterministic FP control framework is established.
For the analysis of this PDE--constrained optimal control problem, the existence, and regularity of solutions to the FP problem are investigated. New $L^\infty$--estimates for solutions are established for low space dimensions under mild assumptions on the drift. Furthermore, based on the theory of Bessel potential spaces, new smoothness properties are derived for solutions to the FP problem in the case of only time--dependent controls. Due to these properties, the control--to--state map, which associates the control functions with the corresponding solution of the FP problem, is well--defined, Fréchet differentiable and compact for suitable Lebesgue spaces or Sobolev spaces.
The existence of optimal controls is proven under various assumptions on the space of admissible controls and objective functionals. First--order optimality conditions are derived using the adjoint system. The resulting characterization of optimal controls is exploited to achieve higher regularity of optimal controls, as well as their state and co--state functions.
Since the FP optimal control problem is non--convex due to its bilinear structure, a first--order analysis should be complemented by a second--order analysis.
Therefore, a second--order analysis for the ensemble--type control problem in the case of $H^1$--controls in time and space is performed, and sufficient second--order conditions are provided. Analogous results are obtained for the tracking--type problem for only time--dependent controls.
The developed theory on the control problem and the first-- and second--order optimality conditions is applied to perform a numerical analysis for a Galerkin discretization of the FP optimal control problem. The main focus is on tracking-type problems with only time--dependent controls. The idea of the presented Galerkin scheme is to first approximate the PDE--constrained optimization problem by a system of ODE--constrained optimization problems. Then, conditions on the problem are presented such that the convergence of optimal controls from one problem to the other can be guaranteed.
For this purpose, a class of bilinear ODE--constrained optimal control problems arising from the Galerkin discretization of the FP problem is analyzed. First-- and second--order optimality conditions are established, and a numerical analysis is performed. A discretization with linear finite elements for the state and co--state problem is investigated, while the control functions are approximated by piecewise constant or piecewise quadratic continuous polynomials. The latter choice is motivated by the bilinear structure of the optimal control problem, allowing to overcome the discrepancies between a discretize--then--optimize and optimize--then--discretize approach. Moreover, second--order accuracy results are shown using the space of continuous, piecewise quadratic polynomials as the discrete space of controls. Lastly, the theoretical results and the second--order convergence rates are numerically verified.
The goal of this thesis is to study the topological and algebraic properties of the quasiconformal automorphism groups of simply and multiply connected domains in the complex plain, in which the quasiconformal automorphism groups are endowed with the supremum metric on the underlying domain. More precisely, questions concerning central topological properties such as (local) compactness, (path)-connectedness and separability and their dependence on the boundary of the corresponding domains are studied, as well as completeness with respect to the supremum metric. Moreover, special subsets of the quasiconformal automorphism group of the unit disk are investigated, and concrete quasiconformal automorphisms are constructed. Finally, a possible application of quasiconformal unit disk automorphisms to symmetric cryptography is presented, in which a quasiconformal cryptosystem is defined and studied.
Physical regimes characterized by low Mach numbers and steep stratifications pose severe challenges to standard finite volume methods. We present three new methods specifically designed to navigate these challenges by being both low Mach compliant and well-balanced. These properties are crucial for numerical methods to efficiently and accurately compute solutions in the regimes considered.
First, we concentrate on the construction of an approximate Riemann solver within Godunov-type finite volume methods. A new relaxation system gives rise to a two-speed relaxation solver for the Euler equations with gravity. Derived from fundamental mathematical principles, this solver reduces the artificial dissipation in the subsonic regime and preserves hydrostatic equilibria. The solver is particularly stable as it satisfies a discrete entropy inequality, preserves positivity of density and internal energy, and suppresses checkerboard modes.
The second scheme is designed to solve the equations of ideal MHD and combines different approaches. In order to deal with low Mach numbers, it makes use of a low-dissipation version of the HLLD solver and a partially implicit time discretization to relax the CFL time step constraint. A Deviation Well-Balancing method is employed to preserve a priori known magnetohydrostatic equilibria and thereby reduces the magnitude of spatial discretization errors in strongly stratified setups.
The third scheme relies on an IMEX approach based on a splitting of the MHD equations. The slow scale part of the system is discretized by a time-explicit Godunov-type method, whereas the fast scale part is discretized implicitly by central finite differences. Numerical dissipation terms and CFL time step restriction of the method depend solely on the slow waves of the explicit part, making the method particularly suited for subsonic regimes. Deviation Well-Balancing ensures the preservation of a priori known magnetohydrostatic equilibria.
The three schemes are applied to various numerical experiments for the compressible Euler and ideal MHD equations, demonstrating their ability to accurately simulate flows in regimes with low Mach numbers and strong stratification even on coarse grids.
The focus of this thesis is on analysing a linear stochastic partial differential equation (SPDE) with a bounded domain. The first part of the thesis commences with an examination of a one-dimensional SPDE. In this context, we construct estimators for the parameters of a parabolic SPDE based on discrete observations of a solution in time and space on a bounded domain. We establish central limit theorems for a high-frequency asymptotic regime, showing substantially smaller asymptotic variances compared to existing estimation methods. Moreover, asymptotic confidence intervals are directly feasible. Our approach builds upon realized volatilities and their asymptotic illustration as the response of a log-linear model with a spatial explanatory variable. This yields efficient estimators based on realized volatilities with optimal rates of convergence and minimal variances. We demonstrate our results by Monte Carlo simulations.
Extending this framework, we analyse a second-order SPDE model in multiple space dimensions in the second part of this thesis and develop estimators for the parameters of this model based on discrete observations in time and space on a bounded domain. While parameter estimation for one and two spatial dimensions was established in recent literature, this is the first work that generalizes the theory to a general, multi-dimensional framework. Our methodology enables the construction of an oracle estimator for volatility within the underlying model. For proving central limit theorems, we use a high-frequency observation scheme. To showcase our results, we conduct a Monte Carlo simulation, highlighting the advantages of our novel approach in a multi-dimensional context.
We generalize a theorem by Titchmarsh about the mean value of Hardy’s \(Z\)-function at the Gram points to the Hecke \(L\)-functions, which in turn implies the weak Gram law for them. Instead of proceeding analogously to Titchmarsh with an approximate functional equation we employ a different method using contour integration.
For a graph \(\Gamma\) , let K be the smallest field containing all eigenvalues of the adjacency matrix of \(\Gamma\) . The algebraic degree \(\deg (\Gamma )\) is the extension degree \([K:\mathbb {Q}]\). In this paper, we completely determine the algebraic degrees of Cayley graphs over abelian groups and dihedral groups.
The concept of derivative is characterised with reference to four basic mental models. These are described as theoretical constructs based on theoretical considerations. The four basic mental models—local rate of change, tangent slope, local linearity and amplification factor—are not only quantified empirically but are also validated. To this end, a test instrument for measuring students’ characteristics of basic mental models is presented and analysed regarding quality criteria.
Mathematics students (n = 266) were tested with this instrument. The test results show that the four basic mental models of the derivative can be reconstructed among the students with different characteristics. The tangent slope has the highest agreement values across all tasks. The agreement on explanations based on the basic mental model of rate of change is not as strongly established among students as one would expect due to framework settings in the school system by means of curricula and educational standards. The basic mental model of local linearity plays a rather subordinate role. The amplification factor achieves the lowest agreement values. In addition, cluster analysis was conducted to identify different subgroups of the student population. Moreover, the test results can be attributed to characteristics of the task types as well as to the students’ previous experiences from mathematics classes by means of qualitative interpretation. These and other results of students’ basic mental models of the derivative are presented and discussed in detail.
Mathematical concepts are regularly used in media reports concerning the Covid-19 pandemic. These include growth models, which attempt to explain or predict the effectiveness of interventions and developments, as well as the reproductive factor. Our contribution has the aim of showing that basic mental models about exponential growth are important for understanding media reports of Covid-19. Furthermore, we highlight how the coronavirus pandemic can be used as a context in mathematics classrooms to help students understand that they can and should question media reports on their own, using their mathematical knowledge. Therefore, we first present the role of mathematical modelling in achieving these goals in general. The same relevance applies to the necessary basic mental models of exponential growth. Following this description, based on three topics, namely, investigating the type of growth, questioning given course models, and determining exponential factors at different times, we show how the presented theoretical aspects manifest themselves in teaching examples when students are given the task of reflecting critically on existing media reports. Finally, the value of the three topics regarding the intended goals is discussed and conclusions concerning the possibilities and limits of their use in schools are drawn.
We extend Bourgain’s bound for the order of growth of the Riemann zeta function on the critical line to Lerch zeta functions. More precisely, we prove L(λ, α, 1/2 + it) ≪ t\(^{13/84+ϵ}\) as t → ∞. For both, the Riemann zeta function as well as for the more general Lerch zeta function, it is conjectured that the right-hand side can be replaced by t\(^ϵ\) (which is the so-called Lindelöf hypothesis). The growth of an analytic function is closely related to the distribution of its zeros.
For a connected real Lie group G we consider the canonical standard-ordered star product arising from the canonical global symbol calculus based on the half-commutator connection of G. This star product trivially converges on polynomial functions on T\(^*\)G thanks to its homogeneity. We define a nuclear Fréchet algebra of certain analytic functions on T\(^*\)G, for which the standard-ordered star product is shown to be a well-defined continuous multiplication, depending holomorphically on the deformation parameter \(\hbar\). This nuclear Fréchet algebra is realized as the completed (projective) tensor product of a nuclear Fréchet algebra of entire functions on G with an appropriate nuclear Fréchet algebra of functions on \({\mathfrak {g}}^*\). The passage to the Weyl-ordered star product, i.e. the Gutt star product on T\(^*\)G, is shown to preserve this function space, yielding the continuity of the Gutt star product with holomorphic dependence on \(\hbar\).
This paper studies differential graded modules and representations up to homotopy of Lie n-algebroids, for general \(n\in {\mathbb {N}}\). The adjoint and coadjoint modules are described, and the corresponding split versions of the adjoint and coadjoint representations up to homotopy are explained. In particular, the case of Lie 2-algebroids is analysed in detail. The compatibility of a Poisson bracket with the homological vector field of a Lie n-algebroid is shown to be equivalent to a morphism from the coadjoint module to the adjoint module, leading to an alternative characterisation of non-degeneracy of higher Poisson structures. Moreover, the Weil algebra of a Lie n-algebroid is computed explicitly in terms of splittings, and representations up to homotopy of Lie n-algebroids are used to encode decomposed VB-Lie n-algebroid structures on double vector bundles.
Providing adaptive, independence-preserving and theory-guided support to students in dealing with real-world problems in mathematics lessons is a major challenge for teachers in their professional practice. This paper examines this challenge in the context of simulations and mathematical modelling with digital tools: in addition to mathematical difficulties when autonomously working out individual solutions, students may also experience challenges when using digital tools. These challenges need to be closely examined and diagnosed, and might – if necessary – have to be overcome by intervention in such a way that the students can subsequently continue working independently. Thus, if a difficulty arises in the working process, two knowledge dimensions are necessary in order to provide adapted support to students. For teaching simulations and mathematical modelling with digital tools, more specifically, these knowledge dimensions are: pedagogical content knowledge about simulation and modelling processes supported by digital tools (this includes knowledge about phases and difficulties in the working process) and pedagogical content knowledge about interventions during the mentioned processes (focussing on characteristics of suitable interventions as well as their implementation and effects on the students’ working process). The two knowledge dimensions represent cognitive dispositions as the basis for the conceptualisation and operationalisation of a so-called adaptive intervention competence for teaching simulations and mathematical modelling with digital tools. In our article, we present a domain-specific process model and distinguish different types of teacher interventions. Then we describe the design and content of a university course at two German universities aiming to promote this domain-specific professional adaptive intervention competence, among others. In a study using a quasi-experimental pre-post design (N = 146), we confirm that the structure of cognitive dispositions of adaptive intervention competence for teaching simulations and mathematical modelling with digital tools can be described empirically by a two-dimensional model. In addition, the effectiveness of the course is examined and confirmed quantitatively. Finally, the results are discussed, especially against the background of the sample and the research design, and conclusions are derived for possibilities of promoting professional adaptive intervention competence in university courses.
This thesis, first, is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints, subsequently, as well as constrained structured optimization problems featuring a composite objective function and set-membership constraints. It is then concerned to convergence and rate-of-convergence analysis of proximal gradient methods for the composite optimization problems in the presence of the Kurdyka--{\L}ojasiewicz property without global Lipschitz assumption.
To study coisotropic reduction in the context of deformation quantization we introduce constraint manifolds and constraint algebras as the basic objects encoding the additional information needed to define a reduction. General properties of various categories of constraint objects and their compatiblity with reduction are examined. A constraint Serre-Swan theorem, identifying constraint vector bundles with certain finitely generated projective constraint modules, as well as a constraint symbol calculus are proved. After developing the general deformation theory of constraint algebras, including constraint Hochschild cohomology and constraint differential graded Lie algebras, the second constraint Hochschild cohomology for the constraint algebra of functions on a constraint flat space is computed.
We present a technique for computing multi-branch-point covers with prescribed ramification and demonstrate the applicability of our method in relatively large degrees by computing several families of polynomials with symplectic and linear Galois groups.
As a first application, we present polynomials over \(\mathbb{Q}(\alpha,t)\) for the primitive rank-3 groups \(PSp_4(3)\) and \(PSp_4(3).C_2\) of degree 27 and for the 2-transitive group \(PSp_6(2)\) in its actions on 28 and 36 points, respectively. Moreover, the degree-28 polynomial for \(PSp_6(2)\) admits infinitely many totally real specializations.
Next, we present the first (to the best of our knowledge) explicit polynomials for the 2-transitive linear groups \(PSL_4(3)\) and \(PGL_4(3)\) of degree 40, and the imprimitive group \(Aut(PGL_4(3))\) of degree 80.
Additionally, we negatively answer a question by König whether there exists a degree-63 rational function with rational coefficients and monodromy group \(PSL_6(2)\) ramified over at least four points. This is achieved due to the explicit computation of the corresponding hyperelliptic genus-3 Hurwitz curve parameterizing this family, followed by a search for rational points on it. As a byproduct of our calculations we obtain the first explicit \(Aut(PSL_6(2))\)-realizations over \(\mathbb{Q}(t)\).
At last, we present a technique by Elkies for bounding the transitivity degree of Galois groups. This provides an alternative way to verify the Galois groups from the previous chapters and also yields a proof that the monodromy group of a degree-276 cover computed by Monien is isomorphic to the sporadic 2-transitive Conway group \(Co_3\).
Ó. Blasco and S. Pott showed that the supremum of operator norms over L\(^{2}\) of all bicommutators (with the same symbol) of one-parameter Haar multipliers dominates the biparameter dyadic product BMO norm of the symbol itself. In the present work we extend this result to the Bloom setting, and to any exponent 1 < p < ∞. The main tool is a new characterization in terms of paraproducts and two-weight John–Nirenberg inequalities for dyadic product BMO in the Bloom setting. We also extend our results to the whole scale of indexed spaces between little bmo and product BMO in the general multiparameter setting, with the appropriate iterated commutator in each case.
Optimization problems with composite functions deal with the minimization of the sum
of a smooth function and a convex nonsmooth function. In this thesis several numerical
methods for solving such problems in finite-dimensional spaces are discussed, which are
based on proximity operators.
After some basic results from convex and nonsmooth analysis are summarized, a first-order
method, the proximal gradient method, is presented and its convergence properties are
discussed in detail. Known results from the literature are summarized and supplemented by
additional ones. Subsequently, the main part of the thesis is the derivation of two methods
which, in addition, make use of second-order information and are based on proximal Newton
and proximal quasi-Newton methods, respectively. The difference between the two methods
is that the first one uses a classical line search, while the second one uses a regularization
parameter instead. Both techniques lead to the advantage that, in contrast to many similar
methods, in the respective detailed convergence analysis global convergence to stationary
points can be proved without any restricting precondition. Furthermore, comprehensive
results show the local convergence properties as well as convergence rates of these algorithms,
which are based on rather weak assumptions. Also a method for the solution of the arising
proximal subproblems is investigated.
In addition, the thesis contains an extensive collection of application examples and a detailed
discussion of the related numerical results.
In this work, we consider impulsive dynamical systems evolving on an infinite-dimensional space and subjected to external perturbations. We look for stability conditions that guarantee the input-to-state stability for such systems. Our new dwell-time conditions allow the situation, where both continuous and discrete dynamics can be unstable simultaneously. Lyapunov like methods are developed for this purpose. Illustrative finite and infinite dimensional examples are provided to demonstrate the application of the main results. These examples cannot be treated by any other published approach and demonstrate the effectiveness of our results.
Our starting point is the Jacobsthal function \(j(m)\), defined for each positive integer \(m\) as the smallest number such that every \(j(m)\) consecutive integers contain at least one integer relatively prime to \(m\). It has turned out that improving on upper bounds for \(j(m)\) would also lead to advances in understanding the distribution of prime numbers among arithmetic progressions. If \(P_r\) denotes the product of the first \(r\) prime numbers, then a conjecture of Montgomery states that \(j(P_r)\) can be bounded from above by \(r (\log r)^2\) up to some constant factor. However, the until now very promising sieve methods seem to have reached a limit here, and the main goal of this work is to develop other combinatorial methods in hope of coming a bit closer to prove the conjecture of Montgomery. Alongside, we solve a problem of Recamán about the maximum possible length among arithmetic progressions in the least (positive) reduced residue system modulo \(m\). Lastly, we turn towards three additive representation functions as introduced by Erdős, Sárközy and Sós who studied their surprising different monotonicity behavior. By an alternative approach, we answer a question of Sárközy and demostrate that another conjecture does not hold.
We give a collection of 16 examples which show that compositions \(g\) \(\circ\) \(f\) of well-behaved functions \(f\) and \(g\) can be badly behaved. Remarkably, in 10 of the 16 examples it suffices to take as outer function \(g\) simply a power-type or characteristic function. Such a collection of examples may serve as a source of exercises for a calculus course.
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the objective function is of simple enough structure. The available convergence theory associated with these methods (mostly) requires the derivative of the smooth part of the objective function to be (globally) Lipschitz continuous, and this might be a restrictive assumption in some practically relevant scenarios. In this paper, we readdress this classical topic and provide convergence results for the classical (monotone) proximal gradient method and one of its nonmonotone extensions which are applicable in the absence of (strong) Lipschitz assumptions. This is possible since, for the price of forgoing convergence rates, we omit the use of descent-type lemmas in our analysis.
Let (ϕ\(_t\))\(_{t≥0}\) be a semigroup of holomorphic functions in the unit disk \(\mathbb {D}\) and K a compact subset of \(\mathbb {D}\). We investigate the conditions under which the backward orbit of K under the semigroup exists. Subsequently, the geometric characteristics, as well as, potential theoretic quantities for the backward orbit of K are examined. More specifically, results are obtained concerning the asymptotic behavior of its hyperbolic area and diameter, the harmonic measure and the capacity of the condenser that K forms with the unit disk.
We construct a foliation of an asymptotically flat end of a Riemannian manifold by hypersurfaces which are critical points of a natural functional arising in potential theory. These hypersurfaces are perturbations of large coordinate spheres, and they admit solutions of a certain over-determined boundary value problem involving the Laplace–Beltrami operator. In a key step we must invert the Dirichlet-to-Neumann operator, highlighting the nonlocal nature of our problem.
Bivariate copula monitoring
(2022)
The assumption of multivariate normality underlying the Hotelling T\(^{2}\) chart is often violated for process data. The multivariate dependency structure can be separated from marginals with the help of copula theory, which permits to model association structures beyond the covariance matrix. Copula‐based estimation and testing routines have reached maturity regarding a variety of practical applications. We have constructed a rich design matrix for the comparison of the Hotelling T\(^{2}\) chart with the copula test by Verdier and the copula test by Vuong, which allows for weighting the observations adaptively. Based on the design matrix, we have conducted a large and computationally intensive simulation study. The results show that the copula test by Verdier performs better than Hotelling T\(^{2}\) in a large variety of out‐of‐control cases, whereas the weighted Vuong scheme often fails to provide an improvement.
A sequentialquadratic Hamiltonian schemefor solving open-loop differential Nash games is proposed and investigated. This method is formulated in the framework of the Pontryagin maximum principle and represents an efficient and robust extension of the successive approximations strategy for solving optimal control problems. Theoretical results are presented that prove the well-posedness of the proposed scheme, and results of numerical experiments are reported that successfully validate its computational performance.
We prove a sharp Bernstein-type inequality for complex polynomials which are positive and satisfy a polynomial growth condition on the positive real axis. This leads to an improved upper estimate in the recent work of Culiuc and Treil (Int. Math. Res. Not. 2019: 3301–3312, 2019) on the weighted martingale Carleson embedding theorem with matrix weights. In the scalar case this new upper bound is optimal.
Nowadays, science, technology, engineering, and mathematics (STEM) play a critical role in a nation’s global competitiveness and prosperity. Thus, there is a need to educate students in these subjects to meet the current and future demands of personal life and society. While applications, especially in science, engineering, and technology, are directly obvious, mathematics underpins the other STEM disciplines. It is recognized that mathematics is the foundation for all other STEM disciplines; the role of mathematics in classrooms is not clear yet. Therefore, the question arises: What is the current role of mathematics in secondary STEM classrooms? To answer this question, we conducted a systematic literature review based on three publication databases (Web of Science, ERIC, and EBSCO Teacher Referral Center). This literature review paper is intended to contribute to the current state of the role of mathematics in STEM education in secondary classrooms. Through the search, starting with 1910 documents, only 14 eligible documents were found. In these, mathematics is often seen as a minor matter and a means to an end in the eyes of science educators. From this, we conclude that the role of mathematics in the STEM classroom should be further strengthened. Overall, the paper highlights a major research gap, and proposes possible initial solutions to close it.
Coisotropic algebras consist of triples of algebras for which a reduction can be defined and unify in a very algebraic fashion coisotropic reduction in several settings. In this paper, we study the theory of (formal) deformation of coisotropic algebras showing that deformations are governed by suitable coisotropic DGLAs. We define a deformation functor and prove that it commutes with reduction. Finally, we study the obstructions to existence and uniqueness of coisotropic algebras and present some geometric examples.
The article deals with the pedagogical content knowledge of mathematical modelling as part of the professional competence of pre-service teachers. With the help of a test developed for this purpose from a conceptual model, we examine whether this pedagogical content knowledge can be promoted in its different facets—especially knowledge about modelling tasks and about interventions—by suitable university seminars. For this purpose, the test was administered to three groups in a seminar for the teaching of mathematical modelling: (1) to those respondents who created their own modelling tasks for use with students, (2) to those trained to intervene in mathematical modelling processes, and (3) participating students who are not required to address mathematical modelling. The findings of the study—based on variance analysis—indicate that certain facets (knowledge of modelling tasks, modelling processes, and interventions) have increased significantly in both experimental groups but to varying degrees. By contrast, pre-service teachers in the control group demonstrated no significant change to their level of pedagogical content knowledge.
Global Existence and Uniqueness Results for Nematic Liquid Crystal and Magnetoviscoelastic Flows
(2022)
Liquid crystals and polymeric fluids are found in many technical applications with liquid crystal displays probably being the most prominent one. Ferromagnetic materials are well established in industrial and everyday use, e.g. as magnets in generators, transformers and hard drive disks. Among ferromagnetic materials, we find a subclass which undergoes deformations if an external magnetic field is applied. This effect is exploited in actuators, magnetoelastic sensors, and new fluid materials have been produced which retain their induced magnetization during the flow.
A central issue consists of a proper modelling for those materials. Several models exist regarding liquid crystals and liquid crystal flows, but up to now, none of them has provided a full insight into all observed effects. On materials encompassing magnetic, elastic and perhaps even fluid dynamic effects, the mathematical literature seems sparse in terms of models. To some extent, one can unify the modeling of nematic liquid crystals and magnetoviscoelastic materials employing a so-called energetic variational approach.
Using the least action principle from theoretical physics, the actual task reduces to finding appropriate energies describing the observed behavior. The procedure leads to systems of evolutionary partial differential equations, which are analyzed in this work.
From the mathematical point of view, fundamental questions on existence, uniqueness and stability of solutions remain unsolved. Concerning the Ericksen-Leslie system modelling nematic liquid crystal flows, an approximation to this model is given by the so-called Ginzburg-Landau approximation. Solutions to the latter are intended to approximately represent solutions to the Ericksen-Leslie system. Indeed, we verify this presumption in two spatial dimensions. More precisely, it is shown that weak solutions of the Ginzburg-Landau approximation converge to solutions of the Ericksen-Leslie system in the energy space for all positive times of evolution. In order to do so, theory for the Euler equations invented by DiPerna and Majda on weak compactness and concentration measures is used.
The second part of the work deals with a system of partial differential equations modelling magnetoviscoelastic fluids. We provide a well-posedness result in two spatial dimensions for large energies and large times. Along the verification of that conclusion, existing theory on the Ericksen-Leslie system and the harmonic map flow is deployed and suitably extended.
In this paper we study properties of the Laplace approximation of the posterior distribution arising in nonlinear Bayesian inverse problems. Our work is motivated by Schillings et al. (Numer Math 145:915–971, 2020. https://doi.org/10.1007/s00211-020-01131-1), where it is shown that in such a setting the Laplace approximation error in Hellinger distance converges to zero in the order of the noise level. Here, we prove novel error estimates for a given noise level that also quantify the effect due to the nonlinearity of the forward mapping and the dimension of the problem. In particular, we are interested in settings in which a linear forward mapping is perturbed by a small nonlinear mapping. Our results indicate that in this case, the Laplace approximation error is of the size of the perturbation. The paper provides insight into Bayesian inference in nonlinear inverse problems, where linearization of the forward mapping has suitable approximation properties.
Die Auseinandersetzung mit Simulations- und Modellierungsaufgaben, die mit digitalen Werkzeugen zu bearbeiten sind, stellt veränderte Anforderungen an Mathematiklehrkräfte in der Unterrichtsplanung und -durchführung. Werden digitale Werkzeuge sinnvoll eingesetzt, so unterstützen sie Simulations- und Modellierungsprozesse und ermöglichen realitätsnähere Sachkontexte im Mathematikunterricht. Für die empirische Untersuchung professioneller Kompetenzen zum Lehren des Simulierens und mathematischen Modellierens mit digitalen Werkzeugen ist es notwendig, Aspekte globaler Lehrkompetenzen von (angehenden) Mathematiklehrkräften bereichsspezifisch auszudeuten.
Daher haben wir ein Testinstrument entwickelt, das die Überzeugungen, die Selbstwirksamkeitserwartungen und das fachdidaktische Wissen zum Lehren des Simulierens und mathematischen Modellierens mit digitalen Werkzeugen erfasst. Ergänzt wird das Testinstrument durch selbstberichtete Vorerfahrungen zum eigenen Gebrauch digitaler Werkzeuge sowie zur Verwendung digitaler Werkzeuge in Unterrichtsplanung und -durchführung.
Das Testinstrument ist geeignet, um mittels Analysen von Veranstaltungsgruppen im Prä-Post-Design den Zuwachs der oben beschriebenen Kompetenz von (angehenden) Mathematiklehrkräften zu messen. Somit können in Zukunft anhand der Ergebnisse die Wirksamkeit von Lehrveranstaltungen, die diese Kompetenz fördern (sollen), untersucht und evaluiert werden.
Der Beitrag gliedert sich in zwei Teile: Zunächst werden in der Testbeschreibung das zugrundeliegende Konstrukt und der Anwendungsbereich des Testinstruments sowie dessen Aufbau und Hinweise zur Durchführung beschrieben. Zudem wird die Testgüte anhand der Pilotierungsergebnisse überprüft. Im zweiten Teil befindet sich das vollständige Testinstrument.
The dissertation investigates the wide class of Epstein zeta-functions in terms of uniform distribution modulo one of the ordinates of their nontrivial zeros. Main results are a proof of a Landau type theorem for all Epstein zeta-functions as well as uniform distribution modulo one for the zero ordinates of all Epstein zeta-functions asscoiated with binary quadratic forms.
In financial mathematics, it is a typical approach to approximate financial markets operating in discrete time by continuous-time models such as the Black Scholes model. Fitting this model gives rise to difficulties due to the discrete nature of market data. We thus model the pricing process of financial derivatives by the Black Scholes equation, where the volatility is a function of a finite number of random variables. This reflects an influence of uncertain factors when determining volatility. The aim is to quantify the effect of this uncertainty when computing the price of derivatives. Our underlying method is the generalized Polynomial Chaos (gPC) method in order to numerically compute the uncertainty of the solution by the stochastic Galerkin approach and a finite difference method. We present an efficient numerical variation of this method, which is based on a machine learning technique, the so-called Bi-Fidelity approach. This is illustrated with numerical examples.
Die vorliegende Arbeit beschäftigt sich explorativ mit Metakognition beim Umgang mit Mathematik. Aufbauend auf der vorgestellten Forschungsliteratur wird der Einsatz von Metakognition im Rahmen einer qualitativen Studie bei Studienanfänger_innen aus verschiedenen Mathematik-(Lehramts-)Studiengängen dokumentiert. Unter Verwendung der Qualitativen Inhaltsanalyse nach Mayring erfolgt die Etablierung eines Kategoriensystems für den Begriff Metakognition im Hinblick auf den Einsatz in der Mathematik, das bisherige Systematisierungen erweitert. Schließlich wird der Einsatz der entsprechenden metakognitiven Aspekte am Beispiel verschiedener Begriffe und Verfahren aus dem Analysis-Unterricht exemplarisch aufgezeigt.
In dieser Arbeit wird mathematisches Papierfalten und speziell 1-fach-Origami im universitären Kontext untersucht. Die Arbeit besteht aus drei Teilen.
Der erste Teil ist im Wesentlichen der Sachanalyse des 1-fach-Origami gewidmet. Im ersten Kapitel gehen wir auf die geschichtliche Einordnung des 1-fach-Origami, betrachten axiomatische Grundlagen und diskutieren, wie das Axiomatisieren von 1-fach-Origami zum Verständnis des Axiomenbegriffs beitragen könnte. Im zweiten Kapitel schildern wir das Design der zugehörigen explorativen Studie, beschreiben unsere Forschungsziele und -fragen. Im dritten Kapitel wird 1-fach-Origami mathematisiert, definiert und eingehend untersucht.
Der zweite Teil beschäftigt sich mit den von uns gestalteten und durchgeführten Kursen »Axiomatisieren lernen mit Papierfalten«. Im vierten Kapitel beschreiben wir die Lehrmethodik und die Gestaltung der Kurse, das fünfte Kapitel enthält ein Exzerpt der Kurse.
Im dritten Teil werden die zugehörigen Tests beschrieben. Im sechsten Kapitel erläutern wir das Design der Tests sowie die Testmethodik. Im siebten Kapitel findet die Auswertung ebendieser Tests statt.
Functions of bounded variation are most important in many fields of mathematics. This thesis investigates spaces of functions of bounded variation with one variable of various types, compares them to other classical function spaces and reveals natural “habitats” of BV-functions. New and almost comprehensive results concerning mapping properties like surjectivity and injectivity, several kinds of continuity and compactness of both linear and nonlinear operators between such spaces are given. A new theory about different types of convergence of sequences of such operators is presented in full detail and applied to a new proof for the continuity of the composition operator in the classical BV-space. The abstract results serve as ingredients to solve Hammerstein and Volterra integral equations using fixed point theory. Many criteria guaranteeing the existence and uniqueness of solutions in BV-type spaces are given and later applied to solve boundary and initial value problems in a nonclassical setting.
A big emphasis is put on a clear and detailed discussion. Many pictures and synoptic tables help to visualize and summarize the most important ideas. Over 160 examples and counterexamples illustrate the many abstract results and how delicate some of them are.
We compute genus-0 Belyi maps with prescribed monodromy and strictly verify the computed results. Among the computed examples are almost simple primitive groups that satisfy the rational rigidity criterion yielding polynomials with prescribed Galois groups over Q(t). We also give an explicit version of a theorem of Magaard, which lists all sporadic groups occurring as composition factors of monodromy groups of rational functions.
A reformulation of cardinality-constrained optimization problems into continuous nonlinear optimization problems with an orthogonality-type constraint has gained some popularity during the last few years. Due to the special structure of the constraints, the reformulation violates many standard assumptions and therefore is often solved using specialized algorithms. In contrast to this, we investigate the viability of using a standard safeguarded multiplier penalty method without any problem-tailored modifications to solve the reformulated problem. We prove global convergence towards an (essentially strongly) stationary point under a suitable problem-tailored quasinormality constraint qualification. Numerical experiments illustrating the performance of the method in comparison to regularization-based approaches are provided.
The bounded input bounded output (BIBO) stability for a nonlinear Caputo fractional system with time‐varying bounded delay and nonlinear output is studied. Utilizing the Razumikhin method, Lyapunov functions and appropriate fractional derivatives of Lyapunov functions some new bounded input bounded output stability criteria are derived. Also, explicit and independent on the initial time bounds of the output are provided. Uniform BIBO stability and uniform BIBO stability with input threshold are studied. A numerical simulation is carried out to show the system's dynamic response, and demonstrate the effectiveness of our theoretical results.
One of the major motivations for the analysis and modeling of time series data is the forecasting of future outcomes. The use of interval forecasts instead of point forecasts allows us to incorporate the apparent forecast uncertainty. When forecasting count time series, one also has to account for the discreteness of the range, which is done by using coherent prediction intervals (PIs) relying on a count model. We provide a comprehensive performance analysis of coherent PIs for diverse types of count processes. We also compare them to approximate PIs that are computed based on a Gaussian approximation. Our analyses rely on an extensive simulation study. It turns out that the Gaussian approximations do considerably worse than the coherent PIs. Furthermore, special characteristics such as overdispersion, zero inflation, or trend clearly affect the PIs' performance. We conclude by presenting two empirical applications of PIs for count time series: the demand for blood bags in a hospital and the number of company liquidations in Germany.
We investigate the convergence of the proximal gradient method applied to control problems with non-smooth and non-convex control cost. Here, we focus on control cost functionals that promote sparsity, which includes functionals of L\(^{p}\)-type for p\in [0,1). We prove stationarity properties of weak limit points of the method. These properties are weaker than those provided by Pontryagin’s maximum principle and weaker than L-stationarity.
In this paper we derive new results on multivariate extremes and D-norms. In particular we establish new characterizations of the multivariate max-domain of attraction property. The limit distribution of certain multivariate exceedances above high thresholds is derived, and the distribution of that generator of a D-norm on R\(^{d}\), whose components sum up to d, is obtained. Finally we introduce exchangeable D-norms and show that the set of exchangeable D-norms is a simplex.
We investigate eigenvalues of the zero-divisor graph Γ(R) of finite commutative rings R and study the interplay between these eigenvalues, the ring-theoretic properties of R and the graph-theoretic properties of Γ(R). The graph Γ(R) is defined as the graph with vertex set consisting of all nonzero zero-divisors of R and adjacent vertices x, y whenever xy=0. We provide formulas for the nullity of Γ(R), i.e., the multiplicity of the eigenvalue 0 of Γ(R). Moreover, we precisely determine the spectra of \(\Gamma ({\mathbb {Z}}_p \times {\mathbb {Z}}_p \times {\mathbb {Z}}_p)\) and \(\Gamma ({\mathbb {Z}}_p \times {\mathbb {Z}}_p \times {\mathbb {Z}}_p \times {\mathbb {Z}}_p)\) for a prime number p. We introduce a graph product ×Γ with the property that Γ(R)≅Γ(R\(_1\))×Γ⋯×ΓΓ(R\(_r\)) whenever R≅R\(_1\)×⋯×R\(_r\). With this product, we find relations between the number of vertices of the zero-divisor graph Γ(R), the compressed zero-divisor graph, the structure of the ring R and the eigenvalues of Γ(R).
In this article we collect some recent results on the global existence of weak solutions for diffuse interface models involving incompressible magnetic fluids. We consider both the cases of matched and unmatched specific densities. For the model involving fluids with identical densities we consider the free energy density to be a double well potential whereas for the unmatched density case it is crucial to work with a singular free energy density.
Circadian endogenous clocks of eukaryotic organisms are an established and rapidly developing research field. To investigate and simulate in an effective model the effect of external stimuli on such clocks and their components we developed a software framework for download and simulation. The application is useful to understand the different involved effects in a mathematical simple and effective model. This concerns the effects of Zeitgebers, feedback loops and further modifying components. We start from a known mathematical oscillator model, which is based on experimental molecular findings. This is extended with an effective framework that includes the impact of external stimuli on the circadian oscillations including high dose pharmacological treatment. In particular, the external stimuli framework defines a systematic procedure by input-output-interfaces to couple different oscillators. The framework is validated by providing phase response curves and ranges of entrainment. Furthermore, Aschoffs rule is computationally investigated. It is shown how the external stimuli framework can be used to study biological effects like points of singularity or oscillators integrating different signals at once. The mathematical framework and formalism is generic and allows to study in general the effect of external stimuli on oscillators and other biological processes. For an easy replication of each numerical experiment presented in this work and an easy implementation of the framework the corresponding Mathematica files are fully made available. They can be downloaded at the following link: https://www.biozentrum.uni-wuerzburg.de/bioinfo/computing/circadian/.
Fluids in Gravitational Fields – Well-Balanced Modifications for Astrophysical Finite-Volume Codes
(2021)
Stellar structure can -- in good approximation -- be described as a hydrostatic state, which which arises due to a balance between gravitational force and pressure gradient. Hydrostatic states are static solutions of the full compressible Euler system with gravitational source term, which can be used to model the stellar interior. In order to carry out simulations of dynamical processes occurring in stars, it is vital for the numerical method to accurately maintain the hydrostatic state over a long time period. In this thesis we present different methods to modify astrophysical finite volume codes in order to make them \emph{well-balanced}, preventing them from introducing significant discretization errors close to hydrostatic states. Our well-balanced modifications are constructed so that they can meet the requirements for methods applied in the astrophysical context: They can well-balance arbitrary hydrostatic states with any equation of state that is applied to model thermodynamical relations and they are simple to implement in existing astrophysical finite volume codes. One of our well-balanced modifications follows given solutions exactly and can be applied on any grid geometry. The other methods we introduce, which do no require any a priori knowledge, balance local high order approximations of arbitrary hydrostatic states on a Cartesian grid. All of our modifications allow for high order accuracy of the method. The improved accuracy close to hydrostatic states is verified in various numerical experiments.
Chemotaxis describes the movement of an organism, such as single or multi-cellular organisms and bacteria, in response to a chemical stimulus. Two widely used models to describe the phenomenon are the celebrated Keller–Segel equation and a chemotaxis kinetic equation. These two equations describe the organism's movement at the macro- and mesoscopic level, respectively, and are asymptotically equivalent in the parabolic regime. The way in which the organism responds to a chemical stimulus is embedded in the diffusion/advection coefficients of the Keller–Segel equation or the turning kernel of the chemotaxis kinetic equation. Experiments are conducted to measure the time dynamics of the organisms' population level movement when reacting to certain stimulation. From this, one infers the chemotaxis response, which constitutes an inverse problem. In this paper, we discuss the relation between both the macro- and mesoscopic inverse problems, each of which is associated with two different forward models. The discussion is presented in the Bayesian framework, where the posterior distribution of the turning kernel of the organism population is sought. We prove the asymptotic equivalence of the two posterior distributions.