Refine
Year of publication
Language
- English (1103) (remove)
Keywords
- optimal control (27)
- stability (14)
- integer programming (11)
- Stochastic programming (9)
- finite elements (9)
- mixed integer programming (9)
- Hamiltonian matrix (8)
- finite element method (8)
- model reduction (8)
- state constraints (8)
- branch-and-cut (7)
- error estimates (7)
- matrix polynomial (7)
- perturbation analysis (7)
- phase transitions (7)
- asymptotics (6)
- convergence (6)
- differential-algebraic equation (6)
- dissipativity (6)
- molecular dynamics (6)
- stochastic programming (6)
- strangeness index (6)
- symplectic matrix (6)
- Monte Carlo simulation (5)
- Optimal control (5)
- Schrödinger equation (5)
- adaptive finite element method (5)
- approximation (5)
- chance constraints (5)
- combinatorial optimization (5)
- eigenvalues (5)
- heat equation (5)
- phase field model (5)
- reaction-diffusion systems (5)
- scenario reduction (5)
- time discretization (5)
- two-stage (5)
- BSDE (4)
- Existence result (4)
- MINLP (4)
- Navier-Stokes equations (4)
- Partial differential equations (4)
- Robust Optimization (4)
- adaptivity (4)
- backward stochastic differential equation (4)
- canonical form (4)
- column generation (4)
- descriptor system (4)
- differential-algebraic equations (4)
- discontinuous coefficients (4)
- dissipative Schroedinger-type operators (4)
- doubly nonlinear equations (4)
- eigenvalue (4)
- eigenvalue problem (4)
- existence (4)
- existence of solutions (4)
- generalized standard materials (4)
- geodesic finite elements (4)
- implied volatility (4)
- indefinite inner product (4)
- matrix pencil (4)
- mechanism design (4)
- metastability (4)
- mixed boundary conditions (4)
- mixed finite elements (4)
- multistage (4)
- network design (4)
- nonconvex (4)
- palindromic eigenvalue problem (4)
- phase separation (4)
- primal heuristic (4)
- rate-independent processes (4)
- scenario tree (4)
- shape-memory alloys (4)
- shape-memory materials (4)
- systems biology (4)
- trajectory storage (4)
- AFEM (3)
- Asymptotic Expansions (3)
- Evolution Maxwell equations (3)
- Gamma convergence (3)
- Helmholtz equation (3)
- Large Neighborhood Search (3)
- Lyapunov exponent (3)
- Malliavin calculus (3)
- Measure Theory (3)
- Optimization (3)
- Primal Heuristic (3)
- Sacker-Sell spectrum (3)
- Schur complement (3)
- Smith form (3)
- Thin Conducting Sheets (3)
- a priori estimates (3)
- balanced truncation (3)
- behavior approach (3)
- calibration (3)
- carrier and current densities (3)
- characteristic function (3)
- connected facility location (3)
- constraint (3)
- constraint integer programming (3)
- constraint programming (3)
- cooperative game theory (3)
- cost sharing mechanisms (3)
- discrepancy (3)
- domain decomposition (3)
- domain propagation (3)
- dynamical systems (3)
- elastoplasticity (3)
- energetic solution (3)
- enthalpy transformation (3)
- even pencil (3)
- exponential dichotomy (3)
- free boundaries (3)
- hardening (3)
- high contrast (3)
- line planning (3)
- maximal monotone operators (3)
- mixed-integer (3)
- necessary optimality conditions (3)
- nonlinear eigenvalue problem (3)
- nonsmooth domains (3)
- optimal stopping (3)
- optimality conditions (3)
- optimization software (3)
- palindromic matrix polynomial (3)
- parabolic equation (3)
- passivity (3)
- perturbation theory (3)
- plasticity (3)
- pole condition (3)
- primal heuristics (3)
- probabilistic constraints (3)
- public transport (3)
- rank one perturbation (3)
- rare events (3)
- regularity (3)
- regularization (3)
- risk measure (3)
- robust representation (3)
- scheduling problems (3)
- spatially adaptive smoothing (3)
- spectral interval (3)
- stochastic volatility (3)
- symmetry breaking (3)
- temperature-induced phase transformation (3)
- transparent boundary condition (3)
- uniqueness (3)
- wave equation (3)
- weak solution (3)
- $\mu$-values (2)
- AMLI method (2)
- ANOVA decomposition (2)
- BMO martingales (2)
- Bohl exponent (2)
- C-stationarity (2)
- Cahn-Hilliard equation (2)
- Cahn-Hilliard system (2)
- Cosserat rod (2)
- Cosserat rods (2)
- Currents (2)
- Delaunay triangulation (2)
- Dune (2)
- Dynamical contact problems (2)
- Elliptic transmission problems (2)
- FPTAS (2)
- Fatou property (2)
- Flows over Time (2)
- GMRES (2)
- Gibbs-Thomson law (2)
- Gradient flow (2)
- Heston model (2)
- Integer Programming (2)
- Knapsack Problem (2)
- Kolmogorov metric (2)
- Krylov subspace methods (2)
- Lavrentiev type regularization (2)
- Lax-Phillips scattering theory (2)
- Linear Programming in Measure Spaces (2)
- Lr-distance (2)
- MINRES (2)
- MIP (2)
- MIQCP (2)
- Markov chain (2)
- Markov chains (2)
- Markov models (2)
- Matching (2)
- Mathematical Programming (2)
- Maxwell equations (2)
- Mixed Integer Programming (2)
- Mixed-Integer Nonlinear Programming (2)
- Moore-Penrose inverse (2)
- Network Flow (2)
- Network Flows (2)
- Newmark method (2)
- Newton-CG (2)
- Nonlinear optimal control (2)
- Nonlinear programming (2)
- Pseudo-Boolean (2)
- QR algorithm (2)
- Quasi-Monte Carlo (2)
- Rapid Branching (2)
- Recovery (2)
- Shortest Path Problem (2)
- Signorini condition (2)
- Stefan problem (2)
- Steklov function (2)
- Sturm-Liouville operators (2)
- Yosida regularization (2)
- adaptive finite element method (AFEM) (2)
- algebraic multigrid methods (2)
- alternating matrix polynomial (2)
- approximation algorithm (2)
- asymptotic limit (2)
- backward error (2)
- calmness (2)
- chemical master equation (2)
- chip verification (2)
- cluster analysis (2)
- complexity (2)
- compressed sensing (2)
- compression (2)
- computational complexity (2)
- computational homogenization (2)
- condition numbers (2)
- conflict analysis (2)
- conformation dynamics (2)
- contact problem (2)
- convergence to equilibrium (2)
- convex relaxation (2)
- coupling conditions (2)
- cow (2)
- crystal growth (2)
- cumulative constraint (2)
- damage (2)
- deflation (2)
- delay differential equation (2)
- demand function (2)
- density matrices (2)
- descriptor systems (2)
- differential inclusions (2)
- diffusion (2)
- discrete convolution (2)
- discrete differential geometry (2)
- dissipative Hamiltonian system (2)
- dissipative Schroedinger-Poisson systems (2)
- dissipative operators (2)
- doubly nonlinear differential inclusions (2)
- drift-diffusion processes (2)
- dual dissipation potential (2)
- effective dynamics (2)
- efficient dimension (2)
- eigenvalue problems (2)
- electrical circuits (2)
- elliptic-parabolic systems (2)
- energy minimization (2)
- energy resolved defect densities (2)
- entropic risk measure (2)
- even polynomial (2)
- evolutionary variational inequalities (2)
- existence and uniqueness (2)
- existence results (2)
- face numbers of polytopes (2)
- fare planning (2)
- filtration (2)
- finite difference method (2)
- finite element (2)
- finite volume method (2)
- first-order hyperbolic systems (2)
- first-order necessary conditions (2)
- first-order necessary optimality conditions (2)
- flux coupling analysis (2)
- functional MRI (2)
- funnel control (2)
- generalized inverse (2)
- generic perturbation (2)
- generic programming (2)
- geometric measure-theory (2)
- giant component (2)
- global convergence (2)
- grid-based methods (2)
- group velocity (2)
- heterostructures (2)
- heuristic (2)
- heuristics (2)
- hierarchical grids (2)
- high-gain output feedback (2)
- high-order FEM (2)
- hormone patterns (2)
- hysteresis operators (2)
- index (2)
- index reduction (2)
- inequality constraints (2)
- interior point method (2)
- inverse problem (2)
- large neighborhood search (2)
- law-invariance (2)
- linear programming (2)
- linear quadratic optimal control (2)
- long delay (2)
- matrix pencils (2)
- matrix sign function (2)
- maximal regularity (2)
- measure solution (2)
- metabolic network (2)
- minimum phase (2)
- mixed integer quadratically constrained programming (2)
- mixed-integer nonlinear programming (2)
- multi-layer network design (2)
- multigrid (2)
- mutual incoherence (2)
- new uniqueness proof (2)
- no small denominators (2)
- non-linear eigenvalue problem (2)
- nonlinear differential-algebraic equations (2)
- nonlinear elasticity (2)
- nonlinear phase field systems (2)
- nonlocal models (2)
- nonlocal radiation interface conditions (2)
- nonstandard phase field system (2)
- numerics (2)
- online optimization (2)
- optimal control problems (2)
- option pricing (2)
- orbitopes (2)
- p(x)-Laplacian (2)
- para-Hermitian (2)
- partial differential equation (2)
- passive system (2)
- path-following (2)
- perturbations (2)
- phase transition (2)
- phase-field model (2)
- photonic crystal wave-guide (2)
- port-Hamiltonian system (2)
- primal (2)
- probability metric (2)
- problem (2)
- pseudo-continuous spectrum (2)
- quadratic growth (2)
- quantitative stability (2)
- rapid branching (2)
- rate-dependent systems (2)
- rate-independent damage evolution (2)
- rate-independent energetic formulation (2)
- rate-independent evolution (2)
- reflection boundary conditions (2)
- relative entropy (2)
- reproduction (2)
- restricted isometry property (2)
- robust control (2)
- scattering matrix (2)
- second-order sufficient conditions (2)
- semismooth Newton method (2)
- sensitivity analysis (2)
- shape and topological derivative (2)
- shape optimization (2)
- sign characteristic (2)
- signal detection (2)
- simplicial surfaces (2)
- singular value decomposition (2)
- skew-Hamiltonian matrix (2)
- space-time discretization (2)
- spectral value sets (2)
- spectrum (2)
- stabilization (2)
- stationary process (2)
- stochastic calculus of variations (2)
- stochastic differential equation (2)
- stochastic resonance (2)
- stochastic synchronization (2)
- strangeness (2)
- strict relative degree (2)
- structure optimization (2)
- structured eigenvalue problem (2)
- structured linearization (2)
- sufficient optimality conditions (2)
- synchronization (2)
- time delayed generator (2)
- time-periodic solutions (2)
- vanishing viscosity method (2)
- variational analysis (2)
- variational inequality (2)
- variational problems (2)
- vector potential formulation (2)
- viscoelasticity (2)
- viscous Cahn-Hilliard system (2)
- zero dynamics (2)
- $CUR$ decomposition (1)
- $H$-based approximation (1)
- $H_\infty$ control (1)
- $W^1 (1)
- $W^1q$ regularity (1)
- $\mathcal{H}_\infty$ control (1)
- (even eigenvalue problem (1)
- (visco-)elasticity (1)
- 3D mesh compression (1)
- A posteriori, error analysis, finite element method, composite material, multiscale, high contrast, generalized Delaunay, network (1)
- AMFEM (1)
- AMLS (1)
- ANOVA (1)
- ASTS orientations (1)
- Abel basis of root vectors (1)
- Absorbing Boundary Conditions (1)
- Acetabulum (1)
- Adaptive Finite Elements (1)
- Adaptive finite element methods (1)
- Adaptive finite elements (1)
- Affine processes (1)
- Airline revenue management (1)
- Algebraic multi-level methods (1)
- Algebraic multilevel methods (1)
- Allen-Cahn equation (1)
- Allen-Cahn-equation (1)
- American option (1)
- American options (1)
- Anisotropic surface energy (1)
- Anisotropic surface energy; high order partial differential equations; pseudospectral methods; surface diffusion (1)
- Approximation (1)
- Approximation Algorithm (1)
- Arbitrage (1)
- Arrhenius law (1)
- Arrhenius-like conductivity law (1)
- Asymptotic analysis (1)
- Asymptotic methods in Finance (1)
- Asymptotic safety (1)
- Atomistic-Continuum Coupling (1)
- Augmenting paths and cycles (1)
- BMO martingale (1)
- BVD pencil (1)
- Barrier method (1)
- Barrier methods (1)
- Bayesian error analysis (1)
- Becker-Doering equations (1)
- Bermudan options (1)
- Birman-Krein formula (1)
- Black-Scholes equation (1)
- Boolean network (1)
- Borel flow (1)
- Boundary control (1)
- Boundary element method (1)
- Branch-and-Bound (1)
- Bridging Domain (1)
- Brownian dynamics (1)
- Brownian mostion (1)
- Brownian motion (1)
- Brunovsky form (1)
- Bubbles (1)
- Bundle Method (1)
- CAD (1)
- CG (1)
- COMSOL Multiphysics (1)
- Cahn--Hilliard equation (1)
- Cahn--Hilliard systems (1)
- Cahn-Hilliard reaction system (1)
- Cahn-Hilliard systems (1)
- Cahn-Hilliard type dynamics (1)
- Cahn-Hilliard/Navier-Stokes system (1)
- Cahn-Larche system (1)
- Cash additivity (1)
- Cash flows (1)
- Cash subadditivity (1)
- Cauchy matrix (1)
- Cayley transformation (1)
- Chance-Constrained-Programming (1)
- Chebyshev interpolation (1)
- Chemical master equation (1)
- Circuit switching (1)
- Classical solvability (1)
- Cogeneration plant (1)
- Column Generation (1)
- Complexity (1)
- Compromise Solutions (1)
- Computational Study (1)
- Conformal parameterizations (1)
- Conformation Dynamics; Markov State Models; Molecular Kinetics; Transition Rates (1)
- Conical surfaces (1)
- Connectivity (1)
- Constraint programming (1)
- Constraint-based modeling, metabolic network, thermodynamic constraints (1)
- Contact angle problem (1)
- Container terminal (1)
- Context-Based Coding (1)
- Contingent Derivative (1)
- Continuous linear programming (1)
- Convex Functions (1)
- Convex relaxation (1)
- Coupled systems (1)
- Crouzeix-Raviart (1)
- Curved rods (1)
- Curvilinear Elements (1)
- Cutset inequalities (1)
- Cycle-canceling algorithm (1)
- Czochralski method (1)
- DAEs (1)
- DWR (1)
- Deformable Surfaces (1)
- Delaunay triangulations (1)
- Delay differential equations (1)
- Diagonal operator (1)
- Diffeomorphic Registration (1)
- Diffeomorphic registration (1)
- Differential-algebraic systems (1)
- Diffuse-gray radiation (1)
- Diffusion tensor imaging (1)
- Diffusion weighted magnetic resonance imaging (1)
- Dilatometer (1)
- Directed graph (1)
- Dirichlet energy (1)
- Dirichlet-Neumann (1)
- Dirichlet-to-Neumann map (1)
- Discontinuous Galerkin methods (1)
- Discounting ambiguity (1)
- Discrete Laplace--Beltrami operators (1)
- Discrete Willmore energies (1)
- Discrete flows over time (1)
- Discrete model (1)
- Discrete model; Gene regulatory network; Piecewise affine model (1)
- Duality (1)
- Duality Theory (1)
- Duffing oscillator (1)
- Dupire (1)
- Dynamic boundary condition (1)
- Dynamic convex risk measures (1)
- Dynamic network flows (1)
- Dynamic penalization (1)
- EPEC (1)
- Eckhaus (1)
- Elasto-plastic contact, Variational inequality of the 2nd kind, Fenchel duality, Moreau-Yosida/Tichonov regularization, Path-following, Semismooth Newton (1)
- Elastoplasticity (1)
- Electricity futures (1)
- Electricity markets (1)
- Electricity portfolio (1)
- Electromagnetic fields (1)
- Elementary flux mode (1)
- Elliptic MPEC (1)
- Elliptic div-grad operators (1)
- Elliptic transmission problem (1)
- Energy balance (1)
- Energy conversion system (1)
- Energy-reaction-diffusion systems (1)
- Epiconvergence (1)
- Epiderivative (1)
- Euclidean (weighted) Voronoi diagram (1)
- Evacuation (1)
- Evolutionary Γ-convergence, gradient systems, homogeniza- tion, Cahn–Hilliard equation, evolutionary variational inequality, energy- dissipation principle, two-scale convergence. (1)
- Extreme Points (1)
- FCS (1)
- FRET (1)
- Feshbach decomposition (1)
- Finance (1)
- Financial derivatives (1)
- Finite Element Method (1)
- First order optimality conditions (1)
- FitzHugh-Nagumo (1)
- Flow over Time (1)
- Flux balance analysis (1)
- Forward Backward Stochastic Differential Equations driven by continuous martingales (1)
- Forward backward SDE (1)
- Frame-Field (1)
- Fredholm alternative (1)
- Fredholm solvability (1)
- Freidlin-Wentzell (1)
- Functional Magnetic Resonance Imaging (1)
- Gamma-convergence (1)
- Gartner-Ellis theorem (1)
- Gene regulatory network (1)
- Generalization (1)
- Generalized Flows (1)
- Generalized gradient structure (1)
- Generalized mean curvature equation (1)
- Generalized nonlinear Schrödinger equations (1)
- Geodesic convexity, gradient structures, gradient flow, Onsager operator, reaction-diffusion system, Wasserstein metric, relative entropy (1)
- Geometry Synthesis (1)
- Ginzburg-Landau equations (1)
- Girsanov's theorem (1)
- Global optimization (1)
- Gradient flow (1)
- Gramians (1)
- Graphen (1)
- Gravity and surface tension driven liquid flows (1)
- H-even matrix (1)
- H-odd matrix (1)
- H-selfadjoint matrices (1)
- H-symmetric matrices (1)
- Hamiltonian eigenvalue problem (1)
- Hamiltonian pseudospectra (1)
- Hamiltonian real Schur form (1)
- Hamiltonian structures (1)
- Hamiltonian system (1)
- Heat treatment (1)
- Helmholtz decomposition (1)
- Hermitian matrix polynomial (1)
- Hermitian pencils (1)
- Hessenberg matrix (1)
- Heston (1)
- Hexagonal Mesh (1)
- Hexagonal Tiling (1)
- Hidden Markov Model (1)
- Hierarchical matrices (1)
- High Order Basis Functions (1)
- Higher integrabilty of gradients of minimizers (1)
- Hybrid Symbolic-Numeric Computation (1)
- Hydro-Reservoir-Management (1)
- Hypergraph Modeling (1)
- IP (1)
- IP-over-WDM (1)
- Image Enhancement (1)
- Implicit Function Theorem (1)
- Implicitely restarted Krylov method (1)
- Implied volatility in the large maturity limit. (1)
- Incompressible Navier-Stokes Equations (1)
- Indium-Arsenide-Antimonide (1)
- Inelastic damage (1)
- Inference branching (1)
- Infinite dimensional linear programming (1)
- Instances (1)
- Integer programming (1)
- Inverse medium scattering (1)
- Jacobi algorithm (1)
- Joint-Chance-Constraints (1)
- Jordan form (1)
- Jordan structure (1)
- KKT-System (1)
- Klein-Gordon equation (1)
- Kronecker chain (1)
- Kronecker product (1)
- Krylov subspace method (1)
- LBB-Stability (1)
- LIBOR market model (1)
- LU decomposition (1)
- L^{\infty}-functional (1)
- Lagrange method, shape derivative, non-linear PDE, material derivative (1)
- Lagrangian invariant subspace (1)
- Lagrangian subspace (1)
- Landau-Levich drag-out problem (1)
- Lang-Kobayashi model (1)
- Lang-Kobayashi system (1)
- Laplace method on Wiener space (1)
- Laplace operator (1)
- Large Deformation (1)
- Large deformation (1)
- Large deviation principle (1)
- Laser surface hardening (1)
- Laser treatment (1)
- Levy models (1)
- Levy processes (1)
- Liapunov-Schmidt procedure (1)
- Libor market model (1)
- Lie groups (1)
- Line Planning (1)
- Lipschitz continuity (1)
- Lipschitz stability (1)
- Lipschitz-homeomorphism (1)
- Lithography (1)
- Lojasiewicz-Simon inequality (1)
- Lubrication theory (1)
- Lur'e equation (1)
- Lur'e equations (1)
- Lure equation (1)
- Lyapunov exponents (1)
- Lyapunov stability (1)
- M-stationarity (1)
- MHD equations (1)
- MIINLP (1)
- MIPLIB (1)
- MSM (1)
- Mallivin's calculus (1)
- Mandible (1)
- Markov (state) models (1)
- Markov Random Field (1)
- Markov State Models (1)
- Markov decision problem (1)
- Markov processes (1)
- Markov property (1)
- Matrix triples (1)
- MaxFlow-MinCut (1)
- MaxFlow-MinCut Theorem (1)
- Maximum flow problem (1)
- Maxwell equation (1)
- Maxwell's equations (1)
- Meshfree (1)
- Metabolic network (1)
- Minimal equivalent subgraph (1)
- Mixed Integer Nonlinear Programming (1)
- Mixed integer programming (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Programming (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-integer nonlinear programming (1)
- Modal analysis (1)
- Model ambiguity (1)
- Molecular kinetics (1)
- Monte-Carlo methods (1)
- Monte-Carlo simulation (1)
- Mordukhovich coderivative (1)
- Moreau- (1)
- Moreau-Yosida approximation (1)
- Moreau-Yosida regularization (1)
- Moulin mechanisms (1)
- Multi-Level Monte-Carlo, Stochastic Partial Differential Equations, Stochastic Finite Element Methods, Multi--Level Methods, Variational Inequalities (1)
- Multi-layer Networks (1)
- Multi-layer network design (1)
- Multi-layer networks (1)
- Multicommodity Flow (1)
- Multicriteria Combinatorial Optimization (1)
- Multiple Multipole Program (1)
- Multiscale Simulation (1)
- Multiscale Testing (1)
- Multistage stochastic programming (1)
- Möbius transformation (1)
- Nash Equilibria (1)
- Navier-Stokes Equations (1)
- Network Flows over Time (1)
- Network expansion (1)
- NeuroImaging (1)
- Newton method (1)
- Newton methods in function space (1)
- Ninomiya–Victoir method (1)
- Non-Nested Multi-Grid (1)
- Noncompact integral operator (1)
- Nonconvex Optimization (1)
- Nonlinear Global Optimization (1)
- Nonlinear and nonlocal evolution (1)
- Nonlinear eigenvalue problem (1)
- Nonlinear eigenvalue problems (1)
- Nonnegative idempotent matrices (1)
- Nonnegative projectors (1)
- Numerics (1)
- ODEs (1)
- Obstacle problem with cohesion (1)
- Onsager operator (1)
- Onsager system (1)
- Optimal Control (1)
- Optimality conditions (1)
- Optimization in Energy (1)
- Optimization methods (1)
- Optoelectronic devices (1)
- Organic semiconductor devices (1)
- Ostwald ripening including mechanics (1)
- PDE Optimization, Conditional Value-At-Risk, Uncertainty Quantification (1)
- PDE constrained optimization (1)
- POAS (1)
- POD (1)
- Packing integer programming (1)
- Pade approximation (1)
- ParaSCIP (1)
- Parabolic optimal control (1)
- Pareto Optimality (1)
- Partition Inequalities (1)
- Paths (1)
- Pattern Synthesis on Surfaces (1)
- Periodic surface homogenization (1)
- Perron-Frobenius theorem (1)
- Phase transition (1)
- Phase transition, nucleation and growth, inverse problem (1)
- Phase transitions (1)
- Phase-field system (1)
- Phosphate Binding Protein (1)
- Picard approximation (1)
- Picard difference operator (1)
- Piecewise affine model (1)
- Pointwise Gradient Constraints (1)
- Pointwise gradient state constraints (1)
- Poisson random measure (1)
- Polyhedral domain (1)
- Polyhedral risk measures (1)
- Polynomial eigenvalue problem (1)
- Popov function (1)
- Positive descriptor systems (1)
- Positive systems (1)
- Potential-driven networks (1)
- Power industry (1)
- Prandtl--Reuss elastic/perfectly plastic model (1)
- Prandtl-Ishlinskii model (1)
- Prandtl-Ishlinskii operator (1)
- Preconditioner (1)
- Price of Anarchy (1)
- Problem Instances (1)
- Pseudocost-Branching (1)
- Public Transit (1)
- Quasilinear elliptic equations (1)
- R (1)
- REDUCE (1)
- Radiosity equation (1)
- Railway Track Allocation (1)
- Rate-independent plasticity (1)
- Rate-independent processes (1)
- Raviart-Thomas (1)
- Reaction-diffusion systems (1)
- Real Quantifier Elimination (1)
- Rebinding (1)
- Recrossing (1)
- Reduced dynamics (1)
- Regular Patterns (1)
- Regularity theory (1)
- Regularization (1)
- Reliability-Branching (1)
- Remeshing (1)
- Riccati equations (1)
- Richards equation (1)
- Riemannian center of mass (1)
- Riemannian manifolds (1)
- Riemannian trust region method (1)
- Riemannian trust-region methods (1)
- Risk Measures (1)
- Risk Preferences (1)
- Risk analysis (1)
- Risk functional (1)
- Ritz vector recycling (1)
- Robin-to-Robin map (1)
- Robust Representation (1)
- Robust representation (1)
- Robustness (1)
- Rolling Stock Planning (1)
- Rotational Symmetry (1)
- Rothe method (1)
- Rounding (1)
- SCIP (1)
- SDFEM discretization (1)
- SMPEC (1)
- SNDlib (1)
- SQP (1)
- SUPG discretization (1)
- SVI parameterisation (1)
- Sasa-Satsuma equation (1)
- Scenario tree (1)
- Scenario tree generation (1)
- Schroedinger equation (1)
- Schur form (1)
- Schur-Newton multigrid (1)
- Scott-Vogelius element (1)
- Seat inventory control (1)
- Second-order subdifferential (1)
- Segmentation (1)
- Shannon information (1)
- Shape optimization (1)
- Shape-memory materials (1)
- Shearlets (1)
- Shortest Path Routing (1)
- Shortest Paths (1)
- Signorini conditions (1)
- Signorini contact (1)
- Singular asymptotic expansions (1)
- Singularity of mean-curvature type (1)
- Skorokhod embedding (1)
- Sobolev spaces with variable exponent (1)
- Sobolev spaces with variable exponent, existence of weak solution, entropy solution, thermistor system, p(x)-Laplacian, heat transfer (1)
- Sobolev spaces with variable exponent, existence of weak solution, thermistor system, $p(x)-Laplacian, heat transfer (1)
- Sobolev–Morrey spaces (1)
- Spark (1)
- Spatio-temporal patterns (1)
- Special Euclidean motion group (1)
- Spectra of Graphs, Laplacians, Perturbations of Eigenvalues (1)
- Spectroscopy (1)
- Stabilized Finite Elements (1)
- State-constrained optimization (1)
- Steel (1)
- Stefan-Gibbs-Thompson problem (1)
- Steiner Tree (1)
- Steiner Tree Generalization (1)
- Stein’s method (1)
- Stochastic generalized equation (1)
- Stochastic optimization (1)
- Stochastic optimization, probabilistic constraints, mixed-integer nonlinear programming, power management (1)
- Stochastic volatility with jumps (1)
- Stochastic-Inflows (1)
- Stokes shift (1)
- Storage space allocation (1)
- Strong Stationarity (1)
- Strong duality (1)
- Structural Adaptive Smoothing (1)
- Structural adaptive smoothing (1)
- Stuart-Landau (1)
- Surface Parameterization (1)
- Surface Plasmon Resonance (1)
- Sylvester equation (1)
- Synchronization (1)
- T-jump (1)
- TR1 Update (1)
- TT tensors (1)
- Takagi factorization (1)
- Taylor expansion (1)
- Temperature jump (1)
- Tensor approximation (1)
- Texture Synthesis (1)
- Thermistor model, p(x)-Laplacian, nonlinear coupled system, existence and boundedness, regularity theory, Caccioppoli estimates, organic light emitting diode, self-heating, Arrhenius like conductivity law (1)
- Thompson canonical form (1)
- Tight frames (1)
- Time consistency (1)
- Time-dependent electromagnetism (1)
- Train Classification (1)
- Trajectory planning, optimal control problem, collision avoidance, (1)
- Transient setting (1)
- Transition Path Theory (1)
- Transition path theory (1)
- Transition pathways (1)
- Transitive closure (1)
- Transitive reduction (1)
- Transmission Condition (1)
- Transmission Conditions (1)
- Traveling wave model (1)
- Tresca friction (1)
- Triangular Remeshing (1)
- Tucker decomposition (1)
- URV decomposition (1)
- VARMA(1,1) model (1)
- VSIDS (1)
- Variable selection (1)
- Variational Inequality (1)
- Variational inequalities (1)
- Variational inequalities of the second kind (1)
- Volterra integral equations (1)
- Volume Parameterization (1)
- WKB expansions (1)
- Wasserstein gradient flow (1)
- Wegeprobleme (1)
- Weighted histogram analysis method (WHAM) (1)
- Weyl function (1)
- Yard crane scheduling (1)
- Zählen (1)
- a posteriori error estimates (1)
- a posteriori error estimation (1)
- a posteriori error estimators (1)
- a priori error analysis (1)
- a priori error estimate (1)
- absorption measurements (1)
- abstract differential-algebraic equations (1)
- abstract interface (1)
- acceptability functional (1)
- acoustic field computation (1)
- active interfaces (1)
- active set strategy (1)
- active-set algorithm (1)
- acyclic mechanisms (1)
- adaptive (1)
- adaptive finite elements (1)
- adaptive mesh refinement (1)
- adaptive methods (1)
- adaptive mixed finite element method (1)
- adjoint based updating (1)
- adjoint gradient computation (1)
- admissibility (1)
- advection--diffusion equation (1)
- affine adjustable robust counterparts (1)
- affine covariant (1)
- affine invariant Gauss-Newton algorithm (1)
- affine routing (1)
- air pollution (1)
- algebraic Riccati equation (1)
- alternate oscillations (1)
- analysis (1)
- anisotropic ellipticity in three dimensions (1)
- anomalous diffusion (1)
- anti-triangular form (1)
- approximate incremental problems (1)
- approximation algorithms (1)
- approximation class (1)
- approximation scheme (1)
- arc-length reparameterization (1)
- arclenght reparameterization (1)
- artificial boundary condition (1)
- assignment (1)
- association pathways (1)
- asymptotic safety (1)
- asymptotic precision (1)
- asymptotic stability (1)
- augmentation (1)
- automotive industry (1)
- available storage (1)
- average value-at-risk (1)
- a~priori error analysis (1)
- backface culling (1)
- balanced AFEM algorithm (1)
- balanced realizations (1)
- band structure calculation (1)
- basis pursuit (1)
- beam equation (1)
- behavioral approach (1)
- bidding (1)
- bilevel programming (1)
- binary programming (1)
- bio heat transfer (1)
- bio-heat equation (1)
- biological network (1)
- biomechanics (1)
- bioparkin (1)
- bipolar orientations (1)
- bistability (1)
- block Newton method (1)
- block Rayleigh quotient iteration (1)
- block-Arnoldi method (1)
- bounded-realness (1)
- box constraints (1)
- branch and cut (1)
- branch-and-bound (1)
- bulge chasing (1)
- bulge exchange (1)
- c++ (1)
- cancer therapy (1)
- canonical Lévy space (1)
- capacitated network design (1)
- capillary meniscus (1)
- cavity modes (1)
- chance constraints, PDE constrained optimization (1)
- characteristicfunction (1)
- chattering (1)
- chimera states (1)
- chromatic staff notation (1)
- circle patterns (1)
- climate risk (1)
- co-derivative (1)
- coagulation (1)
- coagulation and fragmentation (1)
- coarsening (1)
- coarsening with encounters (1)
- coating flows (1)
- coderivative calculus (1)
- coderivatives and second-order subdifferentials (1)
- collision avoidance (1)
- collision detection, distance computation, (1)
- colouring (1)
- combination technique (1)
- comparison principle (1)
- competitive analysis (1)
- complete damage (1)
- complex Hamiltonian Jordan form (1)
- complex bilinear forms (1)
- complex networks (1)
- complex skew-symmetric matrix (1)
- complex skew-symmetric matrix polynomial (1)
- complex symmetric linear system (1)
- complex symmetric matrix (1)
- complex symmetric matrix polynomial (1)
- complexity reduction (1)
- composite finite elements (1)
- composite material (1)
- composite step methods (1)
- compound matrix (1)
- computational (1)
- computational finance (1)
- conditional risk mapping (1)
- conditional risk measures (1)
- conditional stability (1)
- conditioning (1)
- conditions (1)
- conflict learning (1)
- conflicts (1)
- conformational space (1)
- conforming partition (1)
- congruence (1)
- conical diffraction (1)
- connected hypergraphs (1)
- connectivity coding (1)
- consistency (1)
- consistent initialization (1)
- constrained minimization (1)
- constrained optimal control (1)
- constraint-based analysis (1)
- constraint-based analysis; metabolic networks; elementary flux modes (1)
- constraint-based modeling (1)
- contact--stabilized Newmark method (1)
- contact-stabilized Newmark method (1)
- continuity of Nemyckii Operators (1)
- continuous QR algorithm (1)
- continuous dependence (1)
- continuous-time Markov process (1)
- continuous-time systems (1)
- contraction inequality (1)
- contractivity (1)
- control constraints (1)
- control theory (1)
- control using COMSOL MULTIPHYSICS (1)
- control variational methods (1)
- controllability (1)
- controlled voltage excitation (1)
- convection-diffusion problem (1)
- convection-diffusion-reaction operator (1)
- convective Cahn-Hilliard (1)
- convergence analysis (1)
- convergence bounds (1)
- convergence for space-time discretization (1)
- convergence of solutions (1)
- convergence of the central path (1)
- convergence order (1)
- convergence rate for energy release rates (1)
- convergence rates (1)
- convergence theory) (1)
- convergence to steady state (1)
- convexity (1)
- convolution (1)
- convolution quadrature (1)
- cooperative robots (1)
- cost sharing (1)
- coupled partial differential equation (1)
- coupled system (1)
- coupled systems (1)
- coupling (1)
- cplex (1)
- cracks with selfcontact (1)
- cross commodity hedging (1)
- cubature method (1)
- cubic regularization (1)
- cut-based inequalities (1)
- cuts (1)
- cutset inequalities; robust network design (1)
- cutset-polyhedra (1)
- cutting planes (1)
- cycle basis (1)
- cyclo-dissipativity (1)
- damping (1)
- data-to-solution map (1)
- debonding (1)
- decomposition (1)
- defibrillation (1)
- deflating subspace (1)
- deflating subspaces (1)
- degenerate parabolic equation (1)
- delay-differential equations (1)
- delayed coupled oscillators (1)
- delta hedge (1)
- delta perturbation (1)
- demand polytope (1)
- densest k-subgraph (1)
- density matrix (1)
- descrete choice (1)
- destination call system (1)
- deterministic queueing model (1)
- dictionary (1)
- difference quotient (1)
- differentiability (1)
- differential equations (1)
- differential inclusion (1)
- differentiation index (1)
- diffusion-controlled boundary conditions (1)
- dilation (1)
- direct linear solver (1)
- direct modulation (1)
- directed hypergraphs (1)
- directional differentiability (1)
- directors (1)
- discontinuous Galerkin (1)
- discrete Gagliardo-Nirenberg inequalities (1)
- discrete Moser iteration (1)
- discrete QR algorithm (1)
- discrete analytic functions (1)
- discrete choice model (1)
- discrete curvatures (1)
- discrete dynamical system (1)
- discrete network (1)
- discrete obstacle problem (1)
- discrete optimization (1)
- discrete transparent boundary condition (1)
- discrete transparent boundary conditions (1)
- discrete-time systems (1)
- discretization (1)
- disk function method (1)
- dispersive metallic photonic crystals (1)
- dissipation functional (1)
- dissipative Schroedinger operator (1)
- dissipative hyperbolic system (1)
- dissipative scatteringtheory (1)
- distance to bounded-realness (1)
- distance to instability (1)
- distance to singularity (1)
- distortion (1)
- distortion, phase transition, shape optimisation, speed method, transmission problem (1)
- distortion, phase transition, shape optimization, speed method, transmission problem (1)
- distributed optimal control (1)
- distributied optimal control (1)
- divergence-free velocity reconstruction (1)
- doping optimization (1)
- double obstacle potential (1)
- double-obstacle potential (1)
- doubly non-linear differential inclusion (1)
- doubly nonlinear differential inclusion (1)
- drift diffusion (1)
- drift diffusion equation (1)
- drift-diffusion equation (1)
- driver of quadratic growth (1)
- dual entropy-production potential (1)
- dual representation (1)
- dual-weighted (1)
- duality (1)
- dune (1)
- dynamic bifurcation (1)
- dynamic chance constraints (1)
- dynamic convex risk measures (1)
- dynamic hedging (1)
- dynamic penalty functions (1)
- dynamical boundary condition (1)
- dynamical contact problems (1)
- dynamical fingerprints (1)
- eigenfunction (1)
- eigenfunction expansion (1)
- eigenfunctions (1)
- eigenvalue backward error (1)
- eigenvalue cluster (1)
- eigenvalue perturbation (1)
- eigenvalue problem, eigenvalue cluster, adaptive finite element method, optimality (1)
- elasticity (1)
- elasto-plasticity (1)
- electric circuit (1)
- electrical impedance tomography (1)
- electro-magnetic scattering (1)
- electro-reaction-diffusion systems (1)
- electrothermal feedback (1)
- elementary divisor (1)
- elementary divisors (1)
- elementary flux modes (1)
- elevator control (1)
- elevator group control (1)
- elliptic MPEC (1)
- elliptic eigenvalue problem (1)
- elliptic obstacle problems (1)
- elliptic operators (1)
- elliptic problem (1)
- elliptic variational inequality, elliptic MPEC, implicit programming, optimal control of variational inequalities, nonsmooth optimization (1)
- empirical approximation (1)
- energetic (1)
- energetic formulation (1)
- energetic reasoning (1)
- energetic solutions (1)
- energy efficiency (1)
- energy-dissipation principle (1)
- energy-momentum method (1)
- enlargement of filtration (1)
- entropy (1)
- entropy entropy-production balance (1)
- entropy functional (1)
- entropy solution (1)
- entropy/entropy-dissipation formulation (1)
- epsilon-approximate solutions (1)
- equally tempered scale (1)
- equations (1)
- equations of motion (1)
- equilibrium (1)
- equivalence (1)
- error analysis (1)
- error bound (1)
- error estimate (1)
- error of finite state projections (1)
- error reduction (1)
- even matrix pencil (1)
- even matrix pencils (1)
- even matrix polynomial (1)
- even matrix polynomials (1)
- even/odd matrix polynomial (1)
- evolutionary Γ-convergence (1)
- exact residual (1)
- existence and boundedness (1)
- existence and uniqueness of solutions (1)
- existence of equilibrium (1)
- existence of solutions and moments (1)
- existence of weak solution (1)
- explicit formula (1)
- explicit solution formula (1)
- exponential asymptotics (1)
- exponential moment problem (1)
- extended Newtonian interpolation (1)
- extended bridge sampling (EBS) (1)
- extrapolation (1)
- extrapolation methods (1)
- eye diagram (1)
- fares (1)
- feasibility pump (1)
- feedbacklaser (1)
- ferrite-austenite phase transition (1)
- fiber contraction principle (1)
- filter-trust-region method (1)
- filtration distance (1)
- financial derivatives (1)
- finite difference schemes (1)
- finite dynamical systems (1)
- finite element approximation (1)
- finite element method (FEM) (1)
- finite state projections (1)
- finite-volume approximation (1)
- finite-volume method (1)
- finite-volume scheme (1)
- first order eigenvalue perturbation theory (1)
- first-order hyperbolic systems, boundary value problems; exponential dichotomies; stability (1)
- first-order hyperbolic systems, initial-boundary problems; time-periodic solutions, regularity of solutions; Fredholm solvability (1)
- flow-cutset inequalities (1)
- flows (1)
- flux balance analysis (1)
- formulation (1)
- fractional order viscoelasticity (1)
- free boundary problem (1)
- free boundary surfaces (1)
- free energy functional (1)
- frequency locking (1)
- frequency response problem (1)
- frequency-domain (1)
- frictionless dynamic contact (1)
- front fixing (1)
- fully discrete problem (1)
- function space (1)
- functional backward error (1)
- functional condition number (1)
- game theory (1)
- gene regulatory networks (1)
- generalised projected Lyapunov equations (1)
- generalized Naghdi (1)
- generalized Newton method (1)
- generalized complementarity (1)
- generalized curvatures (1)
- generalized density expansions in small noise and small time (1)
- generalized differentiation (1)
- generalized eigenfunctions (1)
- generalized eigenvalue problem (1)
- generalized eigenvalue$ (1)
- generic low-rank perturbations (1)
- geometric modeling (1)
- geometric optimization (1)
- global analytic expansions (1)
- global attractor (1)
- global bounds (1)
- global regularity (1)
- global spatial regularity (1)
- goal oriented error estimation (1)
- grad div stabilization (1)
- grad-div stabilization (1)
- gradient constrained optimization (1)
- gradient structures (1)
- gradient system (1)
- gradient-flow evolution (1)
- graph algorithms (1)
- graph coloring (1)
- graph ismorphism (1)
- graph search algorithm, initialization, robotics (1)
- graph subspace (1)
- graphical user interface (1)
- greedy (1)
- gyncycle (1)
- gyroscopic system (1)
- harmonic mode-locking (1)
- heat flow (1)
- heat transfer (1)
- hedging (1)
- hedging of contingent claim (1)
- hemi-variational inequality (1)
- heteroclinic orbits (1)
- heterogeneous information (1)
- hierarchical basis (1)
- high-dimensional data (1)
- high-dimensional differential equations (1)
- homogeneous polynomial (1)
- homogenisation (1)
- homogenization (1)
- homotopy (1)
- hp finite elements (1)
- hp-adaptive mesh refinement (1)
- hybrid system (1)
- hydrodynamic limit (1)
- hyperassignment (1)
- hyperassignments (1)
- hyperbolic balance law (1)
- hypercubes (1)
- hyperelastic material (1)
- hypergraphs (1)
- idempotent matrices (1)
- implant design (1)
- implicit QR algorithm (1)
- implicit function theorem (1)
- incompressible Navier-Stokes equations (1)
- incompressible flows (1)
- incremental algorithm, facility location problem, network design (1)
- indifference price (1)
- induction heating (1)
- induction law (1)
- infinite dimensional linear (1)
- information difference (1)
- ingular value decomposition (1)
- insider model (1)
- insurance derivative (1)
- integrodifferential equations (1)
- integrodifferential heat equation (1)
- interface kinetics (1)
- interior point methods (1)
- interior point methods in function space (1)
- interpolation error (1)
- intersection graphs (1)
- invariant factor (1)
- invariant polynomial (1)
- invariant polynomials (1)
- invariant sets (1)
- invariant subspace (1)
- iteration scheme (1)
- iterative linear solver (1)
- iterative solution (1)
- kinematic (1)
- kinematic equivalence (1)
- kinetic boundary conditions (1)
- kinetics of phase transitions (1)
- knee model (1)
- knockout simulation (1)
- kp simulations (1)
- lagrangian decomposition (1)
- large deformation contact (1)
- large deformations (1)
- large deviations (1)
- large scale optimization (1)
- large signal response (1)
- large strike and small time asymptotics for implied volatility (1)
- large-deviation principle (1)
- laser with delayed optical feedback (1)
- lattice theory (1)
- leading direction (1)
- least squares (1)
- least-squares method (1)
- length of geodesic polynomial interpolation (1)
- level set method (1)
- level-of-detail (1)
- lexicographic representatives (1)
- light emitting devices (1)
- limit theorem (1)
- limit theorems (1)
- linear elasticity (1)
- linear hardening (1)
- linear matrix inequalities (LMI) (1)
- linear matrix inequality (1)
- linear parabolic equation (1)
- linear re- gression (1)
- linear stability (1)
- linear system (1)
- linear systems (1)
- linear systems of partial differential equations (1)
- linear thermoelasticity (1)
- linear time-varying discrete-time descriptor systems (1)
- linear-quadratic control (1)
- linear-quadratic optimal control (1)
- linearization (1)
- liquid crystals (1)
- local classical solutions (1)
- local convergence (1)
- local limit theorems (1)
- local volatiilty (1)
- local volatility (1)
- log-Sobolev inequality (1)
- logarithmic utility (1)
- logical analysis (1)
- logical modeling (1)
- long-term simulation (1)
- long-time behavior (1)
- long-time behaviour (1)
- lossless (1)
- lossy compression (1)
- low frequency approximation (1)
- low rank perturbation (1)
- lower bound theorem (1)
- lubrication theory (1)
- macroscopic railway modeling (1)
- magnetostriction (1)
- major thirds (1)
- makespan (1)
- manifold (1)
- martensitic transformation (1)
- martingale measure (1)
- martingale representation (1)
- mass transportation (1)
- massive parallization (1)
- matching (1)
- mathematical programming with equilibrium constraints (MPEC) (1)
- matrix factorization (1)
- matrix product states (1)
- max-plus-decomposition (1)
- maximal parabolic Lp-regularity (1)
- maximum feasible subsystem problem (1)
- maximum principle (1)
- mean field approximation (1)
- measure preserving maps (1)
- mesh compression (1)
- meshing (1)
- meta grid (1)
- metabolic networks (1)
- metabolic networks, (1)
- metastable conformation (1)
- metastable states (1)
- metric approximation (1)
- metric regularity (1)
- micro-fe (1)
- micro-structure (1)
- minimal dilation (1)
- minimal positive solution (1)
- minimal variance hedging (1)
- misfit (1)
- mixed Dirichlet-Neumann boundary conditions (1)
- mixed boundary condition (1)
- mixed boundary problems (1)
- mixed control-state constraint (1)
- mixed derivatives (1)
- mixed integer nonlinear programming (1)
- mixed integer programmin (1)
- mixed-integer programming (1)
- mixed-integer quadratically constrained programming (1)
- mixed-integer-programming (1)
- mode-locking (1)
- model (1)
- models (1)
- modified nodal analysis (1)
- modulated waves (1)
- modulation bandwidth (1)
- modulation equations (1)
- modules (1)
- molecular conformation (1)
- molecular dynamics simulations (1)
- moment matching (1)
- monodomain model (1)
- monotone difference scheme (1)
- monotone multigrid (1)
- monotone multigrid method (1)
- morphing (1)
- mortar discretisation (1)
- mortar method (1)
- motion of charged particles (1)
- motion planning, robotics (1)
- multi-hour (1)
- multi-layer (1)
- multi-level approximate block factorizations (1)
- multi-period (1)
- multi-scale problems (1)
- multibody system (1)
- multigrid methods (1)
- multigrid sqp methods (1)
- multilevel approximate block factorizations (1)
- multiple histogram reweighting (1)
- multiresolution (1)
- multiscale (1)
- multiscale Hamiltonian systems (1)
- multiscale method (1)
- multistability (1)
- multistage stochastic program (1)
- multistate Bennett acceptance ratio (MBAR) (1)
- multivariate American derivatives (1)
- necessary conditions (1)
- negatively correlated exposure (1)
- nested iteration (1)
- network aggregation (1)
- network design problems (1)
- network detection (1)
- non-equivalence deflation (1)
- non-linear Newton boundary condition (1)
- non-reflecting boundary condition (1)
- non-self-adjoint operator (1)
- non-selfadjoint Schroedinger-type operator (1)
- non-symmetric (1)
- non-symmetric Riccati equation (1)
- nonconforming FEM (1)
- nonconvex Lyapunov function (1)
- noncooperative games (1)
- nonlinear PDE systems (1)
- nonlinear Schrödinger equation (1)
- nonlinear Schrödinger equations (1)
- nonlinear conductivity (1)
- nonlinear configuration space (1)
- nonlinear coupled system (1)
- nonlinear differential equations (1)
- nonlinear equation (1)
- nonlinear equations (1)
- nonlinear laws (1)
- nonlinear partial differential equations (1)
- nonlinear system of partial differential equations (1)
- nonlocal model (1)
- nonlocal radiation boundary conditions (1)
- nonsmooth Newton (1)
- nonsmooth optimization (1)
- normal cone mapping (1)
- numerical integration (1)
- numerical inverse Laplace transform (1)
- numerical library (1)
- numerical scheme (1)
- numerical upscaling (1)
- observability (1)
- odd matrix polynomial (1)
- odd matrix polynomials (1)
- one-shot strategy (1)
- one-way Helmholtz equation (1)
- online (1)
- online scheduling (1)
- open quantum system (1)
- open quantum systems (1)
- operations research (1)
- optical modes (1)
- optical potential (1)
- optimal Sobolev regularity (1)
- optimal boundary control (1)
- optimal boundary control problem (1)
- optimal convergence (1)
- optimal investment strategy (1)
- optimality condition (1)
- optimization (1)
- optimization with PDEs (1)
- optimize-then-discretize (1)
- optoelectronic modeling (1)
- optoelectronic semiconductor model (1)
- order book dynamics (1)
- order reduction (1)
- ordinary di fferential equations (1)
- ordinary differential equation (1)
- ordinary differential equations (1)
- organic light-emitting diode (1)
- orthogonal matching pursuit (1)
- orthogonal matrix (1)
- oscillatory diffusion (1)
- oscillatory energy (1)
- p$ regularity (1)
- p-FEM (1)
- p-Laplace (1)
- palindromic (1)
- palindromic QR-algorithm (1)
- palindromic matrix pencil (1)
- palindromic matrix polynomials (1)
- palindromic pencil (1)
- palindromic/even eigenvalue problem (1)
- para-Hermitian matrices (1)
- para-Hermitian polynomial (1)
- parabolic operators (1)
- parabolic systems (1)
- parabolic systems of second order (1)
- parallel tempering (1)
- parameter choice (1)
- parameter estimation (1)
- parameter identification (1)
- parametric variational inequalities (1)
- parametrizations (1)
- partial (1)
- partial calmness (1)
- partial differential equations (1)
- particles (1)
- passenger routing (1)
- passive (1)
- passive feedback (1)
- passive systems (1)
- path dependent derivative (1)
- path regularity (1)
- penalty method (1)
- pencil arithmetic (1)
- penta-alanine (1)
- peptides (1)
- percolation (1)
- perfect graphs (1)
- perfectly matched layer method (1)
- perforated domain (1)
- periodic timetable (1)
- phase field (1)
- phase shift (1)
- photoluminescence meassurements (1)
- photonic crystals (1)
- piecewise linear 3D flattening (1)
- piecewise linear maps (1)
- plane wave (1)
- plastic plate model (1)
- play operator (1)
- pointwise state constraints (1)
- policy improvement (1)
- polyconvex elasticity (1)
- polyconvexity (1)
- polyhedral Gauss-Seidel (1)
- polyhedral combinatorics (1)
- polyhedral domains (1)
- polyhedral norms (1)
- polyhedral risk measure (1)
- polyhedral sets (1)
- polynomial (1)
- polynomial eigenvalue problem (1)
- polynomial matrix (1)
- poor mass conservation (1)
- positive difference scheme (1)
- positive real (1)
- postive systems (1)
- potential-driven network flows (1)
- potentials (1)
- power consumption (1)
- presurgical planning (1)
- pricing (1)
- primal-dual active set strategy (1)
- primaldual (1)
- prime implicand (1)
- probabilistic schemes (1)
- probability metrics (1)
- progressive mesh coding (1)
- projected Lyapunov equations (1)
- projector chain (1)
- protein folding (1)
- protein-ligand binding (1)
- pseudospectra (1)
- public transit (1)
- public transport optimization (1)
- purely imaginary (1)
- purely imaginary eigenvalue (1)
- purely imaginary eigenvalues (1)
- pyrometer control (1)
- quadratic cost functional (1)
- quadratic variation (1)
- quadrature formula (1)
- quai-Newton (1)
- quantum dots (1)
- quasi-Newton (1)
- quasi-Newton methods (1)
- quasi-static problems (1)
- quasilinear equation (1)
- quasilinear integrodifferential vectorial equation (1)
- quasilinear parabolic systems (1)
- radiative heat transfer (1)
- railway capacity (1)
- railway models (1)
- random demand (1)
- random discrete structures (1)
- random graphs (1)
- random graphs and hypergraphs (1)
- random matrix (1)
- random recourse (1)
- rank $k$ (1)
- rare transitions (1)
- rarefaction fans (1)
- rate independent materials (1)
- rate matrix (1)
- rate-dependent damage (1)
- rate-independent crack propagation (1)
- rate-independent systems (1)
- rational matrix (1)
- reachability (1)
- real distance to instability (1)
- real structured distance to instability (1)
- real time optimation (1)
- reciprocal (1)
- recourse (1)
- reflection argument (1)
- reflexive Banach spaces (1)
- regression (1)
- regularisation (1)
- regularity estimates (1)
- relaxation oscillations (1)
- required supply (1)
- resonance problems (1)
- resonances (1)
- resource-constrained project Schedulin (1)
- resource-constrained project scheduling (1)
- restricted distance to instability (1)
- restricted real distance to instability (1)
- resuspension (1)
- reverse engineering (1)
- reversible mass action type reactions (1)
- reversible reactions (1)
- robust hedging (1)
- robust optimization (1)
- robust stability (1)
- rogue waves (1)
- rolling-stock-planning (1)
- rough potential energy function (1)
- routing (1)
- saddle-point method (1)
- saddlepoint method (1)
- saturation (1)
- scattering theory (1)
- scenario (1)
- scheduling (1)
- scip (1)
- second order system (1)
- second-order systems (1)
- secular equation (1)
- self-adjoint dilation (1)
- self-adjoint eigenvalue problem (1)
- self-assembly of quantum dots (1)
- self-contact (1)
- self-heating (1)
- self-similar solutions (1)
- selfadjoint matrices (1)
- semi-infinite optimization (1)
- semi-insulating GaAs (1)
- semi-smooth Newton method (1)
- semi-smooth Newton methods (1)
- semiconductor design (1)
- semiconductor laser (1)
- semiconductor ring laser (1)
- semilinear elliptic equation (1)
- semilinear parabolic PDEs (1)
- semismooth Newton (1)
- sensitivities (1)
- sensitivity (1)
- set covering (1)
- set-union knapsack (1)
- sets with Lipschitz boundary (1)
- shape analysis (1)
- shape operator (1)
- shape signatures (1)
- shifted Laplacian preconditioner (1)
- shortest paths (1)
- sign symmetric (1)
- simple invariant subspace (1)
- simple recourse (1)
- simulation (1)
- single-molecule spectroscopy (1)
- singular matrix polynomial (1)
- singular pencil (1)
- singular pencils (1)
- singular perturbation balanced truncation (1)
- singular values (1)
- skew QR factorization (1)
- skew QRQ$^T$ factorization (1)
- skew Takagi factorization (1)
- skew-Hermitian matrix polynomial (1)
- skew-symmetric (1)
- skew-symmetric/symmetric pencil (1)
- sliding mode simulation (1)
- slow time scale (1)
- slow-fast systems (1)
- small denominators (1)
- small signal response (1)
- small strain (1)
- small-slope approximation (1)
- smooth $QR$ factorization (1)
- smooth QR factorization (1)
- smooth operators (1)
- smooth singular value decomposition (1)
- software (1)
- solitons (1)
- solvability (1)
- solver (1)
- sparse grids (1)
- sparse optimal control (1)
- sparse representations (1)
- sparse solution (1)
- sparse solution of linear systems (1)
- spectral approximation (1)
- spectral asymptotics (1)
- spectral clustering (1)
- spectral deferred correction (1)
- spectral factorization (1)
- spectral shift (1)
- spin-stabilized discretization (1)
- split graphs (1)
- split-step method (1)
- spurious solutions (1)
- stability analysis (1)
- staircase form (1)
- state constrained optimization (1)
- stationary distribution (1)
- stationary lasing modes (1)
- stationary point (1)
- stationary solutions (1)
- stationary thermistor model (1)
- statistical error (1)
- stellar subdivisions (1)
- stereographic projection (1)
- stochastic (1)
- stochastic control (1)
- stochastic dominance (1)
- stochastic optimization (1)
- stochastic ordering (1)
- stochastic semi-infinite programming (1)
- stopping time (1)
- storage function (1)
- strained multi quantum-wells (1)
- strangeness-free system (1)
- strong spectrum (1)
- structrured distance to instability (1)
- structure preserving method (1)
- structure-preserving doubling algorithm (1)
- structured (1)
- structured Kronecker canonical form (1)
- structured SVD (1)
- structured backward error (1)
- structured condition number (1)
- structured deflation method (1)
- structured doubling algorithm (1)
- structured eigenvalue backward error (1)
- structured mapping problem (1)
- structured matrices (1)
- structured model reduction (1)
- structured perturbation (1)
- structured perturbations (1)
- structured staircase form, structured Kronecker canonical form, symmetric pencil, Hermitian pencil, alternating pencil, palindromic pencil, linear quadratic control, $H_\infty$ control (1)
- stylized facts (1)
- sub-Riemannian geometry with drift (1)
- sub-quadratic growth (1)
- subdivision surfaces (1)
- subgrid (1)
- subspace recycling (1)
- sufficient optimality condition (1)
- sum of weighted completion times (1)
- super-cell method (1)
- surface modes (1)
- survivability (1)
- switched positive systems (1)
- switched system (1)
- switching (1)
- symmetric pencils (1)
- symmetry detection (1)
- symplectic pencil (1)
- systems theory (1)
- telecommunication networks (1)
- temperature reweighting (1)
- temperature-dependent dynamics (1)
- test equation (1)
- texture mapping (1)
- thermionic emission (1)
- thermistor model (1)
- thermistor system (1)
- thermodynamic constraints (1)
- thermomechanics (1)
- thickness of a domain (1)
- thin flow (1)
- time (1)
- time and space discretization (1)
- time integration (1)
- time-consistency (1)
- time-dependent Dirichlet conditions (1)
- time-discretization (1)
- time-optimal control (1)
- timed automata (1)
- timestep control (1)
- total weighted completion time (1)
- trace formula (1)
- traces (1)
- track allocation framework (1)
- tractability index (1)
- transfer operator (1)
- transition probabilities (1)
- transition state theory (1)
- transmission at material interfaces (1)
- transmission problems (1)
- transparent boundary (1)
- transparent boundary conditions (1)
- transport theory (1)
- traveling magnetic fields (1)
- traveling wave equations (1)
- traveling wave model (1)
- triangular Toeplitz systems (1)
- triangularization (1)
- trimmed linearization (1)
- trip timetable (1)
- truncation (1)
- trust region (1)
- two way canonical form (1)
- two-dimensional Schrödinger equation (1)
- two-stage linear-quadratic problems (1)
- two-stage models (1)
- two-stage stochastic program (1)
- unbounded domain (1)
- undercompressive waves (1)
- unidirectional (1)
- unidirectional coupling (1)
- uniform Caccioppoli-like inequality (1)
- unit sphere (1)
- unitary congruence (1)
- updating factorization (1)
- upscaling (1)
- utility based pricing (1)
- utility indifference hedging and pricing (1)
- utility maximization (1)
- value function (1)
- vanishing viscosity (1)
- vanishing viscosity approach (1)
- variable fixing (1)
- variational analysis and optimization (1)
- variational evolution (1)
- variational formulations (1)
- vehicle dispatching (1)
- vehicle rotation planning (1)
- vehicle scheduling (1)
- velocity method (1)
- von Mises model (1)
- water reservoir management (1)
- weak convergence (1)
- weather derivative (1)
- weather risk (1)
- weighted regularity (1)
- well-posedness (1)
- zero curvature (1)
Improved optimization models for potential-driven network flow problems via ASTS orientations
(2019)
The class of potential-driven network flow problems provides important models for a range of infrastructure networks. For real-world applications, they need to be combined with integer models for switching certain network elements, giving rise to hard-to-solve MINLPs. We observe that on large-scale real-world meshed networks the relaxations usu-
ally employed are rather weak due to cycles in the network. To address this situation, we introduce the concept of ASTS orientations, a generalization of bipolar orientations, as a combinatorial relaxation of feasible solutions of potential-driven flow problems, study their structure, and
show how they can be used to strengthen existing relaxations and thus provide improved optimization models. Our computational results indicate that ASTS orientations can be used to derive much stronger bounds on the flow variables than existing bound tightening methods. We also
show that our proposed model extensions yield significant performance improvements for an existing state-of-the-art MILP model for large-scale gas networks.
In commodity transport networks such as natural gas, hydrogen and water networks, flows arise from nonlinear potential differences between the nodes, which can be represented by so-called “potential-driven” network models. When operators of these networks face increasing demand or the need to handle more diverse transport situations, they regularly seek to expand the capacity of their network by building new pipelines parallel to existing ones (“looping”). The paper introduces a new mixed-integer non-linear programming (MINLP) model and a new non-linear programming (NLP) model and compares these with existing models for the looping problem and related problems in the literature, both theoretically and experimentally. On this basis, we give recommendations about the circumstances under which a certain model should be used. In particular, it turns out that one of our novel models outperforms the existing models.
Moreover, the paper is the first to include the practically relevant option that a particular pipeline may be looped several times.
We discuss drift-diffusion models for charge-carrier transport in organic semiconductor de- vices. The crucial feature in organic materials is the energetic disorder due to random alignment of molecules and the hopping transport of carriers between adjacent energetic sites. The for- mer leads to so-called Gauss-Fermi statistics, which describe the occupation of energy levels by electrons and holes. The latter gives rise to complicated mobility models with a strongly nonlin- ear dependence on temperature, density of carriers, and electric field strength. We present the state-of-the-art modeling of the transport processes and provide a first existence result for the stationary drift-diffusion model taking all of the peculiarities of organic materials into account. The existence proof is based on Schauder’s fixed-point theorem. Finally, we discuss the numerical discretization of the model using finite-volume methods and a generalized Scharfetter-Gummel scheme for the Gauss-Fermi statistics.
This paper deals with the analysis of an instationary drift-diffusion model for organic semicon- ductor devices including Gauss–Fermi statistics and application-specific mobility functions. The charge transport in organic materials is realized by hopping of carriers between adjacent ener- getic sites and is described by complicated mobility laws with a strong nonlinear dependence on temperature, carrier densities and the electric field strength.
To prove the existence of global weak solutions, we consider a problem with (for small den- sities) regularized state equations on any arbitrarily chosen finite time interval. We ensure its solvability by time discretization and passage to the time-continuous limit. Positive lower a priori estimates for the densities of its solutions that are independent of the regularization level en- sure the existence of solutions to the original problem. Furthermore, we derive for these solutions global positive lower and upper bounds strictly below the density of transport states for the densi- ties. The estimates rely on Moser iteration techniques.
This article deals with the spectra of Laplacians of weighted graphs. In this context, two objects are of fundamental importance for the dynamics of complex networks: the second eigenvalue of such a spectrum (called algebraic connectivity) and its associated eigenvector, the so-called Fiedler vector. Here we prove that, given a Laplacian matrix, it is possible to perturb the weights of the existing edges in the underlying graph in order to obtain simple eigenvalues and a Fiedler vector composed of only non-zero entries. These structural genericity properties with the constraint of not adding edges in the underlying
graph are stronger than the classical ones, for which arbitrary structural perturbations are allowed. These results open the opportunity to understand the impact of structural changes on the dynamics of complex systems.
An optimal control problem is studied for a quasilinear Maxwell equation of nondegenerate parabolic
type. Well-posedness of the quasilinear state equation, existence of an optimal control, and weak G\^ateaux-differentiability of the control-to-state mapping are proved. Based on these results, first-order necessary optimality conditions and
an associated adjoint calculus are derived.
A mathematical model is set up that can be useful for controlled voltage excitation in time-dependent electromagnetism.
The well-posedness of the model is proved and an associated optimal control problem is investigated. Here, the control
function is a transient voltage and the aim of the control is the best approximation of desired electric and magnetic fields in
suitable $L^2$-norms.
Special emphasis is laid on an adjoint calculus for first-order necessary optimality conditions.
Moreover, a {peculiar attention is devoted to propose a formulation for which the computational complexity of the finite element solution method is substantially reduced}.
We report the cancellation of the soliton self-frequency shift in nonlinear optical fibers. A soliton which interacts with a group velocity matched low intensity dispersive pump pulse, experiences a continuous blue-shift in frequency, which counteracts the soliton self- frequency shift due to Raman scattering. The soliton self-frequency shift can be fully compensated by a suitably prepared dispersive wave. We quantify this kind of soliton-dispersive wave interaction by an adiabatic approach and demonstrate that the compensation is stable in agreement with numerical simulations.
We consider the phenomenon of an optical soliton controlled (e.g. amplified) by a much weaker second pulse which is efficiently scattered at the soliton. An important problem in this context is to quantify the small range of parameters at which the interaction takes place. This has been achieved by using adiabatic ODEs for the soliton characteristics, which is much faster than an empirical scan of the full propagation equations for all parameters in question.
We consider scattering of small-amplitude dispersive waves at an intense optical soliton which constitutes a nonlinear perturbation of the refractive index. Specifically, we consider a single-mode optical fiber and a group velocity matched pair: an optical soliton and a nearly perfectly reflected dispersive wave, a fiber-optical analogue of the event horizon. By combining (i) an adiabatic approach that is used in soliton perturbation theory and (ii) scattering theory from Quantum Mechanics, we give a quantitative account for the evolution of all soliton parameters. In particular, we quantify the increase in the soliton peak power that may result in spontaneous appearance of an extremely large, so-called champion soliton. The presented adiabatic theory agrees well with the numerical solutions of the pulse propagation equation. Moreover, for the first time we predict the full frequency band of the scattered dispersive waves and explain an emerging caustic structure in the space-time domain.
Physics of short optical pulses is an important and active research area in nonlinear optics. In what follows we theoretically consider the most extreme representatives of short pulses that contain only several oscillations of electromagnetic field. Description of such pulses is traditionally based on envelope equations and slowly varying envelope approximation, despite the fact that the envelope is not “slow” and, moreover, there is no clear definition of such a “fast” envelope. This happens due to another paradoxical feature: the standard (envelope) generalized nonlinear Schrödinger equation yields very good correspondence to numerical solutions of full Maxwell equations even for few-cycle pulses, a thing that should not be. In what follows we address ultrashort optical pulses using Hamiltonian framework for nonlinear waves. As it appears, the standard optical envelope equation is just a reformulation of general Hamiltonian equations. In a sense, no approximations are required, this is why the generalized nonlinear Schrödinger equation is so effective. Moreover, the Hamiltonian framework greatly contributes to our understanding of “fast” envelope, ultrashort solitons, stability and radiation of optical pulses. Even the inclusion of dissipative terms is possible making the Hamiltonian approach an universal theoretical tool also in extreme nonlinear optics.
Chance constraints represent a popular tool for finding decisions that enforce a
robust satisfaction of random inequality systems in terms of probability. They
are widely used in optimization problems subject to uncertain parameters as they
arise in many engineering applications. Most structural results of chance constraints (e.g., closedness, convexity, Lipschitz continuity, differentiability etc.) have been formulated in a finite-dimensional
setting. The aim of this paper is to generalize some of these well-known semi-continuity and convexity properties to a setting of control problems
subject to (uniform) state chance constraints.
We present a globally convergent method for the solution of frictionless large deformation contact problems involving hyperelastic materials.
For the discretisation we apply the dual mortar method which is known to be more stable than node-to-segment approaches. The resulting non-convex constrained minimisation problems are solved using a filter–trust-region scheme.
This method combines several techniques from non-linear optimisation to achieve global convergence towards first-order optimal points. To speed up the method inexact linearisations of the non-penetration constraint are used
whenever the current iterate is far away from a critical point. A monotone multigrid method is applied for the fast solution of the constrained Newton
problems.
We derive an optoelectronic model based on a gradient formulation for the relaxation of electron-, hole- and photon-densities to their equilibrium state. This leads to a coupled system of partial and ordinary differential equations, for which we discuss the isothermal and the non-isothermal scenario separately.
We show the existence of solutions to a system of elliptic PDEs, that was recently introduced to describe the electrothermal behavior of organic semiconductor devices. Here, two diffculties appear: (i) the elliptic term in the current-flow equation is of p(x)-Laplacian type with discontinuous exponent p, which limits the use of standard methods, and (ii) in the heat equation, we have to deal with an a priori L1 term on the right hand side describing the Joule heating in the device. We prove the existence of a weak solution under very weak assumptions on the data. Our existence proof is based on Schauder’s fixed point theorem and the concept of entropy solutions for the heat equation. Here, the crucial point is the continuous dependence of the entropy solutions on the data of the problem.
Classical gradient systems have a linear relation between rates and driving forces. In generalized gradient systems we allow for arbitrary relations derived from general non-quadratic dissipation potentials. This paper describes two natural origins for these structures.
A first microscopic origin of generalized gradient structures is given by the theory of large-deviation principles. While Markovian diffusion processes lead to classical gradient structures, Poissonian jump processes give rise to cosh-type dissipation potentials.
A second origin arises via a new form of convergence, that we call EDP-convergence. Even when starting with classical gradient systems, where the dissipation potential is a quadratic functional of the rate, we may obtain a generalized gradient system in the evolutionary -limit. As examples we treat (i) the limit of a diffusion equation having a thin layer of low diffusivity, which leads to a membrane model, and (ii) the limit of difusion over a high barrier, which gives a reaction-diffusion system.
Large-area organic light-emitting diodes are thin-film multilayer devices that show pronounced self-heating and brightness inhomogeneities at high currents. As these high currents are typical for lighting applications, a deeper understanding of the mechanisms causing these inhomogeneities is necessary. We discuss the modeling of the interplay between current flow, self-heating, and heat transfer in such devices using a system of partial differential equations of thermistor type, that is capable of explaining the development of luminance inhomogeneities. The system is based on the heat equation for the temperature coupled to a p(x)-Laplace-type equation for the electrostatic potential with mixed boundary conditions. The p(x)-Laplacian allows to take into account non-Ohmic electrical behavior of the different organic layers. Moreover, we present analytical results on the existence, boundedness, and regularity of solutions to the system. A numerical scheme based on the finite-volume method allows for efficient simulations of device structures.
We show the existence of solutions to a system of elliptic PDEs, that was recently introduced to describe the electrothermal behavior of organic semiconductor devices. Here, two difficulties appear: (i) the elliptic term in the current-flow equation is of $p(x)$-Laplacian-type with discontinuous exponent $p$, which limits the use of standard methods, and (ii) in the heat equation, we have to deal with an a priori $L^1$ term on the right hand side describing the Joule heating in the device. We prove the existence of a weak solution under very weak assumptions on the data. Our existence proof is based on Schauder’s fixed point theorem and the concept of entropy solutions for the heat equation. Here, the crucial point is the continuous dependence of the entropy solutions on the data of the problem.
We study linear dissipative Hamiltonian (DH) systems with real constant coefficients that arise in energy based modeling of dynamical
systems. In this paper we analyze when such a system is on the boundary
of the region of asymptotic stability, i.e., when it has purely imaginary eigenvalues,
or how much the dissipation term has to be perturbed to be on this boundary. For unstructured systems the explicit construction of the \emph{real distance to instability (real stability radius)} has been a challenging problem. In this paper, we analyze this real distance under different structured perturbations to the dissipation term that preserve the DH structure and we derive explicit formulas for this distance in terms of low rank perturbations. We also show (via numerical examples) that under real structured perturbations to the dissipation the asymptotical
stability of a DH system is much more robust than for unstructured perturbations.
Group-velocity matched cross-phase modulation between a fundamental soliton and a dispersive wave-packet has been previously suggested for optical switching applications similar to an optical transistor. Moreover, the nonlinear interaction in the resulting group-velocity horizon can be exploited for adiabatic compression of the soliton down into the few-cycle regime. Here we show that both mechanisms can be combined. In such a transient compressor, parameters of the dispersive wave may then serve to actively control the soliton compression and adjust the pulse duration in the presence of disturbances. While a certain amount of control is already enabled by the delay between soliton and dispersive wave, the means of controlling the compression process are substantially enhanced by additionally manipulating the chirp of the dispersive wave. Moreover, controlling the chirp of the dispersive wave also enables correction for limitations of the compression scheme due to a self-frequency shift of the soliton or for uncompensated dispersion in the scheme. This substantially widens the practicality of the compression scheme and other applications of the highly efficient nonlinear interaction at the group-velocity horizon.
Dissipative Hamiltonian (DH) systems are an important concept in energy based modeling of dynamical
systems. One of the major advantages of the DH formulation is that the system encodes system
properties in an algebraic way in the system. Making use of the structure,
it is easy to see that DH systems are stable. In this paper
the question is discussed when a linear constant coefficient DH system is on the boundary
of the region of asymptotic stability, i.e., when it has purely imaginary eigenvalues,
or how much it has to be perturbed to be on this boundary. For unstructured systems this distance to instability (stability radius) is well-understood. In this paper,
explicit formulas for this distance under structure preserving perturbations are determined.
It is also shown (via numerical examples) that under structured perturbations the asymptotical
stability of a DH system is much more robust than for unstructured perturbations, since the
distance can be much larger.
In this paper, we introduce and study analytically a vectorial Cahn-Hilliard reaction model coupled with rate-dependent damage processes. The recently proposed Cahn-Hilliard reaction model can e.g. be used to describe the behavior of electrodes of lithium-ion batteries as it includes both the intercalation reactions at the surfaces and the separation into different phases. The coupling with the damage process allows considering simultaneously the evolution of a damage field, a second important physical effect occurring during the charging or discharging of lithium-ion batteries.
Mathematically, this is realized by a Cahn-Larché system with a non-linear Newton boundary condition for the chemical potential and a doubly non-linear differential inclusion for the damage evolution. We show that this system possesses an underlying generalized gradient structure which incorporates the non-linear Newton boundary condition. Using this gradient structure and techniques from the field of convex analysis we are able to prove constructively the existence of weak solutions of the
coupled PDE system.
We discuss analytical and numerical methods for the optimization of optoelectronic devices by performing optimal control of the PDE governing the carrier transport with respect to the doping profile. First, we provide a cost functional that is a sum of a regularization and a contribution, which is motivated by the modal net gain that appears in optoelectronic models of bulk or quantum- well lasers. Then, we state a numerical discretization, for which we study optimized solutions for different regularizations and for vanishing weights.
We derive thermodynamically consistent models of reaction-diffusion equations
coupled to a heat equation. While the total energy is conserved, the total
entropy serves as a driving functional such that the full coupled system is a
gradient flow. The novelty of the approach is the Onsager structure, which is
the dual form of a gradient system, and the formulation in terms of the
densities and the internal energy. In these variables it is possible to assume
that the entropy density is strictly concave such that there is a unique
maximizer (thermodynamical equilibrium) given linear constraints on the total
energy and suitable density constraints.
We consider two particular systems of this type, namely, a
diffusion-reaction bipolar energy transport system, and a
drift-diffusion-reaction energy
transport system with confining potential. We prove corresponding
entropy-entropy production inequalities with explicitly calculable constants
and establish the convergence to thermodynamical equilibrium, at first in
entropy and further in $L^1$ using Cziszar-Kullback-Pinsker type inequalities.
We consider a non-isothermal multi-phase field model.
We subsequently discretize implicitly in time and with
linear finite elements. The arising algebraic problem is
formulated in two variables where one is the multi-phase
field, and the other contains the inverse temperature field.
We solve this saddle point problem numerically by a
non-smooth Schur-Newton approach using truncated
non-smooth Newton multigrid methods. An application in
grain growth as occurring in liquid phase crystallization
of silicon is considered.
In these notes we discuss two approaches to evolutionary Γ- convergence of gradient systems in Hilbert spaces. The formulation of the gradient system is based on two functionals, namely the energy functional and the dissipation potential, which allows us to employ Γ- convergence methods. In the first approach we consider families of uni- formly convex energy functionals such that the limit passage of the time-dependent problems can be based on the theory of evolutionary variational inequalities as developed by Daneri and Savar ́e 2010. The second approach uses the equivalent formulation of the gradient system via the energy-dissipation principle and follows the ideas of Sandier and Serfaty 2004.
We apply both approaches to rigorously derive homogenization limits for Cahn–Hilliard-type equations. Using the method of weak and strong two-scale convergence via periodic unfolding, we show that the energy and dissipation functionals Γ-converge. In conclusion, we will give specific examples for the applicability of each of the two approaches.
Structure-preserving generic low-rank perturbations are studied for classes of structured matrix pencils, including real symmetric, complex symmetric, and complex Hermitian pencils. For singular pencils it is analyzed which characteristic quantities stay invariant in the perturbed canonical form, and it is shown that the regular part of a structured matrix pencil is not affected by generic perturbations of rank one. When the rank one perturbations involve a scaling parameter, the behavior of the canonical forms in dependence of this parameter is analyzed as well.
We study a stationary thermistor model describing the electrothermal behavior of organic semiconductor devices featuring non-Ohmic current-voltage laws and self-heating effects. The coupled system consists of the current-flow equation for the electrostatic potential and the heat equation with Joule heating term as source. The self-heating in the device is modeled by an Arrhenius-like temperature dependency of the electrical conductivity. Moreover, the non-Ohmic electrical behavior is modeled by a power law such that the electrical conductivity depends nonlinearly on the electric field. Notably, we allow for functional substructures with different power laws, which gives rise to a $p(x)$-Laplace-type problem with piecewise constant exponent.
We prove the existence and boundedness of solutions in the two-dimensional case. The crucial point is to establish the higher integrability of the gradient of the electrostatic potential to tackle the Joule heating term. The proof of the improved regularity is based on Caccioppoli-type estimates, Poincar\'e inequalities, and a Gehring-type Lemma for the $p(x)$-Laplacian. Finally, Schauder's fixed-point theorem is used to show the existence of solutions.
We consider a coupled system of two elliptic PDEs, where the elliptic term in the first equation shares the properties of the $p(x)$-Laplacian with discontinuous exponent, while in the second equation we have to deal with an a~priori $L^1$ term on the right hand side. Such a system of equations is suitable for the description of various electrothermal effects, in particular those, where the non-Ohmic behavior can change dramatically with respect to the spatial variable. We prove the existence of a weak solution under very weak assumptions on the data and also under general structural assumptions on the constitutive equations of the model. The main difficulty consists in the fact that we have to overcome simultaneously two obstacles - the discontinuous variable exponent (which limits the use of standard methods) and the $L^1$ right hand side of the heat equation. Our existence proof based on Galerkin approximation is highly constructive and therefore seems to be suitable also for numerical purposes.
Trajectory- or mesh-based methods for analyzing the dynamical behavior of large
molecules tend to be impractical due to the curse of dimensionality - their computational cost increases
exponentially with the size of the molecule. We propose a method to break the curse by a
novel square root approximation of transition rates, Monte Carlo quadrature and a discretization
approach based on solving linear programs. With randomly sampled points on the molecular energy
landscape and randomly generated discretizations of the molecular conguration space as our initial
data, we construct a matrix describing the transition rates between adjacent discretization regions.
This transition rate matrix yields a Markov State Model of the molecular dynamics. We use Perron
cluster analysis and coarse-graining techniques in order to identify metastable sets in conguration
space and approximate the transition rates between the metastable sets. Application of our method
to a simple energy landscape on a two-dimensional conguration space provides proof of concept and
an example for which we compare the performance of dierent discretizations. We show that the
computational cost of our method grows only polynomially with the size of the molecule. However,
nding discretizations of higher-dimensional conguration spaces in which metastable sets can be
identied remains a challenge.
The chemical master equation is a fundamental equation in chemical kinetics. It underlies the classical reaction-rate equations and takes stochastic effects into account. In this paper we give a simple argument showing that the solutions of a large class of chemical master equations are bounded in weighted $\ell_1$-spaces and possess high-order moments. This class includes all equations in which no reactions between two or more already present molecules and further external reactants occur that add mass to the system. As an illustration for the implications of this kind of regularity, we analyze the effect of truncating the state space. This leads to an error analysis for the finite state projections of the chemical master equation, an approximation that forms the basis of many numerical methods.
The present work deals with the resolution of the Poisson equation in a bounded domain made of a thin and periodic layer of finite length placed into a homogeneous medium.
We provide and justify a high order asymptotic expansion which takes into account the boundary layer effect occurring in the vicinity of the periodic layer as well as the corner singularities appearing in the neighborhood of the extremities of the layer. Our approach combines mixes
the method of matched asymptotic expansions and the method of periodic surface homogenization.
We study non-isothermal nucleation and growth phase transformations, which are described by a generalized Avrami model for the phase transition coupled with an energy balance to account for recalescence
effects. The main novelty of our work is the identification of temperature dependent nucleation rates. We prove that such rates can be uniquely identified from measurements in a subdomain and apply an optimal control approach to develop a numerical strategy for its computation.
Let $\sigma_t(x)$ denote the implied volatility at maturity t for a strike $K = S_0 e^{x t}$, where $x \in R$ and $S_0$ is the current value of the underlying. We show that $\sigma_t(x)$ has a uniform (in $x$) limit as maturity t tends to infinity, given by the formula \sigma_{\infty}(x) = \sqrt2 (h^*(x)^{1/2} + (h^*(x) − x)^{1/2}, for $x$ in some compact neighbourhood of zero in the class of affine stochastic volatility models. The function $h^*$ is the convex dual of the limiting cumulant generating function $h$ of the scaled log-spot process. We express $h$ in terms of the functional characteristics of the underlying model. The proof of the limiting formula rests on the large deviation behaviour of the scaled log-spot process as time tends to infinity. We apply our results to obtain the limiting smile for several classes of stochastic volatility models with jumps used in applications (e.g. Heston with state-independent jumps, Bates with state-dependent jumps and Barndorff-Nielsen-Shephard model).
In this article we show, that the binding kinetics of a molecular system can be
identied by a projection of a continuous process onto a nite number of macro states. We thus
interpret binding kinetics as a projection. When projecting onto non-overlapping macro states the
Markovianity is spoiled. As a consequence, the description of e.g. a receptor-ligand system by a two
state kinetics is not accurate. By assigning a degree of membership to each state, we abandon the
non-overlapping approach. This overlap is crucial for a correct mapping of binding eects by Markov
State Models with regard to their long time behavior. It enables us to describe the highly discussed
rebinding eect, where the spatial arrangement of the system has the be included. By introducing
a \degree of fuzziness" we have an indicator for the strength of the rebinding eect, such that the
minimal rebinding eect can be derived from an optimization problem. The fuzziness also includes
some new paradigms for molecular kinetics. These new model paradigms show good agreement with
experimental data.
Markov State Models (MSMs) are widely used to represent molecular
conformational changes as jump-like transitions between subsets of the conformational
state space. However, the simulation of peptide folding in explicit water is
usually said to be unsuitable for the MSM framework. In this article, we summarize
the theoretical background of MSMs and indicate that explicit water simulations do
not contradict these principles. The algorithmic framework of a meshless conformational
space discretization is applied to an explicit water system and the sampling
results are compared to a long-term molecular dynamics trajectory. The meshless
discretization approach is based on spectral clustering of stochastic matrices (MSMs)
and allows for a parallelization of MD simulations. In our example of Trialanine we
were able to compute the same distribution of a long term simulation in less computing
time.
This paper is concerned with the distributed optimal control of a
time-discrete Cahn--Hilliard/Navier--Stokes system with variable
densities.
It focuses on the double-obstacle potential which yields an optimal
control problem for a family of coupled systems in each time instance of a
variational inequality of fourth order and the Navier--Stokes equation.
By proposing a suitable time-discretization, energy estimates are proved
and the existence of solutions to the primal system and of optimal
controls is established for the original problem as well as for a family
of regularized problems. The latter correspond to Moreau--Yosida type
approximations of the double-obstacle potential. The consistency of these
approximations is shown and first order optimality conditions for the
regularized problems are derived. Through a limit process, a stationarity
system for the original problem is established which is related to a
function space version of C-stationarity.
We propose a composite step method, designed for equality constrained optimization with partial differential equations. Focus is laid on the construction of a globalization scheme, which is based on cubic regularization of the objective and an affine covariant damped Newton method for feasibility. We show finite termination of the inner loop and fast local convergence of the algorithm. We discuss preconditioning strategies for the iterative solution of the arising linear systems with projected conjugate gradient. Numerical results are shown for optimal control problems subject to a nonlinear heat equation and subject to nonlinear elastic equations arising from an implant design problem in craniofacial surgery.
In a strong constant electric field, a dielectric particle
immersed in a weakly conducting fluid exhibits spontaneous rotations. This phenomenon is known under the name of the Quincke effect. In the original setup the particle was suspended on a silk thread and performed torsional oscillations of remarkably high amplitude.
We derive the governing equations for this experiment, and
ascertain that onset of oscillations from the quiescent state corresponds to the supercritical Hopf bifurcation.
For the case of a soft thread, we characterize the regime of large-scale torsional relaxation oscillations: explicit estimates are derived for their period and amplitude,
effects of bifurcation delay are described. In a stronger electric field, these relaxation oscillations yield to small-scale erratic rotations of the pendulum.
We study a mechanical equilibrium problem for a material consisting of two components with different densities, which allows to change the outer shape by changing the interface between the subdomains. We formulate the shape design problem of compensating unwanted workpiece
changes by controlling the interface, employ regularity results for transmission problems for a rigorous derivation of optimality conditions based on the speed method, and conclude with some numerical results based on a spline approximation of the interface.
In this paper we propose a time discretization of a system of two parabolic equations describing diffusion-driven atom rearrangement in crystalline matter. The equations express the balances of microforces and microenergy; the two phase fields are the order parameter and the chemical potential. The initial and boundary-value problem for the evolutionary system is known to be well posed. Convergence of the discrete scheme to the solution of the continuous problem is proved by a careful development of uniform estimates, by weak compactness and a suitable treatment of
nonlinearities. Moreover, for the difference of discrete
and continuous solutions we prove an error estimate of
order one with respect to the time step.
This note is concerned with a nonlinear diffusion problem of phase-field type, consisting of a parabolic system of two partial differential equations, complemented by Neumann homogeneous boundary conditions and initial conditions. The system arises from a model of two-species phase segregation
on an atomic lattice [22]; it consists of the balance equations of microforces and microenergy; the two unknowns are the order parameter rho and the chemical potential mu. Some recent results obtained for this class of problems is reviewed and, in the case of a nonconstant and nonlinear atom mobility, uniqueness and continuous dependence on the initial data are shown with the help of a new line of
argumentation developed in [12].
We consider viscoelastic solids undergoing thermal expansion and exhibiting hysteresis effects due to plasticity or phase transformations. Within the framework of generalized standard solids, the problem is described in a 3D setting by the momentum equilibrium equation, the flow rule describing the dependence of the stress on the strain history, and the heat transfer equation. Under appropriate regularity assumptions on the data, a local existence result for this thermodynamically consistent system is established, by combining existence results for ordinary differential equations in Banach spaces with a fixed-point argument. Then global estimates are obtained by using both the classical energy estimate and more specific techniques for the heat equation introduced by Boccardo and Gallouet. Finally a global existence result is derived.
The Stefan problem is coupled with a spatially inhomogeneous and anisotropic Gibbs-Thomson condition at the phase boundary. We show the long-time existence of weak solutions for the non-degenerate Stefan problem with a
spatially inhomogeneous and anisotropic Gibbs-Thomson law and a conditional existence result for the corresponding degenerate Stefan problem. To this end, approximate solutions are constructed by means of variational problems
for energy functionals with spatially inhomogeneous and anisotropic interfacial energy. By passing to the limit, we establish solutions of the Stefan problem with a spatially inhomogeneous and anisotropic Gibbs--Thomson law in a weak generalized BV-formulation.
Uncertainty is inevitable when solving science and engineering application problems. In the face of
uncertainty, it is essential to determine robust and risk-averse solutions. In this work,
we consider a class of PDE-constrained optimization problems in which the PDE coefficients
and inputs may be uncertain. We introduce two approximations for minimizing the
conditional value-at-risk for such PDE-constrained optimization problems. These approximations are based
on the primal and dual formulations of the conditional value-at-risk. For the primal problem,
we introduce a smooth approximation of the conditional value-at-risk in order to utilize
derivative-based optimization algorithms and to take advantage of the convergence properties
of quadrature-based discretizations. For this smoothed conditional value-at-risk, we prove
differentiability as well as consistency of our approximation. For the dual problem, we
regularize the inner maximization problem, rigorously derive optimality conditions, and demonstrate
the consistency of our approximation. Furthermore, we propose a fixed-point iteration that takes
advantage of the structure of the regularized optimality conditions and provides a means of calculating
worst-case probability distributions based on the given probability level. We conclude with numerical
results.
This paper is concerned with the distributed optimal control of a
time-discrete Cahn--Hilliard/Navier--Stokes system with variable
densities.
It focuses on the double-obstacle potential which yields an optimal
control problem for a family of coupled systems in each time instance of a
variational inequality of fourth order and the Navier--Stokes equation.
By proposing a suitable time-discretization, energy estimates are proved
and the existence of solutions to the primal system and of optimal
controls is established for the original problem as well as for a family
of regularized problems. The latter correspond to Moreau--Yosida type
approximations of the double-obstacle potential. The consistency of these
approximations is shown and first order optimality conditions for the
regularized problems are derived. Through a limit process, a stationarity
system for the original problem is established which is related to a
function space version of C-stationarity.
With symmetric local absorbing boundary conditions for the Helmholtz equation scattering problems can be solved on a truncated domain, where the outgoing radiation condition is approximated by a Dirichlet-to-Neumann map with higher tangential derivatives on its outer boundary. Feng's conditions are symmetric local absorbing boundary conditions, which are based on an asymptotic expansion of the coefficients of the exact Dirichlet-to-Neumann map for large radia of the circular outer boundary. In this article we analyse the well-posedness of variational formulations with symmetric local absorbing boundary conditions in general and show how the modelling error introduced by Feng's conditions depends on the radius of the truncated domain.
Adaptive Numerical Solution of Eigenvalue Problems arising from Finite Element Models. AMLS vs. AFEM
(2015)
We discuss adaptive numerical methods for the solution of eigenvalue problems arising either
from the finite element discretization of a partial differential equation (PDE) or from discrete finite element modeling.
When a model is described by a partial differential equation, the adaptive finite element method
starts from a coarse finite element mesh which, based on a posteriori error estimators, is adaptively refined
to obtain eigenvalue/eigenfunction approximations of prescribed accuracy. This method is well established for classes of elliptic PDEs,
but is still in its infancy for more complicated PDE models.
For complex technical systems, the typical approach is to directly derive finite element models
that are discrete in space and are combined with macroscopic models to describe certain phenomena like damping or friction.
In this case one typically starts with a fine uniform mesh and computes eigenvalues and eigenfunctions using
projection methods from numerical linear algebra that are often combined with the algebraic multilevel
substructuring to achieve an adequate performance.
These methods work well in practice but their convergence and error analysis is rather difficult.
We analyze the relationship between these two extreme approaches. Both approaches have their pros and cons which are discussed in detail.
Our observations are demonstrated with several numerical examples.
This paper deals with the effect of generic but structured low rank perturbations on the Jordan structure and sign
characteristic of matrices that have structure in an indefinite inner product space.
The paper is a follow-up of earlier papers in which the effect of rank one perturbations
was considered. Several results that are in contrast to the case of unstructured low rank
perturbations of general matrices are presented here.