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
This paper considers the numerical solution of a transmission boundary-value problem for the time-harmonic Maxwell equations with the help of a special finite volume discretization. Applying this technique to several three-dimensional test problems, we obtain large, sparse, complex linear systems, which are solved by using BiCG, CGS, BiCGSTAB resp., GMRES. We combine these methods with suitably chosen preconditioning matrices and compare the speed of convergence.
Destructive diseases of the lung like lung cancer or fibrosis are still often lethal. Also in case of fibrosis in the liver, the only possible cure is transplantation.
In this thesis, we investigate 3D micro computed synchrotron radiation (SR\( \mu \)CT) images of capillary blood vessels in mouse lungs and livers. The specimen show so-called compensatory lung growth as well as different states of pulmonary and hepatic fibrosis.
During compensatory lung growth, after resecting part of the lung, the remaining part compensates for this loss by extending into the empty space. This process is accompanied by an active vessel growing.
In general, the human lung can not compensate for such a loss. Thus, understanding this process in mice is important to improve treatment options in case of diseases like lung cancer.
In case of fibrosis, the formation of scars within the organ's tissue forces the capillary vessels to grow to ensure blood supply.
Thus, the process of fibrosis as well as compensatory lung growth can be accessed by considering the capillary architecture.
As preparation of 2D microscopic images is faster, easier, and cheaper compared to SR\( \mu \)CT images, they currently form the basis of medical investigation. Yet, characteristics like direction and shape of objects can only properly be analyzed using 3D imaging techniques. Hence, analyzing SR\( \mu \)CT data provides valuable additional information.
For the fibrotic specimen, we apply image analysis methods well-known from material science. We measure the vessel diameter using the granulometry distribution function and describe the inter-vessel distance by the spherical contact distribution. Moreover, we estimate the directional distribution of the capillary structure. All features turn out to be useful to characterize fibrosis based on the deformation of capillary vessels.
It is already known that the most efficient mechanism of vessel growing forms small torus-shaped holes within the capillary structure, so-called intussusceptive pillars. Analyzing their location and number strongly contributes to the characterization of vessel growing. Hence, for all three applications, this is of great interest. This thesis provides the first algorithm to detect intussusceptive pillars in SR\( \mu \)CT images. After segmentation of raw image data, our algorithm works automatically and allows for a quantitative evaluation of a large amount of data.
The analysis of SR\( \mu \)CT data using our pillar algorithm as well as the granulometry, spherical contact distribution, and directional analysis extends the current state-of-the-art in medical studies. Although it is not possible to replace certain 3D features by 2D features without losing information, our results could be used to examine 2D features approximating the 3D findings reasonably well.
The various uses of fiber-reinforced composites, for example in the enclosures of planes, boats and cars, generates the demand for a detailed analysis of these materials. The final goal is to optimize fibrous materials by the means of “virtual material design”. New fibrous materials are virtually created as realizations of a stochastic model and evaluated with physical simulations. In that way, materials can be optimized for specific use cases, without constructing expensive prototypes or performing mechanical experiments. In order to design a practically fabricable material, the stochastic model is first adapted to an existing material and then slightly modified. The virtual reconstruction of the existing material requires a precise knowledge of the geometry of its microstructure. The first part of this thesis describes a fiber quantification method by the means of local measurements of the fiber radius and orientation. The combination of a sparse chord length transform and inertia moments leads to an efficient and precise new algorithm. It outperforms existing approaches with the possibility to treat different fiber radii within one sample, with high precision in continuous space and comparably fast computing time. This local quantification method can be directly applied on gray value images by adapting the directional distance transforms on gray values. In this work, several approaches of this kind are developed and evaluated. Further characterization of the fiber system requires a segmentation of each single fiber. Using basic morphological operators with specific structuring elements, it is possible to derive a probability for each pixel describing if the pixel belongs to a fiber core in a region without overlapping fibers. Tracking high probabilities leads to a partly reconstruction of the fiber cores in non crossing regions. These core parts are then reconnected over critical regions, if they fulfill certain conditions ensuring the affiliation to the same fiber. In the second part of this work, we develop a new stochastic model for dense systems of non overlapping fibers with a controllable level of bending. Existing approaches in the literature have at least one weakness in either achieving high volume fractions, producing non overlapping fibers, or controlling the bending or the orientation distribution. This gap can be bridged by our stochastic model, which operates in two steps. Firstly, a random walk with the multivariate von Mises-Fisher orientation distribution defines bent fibers. Secondly, a force-biased packing approach arranges them in a non overlapping configuration. Furthermore, we provide the estimation of all parameters needed for the fitting of this model to a real microstructure. Finally, we simulate the macroscopic behavior of different microstructures to derive their mechanical and thermal properties. This part is mostly supported by existing software and serves as a summary of physical simulation applied to random fiber systems. The application on a glass fiber reinforced polymer proves the quality of the reconstruction by our stochastic model, as the effective properties match for both the real microstructure and the realizations of the fitted model. This thesis includes all steps to successfully perform virtual material design on various data sets. With novel and efficient algorithms it contributes to the science of analysis and modeling of fiber reinforced materials.
We have presented here a two-dimensional kinetical scheme for equations governing the motion of a compressible flow of an ideal gas (air) based on the Kaniel method. The basic flux functions are computed analytically and have been used in the organization of the flux computation. The algorithm is implemented and tested for the 1D shock and 2D shock-obstacle interaction problems.
The classic approach in robust optimization is to optimize the solution with respect to the worst case scenario. This pessimistic approach yields solutions that perform best if the worst scenario happens, but also usually perform bad on average. A solution that optimizes the average performance on the other hand lacks in worst-case performance guarantee.
In practice it is important to find a good compromise between these two solutions. We propose to deal with this problem by considering it from a bicriteria perspective. The Pareto curve of the bicriteria problem visualizes exactly how costly it is to ensure robustness and helps to choose the solution with the best balance between expected and guaranteed performance.
Building upon a theoretical observation on the structure of Pareto solutions for problems with polyhedral feasible sets, we present a column generation approach that requires no direct solution of the computationally expensive worst-case problem. In computational experiments we demonstrate the effectivity of both the proposed algorithm, and the bicriteria perspective in general.
We consider the problem of evacuating a region with the help of buses. For a given set of possible collection points where evacuees gather, and possible shelter locations where evacuees are brought to, we need to determine both collection points and shelters we would like to use, and bus routes that evacuate the region in minimum time.
We model this integrated problem using an integer linear program, and present a branch-cut-and-price algorithm that generates bus tours in its pricing step. In computational experiments we show that our approach is able to solve instances of realistic size in sufficient time for practical application, and considerably outperforms the usage of a generic ILP solver.
In this paper we give the definition of a solution concept in multicriteria combinatorial optimization. We show how Pareto, max-ordering and lexicographically optimal solutions can be incorporated in this framework. Furthermore we state some properties of lexicographic max-ordering solutions, which combine features of these three kinds of optimal solutions. Two of these properties, which are desirable from a decision maker" s point of view, are satisfied if and only of the solution concept is that of lexicographic max-ordering.
In this paper we develop a data-driven mixture of vector autoregressive models with exogenous components. The process is assumed to change regimes according to an underlying Markov process. In contrast to the hidden Markov setup, we allow the transition probabilities of the underlying Markov process to depend on past time series values and exogenous variables. Such processes have potential applications to modeling brain signals. For example, brain activity at time t (measured by electroencephalograms) will can be modeled as a function of both its past values as well as exogenous variables (such as visual or somatosensory stimuli). Furthermore, we establish stationarity, geometric ergodicity and the existence of moments for these processes under suitable conditions on the parameters of the model. Such properties are important for understanding the stability properties of the model as well as deriving the asymptotic behavior of various statistics and model parameter estimators.
Let \(a_1,\dots,a_n\) be independent random points in \(\mathbb{R}^d\) spherically symmetrically but not necessarily identically distributed. Let \(X\) be the random polytope generated as the convex hull of \(a_1,\dots,a_n\) and for any \(k\)-dimensional subspace \(L\subseteq \mathbb{R}^d\) let \(Vol_L(X) :=\lambda_k(L\cap X)\) be the volume of \(X\cap L\) with respect to the \(k\)-dimensional Lebesgue measure \(\lambda_k, k=1,\dots,d\). Furthermore, let \(F^{(i)}\)(t):= \(\bf{Pr}\) \(\)(\(\Vert a_i \|_2\leq t\)),
\(t \in \mathbb{R}^+_0\) , be the radial distribution function of \(a_i\). We prove that the expectation
functional \(\Phi_L\)(\(F^{(1)}, F^{(2)},\dots, F^{(n)})\) := \(E(Vol_L(X)\)) is strictly decreasing in
each argument, i.e. if \(F^{(i)}(t) \le G^{(i)}(t)t\), \(t \in {R}^+_0\), but \(F^{(i)} \not\equiv G^{(i)}\), we show \(\Phi\) \((\dots, F^{(i)}, \dots\)) > \(\Phi(\dots,G^{(i)},\dots\)). The proof is clone in the more general framework
of continuous and \(f\)- additive polytope functionals.
Treating polyatomic gases in kinetic gas theory requires an appropriate molecule model taking into account the additional internal structure of the gas particles. In this paper we describe two such models, each arising from quite different approaches to this problem. A simulation scheme for solving the corresponding kinetic equations is presented and some numerical results to 1D shockwaves are compared.
Simulation methods like DSMC are an efficient tool to compute rarefied gas flows. Using supercomputers it is possible to include various real gas effects like vibrational energies or chemical reactions in a gas mixture. Nevertheless it is still necessary to improve the accuracy of the current simulation methods in order to reduce the computational effort. To support this task the paper presents a comparison of the classical DSMC method with the so called finite Pointset Method. This new approach was developed during several years in the framework of the European space project HERMES. The comparison given in the paper is based on two different testcases: a spatially homogeneous relaxation problem and a 2-dimensional axisymmetric flow problem at high Mach numbers.
We consider the problem of evacuating an urban area caused by a natural or man-made disaster. There are several planning aspects that need to be considered in such a scenario, which are usually considered separately, due to their computational complexity. These aspects include: Which shelters are used to accommodate evacuees? How to schedule public transport for transit-dependent evacuees? And how do public and individual traffic interact? Furthermore, besides evacuation time, also the risk of the evacuation needs to be considered.
We propose a macroscopic multi-criteria optimization model that includes all of these questions simultaneously. As a mixed-integer programming formulation cannot handle instances of real-world size, we develop a genetic algorithm of NSGA-II type that is able to generate feasible solutions of good quality in reasonable computation times.
We extend the applicability of these methods by also considering how to aggregate instance data, and how to generate solutions for the original instance starting from a reduced solution.
In computational experiments using real-world data modelling the cities of Nice in France and Kaiserslautern in Germany, we demonstrate the effectiveness of our approach and compare the trade-off between different levels of data aggregation.
In this article we give a sufficient condition that a simply connected flexible body does not penetrate itself, if it is subjected to a continuous deformation. It is shown that the deformation map is automatically injective, if it is just locally injective and injective on the boundary of the body. Thereby, it is very remarkable that no higher regularity assumption than continuity for the deformation map is required. The proof exclusively relies on homotopy methods and the Jordan-Brouwer separation theorem.
The notion of Q-Gorenstein smoothings has been introduced by Kollar. ([KoJ], 6.2.3). This notion is essential for formulating Kollar's conjectures on smoothing components for rational surface singularities. He conjectures, loosely speaking, that every smoothing of a rational surface singularity can be obtained by blowing down a deformation of a partial resolution, this partial resolution having the property (among others) that the singularities occuring on it all have qG-smoothings. (For more details and precise statements see [Ko], ch. 6.). It is therefore of interest to construct singularities having qG-smoothings.
A new algorithm for optimization problems with three objective functions is presented which computes a representation for the set of nondominated points. This representation is guaranteed to have a desired coverage error and a bound on the number of iterations needed by the algorithm to meet this coverage error is derived. Since the representation does not necessarily contain nondominated points only, ideas to calculate bounds for the representation error are given. Moreover, the incorporation of domination during the algorithm and other quality measures are discussed.
We present a deterministic simulation scheme for the Boltzmann Semiconductor Equation. The convergence of the method is shown for a simplified space homogeneous case. Numerical experiments, which are very promising, are also given in this situation. The extension for the application to the space inhomogeneous equation with a self consistent electric field is quoted. Theoretical considerations in that case are in preparation.
Many discrepancy principles are known for choosing the parameter \(\alpha\) in the regularized operator equation \((T^*T+ \alpha I)x_\alpha^\delta = T^*y^\delta\), \(||y-y^d||\leq \delta\), in order to approximate the minimal norm least-squares solution of the operator equation \(Tx=y\). In this paper we consider a class of discrepancy principles for choosing the regularization parameter when \(T^*T\) and \(T^*y^\delta\) are approximated by \(A_n\) and \(z_n^\delta\) respectively with \(A_n\) not necessarily self - adjoint. Thisprocedure generalizes the work of Engl and Neubauer (1985),and particular cases of the results are applicable to the regularized projection method as well as to a degenerate kernel method considered by Groetsch (1990).
A distributional solution framework is developed for systems consisting of linear hyperbolic partial differential equations (PDEs) and switched differential algebraic equations (DAEs) which are coupled via boundary conditions. The unique solvability is then characterize in terms of a switched delay DAE. The theory is illustrated with an example of electric power lines modeled by the telegraph equations which are coupled via a switching transformer where simulations confirm the predicted impulsive solutions.
Compared to conventional techniques in computational fluid dynamics, the lattice Boltzmann method (LBM) seems to be a completely different approach to solve the incompressible Navier-Stokes equations. The aim of this article is to correct this impression by showing the close relation of LBM to two standard methods: relaxation schemes and explicit finite difference discretizations. As a side effect, new starting points for a discretization of the incompressible Navier-Stokes equations are obtained.
A single facility problem in the plane is considered, where an optimal location has to be
identified for each of finitely many time-steps with respect to time-dependent weights and
demand points. It is shown that the median objective can be reduced to a special case of the
static multifacility median problem such that results from the latter can be used to tackle the
dynamic location problem. When using block norms as distance measure between facilities,
a Finite Dominating Set (FDS) is derived. For the special case with only two time-steps, the
resulting algorithm is analyzed with respect to its worst-case complexity. Due to the relation
between dynamic location problems for T time periods and T-facility problems, this algorithm
can also be applied to the static 2-facility location problem.
In continous location problems we are given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing ones. In this paper, we consider a pointwise defined objective function where the weights are assigned to the existing facilities depending on the location of the new facility. This approach is shown to be a generalization of the median, center and centdian objective functions. In addition, this approach allows to formulate completely new location models. Efficient algorithms as well as structure results for this algebraic approach for location problems are presented. Extensions to the multifacility and restricted case are also considered.
We propose a model for glioma patterns in a microlocal tumor environment under
the influence of acidity, angiogenesis, and tissue anisotropy. The bottom-up model deduction
eventually leads to a system of reaction–diffusion–taxis equations for glioma and endothelial cell
population densities, of which the former infers flux limitation both in the self-diffusion and taxis
terms. The model extends a recently introduced (Kumar, Li and Surulescu, 2020) description of
glioma pseudopalisade formation with the aim of studying the effect of hypoxia-induced tumor
vascularization on the establishment and maintenance of these histological patterns which are typical
for high-grade brain cancer. Numerical simulations of the population level dynamics are performed
to investigate several model scenarios containing this and further effects.
We develop a framework for shape optimization problems under state equation con-
straints where both state and control are discretized by B-splines or NURBS. In other
words, we use isogeometric analysis (IGA) for solving the partial differential equation and a nodal approach to change domains where control points take the place of nodes and where thus a quite general class of functions for representing optimal shapes and their boundaries becomes available. The minimization problem is solved by a gradient descent method where the shape gradient will be defined in isogeometric terms. This
gradient is obtained following two schemes, optimize first–discretize then and, reversely,
discretize first–optimize then. We show that for isogeometric analysis, the two schemes yield the same discrete system. Moreover, we also formulate shape optimization with respect to NURBS in the optimize first ansatz which amounts to finding optimal control points and weights simultaneously. Numerical tests illustrate the theory.
Facility Location Problems are concerned with the optimal location of one or several new facilities, with respect to a set of existing ones. The objectives involve the distance between new and existing facilities, usually a weighted sum or weighted maximum. Since the various stakeholders (decision makers) will have different opinions of the importance of the existing facilities, a multicriteria problem with several sets of weights, and thus several objectives, arises. In our approach, we assume the decision makers to make only fuzzy comparisons of the different existing facilities. A geometric mean method is used to obtain the fuzzy weights for each facility and each decision maker. The resulting multicriteria facility location problem is solved using fuzzy techniques again. We prove that the final compromise solution is weakly Pareto optimal and Pareto optimal, if it is unique, or under certain assumptions on the estimates of the Nadir point. A numerical example is considered to illustrate the methodology.
A General Hilbert Space Approach to Wavelets and Its Application in Geopotential Determination
(1999)
A general approach to wavelets is presented within a framework of a separable functional Hilbert space H. Basic tool is the construction of H-product kernels by use of Fourier analysis with respect to an orthonormal basis in H. Scaling function and wavelet are defined in terms of H-product kernels. Wavelets are shown to be 'building blocks' that decorrelate the data. A pyramid scheme provides fast computation. Finally, the determination of the earth's gravitational potential from single and multipole expressions is organized as an example of wavelet approximation in Hilbert space structure.
We present a generalization of Proth's theorem for testing certain large integers for primality. The use of Gauß sums leads to a much simpler approach to these primality criteria as compared to the earlier tests. The running time of the algorithms is bounded by a polynomial in the length of the input string. The applicability of our algorithms is linked to certain diophantine approximations of \(l\)-adic roots of unity.
In this paper we consider the problem of optimizing a piecewise-linear objective function over a non-convex domain. In particular we do not allow the solution to lie in the interior of a prespecified region R. We discuss the geometrical properties of this problems and present algorithms based on combinatorial arguments. In addition we show how we can construct quite complicated shaped sets R while maintaining the combinatorial properties.
Various regulatory initiatives (such as the pan-European PRIIP-regulation or the German chance-risk classification for state subsidized pension products) have been introduced that require product providers to assess and disclose the risk-return profile of their issued products by means of a key information document. We will in this context outline a concept for a (forward-looking) simulation-based approach and highlight its application and advantages. For reasons of comparison, we further illustrate the performance of approximation methods based on a projection of observed returns into the future such as the Cornish–Fisher expansion or bootstrap methods.
Numerical Godeaux surfaces are minimal surfaces of general type with the smallest possible numerical invariants. It is known that the torsion group of a numerical Godeaux surface is cyclic of order \(m\leq 5\). A full classification has been given for the cases \(m=3,4,5\) by the work of Reid and Miyaoka. In each case, the corresponding moduli space is 8-dimensional and irreducible.
There exist explicit examples of numerical Godeaux surfaces for the orders \(m=1,2\), but a complete classification for these surfaces is still missing.
In this thesis we present a construction method for numerical Godeaux surfaces which is based on homological algebra and computer algebra and which arises from an experimental approach by Schreyer. The main idea is to consider the canonical ring \(R(X)\) of a numerical Godeaux surface \(X\) as a module over some graded polynomial ring \(S\). The ring \(S\) is chosen so that \(R(X)\) is finitely generated as an \(S\)-module and a Gorenstein \(S\)-algebra of codimension 3. We prove that the canonical ring of any numerical Godeaux surface, considered as an \(S\)-module, admits a minimal free resolution whose middle map is alternating. Moreover, we show that a partial converse of this statement is true under some additional conditions.
Afterwards we use these results to construct (canonical rings of) numerical Godeaux surfaces. Hereby, we restrict our study to surfaces whose bicanonical system has no fixed component but 4 distinct base points, in the following referred to as marked numerical Godeaux surfaces.
The particular interest of this thesis lies on marked numerical Godeaux surfaces whose torsion group is trivial. For these surfaces we study the fibration of genus 4 over \(\mathbb{P}^1\) induced by the bicanonical system. Catanese and Pignatelli showed that the general fibre is non-hyperelliptic and that the number \(\tilde{h}\) of hyperelliptic fibres is bounded by 3. The two explicit constructions of numerical Godeaux surfaces with a trivial torsion group due to Barlow and Craighero-Gattazzo, respectively, satisfy \(\tilde{h} = 2\).
With the method from this thesis, we construct an 8-dimensional family of numerical Godeaux surfaces with a trivial torsion group and whose general element satisfy \(\tilde{h}=0\).
Furthermore, we establish a criterion for the existence of hyperelliptic fibres in terms of a minimal free resolution of \(R(X)\). Using this criterion, we verify experimentally the
existence of a numerical Godeaux surface with \(\tilde{h}=1\).
In this article, we give an explicit homotopy between the solutions (i.e. stress, strain, displacement) of the quasistatic linear elastic and nonlinear elastoplastic boundary value problem, where we assume a linear kinematic hardening material law. We give error estimates with respect to the homotopy parameter.
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 the kinetic model for vehicular traffic developed in [3,4] is considered and theoretical results for the space homogeneous kinetic equation are presented. Existence and uniqueness results for the time dependent equation are stated. An investigation of the stationary equation leads to a boundary value problem for an ordinary differential equation. Existence of the solution and some properties are proved. A numerical investigation of the stationary equation is included.
Multiobjective combinatorial optimization problems have received increasing attention in recent years. Nevertheless, many algorithms are still restricted to the bicriteria case. In this paper we propose a new algorithm for computing all Pareto optimal solutions. Our algorithm is based on the notion of level sets and level curves and contains as a subproblem the determination of K best solutions for a single objective combinatorial optimization problem. We apply the method to the Multiobjective Quadratic Assignment Problem (MOQAP). We present two algorithms for ranking QAP solutions and nally give computational results comparing the methods.
It is often helpful to compute the intrinsic volumes of a set of which only a pixel image is observed. A computational efficient approach, which is suggested by several authors and used in practice, is to approximate the intrinsic volumes by a linear functional of the pixel configuration histogram. Here we want to examine, whether there is an optimal way of choosing this linear functional, where we will use a quite natural optimality criterion that has already been applied successfully for the estimation of the surface area. We will see that for intrinsic volumes other than volume or surface area this optimality criterion cannot be used, since estimators which ignore the data and return constant values are optimal w.r.t. this criterion. This shows that one has to be very careful, when intrinsic volumes are approximated by a linear functional of the pixel configuration histogram.
In this article a new numerical solver for simulations of district heating networks is presented. The numerical method applies the local time stepping introduced in [11] to networks of linear advection equations. In combination with the high order approach of [4] an accurate and very efficient scheme is developed. In several numerical test cases the advantages for simulations of district heating networks are shown.
In the Black-Scholes type financial market, the risky asset S 1 ( ) is supposed to satisfy dS 1 ( t ) = S 1 ( t )( b ( t ) dt + Sigma ( t ) dW ( t ) where W ( ) is a Brownian motion. The processes b ( ), Sigma ( ) are progressively measurable with respect to the filtration generated by W ( ). They are known as the mean rate of return and the volatility respectively. A portfolio is described by a progressively measurable processes Pi1 ( ), where Pi1 ( t ) gives the amount invested in the risky asset at the time t. Typically, the optimal portfolio Pi1 ( ) (that, which maximizes the expected utility), depends at the time t, among other quantities, on b ( t ) meaning that the mean rate of return shall be known in order to follow the optimal trading strategy. However, in a real-world market, no direct observation of this quantity is possible since the available information comes from the behavior of the stock prices which gives a noisy observation of b ( ). In the present work, we consider the optimal portfolio selection which uses only the observation of stock prices.
In the filling process of a car tank, the formation of foam plays an unwanted role, as it may prevent the tank from being completely filled or at least delay the filling. Therefore it is of interest to optimize the geometry of the tank using numerical simulation in such a way that the influence of the foam is minimized. In this dissertation, we analyze the behaviour of the foam mathematically on the mezoscopic scale, that is for single lamellae. The most important goals are on the one hand to gain a deeper understanding of the interaction of the relevant physical effects, on the other hand to obtain a model for the simulation of the decay of a lamella which can be integrated in a global foam model. In the first part of this work, we give a short introduction into the physical properties of foam and find that the Marangoni effect is the main cause for its stability. We then develop a mathematical model for the simulation of the dynamical behaviour of a lamella based on an asymptotic analysis using the special geometry of the lamella. The result is a system of nonlinear partial differential equations (PDE) of third order in two spatial and one time dimension. In the second part, we analyze this system mathematically and prove an existence and uniqueness result for a simplified case. For some special parameter domains the system can be further simplified, and in some cases explicit solutions can be derived. In the last part of the dissertation, we solve the system using a finite element approach and discuss the results in detail.
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.
It is of basic interest to assess the quality of the decisions of a statistician, based on the outcoming data of a statistical experiment, in the context of a given model class P of probability distributions. The statistician picks a particular distribution P , suffering a loss by not picking the 'true' distribution P' . There are several relevant loss functions, one being based on the the relative entropy function or Kullback Leibler information distance. In this paper we prove a general 'minimax risk equals maximin (Bayes) risk' theorem for the Kullback Leibler loss under the hypothesis of a dominated and compact family of distributions over a Polish observation space with suitably integrable densities. We also find that there is always an optimal Bayes strategy (i.e. a suitable prior) achieving the minimax value. Further, we see that every such minimax optimal strategy leads to the same distribution P in the convex closure of the model class. Finally, we give some examples to illustrate the results and to indicate, how the minimax result reflects in the structure of least favorable priors. This paper is mainly based on parts of this author's doctorial thesis.
The original publication is available at www.springerlink.com. This original publication also contains further results. We study a spherical wave propagating in radius- and latitude-direction and oscillating in latitude-direction in case of fibre-reinforced linearly elastic material. A function system solving Euler's equation of motion in this case and depending on certain Bessel and associated Legendre functions is derived.
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.
A Multi-Phase Flow Model Incorporated with Population Balance Equation in a Meshfree Framework
(2011)
This study deals with the numerical solution of a meshfree coupled model of Computational Fluid Dynamics (CFD) and Population Balance Equation (PBE) for liquid-liquid extraction columns. In modeling the coupled hydrodynamics and mass transfer in liquid extraction columns one encounters multidimensional population balance equation that could not be fully resolved numerically within a reasonable time necessary for steady state or dynamic simulations. For this reason, there is an obvious need for a new liquid extraction model that captures all the essential physical phenomena and still tractable from computational point of view. This thesis discusses a new model which focuses on discretization of the external (spatial) and internal coordinates such that the computational time is drastically reduced. For the internal coordinates, the concept of the multi-primary particle method; as a special case of the Sectional Quadrature Method of Moments (SQMOM) is used to represent the droplet internal properties. This model is capable of conserving the most important integral properties of the distribution; namely: the total number, solute and volume concentrations and reduces the computational time when compared to the classical finite difference methods, which require many grid points to conserve the desired physical quantities. On the other hand, due to the discrete nature of the dispersed phase, a meshfree Lagrangian particle method is used to discretize the spatial domain (extraction column height) using the Finite Pointset Method (FPM). This method avoids the extremely difficult convective term discretization using the classical finite volume methods, which require a lot of grid points to capture the moving fronts propagating along column height.
A method to correct the elastic stress tensor at a fixed point of an elastoplastic body, which is subject to exterior loads, is presented and analysed. In contrast to uniaxial corrections (Neuber or ESED), our method takes multiaxial phenomena like ratchetting or cyclic hardening/softening into account by use of Jiang's model. Our numerical algorithm is designed for the case that the scalar load functions are piecewise linear and can be used in connection with critical plane/multiaxial rainflow methods in high cycle fatigue analysis. In addition, a local existence and uniqueness result of Jiang's equations is given.
The Multiple Objective Median Problem involves locating a new facility so that a vector of performance criteria is optimized over a given set of existing facilities. A variation of this problem is obtained if the existing facilities are situated on two sides of a linear barrier. Such barriers like rivers, highways, borders, or mountain ranges are frequently encountered in practice. In this paper, theory of the Multiple Objective Median Problem with line barriers is developped. As this problem is nonconvex but specially-structured, a reduction to a series of convex optimization problems is proposed. The general results lead to a polynomial algorithm for finding the set of efficient solutions. The algorithm is proposed for bi-criteria problems with different measures of distance.
Starting from the two-scale model for pH-taxis of cancer cells introduced in [1], we consider here an extension accounting for tumor heterogeneity w.r.t. treatment sensitivity and a treatment approach including chemo- and radiotherapy. The effect of peritumoral region alkalinization on such therapeutic combination is investigated with the aid of numerical simulations.
We propose a model for acid-mediated tumor invasion involving two different scales: the microscopic one, for the dynamics of intracellular protons and their exchange with their extracellular counterparts, and the macroscopic scale of interactions between tumor cell and normal cell populations, along with the evolution of extracellular protons. We also account for the tactic behavior of cancer cells, the latter being assumed to biase their motion according to a gradient of extracellular protons (following [2,31] we call this pH taxis). A time dependent (and also time delayed) carrying capacity for the tumor cells in response to the effects of acidity is considered as well. The global well posedness of the resulting multiscale model is proved with a regularization and fixed point argument. Numerical simulations are performed in order to illustrate the behavior of the model.
We consider the multiscale model for glioma growth introduced in a previous work and extend it to account
for therapy effects. Thereby, three treatment strategies involving surgical resection, radio-, and
chemotherapy are compared for their efficiency. The chemotherapy relies on inhibiting the binding
of cell surface receptors to the surrounding tissue, which impairs both migration and proliferation.