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)
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.
In large-area Organic Light-Emitting Diodes (OLEDs) spatially inhomogeneous luminance at high power due to inhomogeneous current flow and electrothermal feedback can be observed. To describe these self-heating effects in organic semiconductors we present a stationary thermistor model based on the heat equation for the temperature coupled to a p-Laplace-type equation for the electrostatic potential with mixed boundary conditions. The p-Laplacian describes the non-Ohmic electrical behavior of the organic material. Moreover, an Arrhenius-like temperature dependency of the electrical conductivity is considered.
We introduce a finite-volume scheme for the system and discuss its relation to recent network models for OLEDs. In two spatial dimensions we derive a priori estimates for the temperature and the electrostatic potential and prove the existence of a weak solution by Schauder's fixed point theorem.
The numerical simulation of the band structure of three-dimensional dispersive metallic photonic crystals with face-centered cubic lattices leads to large-scale nonlinear eigenvalue problems, which are very challenging due to a high dimensional subspace associated with the eigenvalue zero and the fact that the desired eigenvalues (with smallest real part) cluster near the zero eigenvalues. For
the solution of the eigenvalue problem, a Newton-type iterative method is proposed and the nullspace-free method is applied to exclude the zero eigenvalues from the associated generalized eigenvalue problem. To find the successive eigenvalue/eigenvector pairs, we propose a new non-equivalence deflation method to transform converged eigenvalues to infinity, while all other eigenvalues remain unchanged. The deflated problem is then solved by the same Newton-type method, which uses a hybrid method that combines the Jacobi-Davidson, the shift-invert residual Arnoldi and nonlinear Arnoldi methods to compute the clustered eigenvalues. Numerical results illustrate that the method is robust even for the case of computing many eigenvalues in very large problems.
Several classes of optimal control of electromagnetic fields are considered. Special emphasis is
laid on a non-standard $H$-based formulation of the equations of electromagnetism in multiply connected conductors. By this technique, the Maxwell equations can be solved with reduced computational complexity. While the magnetic field $H$ in the conductor is obtained from an elliptic equation
with the $\curl \sigma^{-1} \curl$ operator, an elliptic equation with the $\div \mu \nabla$ operator is set up for a potential $\psi$ in the isolator.
Both equations are coupled by appropriate interface conditions. In all problems, the
electrical current is controlled in the conducting domain. Several types of control functions are discussed. In particular, the problem of sparse optimal control is investigated in a package of electrical wires. For all problems, the associated sensitivity
analysis is performed.
A survey of methods from numerical linear algebra for linear constant coefficient differential-algebraic equations (DAEs) and descriptor control systems is presented. We discuss numerical methods to check the solvability properties of DAEs as well as index reduction and regularization techniques. For descriptor systems we discuss controllability and observability properties and how these can be checked numerically. These methods are based on staircase forms and derivative arrays, transformed with real orthogonal transformations that are discussed in detail. Then we use the reformulated problems in several control applications for differential-algebraic equations ranging from regular and singular linear-quadratic optimal and robust control to dissipativity checking. We discuss these applications and give a systematic overview over the theory and the numerical solution methods. In particular, we show that all these applications can be treated with a common approach that is based on the computation of eigenvalues and deflating subspaces of even matrix pencils. The unified approach allows to generalize and improve several techniques that are currently in use in systems and control.
The efficient and reliable computation of guided modes in photonic crystal wave-guides is of great importance for designing optical devices. Transparent boundary conditions based on Dirichlet-to-Neumann operators allow for an exact computation of well-confined modes and modes close to the band edge in the sense that no modelling error is introduced. The well-known super-cell method, on the other hand, introduces a modelling error which may become prohibitively large for guided modes that are not well-confined. The Dirichlet-to-Neumann transparent boundary conditions are, however, not applicable for all frequencies as they are not uniquely defined and their computation is unstable for a countable set of frequencies that correspond to so called Dirichlet eigenvalues. In this work we describe how to overcome this theoretical difficulty introducing Robin-to-Robin transparent boundary conditions whose construction do not exhibit those forbidden frequencies. They seem, hence, well suited for an exact and reliable computation of guided modes in photonic crystal wave-guides.
Regularization and Numerical Solution of the Inverse Scattering Problem using Shearlet Frames
(2014)
Regularization techniques for the numerical solution of nonlinear inverse scattering
problems in two space dimensions are discussed. Assuming that the boundary of a scatterer is its most prominent feature, we exploit as model the class of cartoon-like functions.
Since functions in this class are asymptotically optimally sparsely approximated by shearlet frames, we consider shearlets as a means for the regularization in a Tikhonov method.
We examine both directly the nonlinear problem and a linearized problem obtained by
the Born approximation technique. As problem classes we study the acoustic inverse
scattering problem and the electromagnetic inverse scattering problem. We show that
this approach introduces a sparse regularization for the nonlinear setting and we present
a result describing the behavior of the local regularity of a scatterer under linearization,
which shows that the linearization does not affect the sparsity of the problem. The analytical results are illustrated by numerical examples for the acoustic inverse scattering problem that highlight the effectiveness of this approach.
An eigenvalue perturbation theory under rank-one perturbations is developed for classes
of real matrices that are symmetric with respect to a non-degenerate bilinear form,
or Hamiltonian with respect to a non-degenerate skew-symmetric form.
In contrast to the case of complex matrices, the sign characteristic is a crucial feature
of matrices in these classes. The behavior of the sign characteristic under generic
rank-one perturbations is analyzed in each of these two classes of matrices.
Partial results are presented, but some questions remain open. Applications
include boundedness and robust boundedness for solutions of structured systems
of linear differential equations with respect to general perturbations as well
as with respect to structured rank perturbations of the coefficients.
Using a standard first-order optimality condition for nonsmooth optimization problems, a general framework for a descent method is developed. This setting is applied to a class of mathematical programs with equilibrium constraints in function space from which a new algorithm is derived. Global convergence of the algorithm is demonstrated in function space and the results are then illustrated by numerical experiments.
We derive formulae for the second-order subdifferential of polyhedral norms. These formulae are fully explicit in terms of initial data. In a first step we rely on the explicit formula for the coderivative of normal cone mapping to polyhedra. Though being explicit, this formula is quite involved and difficult to apply. Therefore, we derive simple formulae for the 1-norm and - making use of a recently obtained formula for the second-order subdifferential of the maximum function - for the maximum norm.
In this paper we present an efficient algorithm for the calculation of photonic crystal band structures and band structures of photonic crystal waveguides. Our method relies on the fact that the dispersion curves of the band structure are smooth functions of the quasi-momentum in the one-dimensional Brillouin zone. We show the derivation and computation of the group velocity, the group velocity dispersion, and any higher derivative of the dispersion curves. These derivatives are then employed in a Taylor expansion of the dispersion curves. We control the error of the Taylor expansion with the help of a residual estimate and introduce an adaptive scheme for the selection of nodes in the one-dimensional Brillouin zone at which we solve the underlying eigenvalue problem and compute the derivatives of the dispersion curves. The proposed algorithm is not only advantageous as it decreases the computational effort to compute the band structure but also because it allows
for the identification of crossings and anti-crossings of dispersion curves, respectively. This identification is not possible with the standard approach of solving the underlying eigenvalue problem at a discrete set of values of the quasi-momentum without taking the mode parity into account.
Structured eigenvalue backward errors of matrix pencils and polynomials with palindromic structures
(2014)
We derive formulas for the backward error of an approximate eigenvalue of a *-palindromic
matrix polynomial with respect to *-palindromic perturbations. Such formulas are also obtained
for complex T-palindromic pencils and quadratic
polynomials. When the T-palindromic polynomial is real, then we derive the backward error
of a real number considered as an approximate eigenvalue of the matrix polynomial with
respect to real T-palindromic perturbations.
In all cases the corresponding minimal structure preserving perturbations are obtained as well.
The results are illustrated by numerical experiments. These show that there is
significant difference between the backward errors with respect to structure
preserving and arbitrary perturbations in many cases.
A mechanical equilibrium problem for a material consisting of two components with dierent densities is considered. Due to the heterogeneous material densities, the
outer shape of the underlying workpiece can be changed by shifting the interface between
the subdomains. In this paper, the problem is modeled as a shape design problem for optimally compensating unwanted workpiece changes. The associated control variable is
the interface. Regularity results for transmission problems are employed for a rigorous
derivation of suitable first-order optimality conditions based on the speed method. The paper concludes with several numerical results based on a spline approximation of the
interface.
Multi-valued network models can be described by their topology and a set of parameters capturing the effects of the regulators for each component. Dynamics can then be derived and represented as state transition systems.
Different network models may lead to the same transition system, meaning dynamics analysis of a representative model covers a larger class of models. While rather clear in the Boolean case, the properties contributing to this effect become more involved for multi-valued models. We analyse these properties and present a mathematical description of the resulting model equivalence classes.
In this paper a new theorem is formulated
which allows a rigorous proof of the shape differentiability without the usage of the material derivative; the domain expression is automatically obtained and the boundary expression is easy to derive.
Furthermore, the theorem is applied to a cost function which depends on a quasi-linear transmission
problem. Using a Gagliardo penalization the existence of optimal shapes is established.
A coupling of discrete and continuous optimization to solve kinodynamic motion planning problems
(2014)
This paper studies the relationship between the material derivative method, the shape derivative method, the min-max formulation of Correa and Seeger, and the Lagrange method introduced by Cea. A theorem is formulated
which allows a rigorous proof of the shape differentiability without the usage of material derivative;
the domain expression is automatically obtained and the boundary expression is easy to derive.
Furthermore, the theorem is applied to a cost function which depends on a quasi-linear transmission
problem. Using a Gagliardo penalization the existence of optimal shapes is established.
An algorithm to detect collisions between robots moving along given trajectories is presented. The method is a combination of the adaptive
dynamic collision checking developed by Schwarzer et al. and Lin and Canny's algorithm, which computes efficiently the distance between two polyhedra. The resulting algorithm is part of a global model that computes the optimal task assignment, sequencing and kinodynamic
motion planning in a robotic work-cell.
Two optimal control problems for instationary magnetization
processes are considered in 3D spatial domains that
include electrically conducting and nonconducting regions. The magnetic
fields are generated by induction coils. In the first model, the induction coil
is considered as part of the conducting region and the electrical current is taken
as control. In the second, the coil is viewed as part of the nonconducting region and the
electrical voltage is the control. Here, an integro-differential equation accounts
for the magnetic induction law that couples the given
electrical voltage with the induced electrical current in the
induction coil.
We derive first-order necessary
optimality condition for the optimal controls of both problems. Based on them,
numerical methods of gradient type are applied. Moreover, we report on the application
of model reduction by POD that lead to tremendous savings. Numerical tests are
presented for academic 3D geometries but also for a real-world application.
We study the fundamental problem of scheduling bidirectional traffic across machines arranged on a path. The main feature of the problem is that jobs traveling in the same direction can be scheduled in quick succession on a machine, while jobs in the other direction have to wait for an additional transit time. We show that this tradeoff makes the problem significantly harder than the related flow shop problem, by showing that it is NP-hard even for jobs with identical processing and transit times. We give polynomial algorithms for a single machine and any constant number of machines. In contrast, we show the problem to be NP-hard on a single machine and with identical processing and transit times if some pairs of jobs in different directions are allowed to run on the machine concurrently. We generalize a PTAS of Afrati et al. [1999] for one direction and a single machine to the bidirectional case on any constant number of machines.
The analysis of adaptive finite element methods in practice immediately leads to eigenvalue clusters which requires the simultaneous marking in adaptive finite element methods. A first analysis for multiple eigenvalues of the recent work [Dai, He, Zhou, arXiv Preprint 1210.1846v2] introduces an adaptive method whose marking strategy is based on the element-wise sum of local error estimator contributions for multiple eigenvalues. This paper proves optimality of a practical adaptive algorithm for eigenvalue clusters for the eigenvalues of the Laplace operator in terms of nonlinear approximation classes. All estimates are explicit in the initial mesh-size, the eigenvalues and the cluster width to clarify the dependence of the involved constants.
For regular matrix pencils the distance in norm to the nearest singular pencil
under low rank perturbation is studied. Characterizations of this distance are derived via the Weyl function of the perturbation. Special attention is paid to the Hermitian pencil case.
Estimates for the distance of a given pencil to the set of singular pencils are obtained.
A Branch-Cut-And-Price Algorithm for a Combined Buy-at-Bulk Network Design Facility Location Problem
(2014)
In the combined buy-at-bulk network design facility location
problem we are given an undirected network with a set of potential facilities and a set of clients with demands. In addition, we are also provided a set of cable types with each cable type having a capacity and cost per unit length. The cost to capacity ratio decreases from large to small
cables following economies of scale. A network planner is expected to determine a set of facilities to open and install cables along the edges of the network in order to route the demands of the clients to some open facility. The capacities of the installed cable must be able to support the demands of the clients routed along that edge.The objective is to minimize the cost that is paid for opening facilities and installing cables. We model the problem as an integer program and propose a branch-cut-and-price algorithm for solving it. We study the effect of two family of valid inequalities that naturally emerge from the model. We present the results of our implementation that were tested on a set of large real world instances.
Asymptotic behavior is often of particular interest when analyzing asynchronous Boolean networks representing biological systems such as signal transduction or gene regulatory networks. Methods based on a generalization of the steady state notion, the so-called symbolic steady states, can be exploited to investigate attractor properties as well as for model reduction techniques conserving attractors. In this paper, we propose a novel optimization-based method for computing all maximal symbolic steady states and motivate their use. In particular, we add a new result yielding a lower bound for the number of cyclic attractors and illustrate the methods with a short study of a MAPK pathway model.
Constraint-based modeling of genome-scale metabolic network reconstructions has become a widely used approach in computational biology. Flux coupling analysis is a constraint-based method that analyses the impact of single reaction knockouts on other reactions in the network.We present an extension of flux coupling analysis for double and multiple gene or reaction knockouts, and develop corresponding algorithms for an in silico simulation. To evaluate our method, we perform a full single and double knockout analysis on a selection of genome-scale metabolic network reconstructions and compare the results.
Flux coupling analysis (FCA) has become a useful tool for aiding metabolic reconstructions and guiding genetic manipulations. Originally, it was introduced for constraint-based models of metabolic networks that are based on the steady-state assumption. Recently, we have shown that the steady-state assumption can be replaced by a much weaker lattice-theoretic property related to the supports of metabolic fluxes. In this paper, we further extend our approach and delevelop an efficient algorithm for general qualitative flux coupling analysis (QFCA). We illustrate our method by thermodynamic flux coupling analysis (tFCA), which allows studying steady-state metabolic models with loop-law thermodynamic constraints. These models do not satisfy the lattice-theoretic properties required in our previous work. For a selection of genome-scale metabolic network reconstructions, we discuss both theoretically and practically, how thermodynamic constraints strengthen the coupling results that can be obtained with classical FCA.
Transitive reductions and minimal equivalent subgraphs have proven to be a powerful concept to simplify networks and to measure their redundancy. Here we consider a generalization of the minimal equivalent subgraph problem where a set of arcs is already given. For two digraphs D = (V,A), D′ = (V,A′) with A′ ⊆ A, we ask for the minimal set of edges of D that have to be added to D′ such that the transitive closure of D equals the transitive closure of D′.
We present a method to compute such an extension and show that if D is transitively closed, this problem can be solved in polynomial time.
The long standing problem is discussed of how to deflate the part associated with the eigenvalue infinity in a structured matrix pencil using structure preserving unitary transformations. We derive such a deflation procedure and apply this new technique to symmetric, Hermitian or alternating pencils and in a modified form to (anti)-palindromic pencils. We present a detailed error and perturbation analysis of this and other deflation procedures and demonstrate the properties of the new algorithm with several numerical examples.
We discuss Möbius transformations for general matrix polynomials over arbitrary
elds, analyzing their in
uence on regularity, rank, determinant, constructs such as compound
matrices, and on structural features including sparsity and symmetry. Results on
the preservation of spectral information contained in elementary divisors, partial multiplicity
sequences, invariant pairs, and minimal indices are presented. The eect on canonical
forms such as Smith forms and local Smith forms, on relationships of strict equivalence
and spectral equivalence, and on the property of being a linearization or quadratication
are investigated. We show that many important transformations are special instances
of Möbius transformations, and analyze a Möbius connection between alternating and
palindromic matrix polynomials. Finally, the use of Möbius transformations in solving
polynomial inverse eigenproblems is illustrated.
This paper focuses on
rate-independent damage in elastic bodies. Since the driving energy is nonconvex,
solutions may have jumps as a function of time, and in this situation it is known that the classical concept
of energetic solutions for rate-independent systems
may fail to accurately describe the
behavior of the system at jumps.
Therefore, we resort to the (by now well-established) vanishing viscosity approach to rate-independent modeling
and approximate the model by its viscous regularization.
In fact, the analysis of the latter PDE system presents
remarkable difficulties, due to its highly nonlinear character.
We tackle it by combining a variational approach to a class of abstract doubly nonlinear evolution equations, with
careful regularity estimates tailored to this specific system relying on a q-Laplacian type gradient regularization of the damage variable.
Hence, for the viscous problem we conclude the existence of weak solutions satisfying a
suitable energy-dissipation inequality that is the starting point for the vanishing viscosity analysis.
The latter leads to the notion of (weak) parameterized
solution to our rate-independent system,
which encompasses the influence of viscosity in the description of the jump regime.
We study the approximation of Wasserstein gradient structures
by their finite-dimensional analog. We show that simple
finite-volume discretizations of the linear Fokker-Planck
equation exhibit the recently established entropic gradient-flow
structure for reversible Markov chains. Then we reprove the
convergence of the discrete scheme in the limit of vanishing
mesh size using only the involved gradient-flow structures.
In particular, we make no use of the linearity of the equations
nor of the fact that the Fokker-Planck equation is of second order.
Spectral deferred correction methods for solving stiff ODEs are known to
converge rapidly towards the collocation limit solution on equidistant grids,
but show a much less favourable contraction on non-equidistant grids such as
Radau-IIa points. We interprete SDC methods as fixed point iterations for the
collocation system and propose new DIRK-type sweeps for stiff problems based
on purely linear algebraic considerations. Good convergence is recovered also
on non-equidistant grids. The properties of different variants are explored on
a couple of numerical examples.
The well-known structure theorem of Hadamard-Zol\'esio states that the derivative of a shape functional is a distribution on the boundary of the domain depending only on the normal perturbations of a smooth enough boundary. However a volume representation (distributed shape derivative) is more general than the boundary form and allows to work with shapes having a lower regularity.
It is customary in the shape optimization literature to assume regularity of the domains and use the boundary expression of the shape derivative for numerical algorithm. In this paper we describe the numerous advantages of the distributed shape derivative in terms of generality, easiness of computation and numerical implementation. We give several examples of numerical applications such as the inverse conductivity problem and the level set method.
For the solution of optimal control problems governed by nonlinear parabolic PDEs, methods working on the reduced objective functional are often employed to avoid a full
spatio-temporal discretization of the problem. The evaluation of the reduced gradient requires one solve of the state equation forward in time, and one backward solve of
the adjoint equation. The state enters into the adjoint equation, requiring the storage of a full 4D data set. If Newton-CG methods are used, two additional trajectories
have to be stored. To get numerical results which are accurate enough, in many case very fine discretizations in time and space are necessary, which leads to a significant
amount of data to be stored and transmitted to mass storage. Lossy compression methods were developed to overcome the storage problem by reducing the accuracy of the stored
trajectories. The inexact data induces errors in the reduced gradient and reduced Hessian. In this paper, we analyze the influence of such a lossy trajectory compression
method on Newton-CG methods for optimal control of parabolic PDEs and design an adaptive strategy for choosing appropriate quantization tolerances.
Elementary flux mode (EM) analysis is an important tool in the constraint-based analysis of genome-scale metabolic networks. Due to the combinatorial complexity of these networks, as well as the advances in the level of detail to which they can be reconstructed, an exhaustive enumeration of all EMs is often not practical. Therefore, in recent years interest has shifted towards searching EMs with specific properties. We present a novel method that allows computing EMs containing a given set of target reactions. This generalizes previous algorithms where the set of target reactions consists of a single reaction. In the one-reaction case, our method compares favorably to the previous approaches. In addition, we present several applications of our algorithm for computing EMs containing two target reactions in genome-scale metabolic networks.
Resolving thin conducting sheets for shielding or even skin layers inside by the mesh of numerical methods like the finite element method (FEM) can be avoided by using impedance transmission conditions (ITCs). Those ITCs shall provide an accurate approximation for small sheet thicknesses $d$, where the accuracy is best possible independent of the conductivity or the frequency being small or large -- this we will call robustness. We investigate the accuracy and robustness of popular and recently developed ITCs, and propose robust ITCs which are accurate up to $O(d^2)$.
We consider multiscale Hamiltonian systems in which harmonic oscillators with several high frequencies are coupled to a slow system. It is shown that the oscillatory energy is nearly preserved over long times eps^{-N} for arbitrary N>1, where eps^{-1} is the size of the smallest high frequency. The result is uniform in the frequencies and does not require non-resonance conditions.
Sobolev stability of plane wave solutions to the cubic nonlinear Schrödinger equation on a torus
(2013)
It is shown that plane wave solutions to the cubic nonlinear Schrödinger equation on a torus behave orbitally stable under generic perturbations of the initial data that are small in a high-order Sobolev norm, over long times that extend to arbitrary negative powers of the smallness parameter. The perturbation stays small in the same Sobolev norm over such long times. The proof uses a Hamiltonian reduction and transformation and, alternatively, Birkhoff normal forms or modulated Fourier expansions in time.
Coarsening in solder alloys is a widely accepted indicator for
possible failure of joints in electronic devices.
Based on the well-established Cahn--Larch\'e model
with logarithmic chemical energy density (see, e.g., Dreyer and Mueller 2001),
we present a numerical environment for the efficient
and reliable simulation of coarsening in binary alloys.
Main features are adaptive mesh refinement based on hierarchical error estimates,
fast and reliable algebraic solution by multigrid and Schur--Newton multigrid methods,
and the quantification of the coarsening speed by the temporal growth of mean phase radii.
We provide a detailed description and a numerical assessment of the algorithm and its different components,
together with a practical application to a eutectic AgCu brazing alloy.
We investigate the convergence of an implicit Voronoi finite volume
method for reaction-diffusion problems including nonlinear diffusion
in two space dimensions. The model allows to handle heterogeneous
materials and uses the chemical potentials of the involved species as
primary variables. The numerical scheme uses boundary conforming Delaunay
meshes and preserves positivity and the dissipative property of the
continuous system. Starting from a result on the global stability of
the scheme (uniform, mesh-independent global upper and lower bounds),
we prove strong convergence of the chemical activities and their gradients
to a weak solution of the continuous problem. In order to illustrate the
preservation of qualitative properties by the numerical scheme, we present
a long-term simulation of the Michaelis-Menten-Henri system. Especially,
we investigate the decay properties of the relative free energy and the
evolution of the dissipation rate over several magnitudes of time, and
obtain experimental orders of convergence for these quantities.
In this work we present a complete algorithm for the exact computation of the guided mode band structure in photonic crystal (PhC) wave-guides. In contrast to the supercell method, the used approach does not introduce any modelling error and is hence independent of the confinement of the modes. The approach is based on Dirichlet-to-Neumann (DtN) transparent boundary conditions that yield a nonlinear eigenvalue problem. For the solution of this nonlinear eigenvalue problem we present a direct technique using Chebyshev interpolation that requires a band gap calculation of the PhC in advance. For this band gap calculation –- we introduce as a very efficient tool –- a Taylor expansion of the PhC band structure. We show that our algorithm –- like the supercell method –- converges exponentially, however, its computational costs –- in comparison to the supercell method –- only increase moderately since the size of the matrix to be inverted remains constant.
In high accuracy numerical simulations and optimal control of time-dependent processes, often both many time steps and fine spatial discretizations are needed. Adjoint gradient computation, or post-processing of simulation results, requires the storage of the solution trajectories over the whole time, if necessary together with the adaptively refined spatial grids. In this paper we discuss various techniques to reduce the memory requirements, focusing first on the storage of the solution data, which typically are double precision floating point values. We highlight advantages and disadvantages of the different approaches. Moreover, we present an algorithm for the efficient storage of adaptively refined, hierarchic grids, and the integration with the compressed storage of solution data.
A Fenchel dualization scheme for the one-step time-discretized contact problem of quasi-static
elasto-plasticity with kinematic or isotropic hardening is considered. The associated path is induced
by a combined Moreau-Yosida / Tichonov regularization of the dual problem.
The sequence of solutions to the regularized problems is shown to converge strongly to the optimal
displacement-stress-strain triple of the original elasto-plastic contact problem in the space-continuous setting.
This property relies on the density of the intersection of certain convex sets which is shown as well.
It is also argued that the mappings associated with the resulting problems are Newton- or slantly differentiable.
Consequently, each regularized subsystem can be solved mesh-independently at a local
superlinear rate of convergence. For efficiency purposes, an inexact path-following approach is proposed and
a numerical validation of the theoretical results is given.
The inverse eigenvalue problem for $T$-alternating matrix polynomials over arbitrary
algebraically closed fields of characteristic different from two is considered.
The main result shows that the necessary conditions obtained in \cite{MacMMM10} for a matrix
polynomial to be the Smith form of a $T$-alternating matrix polynomial are under mild
conditions also sufficient to be the Smith form of a $T$-alternating matrix polynomial with
invertible leading coefficient which is additionally in anti-triangular form.. In particular, this result
implies that any $T$-alternating matrix polynomial with invertible leading coefficient is
equivalent to a $T$-alternating matrix polynomial in anti-triangular form that has the
same finite and infinite elementary divisors as the original matrix polynomial.
Finally, the inverse eigenvalue problem for $T$-palindromic matrix polynomials is
considered excluding the case that both $+1$ and $-1$ are eigenvalues.
In this paper, we introduce a high order finite element (FEM) implementation using perfectly matched layer (PML) for the scattering by plasmonic structures inside layered media. The PML is proven to be very accurate and efficient by a comparative analysis with a commercial FEM software and the Multiple Multipole Program (MMP). A convergence analysis using hp-adaptive refinement inside the PML layer
shows that adaptive mesh refinement inside the PML layer is most efficient. Based on this convergence analysis an hp-strategy is proposed, which shows a remarkable error reduction for small additional computational costs.
Shielding sheets are commonly used in the protection of electronic devices. With their large aspect ratios they become a serious issue for the direct application of boundary element methods due to the occurring almost singular integrals. Impedance transmission conditions allow for boundary element formulations where only sheet mid-line has to be triangulated. We propose and analyse boundary element methods of second kind for impedance transmission conditions of two different types for the time-harmonic eddy current problem in two dimensions. In numerical experiments we study the effect on the magnetic shielding efficiency of the discretisation error due the boundary element discretisation and the modelling error due to the
impedance transmission condition.
We study the exact recovery of signals from quantized frame coefficients. Here, the basis of the quantization
is hard thresholding, and we present a simple algorithm for the recovery of reconstructable signals. The set of
non-reconstructable signals is shown to be star-shaped and symmetric with respect to the origin. Moreover, we
provide a criterion on the frame for the boundedness of this set. In this case, we also give a priori bounds.
According to the Helmholtz decomposition,
the irrotational parts of the momentum balance equations of
the incompressible Navier-Stokes equations are balanced by the
pressure gradient.
Unfortunately, nearly all mixed methods for incompressible flows
violate this fundamental property, resulting in the well-known
numerical instability of poor mass conservation.
The origin of this problem is the
lack of $L^2$-orthogonality between discretely divergence-free velocities
and irrotational vector fields.
In order to cure this,
a new variational crime using divergence-free
velocity reconstructions is proposed.
Applying lowest order Raviart-Thomas velocity reconstructions
to the nonconforming Crouzeix-Raviart element
allows to construct
a cheap flow discretization for general 2d and 3d
simplex meshes that possesses the same
advantageous robustness properties like divergence-free flow
solvers.
In the Stokes case,
optimal a-priori error estimates for the velocity gradients
and the pressure are derived. Moreover, the discrete velocity
is independent of the continuous pressure.
Several detailed linear and nonlinear
numerical examples illustrate the theoretical findings.
A basic task in signal analysis is to character-
ize data in a meaningful way for analysis and classification
purposes. Time-frequency transforms are powerful strategies
for signal decomposition, and important recent generalizations
have been achieved in the setting of frame theory. In parallel
recent developments, tools from algebraic topology, traditionally
developed in purely abstract settings, have provided new insights
in applications to data analysis. In this report, we investigate some
interactions of these tools, both theoretically and with numerical
experiments, in order to characterize signals and their frame
transforms. We explain basic concepts in persistent homology
as an important new subfield of computational topology, as well
as formulations of time-frequency analysis in frame theory. Our
objective is to use persistent homology for constructing topo-
logical signatures of signals in the context of frame theory. The
motivation is to design new classification and analysis methods by
combining the strength of frame theory as a fundamental signal
processing methodology, with persistent homology as a new tool
in data analysis.
Primal heuristics are an important component of state-of-the-art codes for mixed integer nonlinear programming (MINLP). In this article we give a compact overview of primal heuristics for MINLP that have been suggested in the literature of recent years. We sketch the fundamental concepts of different classes of heuristics and discuss specific implementations. A brief computational experiment shows that primal heuristics play a key role in achieving feasibility and finding good primal bounds within a global MINLP solver.
Enforcing solvability of a nonlinear matrix equation and estimation of multivariate ARMA time series
(2013)
The matrix equation $X+AX^{-1}A^T=B$, arising in parameter estimation of certain time series models,
is solvable only for certain values of the matrices $A,B$.
We present a numerical method to modify $A,B$ in order to make the matrix equation solvable.
Since solvability depends on the location of the eigenvalues of the palindromic matrix polynomial $\lambda^2 A+\lambda B+A^T$,
our method works by moving those eigenvalues to specified locations using first order spectral perturbation theory.
The method is heuristic but works in practice, as is supported by several compelling numerical examples.
These examples arise from parameter estimation of a common time series model, the multivariate ARMA(1,1).
We consider a general class of continuous asset price models where the drift and the volatility functions, as well as the driving Brownian motions, change at a random time. Under minimal assumptions on the random time and on the driving Brownian motions, we study the behavior of the model in all the filtrations which naturally arise in this setting, establishing martingale representation results and characterizing the validity of the NA1 and NFLVR no-arbitrage conditions.
We consider the design of a passive optical telecommunication access network, where clients have to be connected to an intermediate level of distribution points (DPs) and further on to some central offices (COs) in a tree-like fashion. Each client demands a given number of fiber connections to its CO. Passive optical splitters installed at the DPs allow k connections to share a single common fiber between the DP and the CO. We consider fixed charge costs for the use of an edge of the underlying street network, of a DP, and of a CO and variable costs for installing fibers along the street edges and for installing splitters at the DPs. We present two Lagrangian decomposition approaches that decompose the problem based on the network structure and on the cost structure, respectively. The subproblems are solved using MIP techniques. We report computational results for realistic instances and compare the efficiency of the Lagrangian approaches to the solutions of an integrated MIP model.
Motivation. Modelling, parameter identification, and simulation play an important role in systems biology. Usually, the goal is to determine parameter values that minimise the difference between experimental measurement values and model predictions in a least-squares sense. Large-scale biological networks, however, often suffer from missing data for parameter identification. Thus, the least-squares problems are rank-deficient and solutions are not unique. Many common optimisation methods ignore this detail because they do not take into account the structure of the underlying inverse problem. These algorithms simply return a “solution” without additional information on identifiability or uniqueness. This can yield misleading results, especially if parameters are co-regulated and data are noisy.
Results. The Gauss-Newton method presented in this paper monitors the numerical rank of the Jacobian and converges locally, for the class of adequate problems, to a solution that is unique within the subspace of identifiable parameters. This method has been implemented in BioPARKIN, a software package that combines state-of-the-art numerical algorithms with compliance to system biology standards, most importantly SBML, and an accessible interface.
Availability. The software package BioPARKIN is available for download at http://bioparkin.zib.de .
A basic task in signal analysis is to character-
ize data in a meaningful way for analysis and classification
purposes. Time-frequency transforms are powerful strategies
for signal decomposition, and important recent generalizations
have been achieved in the setting of frame theory. In parallel
recent developments, tools from algebraic topology, traditionally
developed in purely abstract settings, have provided new insights
in applications to data analysis. In this report, we investigate some
interactions of these tools, both theoretically and with numerical
experiments, in order to characterize signals and their frame
transforms. We explain basic concepts in persistent homology
as an important new subfield of computational topology, as well
as formulations of time-frequency analysis in frame theory. Our
objective is to use persistent homology for constructing topo-
logical signatures of signals in the context of frame theory. The
motivation is to design new classification and analysis methods by
combining the strength of frame theory as a fundamental signal
processing methodology, with persistent homology as a new tool
in data analysis.
We derive a formula for the backward error of a complex number $\lambda$ when considered as an approximate eigenvalue
of a Hermitian matrix pencil or polynomial with respect to Hermitian perturbations. The same are also obtained for approximate
eigenvalues of matrix pencils and polynomials with related structures like skew-Hermitian, $*$-even and $*$-odd.
Numerical experiments suggest that in many cases there is a significant difference between the backward
errors with respect to perturbations that preserve structure and those with respect to arbitrary perturbations.
An existence result is proved for 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. This system is meant to model two-species phase segregation on an atomic lattice under the presence of diffusion. A similar system has been recently
introduced and analyzed in [3]. Both systems conform to the general theory developed in [5]: two parabolic PDEs, interpreted as balances of microforces and microenergy,
are to be solved for the order parameter rho and the chemical potential mu. In the system studied in this note, a phase-field equation in rho fairly more general than in [3] is coupled with a highly nonlinear diffusion equation for mu, in which the conductivity coefficient is allowed to depend nonlinearly on both variables.
Global existence and uniqueness for a singular/degenerate Cahn-Hilliard system with viscosity
(2013)
Existence and uniqueness are investigated for 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. This system aims to model two-species phase segregation on an atomic lattice [19]; in the balance equations of microforces and microenergy, the two
unknowns are the order parameter rho and the chemical potential mu. A simpler version of the same system has recently been discussed in [8]. In this paper, a fairly more general phase-field equation for rho is coupled with a genuinely nonlinear diffusion equation for mu. The existence of a global-in-time solution is proved with the help of suitable a priori estimates. In the case of constant atom mobility, a new and rather unusual uniqueness
proof is given, based on a suitable combination of variables.
We are concerned with a nonstandard phase field model of
Cahn-Hilliard type. The model, which was introduced by Podio-Guidugli (Ric. Mat. 2006), describes two-species phase segregation and consists of a system of two highly nonlinearly coupled PDEs. It has been recently investigated
by Colli, Gilardi, Podio-Guidugli, and Sprekels in a series of papers: see, in particular, SIAM J. Appl. Math. 2011,
and Boll. Unione Mat. Ital. 2012. In the latter contribution, the authors can treat the very general case in which the diffusivity coefficient of the parabolic PDE
is allowed to depend nonlinearly on both variables. In the same framework, this paper investigates the asymptotic limit of the solutions to the initial-boundary value problems as the diffusion coefficient sigma in the equation governing the evolution of the order parameter tends to zero. We prove that such a limit actually exists and solves the limit problem, which couples a nonlinear PDE of parabolic type with an ODE accounting for the phase dynamics. In the case of a constant diffusivity, we are able to show uniqueness and to improve the regularity of the solution.
The present note deals with a nonstandard systems of differential equations describing a two-species phase segregation. This system naturally arises in the asymptotic analysis carried out recently by the same authors,
as the diffusion coefficient in the equation governing
the evolution of the order parameter tends to zero. In particular, an existence result has been proved for the limit system in a very general framework. On the contrary, uniqueness was shown by assuming a constant mobility coefficient. Here, we generalize this result and prove
a continuous dependence property in the case that the mobility coefficient suitably depends on the chemical potential.
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.
We study the incremental facility location problem, wherein we are given an instance of the uncapacitated facility location problem. We seek an incremental sequence of opening facilities and an incremental sequence of serving customers along with their fixed assignments to facilities open in the partial sequence. Our aim is to have the solution obtained for serving the first l customers in the sequence be competitive with the optimal solution to serve any l customers. We provide an incremental framework that provides an overall competitive factor of 8 and a worst case instance that provides the lower bound of 3. The problem has applications in multi-stage network planning.
We consider a generalized version of the rooted connected facility location problem which occurs in planning of telecommunication networks with both survivability and hop-length constraints. Given a set of client nodes, a set of potential facility nodes including one predetermined root facility, a set of optional Steiner nodes, and the set of the potential connections among these nodes, that task is to decide which facilities to open, how to assign the clients to the open facilities, and how to interconnect the open facilities in such a way, that the resulting network contains at least edge-disjoint paths, each containing at most H edges, between the root and each open facility and that the total cost for opening facilities and installing connections is minimal. We study two IP models for this problem and present a branch-and-cut algorithm based on Benders decomposition for nding its solution. Finally, we report computational results.
In the connected facility location problem with buy-at-bulk edge costs we are given a set of clients with positive demands and a set of potential facilities with opening costs in an undirected graph with edge lengths obeying the triangle inequality. Moreover, we are given a set of access cable types, each with a cost per unit length and a capacity such that the cost per capacity decreases from small to large cables, and a core cable type of innite capacity. The task is to open some facilities and to connect them by a Steiner tree using core cables, and to build a forest network using access cables such that the edge capacities suce to simultaneously route all client demands unsplit to the open facilities. The objective is to minimize the total cost of opening facilities, building the core Steiner tree, and installing the access cables. In this paper, we devise a constant-factor approximation algorithm for this problem based on a random sampling technique.
We consider a generalization of the connected facility location problem where the clients must be connected to the open facilities via shared capacitated (tree) networks instead of independent shortest paths. This problem arises in the planning of ber optic telecommunication access networks, for example. Given a set of clients with positive demands, a set of potential facilities with opening costs, a set of capacitated access cable types, and a core cable type of innite capacity, one has to decide which facilities to open, how to interconnect them using a Steiner tree of innite capacity core cables, and which access cable types to install on which potential edges such that these edges form a forest and the installed capacities suce to simultaneously route the client demands to the open facilities via single paths. The objective is to minimize the total cost of opening facilities, building the core Steiner tree among them, and installing the access cables. In this paper, we devise a constant-factor approximation algorithm for problem instances where the access cable types obey economies of scale. In the special case where only multiples of a single cable type can be installed on the access edges, a variant of our algorithm achieves a performance guarantee of 6.72.
This paper presents efficient computational techniques for solving an optimization problem in cardiac defibrillation governed by the monodomain equations. Time-dependent electrical currents injected at different spatial positions act as the control. Inexact Newton-CG methods are used, with reduced gradient computation by adjoint solves. In order to reduce the computational complexity, adaptive mesh refinement for state and adjoint equations is performed. To reduce the high storage and bandwidth demand imposed by adjoint gradient and Hessian-vector evaluations, a lossy compression technique for storing trajectory data is applied. An adaptive choice of quantization tolerance based on error estimates is developed in order to ensure convergence. The efficiency of the proposed approach is demonstrated on numerical examples.
In this paper a condition number for linear-quadratic two-stage stochastic optimization problems is introduced as the Lipschitz modulus of the multifunction assigning to a (discrete) probability distribution the solution set of the problem. Being the outer norm of the Mordukhovich coderivative of this multifunction, the condition number can be estimated from above explicitly in terms of the problem data by applying appropriate calculus rules. Here, a chain rule for the extended partial second-order subdifferential recently proved by Mordukhovich and Rockafellar plays a crucial role. The obtained results are illustrated for the example of two-stage stochastic optimization problems with simple recourse.
The chemical master equation is a fundamental equation in chemical kinetics. It is an adequate substitute for the classical reaction-rate equations whenever stochastic effects become relevant. In the present paper we give a simple argument showing that the solutions of a large class of chemical master equations, including all those in which elementary reactions between two and more molecules do not generate a larger number of molecules than existed before,
are bounded in weighted $\ell_1$-spaces. 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 of the finite state projection of the chemical master equation, an approximation that underlies many numerical methods.
A mixed-integer stochastic nonlinear optimization problem with joint probabilistic constraints
(2013)
We illustrate the solution of a mixed-integer stochastic nonlinear optimization problem in an application of power management. In this application, a coupled system consisting of a hydro power station and a wind farm is considered. The objective is to satisfy the local energy demand and sell any surplus energy on a spot market for a short time horizon. Generation of wind energy is assumed to be random, so that demand satisfaction is modeled by a joint probabilistic constraint taking into account the multivariate distribution. The turbine is forced to either operate between given positive limits or to be shut down. This introduces additional binary decisions. The numerical solution procedure is presented and results are illustrated.
We present new residual estimates based on Kato's square root theorem for spectral approximations of diagonalizable non-self-adjoint differential operators of convection-diffusion-reaction type. These estimates are incorporated as part of an hp-adaptive finite element algorithm for practical spectral computations, where it is shown that the
resulting a posteriori error estimates are reliable. Provided experiments demonstrate the efficiency and reliability of our approach.
The huge number of elementary flux modes (EFM) in genome-scale metabolic networks makes analysis based on elementary flux modes intrinsically difficult. However, it has been shown that the elementary flux modes with optimal yield often contain highly redundant information. The set of optimal-yield elementary flux modes can be compressed using modules. Up to now, this compression was only possible by first enumerating the whole set of all optimal-yield elementary flux modes.
We present a direct method for computing modules of the thermodynamically constrained optimal flux space of a metabolic network. This method can be used to decompose the set of optimal-yield elementary flux modes in a modular way and to speed up their computation. In addition, it provides a new form of coupling information that is not obtained by classical flux coupling analysis. We illustrate our approach on a set of model organisms.
Constraint-based analysis of metabolic networks has become a widely used approach in computational systems biology.
In the simplest form, a metabolic network is represented by a stoichiometric matrix and thermodynamic information on the irreversibility of certain reactions.
Then one studies the set of all steady-state flux vectors satisfying these stoichiometric and thermodynamic constraints.
We introduce a new lattice-theoretic framework for the computational analysis of metabolic networks, which focuses on the support of the flux vectors,
i.e., we consider only the qualitative information whether or not a certain reaction is active, but not its specific flux rate.
Our lattice-theoretic view includes classical metabolic pathway analysis as a special case, but turns out to be much more flexible and general,
with a wide range of possible applications.
We show how important concepts from metabolic pathway analysis, such as blocked reactions, flux coupling, or elementary modes, can be generalized to arbitrary lattice-based models. We develop corresponding general algorithms and present a number of computational results.
Multi-Level Monte-Carlo Finite Element Methods for stochastic elliptic variational inequalities
(2013)
Multi-Level Monte-Carlo Finite Element (MLMC--FE) methods
for the solution of stochastic elliptic variational inequalities
are introduced, analyzed, and numerically investigated.
Under suitable assumptions on the random diffusion coefficient,
the random forcing function, and the deterministic obstacle,
we prove existence and uniqueness of solutions of ``mean-square''
and ``pathwise'' formulations.
Suitable regularity results for deterministic,
elliptic obstacle problems lead
to uniform pathwise error bounds, providing
optimal-order error estimates of the statistical error
and upper bounds for the
corresponding computational cost for
classical Monte--Carlo and novel MLMC--FE methods.
Utilizing suitable multigrid solvers for the occurring sample problems,
in two space dimensions
MLMC--FE methods then provide numerical
approximations of the expectation of the random solution
with the same order of efficiency as for a corresponding
deterministic problem, up to logarithmic terms.
Our theoretical findings are illustrated by numerical experiments.
We introduce and analyze nonsmooth Schur-Newton methods for a class of nonsmooth saddle point problems. The method is able to solve problems where the primal energy decomposes into a convex smooth part and a convex separable but nonsmooth part. The method is based on nonsmooth Newton techniques for an equivalent unconstrained dual problem. Using this we show that it is globally convergent even for inexact evaluation of the linear subproblems.
We introduce a new operator for stabilizing error that arises from the weak enforcement of mass conservation in finite element simulations of incompressible flow problems. We show this new operator has a similar positive effect on velocity error as the well-known and very successful grad-div stabilization operator, but the new operator is more attractive from an implementation standpoint because it yields a sparser block structure matrix. That is, while grad-div produces fully coupled block matrices (i.e. block-full), the matrices arising from the new operator are block-upper triangular in two dimensions, and in three dimensions the 2,1 and 3,1 blocks are empty. Moreover, the diagonal blocks of the new operator's matrices are identical to those of grad-div. We provide error estimates and numerical examples for finite element simulations with the new operator, which reveals the significant improvement in accuracy it can provide. Solutions found using the new operator are also compared to those using usual grad-div stabilization, and in all cases, solutions are found to be very similar.
The computation of guided modes in photonic crystal wave-guides is a key issue in the process of designing devices in photonic communications. Existing methods, such as the super-cell method, provide an efficient computation of well-confined modes. However, if the modes are not well-confined, the modelling error of the super-cell method becomes prohibitive and advanced methods applying transparent boundary conditions for periodic media are needed. In this work we demonstrate the numerical realization of a recently proposed Dirichlet-to-Neumann approach and compare the results with those of the super-cell method. For the resulting non-linear eigenvalue problem we propose an iterative solution based on Newton's method and a direct solution using Chebyshev interpolation of the non-linear operator. Based on the Dirichlet-to-Neumann approach, we present a formula for the group velocity of guided modes that can serve as an objective function in the optimization of photonic crystal wave-guides.
We study the perturbation theory of structured matrices under structured
rank one perturbations, with emphasis on matrices that are unitary, orthogonal, or symplectic
with respect to an indefinite inner product. The rank one perturbations are not necessarily of
arbitrary small size (in the sense of norm).
In the case of sesquilinear forms, results on selfadjoint matrices can be applied to
unitary matrices by using the Cayley transformation, but
in the case of real or complex symmetric or skew-symmetric bilinear forms
additional considerations are necessary. For complex symplectic matrices, it turns out that
generically (with respect to the perturbations) the behavior of the Jordan form of the
perturbed matrix follows the pattern established earlier for unstructured matrices and their unstructured perturbations, provided the specific properties of the Jordan
form of complex symplectic matrices are accounted for. For instance,
the number of Jordan blocks of fixed odd size corresponding to the eigenvalue $1$ or $-1$ have to be even.
For complex orthogonal matrices, it is shown that the behavior of
the Jordan structures corresponding to the original eigenvalues that are not moved by
perturbations follows again the pattern established earlier for unstructured matrices,
taking into account the specifics of Jordan forms of complex orthogonal
matrices.
The proofs are based on general results developed in the paper concerning Jordan forms of
structured matrices (which include in particular the classes of orthogonal and symplectic matrices)
under structured rank one perturbations. These results are presented and proved in the framework of
real as well as of complex matrices.
Periodic Solutions to Dissipative Hyperbolic Systems. II: Hopf Bifurcation for Semilinear Problems
(2013)
We consider boundary value problems for semilinear hyperbolic systems of the type
$$
\partial_tu_j + a_j(x,\la)\partial_xu_j + b_j(x,\la,u) = 0, \; x\in(0,1), \;j=1,\dots,n
$$
with smooth coefficient functions $a_j$
and $b_j$
such that
$b_j(x,\la,0) = 0$ for all $x \in [0,1]$, $\la \in \R$, and $j=1,\ldots,n$.
We state conditions for Hopf bifurcation, i.e.,
for existence, local uniqueness (up to phase shifts), smoothness and smooth dependence
on $\la$
of time-periodic solutions bifurcating from the zero stationary solution. Furthermore,
we derive a formula which determines the bifurcation direction.
The proof is done by means of a Liapunov-Schmidt reduction procedure.
For this purpose, Fredholm properties of the linearized
system and implicit function
theorem techniques are used.
There are at least two distinguishing features of Hopf bifurcation theorems for hyperbolic PDEs in comparison with those for parabolic PDEs or for ODEs:
First, the question if a non-degenerate time-periodic solution depends smoothly on the system parameters
is much more delicate. And second,
a sufficient amount of dissipativity is needed in the system, and a priori
it is not clear how to verify this in terms of the data of the PDEs and of the boundary conditions.
Periodic Solutions to Dissipative Hyperbolic Systems. I: Fredholm Solvability of Linear Problems
(2013)
This paper concerns linear first-order hyperbolic systems in one space dimension of the type
$$
\partial_tu_j + a_j(x,t)\partial_xu_j + \sum\limits_{k=1}^nb_{jk}(x,t)u_k = f_j(x,t),\; x \in (0,1),\; j=1,\ldots,n,
$$
with periodicity conditions in time and reflection boundary conditions in space. We state a kind of dissipativity condition (depending on the coefficients $a_j$ and $b_{jj}$ and the boundary reflection coefficients), which implies Fredholm solvability of the problem, i.e., either there is a nontrivial solution to the homogeneous problem (in this case the space of such solutions has finite dimension) or the nonhomogeneous problem is uniquely solvable for any right-hand side (in this case the solution depends continuously on the right-hand side). In particular, under those conditions no small denominator effects occur.
Our results work for many non-strictly hyperbolic systems, but they are new even in the case of strict hyperbolicity.
Finally, in the case that all coefficients $a_j$ are $t$-independent, we show that the solutions are $C^\infty$-smooth if the data are $C^\infty$-smooth.
We examine robustness of exponential dichotomies of boundary value problems for general linear first-order one-dimensional hyperbolic systems. The boundary conditions are supposed to be of types ensuring smoothing solutions in finite time, which includes reflection boundary conditions. We show that the dichotomy survives in the space of continuous functions under small perturbations of all coefficients in the differential equations.
We give an exposition of recent results on regularity and Fredholm properties for first-order one-dimensional hyperbolic PDEs. We show that large classes of boundary operators cause an effect that smoothness increases with time. This property is the key in finding regularizers
(parametrices) for hyperbolic problems. We construct regularizers for periodic problems for dissipative first-order linear hyperbolic PDEs and show that these problems are modeled by Fredholm operators of index zero.
We consider systems of reaction-diffusion equations as gradient systems with respect to an entropy functional and a dissipation metric given in terms of a so-called Onsager operator, which is a sum of a diffusion part of Wasserstein type and a reaction part. We provide methods for establishing geodesic $\lambda$-convexity of the entropy functional by purely differential methods, thus circumventing arguments from mass transportation. Finally, several examples, including a drift-diffusion system, provide a survey on the applicability of the theory.
Grad-div stabilization has been proved to be a very useful tool in discretizations
of incompressible flow problems. Standard error analysis for inf-sup stable conforming pairs of
finite element spaces predicts that the stabilization parameter should be optimally chosen
to be $\mathcal O(1)$. This paper revisits this choice for the Stokes equations on the basis
of minimizing the $H^1(\Omega)$ error of the velocity and the $L^2(\Omega)$ error of the pressure.
It turns out, by applying a refined error analysis, that the optimal parameter choice is more subtle
than known so far in the literature. It depends on the used norm,
the solution, the family of finite
element spaces, and the type of mesh. Depending on the situation, the
optimal
stabilization parameter might range from being very small to very large.
The analytic results
are supported by numerical examples.
Complete damage in linear elastic materials — Modeling, weak formulation and existence results
(2013)
In this work, we introduce a degenerating PDE system with a time-depending
domain for complete damage processes under time-varying
Dirichlet boundary conditions. The evolution of the system is
described by a doubly nonlinear differential inclusion for the damage
process and a degenerating quasi-static balance equation for the displacement field
which are strongly nonlinearly coupled.
In our proposed model, the material
may completely disintegrate which is indispensable for a realistic modeling of
damage processes in elastic materials. Complete damage theories
lead to several mathematical problems since, for instance, coercivity properties
of the free energy are lost and, therefore, several difficulties arise.
For the introduced complete damage model, we propose a classical
formulation and a corresponding suitable weak formulation in an
$SBV$-framework. The main aim is to prove existence of weak solutions
for the introduced degenerating model. In addition, we show that the classical
differential inclusion can be regained from the notion of weak solutions under
certain regularity assumptions which is a novelty in the theory of complete damage
models of this type.
For the existence results, we had to handle the following problem:
During the damage process it might occur that not completely damaged material regions are isolated
from the Dirichlet boundary. In this case, the
deformation field cannot be controlled in the transition from incomplete
to complete damage. To tackle this problem, we consider the evolution
process on a time-depending domain. In this context, two major challenges
arise:
Firstly, the time-dependent domain approach leads to jumps in the energy
which have to be accounted for in the energy inequality of the notion of
weak solutions. To handle this problem, several energy estimates are established
by $\Gamma$-convergence techniques. Secondly, the time-depending domain
might have bad smoothness properties such that Korn's inequality cannot be
applied. To this end, a covering result for such sets with smooth
compactly embedded domains has been shown.
This paper discusses adaptive finite element methods (AFEMs) for the solution of elliptic eigenvalue problems associated with partial differential operators. An adaptive method based on nodal-patch refinement leads to an asymptotic error reduction property for the computed sequence of simple eigenvalues and eigenfunctions. This justifies the use of the proven saturation property for a class of reliable and efficient hierarchical a posteriori error estimators. Numerical experiments confirm that the saturation property is present even for very coarse meshes for many examples; in other cases the smallness assumption on the initial mesh may be severe.
Flux variability analysis (FVA) is an important tool to further analyze the results obtained by flux balance analysis (FBA) on genome-scale metabolic networks. Standard FVA may predict unbounded fluxes through some reactions in the network even if the nutrient uptake rate is bounded. These fluxes violate the second law of thermodynamics. They may be eliminated by extending flux variability analysis with thermodynamic constraints.
We present a new algorithm for efficient flux variability (and flux balance) analysis with thermodynamic constraints, suitable for analyzing genome-scale metabolic networks. We first show that flux balance analysis with thermodynamic constraints is NP-hard. Then we derive a theoretical tractability result, which can be applied to metabolic networks in practice. We use this result to develop a new constraint programming algorithm Fast-tFVA for fast flux variability analysis with thermodynamic constraints (tFVA). Computational comparisons with previous methods demonstrate the efficiency of the new method. For tFVA, a speed-up of factor 30-300 is achieved.
In an analysis of genome-scale metabolic networks in the BioModels database, we found that in 485 out of 716 networks additional irreversible or fixed reactions could be detected.
We discuss the possibility of computing eigenpairs of some prototypical linear second-order self-adjoint elliptic partial differential operator (or its high-resolution finite element discretization) by numerical upscaling techniques. We compute a low-dimensional generalized finite element space that preserves small eigenvalues in a superconvergent way. The approximate eigenpairs are then obtained by solving the corresponding low-dimensional algebraic eigenvalue problem. The rigorous error bounds are based on two-scale decompositions of H1 by means of a certain Clement-type quasi-interpolation operator.
We present a discretization for dynamic large deformation contact problems without friction. Our model is based on Hamilton’s principle, which avoids the explicit appearance of the contact forces. The resulting differential inclusion is discretized in time using a modified midpoint rule. This modification, which concerns the evaluation of the generalized gradient, allows to achieve energy dissipativity. For the space discretization we use a dual-basis mortar method. The resulting spatial algebraic
problems are nonconvex minimization problems with nonconvex inequality constraints. These can be solved efficiently using a trust-region SQP framework with a monotone multigrid inner solver.
In this paper we propose and analyze a new Multiscale Method for solving semi-linear elliptic problems with heterogeneous and highly variable coeffcient functions. For this purpose we construct a generalized finite element basis that spans a low dimensional multiscale space. The basis is assembled by performing localized linear finescale computations in small patches that have a diameter of order H |log(H)| where H is the coarse mesh size. Without any assumptions on the type of the oscillations in the coeffcients, we give a rigorous proof for a linear convergence of the H1-error with respect to the coarse mesh
size. To solve the arising equations, we propose an algorithm that is based on a damped Newton scheme in the multiscale space.
We discuss shape optimization problems for cylindrical tubes that are loaded by time-dependent applied force. This is a problem of shape optimization that leads to optimal control in linear elasticity theory. We determine the optimal thickness of a cylindrical tube minimizing the deformation of the tube under the influence of the external force. The main difficulty is that the state equation is a hyperbolic partial differential equation of 4th order. First order necessary conditions for the optimal solution are derived. Based on them, a numerical method is set up and numerical examples are presented.
Optimal Thickness of a Cylindrical Shell -- An Optimal Control Problem in Linear Elasticity Theory
(2012)
In this paper we discuss optimization problems for cylindrical tubes which are loaded by an applied force. This is a problem of optimal control in linear elasticity theory (shape optimization). We are looking for an optimal thickness minimizing the deflection (deformation) of the tube under the influence of an external force.
From basic equations of mechanics, we derive the equation of deformation. We apply the displacement approach from shell theory and make use of the hypotheses of
Mindlin and Reissner. A corresponding optimal control problem is formulated and first order necessary conditions for the optimal solution (optimal thickness) are derived.
We present numerical examples which were solved by the finite element method.
In incompressible flows with vanishing
normal velocities at the boundary, irrotational forces in the momentum
equations should be balanced
completely by the pressure gradient.
Unfortunately, nearly all available discretization methods for incompressible flows violate this property.
The origin of the problem is that discrete velocity approximations
of incompressible flows are usually not
divergence-free. Hence, the use of divergence-free velocity reconstructions is
proposed wherever an $L^2$ scalar product appears in the discrete
variational formulation.
The approach is illustrated and applied to a nonconforming MAC-like discretization for unstructured Delaunay grids.
It is numerically demonstrated that a divergence-free velocity reconstruction based on the lowest-order Raviart-Thomas element
increases the robustness and accuracy of an existing convergent discretization, when irrotational forces appear in the momentum equations.
A novel Finite Element Method (FEM) for the computational simulation in particle reinforced composite materials with many inclusions is presented. It is based on an adapted mesh which consists of triangles and parametric quadrilaterals in 2D. The number of elements and, hence, the number of degrees of freedom are proportional to the number of inclusions. The error of the method is independent of the distance of the neighboring inclusions. While being related to network methods, the approach can tackle more general settings. We present an efficient residual a posteriori error estimator which enables to compute reliable upper and lower error bounds. Several numerical examples illustrate the performance of the method and the error estimator. Moreover, it is demonstrated that the assumption of a lattice structure of inclusions can easily lead to incorrect predictions about material properties.
We formulate the static mechanical coupling of a geometrically exact Cosserat rod
to a nonlinearly elastic continuum. In this setting, appropriate coupling conditions have
to connect a one-dimensional model with director variables to a three-dimensional
model without directors.
Two alternative coupling conditions are proposed,
which correspond to two different configuration trace spaces.
For both we show existence of solutions of the coupled problems, using the direct
method of the calculus of variations. From the first-order optimality conditions
we also derive the corresponding conditions for the dual variables. These are
then interpreted in mechanical terms.
Recent research has shown that
in some practically relevant situations like multi-physics flows[11]
divergence-free mixed finite elements may have a significantly
smaller discretization error than standard non-divergence-free
mixed finite elements. In order to judge the overall performance of
divergence-free mixed finite elements, we
investigate linear solvers for the saddle point linear systems arising in $((P_k)^d,P_{k-1}^{disc})$ Scott-Vogelius finite element implementations of the incompressible Navier-Stokes equations. We investigate both direct and iterative solver methods.
Due to discontinuous pressure elements in the case of Scott-Vogelius elements, considerably more solver strategies seem to deliver promising results than in the case of standard mixed finite elements like
Taylor-Hood elements. For direct methods, we extend recent preliminary work using sparse banded solvers on the penalty method formulation to finer meshes, and discuss extensions. For iterative methods, we test augmented Lagrangian and H-LU preconditioners with GMRES, on both full and statically condensed systems.
Several numerical experiments are provided that show these classes of solvers are well suited for use with Scott-Vogelius elements, and could deliver an interesting overall performance in several applications.
We consider discretizations for reaction-diffusion systems with nonlinear
diffusion in two space dimensions. The applied model allows to handle heterogeneous
materials and uses the chemical potentials of the involved species as primary variables.
We propose an implicit Voronoi finite volume discretization on regular Delaunay
meshes that allows to prove uniform, mesh-independent global upper and lower L1
bounds for the chemical potentials. These bounds provide the main step for a convergence
analysis for the full discretized nonlinear evolution problem. The fundamental
ideas are energy estimates, a discrete Moser iteration and the use of discrete
Gagliardo-Nirenberg inequalities. For the proof of the Gagliardo-Nirenberg inequalities
we exploit that the discrete Voronoi finite volume gradient norm in 2d coincides
with the gradient norm of continuous piecewise linear finite elements.
The authors propose a recycling MINRES scheme for a solution of subsequent self-adjoint linear systems as appearing, for example, in the Newton process for solving nonlinear equations. Ritz vectors are automatically extracted from one MINRES run and then used for self-adjoint deflation in the next. The method is designed to work with a preconditioner and arbitrary inner products. Numerical experiments with nonlinear Schrödinger equations indicate a substantial decrease in computation time when recycling is used.
Mathematical modeling often helps to provide a systems perspective on gene regulatory networks. In particular, qualitative approaches are useful when detailed kinetic information is lacking. Multiple methods have been developed that implement qualitative information in different ways, e.g., in purely discrete or hybrid discrete/continuous models. In this paper, we compare the discrete asynchronous logical modeling formalism for gene regulatory networks due to R. Thomas with piecewise affine differential equation models.
We provide a local characterization of the qualitative dynamics of a piecewise affine differential equation model using the discrete dynamics of a corresponding Thomas model. Based on this result, we investigate the consistency of higher-level dynamical properties such as attractor characteristics and reachability. We show that although the two approaches are based on equivalent information, the resulting qualitative dynamics are different. In particular, the dynamics of the piecewise affine differential equation model is not a simple refinement of the dynamics of the Thomas model.
Piecewise linear convex functions arise as integrands in stochastic programs. They are Lipschitz continuous on their domain, but do not belong to tensor product Sobolev spaces. Motivated by applying Quasi-Monte Carlo methods we show that all terms of their ANOVA decomposition, except the one of highest order, are smooth if the underlying densities are smooth and certain geometric condition is satisfied. The latter condition is generically satisfied in the normal case.
We consider convex optimization problems with $k$th order stochastic dominance constraints for $k\ge 2$. We discuss distances of random variables that are relevant for the dominance relation and establish quantitative stability results for optimal values and solution sets in terms of a suitably selected probability metrics.Moreover, we provide conditions ensuring that the optimal value function is Hadamard directionally differentiable. Finally, we discuss some implications of the results for empirical (Monte Carlo,
sample average) approximations of dominance constrained optimization models.
Logical modeling of biological regulatory networks gives rise to a representation of the system's dynamics as a so-called state transition graph. Analysis of such a graph in its entirety allows for a comprehensive understanding of the functionalities and behavior of the modeled system. However, the size of the vertex set of the graph is exponential in the number of the network components making analysis costly, motivating development of reduction methods. In this paper, we present results allowing for a complete description of an asynchronous state transition graph of a Thomas network solely based on the analysis of the subgraph induced by certain extremal states. Utilizing this notion, we compare the behavior of a simple multi-valued network and a corresponding Boolean network and analyze the conservation of dynamical properties between them. Understanding the relation between such coarser and finer models is a necessary step towards meaningful network reduction as well as model refinement methods.