Kaiserslautern - Fachbereich Mathematik
Refine
Year of publication
- 1999 (131)
- 1995 (45)
- 1996 (44)
- 2000 (44)
- 2014 (43)
- 1992 (41)
- 2003 (39)
- 2005 (38)
- 1997 (36)
- 1998 (35)
- 1994 (34)
- 2007 (34)
- 2015 (34)
- 1991 (31)
- 2006 (31)
- 2001 (30)
- 2009 (30)
- 2011 (30)
- 2020 (30)
- 2022 (30)
- 1993 (28)
- 2008 (28)
- 2016 (28)
- 2021 (28)
- 2002 (27)
- 2013 (27)
- 2004 (26)
- 2012 (23)
- 2023 (23)
- 2010 (21)
- 2017 (19)
- 2018 (18)
- 2019 (13)
- 1990 (10)
- 1985 (8)
- 1984 (7)
- 1986 (6)
- 1987 (6)
- 1989 (6)
- 1988 (5)
- 2024 (4)
- 1979 (2)
- 1981 (1)
- 1983 (1)
Document Type
- Preprint (608)
- Doctoral Thesis (291)
- Report (121)
- Article (76)
- Diploma Thesis (26)
- Lecture (25)
- Master's Thesis (8)
- Course Material (5)
- Part of a Book (4)
- Study Thesis (4)
Keywords
- Mathematische Modellierung (19)
- MINT (16)
- Schule (16)
- Wavelet (14)
- Inverses Problem (12)
- Mehrskalenanalyse (12)
- Modellierung (12)
- Mathematikunterricht (9)
- praxisorientiert (9)
- Approximation (8)
- Boltzmann Equation (8)
- Regularisierung (8)
- Lineare Algebra (7)
- Location Theory (7)
- Numerical Simulation (7)
- Optimization (7)
- integer programming (7)
- Algebraische Geometrie (6)
- Finanzmathematik (6)
- Gravitationsfeld (6)
- Navier-Stokes-Gleichung (6)
- Portfolio Selection (6)
- modelling (6)
- wavelets (6)
- Elastizität (5)
- Elastoplastizität (5)
- Modellierungswoche (5)
- Numerische Mathematik (5)
- Stochastische dynamische Optimierung (5)
- haptotaxis (5)
- isogeometric analysis (5)
- nonparametric regression (5)
- portfolio optimization (5)
- time series (5)
- Combinatorial Optimization (4)
- Galerkin-Methode (4)
- Homogenisierung <Mathematik> (4)
- Hysterese (4)
- Kugel (4)
- Multicriteria optimization (4)
- NURBS (4)
- Optionspreistheorie (4)
- Portfolio-Optimierung (4)
- Simulation (4)
- Sphäre (4)
- hub location (4)
- linear algebra (4)
- mathematical education (4)
- multiscale model (4)
- network flows (4)
- neural network (4)
- numerics (4)
- praxis orientated (4)
- Analysis (3)
- Bewertung (3)
- Brownian motion (3)
- CHAMP <Satellitenmission> (3)
- Cauchy-Navier equation (3)
- Cauchy-Navier-Gleichung (3)
- Combinatorial optimization (3)
- Computeralgebra (3)
- Elastoplasticity (3)
- Erwarteter Nutzen (3)
- Finite-Volumen-Methode (3)
- Geodäsie (3)
- Geometric Ergodicity (3)
- Gravimetrie (3)
- Gröbner bases (3)
- Gröbner-Basis (3)
- Harmonische Spline-Funktion (3)
- Hysteresis (3)
- Intensity modulated radiation therapy (3)
- Kugelflächenfunktion (3)
- Lineare Optimierung (3)
- Monte-Carlo-Simulation (3)
- Mosco convergence (3)
- Multicriteria Optimization (3)
- Multiobjective optimization (3)
- Multiresolution Analysis (3)
- Numerische Strömungssimulation (3)
- Partial Differential Equations (3)
- Poisson-Gleichung (3)
- Portfolio Optimization (3)
- Portfoliomanagement (3)
- Randwertproblem / Schiefe Ableitung (3)
- Risikomanagement (3)
- Simplex (3)
- Sobolev-Raum (3)
- Spherical Wavelets (3)
- Spline (3)
- Spline-Approximation (3)
- Standortplanung (3)
- Stücklisten (3)
- Timetabling (3)
- Transaction Costs (3)
- Tropische Geometrie (3)
- Vektorwavelets (3)
- Wavelet-Analyse (3)
- autoregressive process (3)
- average density (3)
- combinatorial optimization (3)
- consecutive ones property (3)
- consistency (3)
- domain decomposition (3)
- facets (3)
- harmonic density (3)
- heuristic (3)
- kinetic equations (3)
- lattice Boltzmann method (3)
- low Mach number limit (3)
- optimales Investment (3)
- radiotherapy (3)
- tangent measure distributions (3)
- well-posedness (3)
- Algebraic Optimization (2)
- Algebraic dependence of commuting elements (2)
- Algebraische Abhängigkeit der kommutierende Elementen (2)
- Approximation Algorithms (2)
- Asymptotic Analysis (2)
- Asymptotic Expansion (2)
- Asymptotik (2)
- B-Spline (2)
- B-splines (2)
- Beam-on time (2)
- Biorthogonalisation (2)
- Biot-Savart Operator (2)
- Biot-Savart operator (2)
- CFD (2)
- CHAMP (2)
- Change analysis (2)
- Computer Algebra System (2)
- Computeralgebra System (2)
- Decomposition and Reconstruction Schemes (2)
- Decomposition cardinality (2)
- Delay Management (2)
- Derivat <Wertpapier> (2)
- Diffusionsprozess (2)
- Diskrete Fourier-Transformation (2)
- EM algorithm (2)
- Elastic BVP (2)
- Elasticity (2)
- Elastische Deformation (2)
- Elastisches RWP (2)
- Elastoplastisches RWP (2)
- Endliche Geometrie (2)
- Erdmagnetismus (2)
- FFT (2)
- Fatigue (2)
- Field splitting (2)
- Filtergesetz (2)
- Filtration (2)
- Finite Pointset Method (2)
- GOCE <Satellitenmission> (2)
- GRACE <Satellitenmission> (2)
- Geometrical Algorithms (2)
- Geothermal Flow (2)
- Graph Theory (2)
- Graphentheorie (2)
- Gruppentheorie (2)
- Hamilton-Jacobi-Differentialgleichung (2)
- Hochskalieren (2)
- Hypervolume (2)
- IMRT (2)
- Integer-valued time series (2)
- Inverse Problem (2)
- Isogeometrische Analyse (2)
- Jiang's model (2)
- Jiang-Modell (2)
- Konvergenz (2)
- Kreditrisiko (2)
- Langevin equation (2)
- Laplace transform (2)
- Lebensversicherung (2)
- Level-Set-Methode (2)
- Line Planning (2)
- Line Pool Generation (2)
- Lineare Elastizitätstheorie (2)
- Lineare partielle Differentialgleichung (2)
- Local smoothing (2)
- Logik (2)
- Lokalisation (2)
- Markov Chain (2)
- Mathematik (2)
- Mehrkriterielle Optimierung (2)
- Mehrskalenmodell (2)
- Mikrostruktur (2)
- Mixture Models (2)
- Modellbildung (2)
- Modulraum (2)
- Multileaf collimator sequencing (2)
- Multiobjective programming (2)
- Multiset Multicover (2)
- Multivariate Approximation (2)
- Neural networks (2)
- Numerisches Verfahren (2)
- Open Source Library (2)
- Optimal Control (2)
- Optimierung (2)
- Optimization in Public Transportation (2)
- POD (2)
- Palm distributions (2)
- Parallel volume (2)
- Particle Methods (2)
- Partielle Differentialgleichung (2)
- Poröser Stoff (2)
- Public Transport Planning (2)
- Rarefied Gas Dynamics (2)
- Ratenunabhängigkeit (2)
- Regressionsanalyse (2)
- Regularization (2)
- Robust Optimization (2)
- Scheduling (2)
- Schnitttheorie (2)
- Singularity theory (2)
- Sobolev spaces (2)
- Software for Public Transport Planning (2)
- Split Operator (2)
- Statistisches Modell (2)
- Stochastic Control (2)
- Stochastische Differentialgleichung (2)
- Stop Location (2)
- Subset selection (2)
- Theorie schwacher Lösungen (2)
- Time Series (2)
- Transaktionskosten (2)
- Up Functions (2)
- Upscaling (2)
- Value-at-Risk (2)
- Variationsungleichungen (2)
- Vehicle Scheduling (2)
- Vektorkugelfunktionen (2)
- Volatilität (2)
- Weißes Rauschen (2)
- White Noise Analysis (2)
- Wills functional (2)
- algebraic geometry (2)
- algorithmic game theory (2)
- approximate identity (2)
- asymptotic analysis (2)
- asymptotic behavior (2)
- average densities (2)
- cancer cell invasion (2)
- changepoint test (2)
- competitive analysis (2)
- connectedness (2)
- convergence (2)
- convex optimization (2)
- coset enumeration (2)
- curve singularity (2)
- degenerate diffusion (2)
- delay (2)
- density distribution (2)
- duality (2)
- dynamische Systeme (2)
- elastoplasticity (2)
- equilibrium strategies (2)
- evolutionary spectrum (2)
- finite volume method (2)
- geomagnetism (2)
- geometric ergodicity (2)
- global existence (2)
- harmonische Dichte (2)
- heat equation (2)
- hidden variables (2)
- homogenization (2)
- hub covering (2)
- hysteresis (2)
- illiquidity (2)
- image denoising (2)
- incompressible Navier-Stokes equations (2)
- interface problem (2)
- inverse optimization (2)
- inverse problem (2)
- inverse problems (2)
- k-link shortest path (2)
- lacunarity distribution (2)
- level set method (2)
- limit and jump relations (2)
- linear optimization (2)
- localizing basis (2)
- location theory (2)
- mathematical modeling (2)
- mesh generation (2)
- mixture (2)
- modal derivatives (2)
- moment realizability (2)
- monotropic programming (2)
- multicriteria optimization (2)
- multileaf collimator (2)
- multiplicative noise (2)
- nonlinear diffusion (2)
- nonlinear diffusion filtering (2)
- occupation measure (2)
- online optimization (2)
- optimal control (2)
- optimal investment (2)
- optimization (2)
- order-two densities (2)
- pH-taxis (2)
- parabolic system (2)
- particle method (2)
- particle methods (2)
- polynomial algorithms (2)
- poroelasticity (2)
- porous media (2)
- pyramid scheme (2)
- rate of convergence (2)
- regression analysis (2)
- regular surface (2)
- regularization (2)
- regularization wavelets (2)
- reproducing kernel (2)
- reproduzierender Kern (2)
- satellite gravity gradiometry (2)
- scale-space (2)
- series-parallel graphs (2)
- simplex (2)
- singularities (2)
- spherical approximation (2)
- splines (2)
- stationarity (2)
- stationary radiative transfer equation (2)
- subgroup problem (2)
- uniqueness (2)
- universal objective function (2)
- valid inequalities (2)
- variational inequalities (2)
- vector spherical harmonics (2)
- vectorial wavelets (2)
- weak solution (2)
- worst-case scenario (2)
- "Slender-Body"-Theorie (1)
- (Joint) chance constraints (1)
- (dynamic) network flows (1)
- 2-d kernel regression (1)
- 3D image analysis (1)
- A-infinity-bimodule (1)
- A-infinity-category (1)
- A-infinity-functor (1)
- ALE-Methode (1)
- AR-ARCH (1)
- Abel integral equations (1)
- Abelian groups (1)
- Abgeschlossenheit (1)
- Ableitung höherer Ordnung (1)
- Ableitungsfreie Optimierung (1)
- Abstract ODE (1)
- Abstract linear systems theory (1)
- Acid-mediated tumor invasion (1)
- Adjazenz-Beziehungen (1)
- Adjoint method (1)
- Adjoint system (1)
- Advanced Encryption Standard (1)
- Aggregation (1)
- Agriculture Loan (1)
- Algebraic Geometry (1)
- Algebraic geometry (1)
- Algebraic groups (1)
- Algebraic optimization (1)
- Algebraischer Funktionenkörper (1)
- Algorithmics (1)
- Alter (1)
- Analytic semigroup (1)
- Angewandte Mathematik (1)
- Anisotropic smoothness classes (1)
- Annulus (1)
- Anti-diffusion (1)
- Antidiffusion (1)
- Applications (1)
- Approximationsalgorithmus (1)
- Approximative Identität (1)
- Arbitrage (1)
- Arc distance (1)
- Archimedische Kopula (1)
- Arduino (1)
- Asiatische Option (1)
- Asset allocation (1)
- Asset-liability management (1)
- Associative Memory Problem (1)
- Asympotic Analysis (1)
- Asymptotische Entwicklung (1)
- Ausfallrisiko (1)
- Automatische Differentiation (1)
- Automatische Spracherkennung (1)
- Automorphismengruppe (1)
- Autoregression (1)
- Autoregressive Hilbertian model (1)
- Autoregressive time series (1)
- Balance sheet (1)
- Banach lattice (1)
- Barriers (1)
- Basic Scheme (1)
- Basis Risk (1)
- Basket Option (1)
- Baum <Mathematik> (1)
- Bayes risk (1)
- Bayes-Entscheidungstheorie (1)
- Bayesrisiko (1)
- Beam models (1)
- Beam orientation (1)
- Behinderter (1)
- Bell Number (1)
- Berechnungskomplexität (1)
- Bernstein Kern (1)
- Bernstein–Gelfand–Gelfand construction (1)
- Bernstejn-Polynom (1)
- Beschichtungsprozess (1)
- Beschränkte Krümmung (1)
- Bessel functions (1)
- Betrachtung des Schlimmstmöglichen Falles (1)
- Betriebsfestigkeit (1)
- Bilanzstrukturmanagement (1)
- Bildsegmentierung (1)
- Binary (1)
- Binomialbaum (1)
- Biot Poroelastizitätgleichung (1)
- Bisector (1)
- Black-Scholes model (1)
- Bondindizes (1)
- Bootstrap (1)
- Boundary Value Problem (1)
- Boundary Value Problem / Oblique Derivative (1)
- Boundary Value Problems (1)
- Box Algorithms (1)
- Box-Algorithm (1)
- Brinkman (1)
- Brownian Diffusion (1)
- Brownsche Bewegung (1)
- CAQ (1)
- CDO (1)
- CDS (1)
- CDSwaption (1)
- CFL type conditions (1)
- CHAMP-Mission (1)
- CPDO (1)
- CUSUM statistic (1)
- CWGAN (1)
- Cantor sets (1)
- Capacity (1)
- Capital-at-Risk (1)
- Carreau law (1)
- Castelnuovo Funktion (1)
- Castelnuovo function (1)
- Cauchy-Navier scaling function and wavelet (1)
- Cauchy-Navier-Equation (1)
- Censoring (1)
- Center Location (1)
- Change Point Analysis (1)
- Change Point Test (1)
- Change-point Analysis (1)
- Change-point estimator (1)
- Change-point test (1)
- Charakter <Gruppentheorie> (1)
- Chi-Quadrat-Test (1)
- Cholesky-Verfahren (1)
- Chorin's projection scheme (1)
- Chow Quotient (1)
- Circle Location (1)
- Classification (1)
- Cluster-Analyse (1)
- Coarse graining (1)
- Cohen-Lenstra heuristic (1)
- Collision Operator (1)
- Collocation Method plus (1)
- Commodity Index (1)
- Competitive Analysis (1)
- Complex Structures (1)
- Complexity (1)
- Complexity and performance of numerical algorithms (1)
- Composite Materials (1)
- Computer Algebra (1)
- Computer algebra (1)
- Conditional Value-at-Risk (1)
- Connectivity (1)
- Consistencyanalysis (1)
- Consistent Price Processes (1)
- Constraint Generation (1)
- Construction of hypersurfaces (1)
- Container (1)
- Continuum mechanics (1)
- Convergence Rate (1)
- Convex Analysis (1)
- Convex geometry (1)
- Convex sets (1)
- Convexity (1)
- Copula (1)
- Core (1)
- Cosine function (1)
- Coupled PDEs (1)
- Covid-19 (1)
- Coxeter groups (1)
- Coxeter-Freudenthal-Kuhn triangulation (1)
- Crane (1)
- Crash (1)
- Crash Hedging (1)
- Crash modelling (1)
- Crashmodellierung (1)
- Credit Default Swap (1)
- Credit Risk (1)
- Curvature (1)
- Curved viscous fibers (1)
- Cut (1)
- Cutting and Packing (1)
- Cycle Decomposition (1)
- DSMC (1)
- Darstellungstheorie (1)
- Das Urbild von Ideal unter einen Morphismus der Algebren (1)
- Debt Management (1)
- Decision Making (1)
- Decision support (1)
- Decomposition of integer matrices (1)
- Defaultable Options (1)
- Deformationstheorie (1)
- Degenerate Diffusion Semigroups (1)
- Delaunay (1)
- Delaunay triangulation (1)
- Delaunay triangulierung (1)
- Delay Differential Equations (1)
- Dense gas (1)
- Derivatives (1)
- Didaktik (1)
- Differential Cross-Sections (1)
- Differential forms (1)
- Differentialgleichung mit nacheilendem Argument (1)
- Differentialinklusionen (1)
- Differenzenverfahren (1)
- Differenzierbare Mannigfaltigkeit (1)
- Differenzmenge (1)
- Diffusion (1)
- Diffusion processes (1)
- Dirichlet series (1)
- Dirichlet-Problem (1)
- Discrete Bicriteria Optimization (1)
- Discrete decision problems (1)
- Discrete velocity models (1)
- Discriminatory power (1)
- Diskrete Mathematik (1)
- Dispersionsrelation (1)
- Dissertation (1)
- Diversifikation (1)
- Domain Decomposition (1)
- Doppelbarriereoption (1)
- Double Barrier Option (1)
- Druckkorrektur (1)
- Dynamic Network Flow Problem (1)
- Dynamic Network Flows (1)
- Dynamic capillary pressure (1)
- Dynamic cut (1)
- Dynamische Systeme (1)
- Dynamische Topographie (1)
- Dynasys (1)
- Dünnfilmapproximation (1)
- EDF observation models (1)
- EGM96 (1)
- EM algorith (1)
- Earliest arrival augmenting path (1)
- Earth' (1)
- Earth's disturbing potential (1)
- Education (1)
- Edwards Model (1)
- Effective Conductivity (1)
- Efficiency (1)
- Efficient Reliability Estimation (1)
- Effizienter Algorithmus (1)
- Effizienz (1)
- Eigenschwingung (1)
- Eikonal equation (1)
- Elastoplastic BVP (1)
- Electricity consumption (1)
- Elektromagnetische Streuung (1)
- Elektronik (1)
- Elementare Zahlentheorie (1)
- Eliminationsverfahren (1)
- Elliptic-parabolic equation (1)
- Elliptische Verteilung (1)
- Elliptisches Randwertproblem (1)
- Endliche Gruppe (1)
- Endliche Lie-Gruppe (1)
- Enskog equation (1)
- Entscheidungsbaum (1)
- Entscheidungsunterstützung (1)
- Enumerative Geometrie (1)
- Epidemiologie (1)
- Epidemiology (1)
- Erdöl Prospektierung (1)
- Ergodic (1)
- Erwartungswert-Varianz-Ansatz (1)
- Essential m-dissipativity (1)
- Euler's equation of motion (1)
- Evacuation Planning (1)
- Evakuierung (1)
- Evolution Equations (1)
- Evolutionary Integral Equations (1)
- Exogenous (1)
- Expected shortfall (1)
- Experimental Data (1)
- Exponential Utility (1)
- Exponentieller Nutzen (1)
- Extrapolation (1)
- Extreme Events (1)
- Extreme value theory (1)
- FEM (1)
- FEM-FCT stabilization (1)
- FPM (1)
- FPTAS (1)
- Faden (1)
- Faltung (1)
- Faltung <Mathematik> (1)
- Families of Probability Measures (1)
- Fast Pseudo Spectral Algorithm (1)
- Fast Wavelet Transform (1)
- Feed-forward Networks (1)
- Feedfoward Neural Networks (1)
- Feynman Integrals (1)
- Feynman path integrals (1)
- Fiber spinning (1)
- Fiber suspension flow (1)
- Filippov theory (1)
- Filippov-Theorie (1)
- Financial Engineering (1)
- Finanzkrise (1)
- Finanznumerik (1)
- Finanzzeitreihe (1)
- Finite-Elemente-Methode (1)
- Finite-Punktmengen-Methode (1)
- Firmwertmodell (1)
- First Order Optimality System (1)
- First--order optimality system (1)
- Flachwasser (1)
- Flachwassergleichungen (1)
- FlowLoc (1)
- Fluid dynamics (1)
- Fluid-Feststoff-Strömung (1)
- Fluid-Struktur-Kopplung (1)
- Fluid-Struktur-Wechselwirkung (1)
- Foam decay (1)
- Fokker-Planck equation (1)
- Fokker-Planck-Gleichung (1)
- Forbidden Regions (1)
- Forecasting (1)
- Forward-Backward Stochastic Differential Equation (1)
- Fourier-Transformation (1)
- Fredholm integral equation of the second kind (1)
- Fredholmsche Integralgleichung (1)
- Frequency Averaging (1)
- Function of bounded variation (1)
- Functional autoregression (1)
- Functional time series (1)
- Funktionalanalysis (1)
- Funktionenkörper (1)
- Fuzzy Programming (1)
- GARCH (1)
- GARCH Modelle (1)
- GOCE <satellite mission> (1)
- GPS-satellite-to-satellite tracking (1)
- GRACE (1)
- GRACE <satellite mission> (1)
- Galerkin Approximation (1)
- Gamma-Konvergenz (1)
- Garantiezins (1)
- Garbentheorie (1)
- Gauge Distances (1)
- Gauss-Manin connection (1)
- Gaussian random noise (1)
- Gebietszerlegung (1)
- Gebietszerlegungsmethode (1)
- Gebogener viskoser Faden (1)
- Generative adversarial networks (1)
- Geo-referenced data (1)
- Geodesie (1)
- Geodätischer Satellit (1)
- Geomagnetic Field Modelling (1)
- Geomagnetismus (1)
- Geomathematik (1)
- Geometrical algorithms (1)
- Geometrische Ergodizität (1)
- Geostrophic flow (1)
- Geostrophisches Gleichgewicht (1)
- Geothermal Systems (1)
- Geothermischer Fluss (1)
- Gewichteter Sobolev-Raum (1)
- Gewichtung (1)
- Gittererzeugung (1)
- Gleichgewichtsstrategien (1)
- Gleichmäßige Approximation (1)
- Global Optimization (1)
- Global optimization (1)
- Globale nichtlineare Analysis (1)
- Glättung (1)
- Glättungsparameterwahl (1)
- Grad expansion (1)
- Gradient based optimization (1)
- Granular flow (1)
- Granulat (1)
- Graph coloring (1)
- Gravimetry (1)
- Gravitation (1)
- Gravitational Field (1)
- Gravitationsmodell (1)
- Greedy Heuristic (1)
- Greedy algorithm (1)
- Green’s function (1)
- Gromov Witten (1)
- Gromov-Witten-Invariante (1)
- Große Abweichung (1)
- Gruppenoperation (1)
- Gröbner base (1)
- Gröbner bases in monoid and group rings (1)
- Gröbner-basis (1)
- Gyroscopic (1)
- Hadamard manifold (1)
- Hadamard space (1)
- Hadamard-Mannigfaltigkeit (1)
- Hadamard-Raum (1)
- Hamiltonian (1)
- Hamiltonian Path Integrals (1)
- Hamiltonian groups (1)
- Handelsstrategien (1)
- Hardy space (1)
- Harmonische Analyse (1)
- Harmonische Dichte (1)
- Harmonische Funktion (1)
- Hazard Functions (1)
- Heavy-tailed Verteilung (1)
- Hedging (1)
- Helmholtz Type Boundary Value Problems (1)
- Helmholtz decomposition (1)
- Helmholtz-Decomposition (1)
- Helmholtz-Zerlegung (1)
- Heston-Modell (1)
- Heuristic (1)
- Heuristik (1)
- Hidden Markov models for Financial Time Series (1)
- Hierarchies (1)
- Hierarchische Matrix (1)
- Higher Order Differentials as Boundary Data (1)
- Hilbert complexes (1)
- Hochschild homology (1)
- Hochschild-Homologie (1)
- Homogeneous Relaxation (1)
- Homogenization (1)
- Homologietheorie (1)
- Homologische Algebra (1)
- Homotopie (1)
- Homotopiehochhebungen (1)
- Homotopy (1)
- Homotopy lifting (1)
- Hub Location Problem (1)
- Hub-and-Spoke-System (1)
- Hybrid Codes (1)
- Hydrological Gravity Variations (1)
- Hydrologie (1)
- Hydrostatischer Druck (1)
- Hyperbolic Conservation (1)
- Hyperelastizität (1)
- Hyperelliptische Kurve (1)
- Hyperflächensingularität (1)
- Hyperspektraler Sensor (1)
- Hypocoercivity (1)
- INGARCH (1)
- ITSM (1)
- Idealklassengruppe (1)
- Identifiability (1)
- Ill-Posed Problems (1)
- Ill-posed Problems (1)
- Ill-posed problem (1)
- Illiquidität (1)
- Image restoration (1)
- Immiscible lattice BGK (1)
- Immobilienaktie (1)
- Improperly posed problems (1)
- Impulse control (1)
- Incompressible Navier-Stokes (1)
- Index Insurance (1)
- Industrial Applications (1)
- Infectious Diseases (1)
- Inflation (1)
- Information Theory (1)
- Infrarotspektroskopie (1)
- Injectivity of mappings (1)
- Injektivität von Abbildungen (1)
- Inkompressibel Navier-Stokes (1)
- Inkorrekt gestelltes Problem (1)
- Insurance (1)
- Integral (1)
- Integral Equations (1)
- Integral transform (1)
- Integration (1)
- Intensität (1)
- Interdisziplinärer Projektunterricht (1)
- Internationale Diversifikation (1)
- Interpolation Algorithm (1)
- Inverse Problems (1)
- Inverse problems in Banach spaces (1)
- Irreduzibler Charakter (1)
- Isogeometric Analysis (1)
- Isotropy (1)
- Iterative Methods (1)
- Ito (1)
- Jacobigruppe (1)
- Jeffreys' prior (1)
- Jiang's constitutive model (1)
- Jiangsches konstitutives Gesetz (1)
- K-best solution (1)
- K-cardinality trees (1)
- Kaktusgraph (1)
- Kalkül (1)
- Kalkül des natürlichen Schließens (1)
- Kallianpur-Robbins law (1)
- Kanalcodierung (1)
- Karhunen-Loève expansion (1)
- Kategorientheorie (1)
- Kelvin Transformation (1)
- Kernschätzer (1)
- Kinetic Schems (1)
- Kinetic Theory of Gases (1)
- Kinetic theory (1)
- Kirchhoff-Love shell (1)
- Kiyoshi (1)
- Knapsack (1)
- Knapsack problem (1)
- Kohonen's SOM (1)
- Kombinatorik (1)
- Kombinatorische Optimierung (1)
- Kommutative Algebra (1)
- Kompakter Träger <Mathematik> (1)
- Konjugierte Dualität (1)
- Konstruktion von Hyperflächen (1)
- Konstruktive Approximation (1)
- Kontinuum <Mathematik> (1)
- Kontinuumsmechanik (1)
- Kontinuumsphysik (1)
- Konvergenzrate (1)
- Konvergenzverhalten (1)
- Konvexe Mengen (1)
- Konvexe Optimierung (1)
- Kopplungsmethoden (1)
- Kopplungsproblem (1)
- Kopula <Mathematik> (1)
- Kreitderivaten (1)
- Kristallmathematik (1)
- Kryptoanalyse (1)
- Kryptologie (1)
- Krümmung (1)
- Kugelfunktion (1)
- Kullback Leibler distance (1)
- Kullback-Leibler divergence (1)
- Kurvenschar (1)
- L-curve Methode (1)
- L2-Approximation (1)
- LIBOR (1)
- Label correcting algorithm (1)
- Label setting algorithm (1)
- Lagrange (1)
- Lagrangian Functions (1)
- Lagrangian relaxation (1)
- Large-Scale Problems (1)
- Lattice Boltzmann (1)
- Lattice-BGK (1)
- Lattice-Boltzmann (1)
- Lavrentiev regularization (1)
- Lavrentiev regularization for equations with monotone operators (1)
- Leading-Order Optimality (1)
- Learnability (1)
- Learning systems (1)
- Least-squares Monte Carlo method (1)
- Lebesque-Integral (1)
- Legendre Wavelets (1)
- Lehrkräfte (1)
- Lehrmittel (1)
- Level set methods (1)
- Level sets (1)
- Levy process (1)
- Lexicographic Order (1)
- Lexicographic max-ordering (1)
- Lie algebras (1)
- Lie-Typ-Gruppe (1)
- Linear Integral Equations (1)
- Linear kinematic hardening (1)
- Linear kinematische Verfestigung (1)
- Linear membership function (1)
- Lineare Integralgleichung (1)
- Lippmann-Schwinger Equation (1)
- Lippmann-Schwinger equation (1)
- Liquidität (1)
- Local completeness (1)
- Local existence uniqueness (1)
- Locally Supported Radial Basis Functions (1)
- Locally Supported Zonal Kernels (1)
- Locally stationary processes (1)
- Location (1)
- Location problems (1)
- Location theory (1)
- Locational Planning (1)
- Lokalkompakte Kerne (1)
- Low-discrepancy sequences (1)
- Lucena (1)
- MBS (1)
- MKS (1)
- ML-estimation (1)
- MLC (1)
- MLE (1)
- MOCO (1)
- Macaulay’s inverse system (1)
- Machine Scheduling (1)
- Magneto-Elastic Coupling (1)
- Magnetoelastic coupling (1)
- Magnetoelasticity (1)
- Magnetostriction (1)
- Marangoni-Effekt (1)
- Market Equilibrium (1)
- Markov Kette (1)
- Markov process (1)
- Markov switching (1)
- Markov-Ketten-Monte-Carlo-Verfahren (1)
- Markov-Prozess (1)
- Marktmanipulation (1)
- Marktrisiko (1)
- Martingaloptimalitätsprinzip (1)
- Maschinelles Lernen (1)
- Massendichte (1)
- Math-Talent-School (1)
- Mathematical Epidemiology (1)
- Mathematical Finance (1)
- Mathematical Modeling (1)
- Mathematics (1)
- Mathematisches Modell (1)
- Matrixkompression (1)
- Matrizenfaktorisierung (1)
- Matrizenzerlegung (1)
- Matroids (1)
- Max-Ordering (1)
- Maximal Cohen-Macaulay modules (1)
- Maximale Cohen-Macaulay Moduln (1)
- Maximum Likelihood Estimation (1)
- Maximum-Likelihood-Schätzung (1)
- Maxwell's equations (1)
- McKay conjecture (1)
- McKay-Conjecture (1)
- McKay-Vermutung (1)
- Medical Physics (1)
- Mehrdimensionale Bildverarbeitung (1)
- Mehrdimensionale Spline-Funktion (1)
- Mehrdimensionales Variationsproblem (1)
- Mehrskalen (1)
- Methode der Fundamentallösungen (1)
- Microstructure (1)
- Mie representation (1)
- Mie- and Helmholtz-Representation (1)
- Mie- und Helmholtz-Darstellung (1)
- Mie-Darstellung (1)
- Mie-Representation (1)
- Mikroelektronik (1)
- Minimal spannender Baum (1)
- Minimum Cost Network Flow Problem (1)
- Minimum Principle (1)
- Minkowski space (1)
- Mixed Connectivity (1)
- Mixed integer programming (1)
- Mixed method (1)
- Model-Dynamics (1)
- Moduli Spaces (1)
- Molekulardynamik (1)
- Molodensky Problem (1)
- Molodensky problem (1)
- Moment sequence (1)
- Momentum and Mas Transfer (1)
- Monoid and group rings (1)
- Monotone dynamical systems (1)
- Monte Carlo (1)
- Monte Carlo method (1)
- Moreau-Yosida regularization (1)
- Morphismus (1)
- Mosaike (1)
- Motion Capturing (1)
- Multi Primary and One Second Particle Method (1)
- Multi-Asset Option (1)
- Multi-Variant Model (1)
- Multi-dimensional systems (1)
- Multicriteria Location (1)
- Multileaf Collimator (1)
- Multileaf collimator (1)
- Multiperiod planning (1)
- Multiphase Flows (1)
- Multiple Criteria (1)
- Multiple Objective Programs (1)
- Multiple criteria analysis (1)
- Multiple criteria optimization (1)
- Multiple objective combinatorial optimization (1)
- Multiple objective optimization (1)
- Multiplicative Schwarz Algorithm (1)
- Multiresolution analysis (1)
- Multiscale Methods (1)
- Multiscale model (1)
- Multiscale modelling (1)
- Multiskalen-Entrauschen (1)
- Multiskalenapproximation (1)
- Multispektralaufnahme (1)
- Multispektralfotografie (1)
- Multisresolution Analysis (1)
- Multivariate (1)
- Multivariate Analyse (1)
- Multivariate Wahrscheinlichkeitsverteilung (1)
- Multivariates Verfahren (1)
- NP (1)
- NP-completeness (1)
- Nash equilibria (1)
- Navier Stokes equation (1)
- Navier-Stokes (1)
- Network flows (1)
- Networks (1)
- Netzwerksynthese (1)
- Neumann Wavelets (1)
- Neumann wavelets (1)
- Neumann-Problem (1)
- Neural Networks (1)
- Neuronales Netz (1)
- Newtonsches Potenzial (1)
- Nicht-Desarguessche Ebene (1)
- Nichtglatte Optimierung (1)
- Nichtkommutative Algebra (1)
- Nichtkonvexe Optimierung (1)
- Nichtkonvexes Variationsproblem (1)
- Nichtlineare Approximation (1)
- Nichtlineare Diffusion (1)
- Nichtlineare Optimierung (1)
- Nichtlineare Zeitreihenanalyse (1)
- Nichtlineare partielle Differentialgleichung (1)
- Nichtlineare/große Verformungen (1)
- Nichtlineares Galerkinverfahren (1)
- Nichtparametrische Regression (1)
- Nichtpositive Krümmung (1)
- Niederschlag (1)
- Nilpotent elements (1)
- No-Arbitrage (1)
- Non-commutative Computer Algebra (1)
- Non-convex body (1)
- Non-linear wavelet thresholding (1)
- Nonlinear Galerkin Method (1)
- Nonlinear Optimization (1)
- Nonlinear dynamics (1)
- Nonlinear regression (1)
- Nonlinear time series analysis (1)
- Nonlinear/large deformations (1)
- Nonparametric AR-ARCH (1)
- Nonparametric regression (1)
- Nonparametric time series (1)
- Nonsmooth contact dynamics (1)
- Nonstationary processes (1)
- Nulldimensionale Schemata (1)
- Numerical Analysis (1)
- Numerical Flow Simulation (1)
- Numerical methods (1)
- Numerics (1)
- Numerische Mathematik / Algorithmus (1)
- Oberflächenmaße (1)
- Oberflächenspannung (1)
- On-line algorithm (1)
- One-dimensional systems (1)
- Online Algorithms (1)
- Optimal Prior Distribution (1)
- Optimal control (1)
- Optimal portfolios (1)
- Optimal semiconductor design (1)
- Optimale Kontrolle (1)
- Optimale Portfolios (1)
- Optimization Algorithms (1)
- Option (1)
- Option Valuation (1)
- Optionsbewertung (1)
- Order (1)
- Orthonormalbasis (1)
- Ovoid (1)
- PDE-Constrained Optimization, Robust Design, Multi-Objective Optimization (1)
- Palm distribution (1)
- Panel clustering (1)
- Papiermaschine (1)
- Parallel Algorithms (1)
- Paralleler Algorithmus (1)
- Parameter identification (1)
- Parameteridentifikation (1)
- Pareto Optimality (1)
- Pareto Points (1)
- Pareto optimality (1)
- Parkette (1)
- Partikel Methoden (1)
- Patchworking Methode (1)
- Patchworking method (1)
- Pathwise Optimality (1)
- Pedestrian FLow (1)
- Perceptron (1)
- Periodic Homogenization (1)
- Perona-Malik filter (1)
- Pfadintegral (1)
- Planares Polynom (1)
- Poisson autoregression (1)
- Poisson noise (1)
- Poisson regression (1)
- PolyBoRi (1)
- Polyhedron (1)
- Polynomapproximation (1)
- Polynomial Eigenfunctions (1)
- Pontrjagin (1)
- Population Balance Equation (1)
- Poroelastizität (1)
- Porous flow (1)
- Portfolio Optimierung (1)
- Portfoliooptimierung (1)
- Potential transform (1)
- Preimage of an ideal under a morphism of algebras (1)
- Probust optimization (1)
- Project prioritization (1)
- Project selection (1)
- Projektarbeit (1)
- Projektionsoperator (1)
- Projektive Fläche (1)
- Projektunterricht (1)
- Prox-Regularisierung (1)
- Pseudopolynomial-Time Algorithm (1)
- Punktmengen (1)
- Punktprozess (1)
- QMC (1)
- QVIs (1)
- Quadratischer Raum (1)
- Quantile autoregression (1)
- Quasi-Variational Inequalities (1)
- Quasi-identities (1)
- RCGAN (1)
- RCWGAN (1)
- RKHS (1)
- Radial Basis Functions (1)
- Radiation Therapy (1)
- Radiative Heat Trasfer (1)
- Radiative heat transfer (1)
- Radiotherapy (1)
- Rainflow (1)
- Random Errors (1)
- Random body (1)
- Random differential equations (1)
- Random number generation (1)
- Randwertproblem (1)
- Rank test (1)
- Rarefied Gas Flows (1)
- Rarefied Gsa Dynamics (1)
- Rarefied Polyatomic Gases (1)
- Rarefied gas (1)
- Raspberry Pi (1)
- Rate-independency (1)
- Ray-Knight Theorem (1)
- Rayleigh Number (1)
- Reaction-diffusion equations (1)
- Rectifiability (1)
- Recurrent Networks (1)
- Recurrent neural networks (1)
- Reflection (1)
- Reflexionsspektroskopie (1)
- Regime Shifts (1)
- Regime-Shift Modell (1)
- Regularisierung / Stoppkriterium (1)
- Regularization / Stop criterion (1)
- Regularization Wavelets (1)
- Regularization methods (1)
- Rehabilitation clinics (1)
- Relaxation (1)
- Reliability (1)
- Representation (1)
- Resolvent Estimate (1)
- Resonant tunneling diode (1)
- Restricted Regions (1)
- Restricted Shortest Path (1)
- Richtungsableitung (1)
- Riemann-Siegel formula (1)
- Riemannian manifolds (1)
- Riemannsche Mannigfaltigkeiten (1)
- Riemannsche Summen (1)
- Riesz Transform (1)
- Rigid Body Motion (1)
- Risikoanalyse (1)
- Risikomaße (1)
- Risikotheorie (1)
- Risk Management (1)
- Risk Measures (1)
- Risk Sharing (1)
- Robust smoothing (1)
- Rohstoffhandel (1)
- Rohstoffindex (1)
- Räumliche Statistik (1)
- SARS-CoV-2 (1)
- SAW filters (1)
- SGG (1)
- SPn-approximation (1)
- SST (1)
- SWARM (1)
- Saddle Points (1)
- Sandwiching algorithm (1)
- Satellitendaten (1)
- Satellitengeodäsie (1)
- Satellitengradiogravimetrie (1)
- Satellitengradiometrie (1)
- Scalar type operator (1)
- Scalar-type operator (1)
- Scale function (1)
- Scattered-Data-Interpolation (1)
- Schaum (1)
- Schaumzerfall (1)
- Schiefe Ableitung (1)
- Schnelle Fourier-Transformation (1)
- Schnitt <Mathematik> (1)
- Schwache Formulierung (1)
- Schwache Konvergenz (1)
- Schwache Lösu (1)
- Second Order Conditions (1)
- Seismic Modeling (1)
- Seismische Tomographie (1)
- Seismische Welle (1)
- Semantik (1)
- Semi-Markov-Kette (1)
- Semi-infinite optimization (1)
- Semigroups (1)
- Sensitivitäten (1)
- Sequential test (1)
- Sequenzieller Algorithmus (1)
- Serre functor (1)
- Shallow Water Equations (1)
- Shannon capacity (1)
- Shannon optimal priors (1)
- Shannon-Capacity (1)
- Shape optimization (1)
- Shapley value (1)
- Shapleywert (1)
- Shearlets (1)
- Sheaves (1)
- Shock Wave Problem (1)
- Shortest path problem (1)
- Signalanalyse (1)
- Similarity measures (1)
- Singular <Programm> (1)
- Singularität (1)
- Singularitätentheorie (1)
- Skalierungsfunktion (1)
- Slender body theory (1)
- Slender-Body Approximations (1)
- Smoothed Particle Hydrodynamics (1)
- Sobolevräume (1)
- Solvency II (1)
- Solvency-II-Richtlinie (1)
- Spannungs-Dehn (1)
- Spatial Statistics (1)
- Spectral Analysis (1)
- Spectral Method (1)
- Spectral theory (1)
- Spektralanalyse <Stochastik> (1)
- Spherical (1)
- Spherical Fast Wavelet Transform (1)
- Spherical Harmonics (1)
- Spherical Location Problem (1)
- Spherical Multiresolution Analysis (1)
- Sphärische Approximation (1)
- Sphärische Wavelets (1)
- Spieltheorie (1)
- Spline-Interpolation (1)
- Spline-Wavelets (1)
- Splines (1)
- Split-Operator (1)
- Splitoperator (1)
- Sprung-Diffusions-Prozesse (1)
- Square-mean Convergence (1)
- Stabile Vektorbundle (1)
- Stable vector bundles (1)
- Standard basis (1)
- Standortprobleme (1)
- Standorttheorie (1)
- Statistical Experiments (1)
- Statistics (1)
- Steuer (1)
- Stieltjes transform (1)
- Stochastic Impulse Control (1)
- Stochastic Processes (1)
- Stochastic Volatility (1)
- Stochastische Inhomogenitäten (1)
- Stochastische Processe (1)
- Stochastische Volatilität (1)
- Stochastische Zinsen (1)
- Stochastische optimale Kontrolle (1)
- Stochastischer Prozess (1)
- Stochastisches Feld (1)
- Stochastisches Modell (1)
- Stokes Flow (1)
- Stokes Wavelets (1)
- Stokes wavelets (1)
- Stokes-Gleichung (1)
- Stop- and Play-Operators (1)
- Stop- und Play-Operator (1)
- Stop- und Spieloperator (1)
- Stop-und Play-Operator (1)
- Stornierung (1)
- Stoßdämpfer (1)
- Strahlentherapie (1)
- Strahlungstransport (1)
- Strain-Life Approach (1)
- Stratifaltigkeiten (1)
- Structural Reliability (1)
- Structure Theory (1)
- Strukturiertes Finanzprodukt (1)
- Strukturoptimierung (1)
- Strömungsdynamik (1)
- Strömungsmechanik (1)
- Subset Simulationen (1)
- Success Run (1)
- Survival Analysis (1)
- Synthesizer (1)
- Synthetic data generation (1)
- Systemidentifikation (1)
- Sägezahneffekt (1)
- TDTSP (1)
- TSP (1)
- Tabellenkalkulation (1)
- Tableau-Kalkül (1)
- Tail Dependence Koeffizient (1)
- Temporal Variational Autoencoders (1)
- Tensor Spherical Harmonics (1)
- Tensorfeld (1)
- Test for Changepoint (1)
- Theorem of Plemelj-Privalov (1)
- Thermophoresis (1)
- Thin film approximation (1)
- Tichonov-Regularisierung (1)
- Tiefengeothermie (1)
- Time-Series (1)
- Time-Space Multiresolution Analysis (1)
- Time-delay-Netz (1)
- TimeGAN (1)
- Titration (1)
- Topologieoptimierung (1)
- Topology optimization (1)
- Traffic flow (1)
- Train Rearrangement (1)
- Transaction costs (1)
- Translation planes (1)
- Transportation Problem (1)
- Tree (1)
- Trennschärfe <Statistik> (1)
- Trennverfahren (1)
- Treppenfunktionen (1)
- Triangular fuzzy number (1)
- Tropical Grassmannian (1)
- Tropical Intersection Theory (1)
- Tube Drawing (1)
- Two-Scale Convergence (1)
- Two-phase flow (1)
- Uniform matroids (1)
- Universal objective function (1)
- Unreinheitsfunktion (1)
- Unschärferelation (1)
- Unsupervised learning (1)
- Untermannigfaltigkeit (1)
- Upwind-Verfahren (1)
- Usage modeling (1)
- Utility (1)
- Value at Risk (1)
- Value at risk (1)
- Van Neumann-Kakutani transformation (1)
- Variational autoencoders (1)
- Variational inequalities (1)
- Variationsrechnung (1)
- Variationsungleichugen (1)
- Vector Spherical Harmonics (1)
- Vector-valued holomorphic function (1)
- Vectorfield approximation (1)
- Vectorial Wavelets (1)
- Vektor-Wavelets (1)
- Vektorfeld (1)
- Vektorfeldapproximation (1)
- Verkehsplanung (1)
- Verschlüsselung (1)
- Verschwindungsatz (1)
- Versicherung (1)
- Vetor optimization (1)
- Vigenere (1)
- Virus Variants (1)
- Viskoelastische Flüssigkeiten (1)
- Viskose Transportschemata (1)
- Volatilitätsarbitrage (1)
- Vollständigkeit (1)
- Vorkonditionierer (1)
- Vorlesungsskript (1)
- Voronoi diagram (1)
- Vorwärts-Rückwärts-Stochastische-Differentialgleichung (1)
- Water reservoir management (1)
- Wave Based Method (1)
- Wavelet Analysis auf regulären Flächen (1)
- Wavelet-Theorie (1)
- Wavelet-Theory (1)
- Wavelet-Transformation (1)
- Wavelets (1)
- Wavelets auf der Kugel und der Sphäre (1)
- Weak Solution Theory (1)
- Wellengeschwindigkeit (1)
- White Noise (1)
- Wirbelabtrennung (1)
- Wirbelströmung (1)
- Wirkungsnetz (1)
- Wissenschaftliches Rechnen (1)
- Word problem (1)
- Worst-Case (1)
- Wärmeleitfähigkeit (1)
- Yaglom limits (1)
- Zeitabhängigkeit (1)
- Zeitintegrale Modelle (1)
- Zeitliche Veränderungen (1)
- Zeitreihe (1)
- Zeitreihen (1)
- Zellulärer Automat (1)
- Zentrenprobleme (1)
- Zerlegungen (1)
- Zero-dimensional schemes (1)
- Zonal Kernel Functions (1)
- Zopfgruppe (1)
- Zufälliges Feld (1)
- Zweiphasenströmung (1)
- Zyklische Homologie (1)
- abgeleitete Kategorie (1)
- acid-mediated tumor invasion (1)
- activity-based model (1)
- adaptive algorithm (1)
- adaptive estimation (1)
- adaptive grid generation (1)
- additive Gaussian noise (1)
- adjacency (1)
- adjacency relations (1)
- adjoint approach (1)
- adjoints (1)
- aggressive space mapping (1)
- aleph (1)
- algebraic attack (1)
- algebraic correspondence (1)
- algebraic function fields (1)
- algebraic number fields (1)
- algebraic topology (1)
- algebraische Korrespondenzen (1)
- algebraische Topologie (1)
- algebroid curve (1)
- algorithm (1)
- alternating minimization (1)
- alternating optimization (1)
- analoge Mikroelektronik (1)
- angewandte Mathematik (1)
- angewandte Topologie (1)
- anisotropen Viskositätsmodell (1)
- anisotropic diffusion (1)
- anisotropic viscosity (1)
- anisotropy (1)
- applied mathematics (1)
- approximation methods (1)
- approximative Identität (1)
- arbitrary Lagrangian-Eulerian methods (ALE) (1)
- arbitrary function (1)
- archimedean copula (1)
- area loss (1)
- asian option (1)
- associated Legendre functions (1)
- asymptotic expansions (1)
- asymptotic preserving numerical scheme (1)
- asymptotic-preserving (1)
- auto-pruning (1)
- automatic differentiation (1)
- ball (1)
- basic systems theoretic properties (1)
- basket option (1)
- benders decomposition (1)
- bending strip method (1)
- best basis (1)
- bicriteria shortest path problem (1)
- bicriterion path problems (1)
- bills of material (1)
- bills of materials (1)
- bin coloring (1)
- binomial tree (1)
- biorthogonal bases of L^2 (1)
- bipolar quantum drift diffusion model (1)
- blackout period (1)
- bocses (1)
- body wave velocity (1)
- bootstrap (1)
- bottleneck (1)
- boundary conditions (1)
- boundary value problem (1)
- boundary-value problems of potent (1)
- branch and cut (1)
- branching process (1)
- bus bunching (1)
- cactus graph (1)
- cancer radiation therapy (1)
- canonical ideal (1)
- canonical module (1)
- cardinality constraint combinatorial optimization (1)
- cash management (1)
- center hyperplane (1)
- centrally symmetric polytope (1)
- change analysis (1)
- change point (1)
- changing market coefficients (1)
- characteristic polynomial (1)
- charged fluids (1)
- chemotaxis (1)
- chemotherapy (1)
- classical solutions (1)
- clo (1)
- closure approximation (1)
- clustering (1)
- clustering methods (1)
- combinatorics (1)
- common transversal (1)
- compact operator equation (1)
- complete presentations (1)
- complexity (1)
- composites (1)
- computational complexity (1)
- computational finance (1)
- computer algebra (1)
- computeralgebra (1)
- conditional quantile (1)
- conditional quantiles (1)
- confluence (1)
- consecutive ones matrix (1)
- consecutive ones polytopes (1)
- constructive approximation (1)
- control theory (1)
- convergence behaviour (1)
- convex constraints (1)
- convex distance funtion (1)
- convex operator (1)
- cooling processes (1)
- cooperative game (1)
- core (1)
- correlated errors (1)
- count data (1)
- coupling methods (1)
- coverage error (1)
- crash (1)
- crash hedging (1)
- crash modelling (1)
- credit risk (1)
- curvature (1)
- cusp forms (1)
- cut (1)
- cut basis problem (1)
- cuts (1)
- cyclic homology (1)
- da (1)
- data structure (1)
- data-adaptive bandwidth choice (1)
- decision support (1)
- decision support systems (1)
- decisions (1)
- decoding (1)
- decrease direction (1)
- default time (1)
- deficiency (1)
- deflections of the vertical (1)
- degenerations of an elliptic curve (1)
- delay management (1)
- delay management problem (1)
- denoising (1)
- dense univariate rational interpolation (1)
- density gradient equation (1)
- derivative-free iterative method (1)
- derived category (1)
- descent algorithm (1)
- determinant (1)
- differential inclusions (1)
- diffusion models (1)
- diffusive scaling (1)
- direct product (1)
- directional derivative (1)
- discrepancy (1)
- discrete element method (1)
- discrete measure (1)
- discrete time setting (1)
- discrete velocity models (1)
- discretization (1)
- diskrete Systeme (1)
- displacement problem (1)
- distribution (1)
- diversification (1)
- domain decomposition methods (1)
- domain parametrization (1)
- double exponential distribution (1)
- downward continuation (1)
- drift diffusion (1)
- drift-diffusion limit (1)
- durability (1)
- dynamic holding (1)
- dynamic network flows (1)
- dynamical topography (1)
- earliest arrival flow (1)
- earliest arrival flows (1)
- efficiency loss (1)
- efficient solution (1)
- eigenvalue problems (1)
- elasticity problem (1)
- elastoplastic BVP (1)
- elliptical distribution (1)
- endomorphism ring (1)
- energy transport (1)
- entropy (1)
- enumerative geometry (1)
- epsilon-constraint method (1)
- equilibrium state (1)
- equisingular families (1)
- estimate (1)
- estimation (1)
- estimator (1)
- exact fully discrete vectorial wavelet transform (1)
- exact solution (1)
- exchange rate (1)
- explicit representation (1)
- explicit representations (1)
- explizite Darstellung (1)
- exponential rate (1)
- extreme equilibria (1)
- f-dissimilarity (1)
- face value (1)
- facility location (1)
- fast approximation (1)
- fatigue (1)
- fiber reinforced silicon carbide (1)
- fibre lay-down dynamics (1)
- film casting (1)
- filtration (1)
- final prediction error (1)
- financial mathematics (1)
- finite biodiversity (1)
- finite difference method (1)
- finite difference schemes (1)
- finite element method (1)
- finite groups of Lie type (1)
- finite pointset method (1)
- finite spin group (1)
- finite volume methods (1)
- finite-difference methods (1)
- first hitting time (1)
- fixpoint theorem (1)
- float glass (1)
- flood risk (1)
- fluid dynamic equations (1)
- fluid structure (1)
- fluid structure interaction (1)
- fluid-structure interaction (FSI) (1)
- formale Logik (1)
- formants (1)
- formulation as integral equation (1)
- forward-shooting grid (1)
- fptas (1)
- fractals (1)
- free boundary (1)
- free surface (1)
- freie Oberfläche (1)
- frequency bands (1)
- freqzency bands (1)
- function of bounded variation (1)
- functional data (1)
- functional time series (1)
- fundamental cut (1)
- fundamental systems (1)
- gas dynamics (1)
- gauge (1)
- gebietszerlegung (1)
- general multidimensional moment problem (1)
- generalized Gummel itera (1)
- generalized inverse Gaussian diffusion (1)
- generic character table (1)
- geodetic (1)
- geomagnetic field modelling from MAGSAT data (1)
- geomathematics (1)
- geometric measure theory (1)
- geometrical algorithms (1)
- geometry of measures (1)
- geopotential determination (1)
- gitter (1)
- glioblastoma (1)
- global optimization (1)
- go-or-grow (1)
- go-or-grow dichotomy (1)
- good semigroup (1)
- gradient descent reprojection (1)
- granular flow (1)
- graph and network algorithm (1)
- graph p-Laplacian (1)
- gravimetry (1)
- gravitation (1)
- gravitational field recovery (1)
- grenzwert (1)
- group action (1)
- groups of Lie type (1)
- growing sub-quadratically (1)
- growth optimal portfolios (1)
- großer Investor (1)
- harmonic WFT (1)
- harmonic balance (1)
- harmonic scaling functions and wavelets (1)
- harmonic wavelets (1)
- headway prediction (1)
- heat radiation (1)
- hedging (1)
- hidden Markov (1)
- hierarchical matrix (1)
- higher order (1)
- higher-order moments (1)
- homological algebra (1)
- hybrid method (1)
- hyper-quasi-identities (1)
- hyperbolic conservation laws (1)
- hyperbolic systems (1)
- hyperbolic systems of conservation laws (1)
- hyperelliptic function field (1)
- hyperelliptische Funktionenkörper (1)
- hypergeometric functions (1)
- hyperplane transversal (1)
- hyperquasivarieties (1)
- hyperspectal unmixing (1)
- hypocoercivity (1)
- idealclass group (1)
- image analysis (1)
- image enhancement (1)
- image processing (1)
- image restoration (1)
- impulse control (1)
- impurity functions (1)
- incident wave (1)
- incompressible Euler equation (1)
- incompressible elasticity (1)
- incompressible limit (1)
- infinite-dimensional analysis (1)
- infinite-dimensional manifold (1)
- inflation-linked product (1)
- information (1)
- inhibitory synaptic transmission (1)
- initial temperature (1)
- initial temperature reconstruction (1)
- instantaneous phase (1)
- integer GARCH (1)
- integer-valued time series (1)
- integral constitutive equations (1)
- intensity (1)
- intensity map segmentation (1)
- interest oriented portfolios (1)
- internal approximation (1)
- intersection local time (1)
- interval graphs (1)
- intra- and extracellular proton dynamics (1)
- invariant theory (1)
- inverse Fourier transform (1)
- inversion method (1)
- isogeometric analysis (IGA) (1)
- iterative bandwidth choice (1)
- jump diffusion (1)
- jump-diffusion process (1)
- junction (1)
- k-cardinality minimum cut (1)
- k-max (1)
- kardinalzahl (1)
- kernel (1)
- kernel estimate (1)
- kernel estimates (1)
- kinetic approach (1)
- kinetic models (1)
- kinetic semiconductor equations (1)
- kinetic theory (1)
- knapsack (1)
- kombinatorische Optimierung (1)
- konvexe Analysis (1)
- kooperative Spieltheorie (1)
- label setting algorithm (1)
- large deviations (1)
- large investor (1)
- large scale integer programming (1)
- lattice Boltzmann (1)
- level K-algebras (1)
- life insurance (1)
- limes (1)
- limit models (1)
- limit theorems (1)
- linear code (1)
- linear programming (1)
- linear systems (1)
- linear transport equation (1)
- local approximation of sea surface topography (1)
- local bandwidths (1)
- local multiscale (1)
- local orientation (1)
- local search algorithm (1)
- local stationarity (1)
- local support (1)
- local trigonometric packets (1)
- local-global conjectures (1)
- localization (1)
- locally compact (1)
- locally compact kernels (1)
- locally maximal clone (1)
- locally stationary process (1)
- locally supported (Green's) vector wavelets (1)
- locally supported (Green’s) vector wavelets (1)
- locally supported wavelets (1)
- location (1)
- location problem (1)
- locational planning (1)
- log averaging methods (1)
- log-utility (1)
- logarithmic average (1)
- logarithmic averages (1)
- logarithmic utility (1)
- logical analysis (1)
- logische Analyse (1)
- lokal kompakt (1)
- lokaler Träger (1)
- lokalisierende Basis (1)
- lokalisierende Kerne (1)
- longevity bonds (1)
- loss analysis (1)
- low discrepancy (1)
- low-rank approximation (1)
- machine learning (1)
- macro derivative (1)
- magnetic field (1)
- market crash (1)
- market manipulation (1)
- markov model (1)
- martingale measu (1)
- martingale optimality principle (1)
- mathematica education (1)
- mathematical modelling (1)
- mathematical morphology (1)
- mathematische Modellierung (1)
- matrix decomposition (1)
- matrix problems (1)
- matroid flows (1)
- maximal dynamic flow (1)
- maximum a posteriori estimation (1)
- maximum capacity path (1)
- maximum entropy (1)
- maximum entropy moment (1)
- maximum flows (1)
- maximum likelihood estimation (1)
- maximum-entropy (1)
- mean-variance approach (1)
- mechanism design (1)
- mehrwertig (1)
- mesh deformation (1)
- mesh-free method (1)
- method of fundamental solutions (1)
- micromechanics (1)
- minimal paths (1)
- minimal polynomial (1)
- minimal spanning tree (1)
- minimaler Schnittbaum (1)
- minimax estimation (1)
- minimax rate (1)
- minimax risk (1)
- minimum cost flows (1)
- minimum cut (1)
- minimum cut tree (1)
- minimum fundamental cut basis (1)
- mixed convection (1)
- mixed methods (1)
- mixed multiscale finite element methods (1)
- mixing (1)
- mixture models (1)
- mixture of quantum fluids and classical fluids (1)
- model order reduction (1)
- model reduction (1)
- moduli space (1)
- moduli spaces (1)
- moment methods (1)
- monlinear vibration (1)
- monodromy (1)
- monogenic signals (1)
- monoid- and group-presentations (1)
- monotone Konvergenz (1)
- monotone consecutive arrangement (1)
- moving contact line (1)
- multi scale (1)
- multi-asset option (1)
- multi-class image segmentation (1)
- multi-level Monte Carlo (1)
- multi-phase flow (1)
- multi-scale model (1)
- multicategory (1)
- multicriteria minimal path problem is presented (1)
- multidimensional Kohonen algorithm (1)
- multifilament superconductor (1)
- multigrid method (1)
- multigrid methods (1)
- multileaf collimator sequencing (1)
- multiliead collimator sequencing (1)
- multiobjective optimization (1)
- multipatch (1)
- multiple collision frequencies (1)
- multiple objective (1)
- multiple objective optimization (1)
- multiresolution analysis (1)
- multiscale analysis (1)
- multiscale approximation (1)
- multiscale approximation on regular telluroidal surfaces (1)
- multiscale denoising (1)
- multiscale methods (1)
- multiscale modeling (1)
- multiscale models (1)
- multivariate chi-square-test (1)
- mutiresolution (1)
- naive diversification (1)
- neighborhood search (1)
- network congestion game (1)
- network flow (1)
- network location (1)
- network synthesis (1)
- netzgenerierung (1)
- neural networks (1)
- never-meet property (1)
- nicht-newtonsche Strömungen (1)
- nichtlineare Druckkorrektor (1)
- nichtlineare Modellreduktion (1)
- nichtlineare Netzwerke (1)
- nichtparametrisch (1)
- non square linear system solving (1)
- non-Gaussia non-i.i.d. errors (1)
- non-commutative geometry (1)
- non-convex body (1)
- non-convex optimization (1)
- non-desarguesian plane (1)
- non-linear wavelet thresholding (1)
- non-local filtering (1)
- non-newtonian flow (1)
- non-parametric regression (1)
- non-stationary time series (1)
- nonconvex optimization (1)
- noninformative prior (1)
- nonlinear circuits (1)
- nonlinear elasticity (1)
- nonlinear finite element method (1)
- nonlinear heat equation (1)
- nonlinear inverse problem (1)
- nonlinear model reduction (1)
- nonlinear pressure correction (1)
- nonlinear term structure dependence (1)
- nonlinear thresholding (1)
- nonlinear vibration analysis (1)
- nonlinear wavelet thresholding (1)
- nonlocal filtering (1)
- nonlocal sample dependence (1)
- nonnegative matrix factorization (1)
- nonparametric (1)
- nonparametric regression and (spectral) density estimation (1)
- nonwovens (1)
- norm (1)
- normal cone (1)
- normal mode (1)
- normality (1)
- normalization (1)
- normed residuum (1)
- number fields (1)
- number of objectives (1)
- numeraire portfolios (1)
- numerical integration (1)
- numerical irreducible decomposition (1)
- numerical methods (1)
- numerical methods for stiff equations (1)
- numerics for pdes (1)
- numerische Strömungssimulation (1)
- numerisches Verfahren (1)
- oblique derivative (1)
- one-dimensional self-organization (1)
- operator splitting (1)
- optimal capital structure (1)
- optimal consumption and investment (1)
- optimal portfolios (1)
- optimal rate of convergence (1)
- optiman stopping (1)
- option pricing (1)
- option valuation (1)
- order selection (1)
- order-three density (1)
- order-two density (1)
- orthogonal bandlimited and non-bandlimited wavelets (1)
- ovoids (1)
- parallel numerical algorithms (1)
- parameter choice (1)
- parameter identification (1)
- partial differential equation (1)
- partial differential equations (1)
- partial differential-algebraic equations (1)
- partial information (1)
- partition of unity (1)
- path-dependent options (1)
- pattern (1)
- penalization (1)
- penalty methods (1)
- penalty-free formulation (1)
- personnel scheduling (1)
- petroleum exploration (1)
- physicians (1)
- piezoelectric periodic surface acoustic wave filters (1)
- planar Brownian motion (1)
- planar polynomial (1)
- polycyclic group rings (1)
- polyhedral analysis (1)
- polyhedral norm (1)
- polynomial weight functions (1)
- porous media flow (1)
- portfolio (1)
- portfolio decision (1)
- portfolio optimisation (1)
- portfolio-optimization (1)
- poröse Medien (1)
- positivity preserving time integration (1)
- posterior collapse (1)
- potential (1)
- potential operators (1)
- preconditioners (1)
- predictive control (1)
- prefix reduction (1)
- prefix string rewriting (1)
- prefix-rewriting (1)
- preservation of relations (1)
- pressure correction (1)
- price of anarchy (1)
- price of stability (1)
- primal-dual algorithm (1)
- probability distribution (1)
- projected quasi-gradient method (1)
- projection method (1)
- projective surfaces (1)
- properly efficient solution (1)
- proximation (1)
- proxy modeling (1)
- pseudospectral methods (1)
- public transport (1)
- public transportation (1)
- pyramid schemes (1)
- pyramids (1)
- quadratic forms (1)
- quadrinomial tree (1)
- qualitative threshold model (1)
- quantile autoregression (1)
- quasi-Monte Carlo (1)
- quasi-P (1)
- quasi-SH (1)
- quasi-SV (1)
- quasi-variational inequalities (1)
- quasihomogeneity (1)
- quasiregular group (1)
- quasireguläre Gruppe (1)
- quasivarieties (1)
- quickest path (1)
- radiation therapy (1)
- radiative heat transfer (1)
- rainflow (1)
- random noise (1)
- rare disasters (1)
- rarefied gas flows (1)
- rate-independency (1)
- ratio ergodic theorem (1)
- raum-zeitliche Analyse (1)
- reaction-diffusion-taxis equations (1)
- reaction-diffusion-transport equations (1)
- real quadratic number fields (1)
- reconstruction formula (1)
- reconstructions (1)
- redundant constraint (1)
- reference prior (1)
- reflectionless boundary condition (1)
- reflexionslose Randbedingung (1)
- refraction (1)
- regime-shift model (1)
- regularization by wavelets (1)
- regularization methods (1)
- reguläre Fläche (1)
- reinitialization (1)
- rela (1)
- representative systems (1)
- residual based error formula (1)
- resource constrained shortest path problem (1)
- rewriting (1)
- rheology (1)
- risk analysis (1)
- risk measures (1)
- risk reduction (1)
- robust network flows (1)
- robustness (1)
- rostering (1)
- s external gravitational field (1)
- sampling (1)
- satellite gradiometry (1)
- satellite-to-satellite tracking (1)
- sawtooth effect (1)
- scalar and vectorial wavelets (1)
- scalar conservation laws (1)
- scalarization (1)
- scale discrete spherical vector wavelets (1)
- scaled boundary isogeometric analysis (1)
- scaled boundary parametrizations (1)
- scaled translates (1)
- scaling functions (1)
- scheduling (1)
- scheduling theory (1)
- schlecht gestellt (1)
- schnelle Approximation (1)
- second class group (1)
- second order upwind discretization (1)
- seismic tomography (1)
- seismic wave (1)
- selfish routing (1)
- semi-classical limits (1)
- semigroup of values (1)
- semisprays (1)
- sensitivities (1)
- separation problem (1)
- sequential test (1)
- set covering (1)
- severely ill-posed inverse problems (1)
- shape optimization (1)
- sheaf theory (1)
- shear flow (1)
- shock wave (1)
- short-time periodogram (1)
- shortest path problem (1)
- sieve estimate (1)
- similarity measures (1)
- simulierte Finanzzeitreihe (1)
- single layer kernel (1)
- singular fluxes (1)
- singular optimal control (1)
- singular spaces (1)
- singuläre Räume (1)
- sink location (1)
- slope limiter (1)
- smoothing (1)
- solution formula (1)
- sparse interpolation of multivariate rational functions (1)
- sparse multivariate polynomial interpolation (1)
- sparsity (1)
- special entropies (1)
- spectral sequences (1)
- spectrogram (1)
- speech recognition (1)
- sphere (1)
- spherical decomposition (1)
- spherical splines (1)
- spline (1)
- spline and wavelet based determination of the geoid and the gravitational potential (1)
- spline-wavelets (1)
- splitting function (1)
- sputtering process (1)
- squares (1)
- stability (1)
- stability uniformly in the mean free path (1)
- star-shaped domain (1)
- stationary solutions (1)
- statistical experiment (1)
- steady Boltzmann equation (1)
- stimulus response data (1)
- stochastic arbitrage (1)
- stochastic coefficient (1)
- stochastic differential equations (1)
- stochastic interest rate (1)
- stochastic optimal control (1)
- stochastic processes (1)
- stochastic stability (1)
- stochastische Arbitrage (1)
- stop location (1)
- stop- and play-operator (1)
- stop- and play-operators (1)
- stratifolds (1)
- strictly quasi-convex functions (1)
- strong equilibria (1)
- strong theorems (1)
- strongly polynomial-time algorithm (1)
- structure tensor (1)
- subgradient (1)
- subgroup presentation problem (1)
- superposed fluids (1)
- superstep cycles (1)
- surface measures (1)
- surrender options (1)
- surrogate algorithm (1)
- systems (1)
- syzygies (1)
- tail dependence coefficient (1)
- tax (1)
- technische Analyse (1)
- tension problems (1)
- tensions (1)
- tensor product basis (1)
- test (1)
- texture (1)
- thermal equilibrium state (1)
- threshold choice (1)
- time delays (1)
- time-delayed carrying capacities (1)
- time-dependent shortest path problem (1)
- time-frequency plan (1)
- time-varying autoregression (1)
- time-varying covariance (1)
- topological asymptotic expansion (1)
- toric geometry (1)
- torische Geometrie (1)
- total latency (1)
- total variation (1)
- total variation spatial regularization (1)
- traffic planning (1)
- transit operations (1)
- translation invariant spaces (1)
- translinear circuits (1)
- translineare Schaltungen (1)
- transmission conditions (1)
- trial systems (1)
- triclinic medium (1)
- tropical geometry (1)
- tumor acidity (1)
- tumor cell invasion (1)
- tumor cell migration (1)
- two-scale expansion (1)
- unbeschränktes Potential (1)
- unbounded potential (1)
- uncapacitated facility location (1)
- uncertainty principle (1)
- unendlich (1)
- uniform central limit theorem (1)
- uniform consistency (1)
- uniform ergodicity (1)
- unimodular certification (1)
- unimodularity (1)
- value preserving portfolios (1)
- value semigroup (1)
- value-at-risk (1)
- valuing contracts (1)
- variable selection (1)
- variational methods (1)
- variational model (1)
- vector bundles (1)
- vector measure (1)
- vector wavelets (1)
- vectorial multiresolution analysis (1)
- vehicular traffic (1)
- verication theorem (1)
- vertical velocity (1)
- vertikale Geschwindigkeiten (1)
- viscoelastic fluids (1)
- viscosity solutions (1)
- volatility arbitrage (1)
- vortex seperation (1)
- wave propagation (1)
- wavelet estimators (1)
- wavelet packets (1)
- wavelet thresholding (1)
- wavelet transform (1)
- weak dependence (1)
- weak solution theory (1)
- weak solutions (1)
- weakly/ strictly pareto optima (1)
- weight optimization (1)
- windowed Fourier transform (1)
- winner definition (1)
- worst-case (1)
- Äquisingularität (1)
- Überflutung (1)
- Überflutungsrisiko (1)
- Übergangsbedingungen (1)
Faculty / Organisational entity
In this work a 3-dimensional contact elasticity problem for a thin fiber and a rigid foundation is studied. We describe the contact condition by a linear Robin-condition (by meaning of the penalized and linearized non-penetration and friction conditions).
The dimension of the problem is reduced by an asymptotic approach. Scaling the Robin parameters appropriately we obtain a recurrent chain of Neumann type boundary value problems which are considered only in the microscopic scale. The problem for the leading term is a homogeneous Neumann problem, hence the leading term depends only on the slow variable. This motivates the choice of a multiplicative ansatz in the asymptotic expansion.
The theoretical results are illustrated with numerical examples performed with a commercial finite-element software-tool.
In der Arbeit sollen ausgewählte technische Indikatoren und deren Handelsstrategien hinsichtlich ihres Verhaltens bzw. ihrer Profitabilität in verschiedenen Marktphasen untersucht werden. Um das Argument, dass die Indikatoren selbst erfüllend sind, zu entkräften, werden Finanzzeitreihen simuliert und die Indikatoren auf diese angewendet und ausgewertet. Zu diesem Zweck wird zu gegebenen echten Kursdaten ein finanzzeitreihenanalytisches Modell angepasst. Dieses wird zur Simulation von Finanzzeitreihen und damit zur Auswertung der Indikatoren verwendet werden. Durch geeignete Auswahlverfahren sollen verschiedene Handelsstrategien zu Strategien kombiniert werden, um ein besseres Ertrag/Risikoverhältnis zu erreichen als dies bei einzelnen Strategien der Fall wäre.
We propose and study a strongly coupled PDE-ODE system with tissue-dependent degenerate diffusion and haptotaxis that can serve as a model prototype for cancer cell invasion through the
extracellular matrix. We prove the global existence of weak solutions and illustrate the model behaviour by numerical simulations for a two-dimensional setting.
We propose and study a strongly coupled PDE-ODE-ODE system modeling cancer cell invasion through a tissue network
under the go-or-grow hypothesis asserting that cancer cells can either move or proliferate. Hence our setting features
two interacting cell populations with their mutual transitions and involves tissue-dependent degenerate diffusion and
haptotaxis for the moving subpopulation. The proliferating cells and the tissue evolution are characterized by way of ODEs
for the respective densities. We prove the global existence of weak solutions and illustrate the model behaviour by
numerical simulations in a two-dimensional setting.
The main purpose of the study was to improve the physical properties of the modelling of compressed materials, especially fibrous materials. Fibrous materials are finding increasing application in the industries. And most of the materials are compressed for different applications. For such situation, we are interested in how the fibre arranged, e.g. with which distribution. For given materials it is possible to obtain a three-dimensional image via micro computed tomography. Since some physical parameters, e.g. the fibre lengths or the directions for points in the fibre, can be checked under some other methods from image, it is beneficial to improve the physical properties by changing the parameters in the image.
In this thesis, we present a new maximum-likelihood approach for the estimation of parameters of a parametric distribution on the unit sphere, which is various as some well known distributions, e.g. the von-Mises Fisher distribution or the Watson distribution, and for some models better fit. The consistency and asymptotic normality of the maximum-likelihood estimator are proven. As the second main part of this thesis, a general model of mixtures of these distributions on a hypersphere is discussed. We derive numerical approximations of the parameters in an Expectation Maximization setting. Furthermore we introduce a non-parametric estimation of the EM algorithm for the mixture model. Finally, we present some applications to the statistical analysis of fibre composites.
This thesis is devoted to deal with the stochastic optimization problems in various situations with the aid of the Martingale method. Chapter 2 discusses the Martingale method and its applications to the basic optimization problems, which are well addressed in the literature (for example, [15], [23] and [24]). In Chapter 3, we study the problem of maximizing expected utility of real terminal wealth in the presence of an index bond. Chapter 4, which is a modification of the original research paper joint with Korn and Ewald [39], investigates an optimization problem faced by a DC pension fund manager under inflationary risk. Although the problem is addressed in the context of a pension fund, it presents a way of how to deal with the optimization problem, in the case there is a (positive) endowment. In Chapter 5, we turn to a situation where the additional income, other than the income from returns on investment, is gained by supplying labor. Chapter 6 concerns a situation where the market considered is incomplete. A trick of completing an incomplete market is presented there. The general theory which supports the discussion followed is summarized in the first chapter.
These lecture notes give a completely self-contained introduction to the control theory of linear time-invariant systems. No prior knowledge is requried apart from linear algebra and some basic familiarity with ordinary differential equations. Thus, the course is suited for students of mathematics in their second or third year, and for theoretically inclined engineering students. Because of its appealing simplicity and elegance, the behavioral approch has been adopted to a large extend. A short list of recommended text books on the subject has been added, as a suggestion for further reading.
Algebraic Systems Theory
(2004)
Control systems are usually described by differential equations, but their properties of interest are most naturally expressed in terms of the system trajectories, i.e., the set of all solutions to the equations. This is the central idea behind the so-called "behavioral approach" to systems and control theory. On the other hand, the manipulation of linear systems of differential equations can be formalized using algebra, more precisely, module theory and homological methods ("algebraic analysis"). The relationship between modules and systems is very rich, in fact, it is a categorical duality in many cases of practical interest. This leads to algebraic characterizations of structural systems properties such as autonomy, controllability, and observability. The aim of these lecture notes is to investigate this module-system correspondence. Particular emphasis is put on the application areas of one-dimensional rational systems (linear ODE with rational coefficients), and multi-dimensional constant systems (linear PDE with constant coefficients).
Die Theorie der mehrdimensionalen Systeme ist ein relativ junges Forschungsgebiet innerhalb der Systemtheorie, erste Arbeiten stammen aus den 70er Jahren. Hauptmotiv für das Studium multidimensionaler Systeme war die Notwendigkeit einer Erweiterung der Theorie der digitalen Filter, die in der klassischen, eindimensionalen Signalverarbeitung (zeitabhängige Signale) Anwendung finden, auf den Bereich der Bildverarbeitung, also auf zweidimensionale Signale.; Die Vorlesung beschäftigt sich daher in ihrem ersten Teil mit skalaren zweidimensionalen Systemen und beschränkt sich im wesentlichen auf den linearen Fall. Untersucht werden zweidimensionale Filter, ihre wichtigsten Eigenschaften, Kausalität und Stabilität, sowie ihre Zustandsraum- realisierungen, etwa die Modelle von Roesser und Fornasini-Marchesini. Parallelen und Unterschiede zur eindimensionalen Systemtheorie werden betont.; Im zweiten Teil der Vorlesung werden allgemeine höherdimensionale und multivariable Systeme behandelt. Für diese Systeme erweist sich der von Jan Willems begründete Zugang zur Systemtheorie, der sogenannte behavioral approach, als zweckmäßig. Grundlegende Ideen dieses Ansatzes sowie eine der wichtigsten Methoden zum Rechnen mit Polynomen in mehreren Variablen, die Theorie der Gröbnerbasen, werden vorgestellt.
As a consequence of the real estate market crash after 2008, large investors invested a significant amount of wealth into single-family houses to construct a portfolio of rental dwellings, whose income is securitized in the capital. In some local housing markets, these investors own remarkable numbers of single-family houses. Furthermore, their trading activities have resulted in a new investment strategy, which exacerbates property wealth concentration and polarization. This new investment strategy and its portfolio optimization inspire curiosity about its influence on housing markets. This paper first aims to find an optimal portfolio strategy by employing an expected utility optimization from the terminal wealth, which adopts a stochastic model that includes a variety of economic states to estimate house prices. Second, it aims to analyze the effect of large investors on the housing market. The results show the investment strategies of large investors depend on the balance among economic state, maintenance cost, rental income, interest rate and investment willingness of large investors to housing and their effect depends on the state of the economy.
Load modeling is one of the crucial tasks for improving smart grids’ energy efficiency. Among many alternatives, machine learning-based load models have become popular in applications and have shown outstanding performance in recent years. The performance of these models highly relies on data quality and quantity available for training. However, gathering a sufficient amount of high-quality data is time-consuming and extremely expensive. In the last decade, Generative Adversarial Networks (GANs) have demonstrated their potential to solve the data shortage problem by generating synthetic data by learning from recorded/empirical data. Educated synthetic datasets can reduce prediction error of electricity consumption when combined with empirical data. Further, they can be used to enhance risk management calculations. Therefore, we propose RCGAN, TimeGAN, CWGAN, and RCWGAN which take individual electricity consumption data as input to provide synthetic data in this study. Our work focuses on one dimensional times series, and numerical experiments on an empirical dataset show that GANs are indeed able to generate synthetic data with realistic appearance.
Estimation and Portfolio Optimization with Expert Opinions in Discrete-time Financial Markets
(2021)
In this thesis, we mainly discuss the problem of parameter estimation and
portfolio optimization with partial information in discrete-time. In the portfolio optimization problem, we specifically aim at maximizing the utility of
terminal wealth. We focus on the logarithmic and power utility functions. We consider expert opinions as another observation in addition to stock returns to improve estimation of drift and volatility parameters at different times and for the purpose of asset optimization.
In the first part, we assume that the drift term has a fixed distribution, and
the volatility term is constant. We use the Kalman filter to combine the two
types of observations. Moreover, we discuss how to transform this problem
into a non-linear problem of Gaussian noise when the expert opinion is uniformly distributed. The generalized Kalman filter is used to estimate the parameters in this problem.
In the second part, we assume that drift and volatility of asset returns are both driven by a Markov chain. We mainly use the change-of-measure technique to estimate various values required by the EM algorithm. In addition,
we focus on different ways to combine the two observations, expert opinions and asset returns. First, we use the linear combination method. At the same time, we discuss how to use a logistic regression model to quantify expert
opinions. Second, we consider that expert opinions follow a mixed Dirichlet distribution. Under this assumption, we use another probability measure to
estimate the unnormalized filters, needed for the EM algorithm.
In the third part, we assume that expert opinions follow a mixed Dirichlet distribution and focus on how we can obtain approximate optimal portfolio
strategies in different observation settings. We claim the approximate strategies from the dynamic programming equations in different settings and analyze the dependence on the discretization step. Finally we compute different
observation settings in a simulation study.
In this thesis, a new concept to prove Mosco convergence of gradient-type Dirichlet forms within the \(L^2\)-framework of K.~Kuwae and T.~Shioya for varying reference measures is developed.
The goal is, to impose as little additional conditions as possible on the sequence of reference measure \({(\mu_N)}_{N\in \mathbb N}\), apart from weak convergence of measures.
Our approach combines the method of Finite Elements from numerical analysis with the topic of Mosco convergence.
We tackle the problem first on a finite-dimensional substructure of the \(L^2\)-framework, which is induced by finitely many basis functions on the state space \(\mathbb R^d\).
These are shifted and rescaled versions of the archetype tent function \(\chi^{(d)}\).
For \(d=1\) the archetype tent function is given by
\[\chi^{(1)}(x):=\big((-x+1)\land(x+1)\big)\lor 0,\quad x\in\mathbb R.\]
For \(d\geq 2\) we define a natural generalization of \(\chi^{(1)}\) as
\[\chi^{(d)}(x):=\Big(\min_{i,j\in\{1,\dots,d\}}\big(\big\{1+x_i-x_j,1+x_i,1-x_i\big\}\big)\Big)_+,\quad x\in\mathbb R^d.\]
Our strategy to obtain Mosco convergence of
\(\mathcal E^N(u,v)=\int_{\mathbb R^d}\langle\nabla u,\nabla v\rangle_\text{euc}d\mu_N\) towards \(\mathcal E(u,v)=\int_{\mathbb R^d}\langle\nabla u,\nabla v\rangle_\text{euc}d\mu\) for \(N\to\infty\)
involves as a preliminary step to restrict those bilinear forms to arguments \(u,v\) from the vector space spanned by the finite family \(\{\chi^{(d)}(\frac{\,\cdot\,}{r}-\alpha)\) \(|\alpha\in Z\}\) for
a finite index set \(Z\subset\mathbb Z^d\) and a scaling parameter \(r\in(0,\infty)\).
In a diagonal procedure, we consider a zero-sequence of scaling parameters and a sequence of index sets exhausting \(\mathbb Z^d\).
The original problem of Mosco convergence, \(\mathcal E^N\) towards \(\mathcal E\) w.r.t.~arguments \(u,v\) form the respective minimal closed form domains extending the pre-domain \(C_b^1(\mathbb R^d)\), can be solved
by such a diagonal procedure if we ask for some additional conditions on the Radon-Nikodym derivatives \(\rho_N(x)=\frac{d\mu_N(x)}{d x}\), \(N\in\mathbb N\). The essential requirement reads
\[\frac{1}{(2r)^d}\int_{[-r,r]^d}|\rho_N(x)- \rho_N(x+y)|d y \quad \overset{r\to 0}{\longrightarrow} \quad 0 \quad \text{in } L^1(d x),\,
\text{uniformly in } N\in\mathbb N.\]
As an intermediate step towards a setting with an infinite-dimensional state space, we let $E$ be a Suslin space and analyse the Mosco convergence of
\(\mathcal E^N(u,v)=\int_E\int_{\mathbb R^d}\langle\nabla_x u(z,x),\nabla_x v(z,x)\rangle_\text{euc}d\mu_N(z,x)\) with reference measure \(\mu_N\) on \(E\times\mathbb R^d\) for \(N\in\mathbb N\).
The form \(\mathcal E^N\) can be seen as a superposition of gradient-type forms on \(\mathbb R^d\).
Subsequently, we derive an abstract result on Mosco convergence for classical gradient-type Dirichlet forms
\(\mathcal E^N(u,v)=\int_E\langle \nabla u,\nabla v\rangle_Hd\mu_N\) with reference measure \(\mu_N\) on a Suslin space $E$ and a tangential Hilbert space \(H\subseteq E\).
The preceding analysis of superposed gradient-type forms can be used on the component forms \(\mathcal E^{N}_k\), which provide the decomposition
\(\mathcal E^{N}=\sum_k\mathcal E^{N}_k\). The index of the component \(k\) runs over a suitable orthonormal basis of admissible elements in \(H\).
For the asymptotic form \(\mathcal E\) and its component forms \(\mathcal E^k\), we have to assume \(D(\mathcal E)=\bigcap_kD(\mathcal E^k)\) regarding their domains, which is equivalent to the Markov uniqueness of \(\mathcal E\).
The abstract results are tested on an example from statistical mechanics.
Under a scaling limit, tightness of the family of laws for a microscopic dynamical stochastic interface model over \((0,1)^d\) is shown and its asymptotic Dirichlet form identified.
The considered model is based on a sequence of weakly converging Gaussian measures \({(\mu_N)}_{N\in\mathbb N}\) on \(L^2((0,1)^d)\), which are
perturbed by a class of physically relevant non-log-concave densities.
A Topology Primer
(2002)
Manifolds
(2017)
The thesis at hand deals with the numerical solution of multiscale problems arising in the modeling of processes in fluid and thermo dynamics. Many of these processes, governed by partial differential equations, are relevant in engineering, geoscience, and environmental studies. More precisely, this thesis discusses the efficient numerical computation of effective macroscopic thermal conductivity tensors of high-contrast composite materials. The term "high-contrast" refers to large variations in the conductivities of the constituents of the composite. Additionally, this thesis deals with the numerical solution of Brinkman's equations. This system of equations adequately models viscous flows in (highly) permeable media. It was introduced by Brinkman in 1947 to reduce the deviations between the measurements for flows in such media and the predictions according to Darcy's model.
In the first part of the thesis we develop the theory of standard bases in free modules over (localized) polynomial rings. Given that linear equations are solvable in the coefficients of the polynomials, we introduce an algorithm to compute standard bases with respect to arbitrary (module) monomial orderings. Moreover, we take special care to principal ideal rings, allowing zero divisors. For these rings we design modified algorithms which are new and much faster than the general ones. These algorithms were motivated by current limitations in formal verification of microelectronic System-on-Chip designs. We show that our novel approach using computational algebra is able to overcome these limitations in important classes of applications coming from industrial challenges.
The second part is based on research in collaboration with Jason Morton, Bernd Sturmfels and Anne Shiu. We devise a general method to describe and compute a certain class of rank tests motivated by statistics. The class of rank tests may loosely be described as being based on computing the number of linear extensions to given partial orders. In order to apply these tests to actual data we developed two algorithms and used our implementations to apply the methodology to gene expression data created at the Stowers Institute for Medical Research. The dataset is concerned with the development of the vertebra. Our rankings proved valuable to the biologists.
Model uncertainty is a challenge that is inherent in many applications of mathematical models in various areas, for instance in mathematical finance and stochastic control. Optimization procedures in general take place under a particular model. This model, however, might be misspecified due to statistical estimation errors and incomplete information. In that sense, any specified model must be understood as an approximation of the unknown "true" model. Difficulties arise since a strategy which is optimal under the approximating model might perform rather bad in the true model. A natural way to deal with model uncertainty is to consider worst-case optimization.
The optimization problems that we are interested in are utility maximization problems in continuous-time financial markets. It is well known that drift parameters in such markets are notoriously difficult to estimate. To obtain strategies that are robust with respect to a possible misspecification of the drift we consider a worst-case utility maximization problem with ellipsoidal uncertainty sets for the drift parameter and with a constraint on the strategies that prevents a pure bond investment.
By a dual approach we derive an explicit representation of the optimal strategy and prove a minimax theorem. This enables us to show that the optimal strategy converges to a generalized uniform diversification strategy as uncertainty increases.
To come up with a reasonable uncertainty set, investors can use filtering techniques to estimate the drift of asset returns based on return observations as well as external sources of information, so-called expert opinions. In a Black-Scholes type financial market with a Gaussian drift process we investigate the asymptotic behavior of the filter as the frequency of expert opinions tends to infinity. We derive limit theorems stating that the information obtained from observing the discrete-time expert opinions is asymptotically the same as that from observing a certain diffusion process which can be interpreted as a continuous-time expert. Our convergence results carry over to convergence of the value function in a portfolio optimization problem with logarithmic utility.
Lastly, we use our observations about how expert opinions improve drift estimates for our robust utility maximization problem. We show that our duality approach carries over to a financial market with non-constant drift and time-dependence in the uncertainty set. A time-dependent uncertainty set can then be defined based on a generic filter. We apply this to various investor filtrations and investigate which effect expert opinions have on the robust strategies.
In this dissertation we consider complex, projective hypersurfaces with many isolated singularities. The leading questions concern the maximal number of prescribed singularities of such hypersurfaces in a given linear system, and geometric properties of the equisingular stratum. In the first part a systematic introduction to the theory of equianalytic families of hypersurfaces is given. Furthermore, the patchworking method for constructing hypersurfaces with singularities of prescribed types is described. In the second part we present new existence results for hypersurfaces with many singularities. Using the patchworking method, we show asymptotically proper results for hypersurfaces in P^n with singularities of corank less than two. In the case of simple singularities, the results are even asymptotically optimal. These statements improve all previous general existence results for hypersurfaces with these singularities. Moreover, the results are also transferred to hypersurfaces defined over the real numbers. The last part of the dissertation deals with the Castelnuovo function for studying the cohomology of ideal sheaves of zero-dimensional schemes. Parts of the theory of this function for schemes in P^2 are generalized to the case of schemes on general surfaces in P^3. As an application we show an H^1-vanishing theorem for such schemes.
We study the efficient computation of Nash and strong equilibria in weighted bottleneck games. In such a game different players interact on a set of resources in the way that every player chooses a subset of the resources as her strategy. The cost of a single resource depends on the total weight of players choosing it and the personal cost every player tries to minimize is the cost of the most expensive resource in her strategy, the bottleneck value. To derive efficient algorithms for finding Nash equilibria in these games, we generalize a tranformation of a bottleneck game into a special congestion game introduced by Caragiannis et al. [1]. While investigating the transformation we introduce so-called lexicographic games, in which the aim of a player is not only to minimize her bottleneck value but to lexicographically minimize the ordered vector of costs of all resources in her strategy. For the special case of network bottleneck games, i.e., the set of resources are the edges of a graph and the strategies are paths, we analyse different Greedy type methods and their limitations for extension-parallel and series-parallel graphs.
Sudakov's typical marginals, random linear functionals and a conditional central limit theorem
(1997)
V.N. Sudakov [Sud78] proved that the one-dimensional marginals of a highdimensional second order measure are close to each other in most directions. Extending this and a related result in the context of projection pursuit of P. Diaconis and D. Freedman [Dia84], we give for a probability measure P and a random (a.s.) linear functional F on a Hilbert space simple sufficient conditions under which most of the one-dimensional images of P under F are close to their canonical mixture which turns out to be almost a mixed normal distribution. Using the concept of approximate conditioning we deduce a conditional central limit theorem (theorem 3) for random averages of triangular arrays of random variables which satisfy only fairly weak asymptotic orthogonality conditions.
Bekanntlich gibt es keinen befriedigenden unendlich dimensionalen Ersatz für das Lebesgue-Mass. Andererseits lassen sich viele Techniken klassischer Analysis auch auf unendlich dimensionale Situationen übertragen. Eine Möglichkeit hierzu gibt die Theorie differenzierbarer Masse. Man definiert Richtungsableitungen für Masse ähnlich wie für Funktionen. Eines der zentralen Beispiele ist das Wiener-Mass. Stochastische Integration bezüglich der Brownschen Bewegung, insbesondere das Skorokhod-Integral ergeben sich in natürlicher Weise durch diesen Ansatz und auch die Grundideen des MalliavinKalküls lassen sich in diesem Rahmen einfach erläutern. Die Vorträge geben die meisten Beweise.
Starting from the uniqueness question for mixtures of distributions this review centers around the question under which formally weaker assumptions one can prove the existence of SPLIFs, in other words perfect statistics and tests. We mention a couple of positive and negative results which complement the basic contribution of David Blackwell in 1980. Typically the answers depend on the choice of the set theoretic axioms and on the particular concepts of measurability.
Analysis II
(2000)
We study a model for learning periodic signals in recurrent neural networks proposed by Doya and Yoshizawa [7] that can be considered as a model for temporal pattern memory in animal motoric systems. A network receives an external oscillatory input and adjusts its weights so that this signal can be reproduced approximately as the network output after some time. We use tools from adaptive control theory to derive an algorithm for weight matrices with special structure. If the input is generated by a network of the same structure the algorithm converges globally and does not exhibit the deficiencies of the back-propagation based approach of Doya and Yoshizawa under a persistency of excitation condition. This simple algorithm can also be used for open loop identification under quite restructive assumptions. The persistency of excitation condition cannot be proven even for the matrices with special structure but for a 3d system. For higher dimensional systems we give connections to the theory of linear time-varying systems where this condition is generically true (under assumption which are also needed in the time-invariant case). However, we cannot show that the linearized system related to the nonlinear neural network fulfills these generic assumptions.
The edge enhancement property of a nonlinear diffusion equation with a suitable expression for the diffusivity is an important feature for image processing. We present an algorithm to solve this equation in a wavelet basis and discuss its one dimensional version in some detail. Sample calculations demonstrate principle effects and treat in particular the case of highly noise perturbed signals. The results are discussed with respect to performance, efficiency, choice of parameters and are illustrated by a large number of figures. Finally, a comparison with a Fourier method and a finite volume method is performed.
A survey on continuous, semidiscrete and discrete well-posedness and scale-space results for a class of nonlinear diffusion filters is presented. This class does not require any monotony assumption (comparison principle) and, thus, allows image restoration as well. The theoretical results include existence, uniqueness, continuous dependence on the initial image, maximum-minimum principles, average grey level invariance, smoothing Lyapunov functionals, and convergence to a constant steady state.
Cloudy inhomogenities in artificial fabrics are graded by a fast method which is based on a Laplacian pyramid decomposition of the fabric image. This band-pass representation takes into account the scale character of the cloudiness. A quality measure of the entire cloudiness is obtained as a weighted mean over the variances of all scales.
The ideas of texture analysis by means of the structure tensor are combined with the scale-space concept of anisotropic diffusion filtering. In contrast to many other nonlinear diffusion techniques, the proposed one uses a diffusion tensor instead of a scalar diffusivity. This allows true anisotropic behaviour. The preferred diffusion direction is determined according to the phase angle of the structure tensor. The diffusivity in this direction is increasing with the local coherence of the signal. This filter is constructed in such a way that it gives a mathematically well-funded scale-space representation of the original image. Experiments demonstrate its usefulness for the processing of interrupted one-dimensional structures such as fingerprint and fabric images.
In spite of its lack of theoretical justification, nonlinear diffusion filtering has become a powerful image enhancement tool in the recent years. The goal of the present paper is to provide a mathematical foundation for nonlinear diffusion filtering as a scale-space transformation which is flexible enough to simplify images without loosing the capability of enhancing edges. By stuying the Lyapunow functional, it is shown that nonlinear diffusion reduces Lp norms and central moments and increases the entropy of images. The proposed anisotropic class utilizes a diffusion tensor which may be adapted to the image structure. It permits existence, uniqueness and regularity results, the solution depends continuously on the initial image, and it fulfills an extremum principle. All considerations include linear and certain nonlinear isotropic models and apply to m-dimensional vector-valued images. The results are juxtaposed to linear and morphological scale-spaces.
The performance of napkins is nowadays improved substantially by embedding granules of a superabsorbent into the cellulose matrix. In this paper a continuous model for the liquid transport in such an Ultra Napkin is proposed. Its mean feature is a nonlinear diffusion equation strongly coupled with an ODE describing a reversible absorbtion process. An efficient numerical method based on a symmetrical time splitting and a finite difference scheme of ADI-predictor-corrector type has been developed to solve these equations in a three dimensional setting. Numerical results are presented that can be used to optimize the granule distribution.
A way to derive consistently kinetic models for vehicular traffic from microscopic follow the leader models is presented. The obtained class of kinetic equations is investigated. Explicit examples for kinetic models are developed with a particular emphasis on obtaining models, that give realistic results. For space homogeneous traffic flow situations numerical examples are given including stationary distributions and fundamental diagrams.
In this paper we analyze the vibrations of nonlinear structures by means of the novel approach of isogeometric finite elements. The fundamental idea of isogeometric finite elements is to apply the same functions, namely B-Splines and NURBS (Non-Uniform Rational B-Splines), for describing the geometry and for representing the numerical solution. In case of linear vibrational analysis, this approach has already been shown to possess substantial advantages over classical finite elements, and we extend it here to a nonlinear framework based on the harmonic balance principle.
As application, the straight nonlinear Euler-Bernoulli beam is used, and overall, it is demonstrated that isogeometric finite elements with B-Splines in combination with the harmonic balance method are a powerful means for the analysis of nonlinear structural vibrations. In particular, the smoother k-method provides higher accuracy than the p-method for isogeometric nonlinear vibration analysis.
In this paper we present a method for nonlinear frequency response analysis of mechanical vibrations of 3-dimensional solid structures.
For computing nonlinear frequency response to periodic excitations, we employ the well-established harmonic balance method.
A fundamental aspect for allowing a large-scale application of the method is model order reduction of the discretized equation of motion. Therefore we propose the utilization of a modal projection method enhanced with modal derivatives, providing second-order information.
For an efficient spatial discretization of continuum mechanics nonlinear partial differential equations, including large deformations and hyperelastic material laws, we use the isogeometric finite element method, which has already been shown to possess advantages over classical finite element discretizations in terms of higher accuracy of numerical approximations in the fields of linear vibration and static large deformation analysis.
With several computational examples, we demonstrate the applicability and accuracy of the modal derivative reduction method for nonlinear static computations and vibration analysis.
Thus, the presented method opens a promising perspective on application of nonlinear frequency analysis to large-scale industrial problems.
In this thesis we present a new method for nonlinear frequency response analysis of mechanical vibrations.
For an efficient spatial discretization of nonlinear partial differential equations of continuum mechanics we employ the concept of isogeometric analysis. Isogeometric finite element methods have already been shown to possess advantages over classical finite element discretizations in terms of exact geometry representation and higher accuracy of numerical approximations using spline functions.
For computing nonlinear frequency response to periodic external excitations, we rely on the well-established harmonic balance method. It expands the solution of the nonlinear ordinary differential equation system resulting from spatial discretization as a truncated Fourier series in the frequency domain.
A fundamental aspect for enabling large-scale and industrial application of the method is model order reduction of the spatial discretization of the equation of motion. Therefore we propose the utilization of a modal projection method enhanced with modal derivatives, providing second-order information. We investigate the concept of modal derivatives theoretically and using computational examples we demonstrate the applicability and accuracy of the reduction method for nonlinear static computations and vibration analysis.
Furthermore, we extend nonlinear vibration analysis to incompressible elasticity using isogeometric mixed finite element methods.
This thesis consists of two parts, i.e. the theoretical background of (R)ABSDE including basic theorems, theoretical proofs and properties (Chapter 2-4), as well as numerical algorithms and simulations for (R)ABSDES (Chapter 5). For the theoretical part, we study ABSDEs (Chapter 2), RABSDEs with one obstacle (Chapter 3)and RABSDEs with two obstacles (Chapter 4) in the defaultable setting respectively, including the existence and uniqueness theorems, applications, the comparison theorem for ABSDEs, their relations with PDEs and stochastic differential delay equations (SDDE). The numerical algorithm part (Chapter 5) introduces two main algorithms, a discrete penalization scheme and a discrete reflected scheme based on a random walk approximation of the Brownian motion as well as a discrete approximation of the default martingale; we give the convergence results of the algorithms, provide a numerical example and an application in American game options in order to illustrate the performance of the algorithms.
The efficient numerical treatment of the Boltzmann equation is a very important task in many fields of application. Most of the practically relevant numerical schemes are based on the simulation of large particle systems that approximate the evolution of the distribution function described by the Boltzmann equation. In particular, stochastic particle systems play an important role in the construction of various numerical algorithms.
Diese Diplomarbeit gibt eine kurze Einführung in das Gebiet der Diffusionsprozesse (beschrieben als Lösungen stochastischer Differentialgleichungen) und der großen Abweichungen. Mit Methoden aus dem Gebiet der großen Abweichungen wird dann das asymptotische Verhalten des Bayesrisikos für die unterscheidung zweier Diffusionsprozesse untersucht.
In this text we survey some large deviation results for diffusion processes. The first chapters present results from the literature such as the Freidlin-Wentzell theorem for diffusions with small noise. We use these results to prove a new large deviation theorem about diffusion processes with strong drift. This is the main result of the thesis. In the later chapters we give another application of large deviation results, namely to determine the exponential decay rate for the Bayes risk when separating two different processes. The final chapter presents techniques which help to experiment with rare events for diffusion processes by means of computer simulations.
In this thesis we explicitly solve several portfolio optimization problems in a very realistic setting. The fundamental assumptions on the market setting are motivated by practical experience and the resulting optimal strategies are challenged in numerical simulations.
We consider an investor who wants to maximize expected utility of terminal wealth by trading in a high-dimensional financial market with one riskless asset and several stocks.
The stock returns are driven by a Brownian motion and their drift is modelled by a Gaussian random variable. We consider a partial information setting, where the drift is unknown to the investor and has to be estimated from the observable stock prices in addition to some analyst’s opinion as proposed in [CLMZ06]. The best estimate given these observations is the well known Kalman-Bucy-Filter. We then consider an innovations process to transform the partial information setting into a market with complete information and an observable Gaussian drift process.
The investor is restricted to portfolio strategies satisfying several convex constraints.
These constraints can be due to legal restrictions, due to fund design or due to client's specifications. We cover in particular no-short-selling and no-borrowing constraints.
One popular approach to constrained portfolio optimization is the convex duality approach of Cvitanic and Karatzas. In [CK92] they introduce auxiliary stock markets with shifted market parameters and obtain a dual problem to the original portfolio optimization problem that can be better solvable than the primal problem.
Hence we consider this duality approach and using stochastic control methods we first solve the dual problems in the cases of logarithmic and power utility.
Here we apply a reverse separation approach in order to obtain areas where the corresponding Hamilton-Jacobi-Bellman differential equation can be solved. It turns out that these areas have a straightforward interpretation in terms of the resulting portfolio strategy. The areas differ between active and passive stocks, where active stocks are invested in, while passive stocks are not.
Afterwards we solve the auxiliary market given the optimal dual processes in a more general setting, allowing for various market settings and various dual processes.
We obtain explicit analytical formulas for the optimal portfolio policies and provide an algorithm that determines the correct formula for the optimal strategy in any case.
We also show optimality of our resulting portfolio strategies in different verification theorems.
Subsequently we challenge our theoretical results in a historical and an artificial simulation that are even closer to the real world market than the setting we used to derive our theoretical results. However, we still obtain compelling results indicating that our optimal strategies can outperform any benchmark in a real market in general.