Refine
Year of publication
Language
- English (97)
Keywords
- optimal control (11)
- differential-algebraic equation (4)
- finite elements (4)
- metastability (4)
- trajectory storage (4)
- Lyapunov exponent (3)
- Sacker-Sell spectrum (3)
- exponential dichotomy (3)
- geodesic finite elements (3)
- rare events (3)
- spectral interval (3)
- state constraints (3)
- Bohl exponent (2)
- Cosserat rods (2)
- Currents (2)
- Dune (2)
- Hamiltonian matrix (2)
- Krylov subspace methods (2)
- MINRES (2)
- Matching (2)
- Newton-CG (2)
- Schrödinger equation (2)
- Steklov function (2)
- cluster analysis (2)
- compression (2)
- deflation (2)
- domain decomposition (2)
- dynamical systems (2)
- flux coupling analysis (2)
- generic programming (2)
- grid-based methods (2)
- hierarchical grids (2)
- index (2)
- metabolic network (2)
- molecular dynamics (2)
- nonlinear elasticity (2)
- path-following (2)
- perturbation theory (2)
- regularity (2)
- strangeness (2)
- strangeness index (2)
- $CUR$ decomposition (1)
- $H_\infty$ control (1)
- Acetabulum (1)
- Adaptive Finite Elements (1)
- Adaptive finite elements (1)
- Atomistic-Continuum Coupling (1)
- BVD pencil (1)
- Boolean network (1)
- Bridging Domain (1)
- C-stationarity (1)
- CG (1)
- Cahn-Larche system (1)
- Cayley transformation (1)
- Conformation Dynamics; Markov State Models; Molecular Kinetics; Transition Rates (1)
- Constraint-based modeling, metabolic network, thermodynamic constraints (1)
- Cosserat rod (1)
- Deformable Surfaces (1)
- Diffeomorphic Registration (1)
- Diffeomorphic registration (1)
- Dirichlet-Neumann (1)
- Discrete model (1)
- Discrete model; Gene regulatory network; Piecewise affine model (1)
- Dynamical contact problems (1)
- Elementary flux mode (1)
- Elliptic div-grad operators (1)
- Flux balance analysis (1)
- GMRES (1)
- Gene regulatory network (1)
- Ginzburg-Landau equations (1)
- Hamiltonian eigenvalue problem (1)
- Hamiltonian pseudospectra (1)
- Hamiltonian real Schur form (1)
- Klein-Gordon equation (1)
- Large Deformation (1)
- Large deformation (1)
- Lithography (1)
- Mandible (1)
- Markov Random Field (1)
- Maxwell's equations (1)
- Meshfree (1)
- Metabolic network (1)
- Monte Carlo simulation (1)
- Multiscale Simulation (1)
- Newmark method (1)
- Newton methods in function space (1)
- Nonlinear eigenvalue problems (1)
- PDE constrained optimization (1)
- Perron-Frobenius theorem (1)
- Piecewise affine model (1)
- Polynomial eigenvalue problem (1)
- Positive descriptor systems (1)
- QR algorithm (1)
- Richards equation (1)
- Riemannian center of mass (1)
- Riemannian manifolds (1)
- Riemannian trust region method (1)
- Riemannian trust-region methods (1)
- Ritz vector recycling (1)
- Rothe method (1)
- SQP (1)
- Schroedinger equation (1)
- Schur-Newton multigrid (1)
- Segmentation (1)
- Signorini condition (1)
- TR1 Update (1)
- Tucker decomposition (1)
- Variational inequalities (1)
- abstract interface (1)
- adaptive finite element method (1)
- adaptive finite elements (1)
- adaptive mesh refinement (1)
- adaptive methods (1)
- adaptivity (1)
- adjoint based updating (1)
- adjoint gradient computation (1)
- anisotropic ellipticity in three dimensions (1)
- approximation (1)
- augmentation (1)
- backward error (1)
- biological network (1)
- biomechanics (1)
- bounded-realness (1)
- c++ (1)
- chattering (1)
- chemical master equation (1)
- complex skew-symmetric matrix polynomial (1)
- complex symmetric matrix polynomial (1)
- complexity reduction (1)
- compressed sensing (1)
- conformation dynamics (1)
- conformational space (1)
- conical diffraction (1)
- consistency (1)
- constraint-based analysis (1)
- constraint-based analysis; metabolic networks; elementary flux modes (1)
- constraint-based modeling (1)
- contact problem (1)
- continuity of Nemyckii Operators (1)
- continuous QR algorithm (1)
- control constraints (1)
- convergence order (1)
- coupling (1)
- coupling conditions (1)
- defibrillation (1)
- descriptor system (1)
- dictionary (1)
- differential-algebraic equations (1)
- differentiation index (1)
- directors (1)
- discrete QR algorithm (1)
- discrete dynamical system (1)
- disk function method (1)
- distance to bounded-realness (1)
- drift-diffusion equation (1)
- dune (1)
- eigenfunctions (1)
- eigenvalue cluster (1)
- eigenvalue problem (1)
- electro-magnetic scattering (1)
- elementary flux modes (1)
- energy minimization (1)
- equivalence (1)
- even matrix polynomial (1)
- even matrix polynomials (1)
- even pencil (1)
- exact residual (1)
- existence and uniqueness of solutions (1)
- explicit formula (1)
- finite dynamical systems (1)
- finite state projections (1)
- flux balance analysis (1)
- function space (1)
- generalised projected Lyapunov equations (1)
- goal oriented error estimation (1)
- hierarchical basis (1)
- homotopy (1)
- hybrid system (1)
- hypercubes (1)
- implant design (1)
- index reduction (1)
- inequality constraints (1)
- interior point methods (1)
- interior point methods in function space (1)
- interpolation error (1)
- kinematic (1)
- kinematic equivalence (1)
- knockout simulation (1)
- lattice theory (1)
- leading direction (1)
- least squares (1)
- linear programming (1)
- linear-quadratic control (1)
- liquid crystals (1)
- local convergence (1)
- logical modeling (1)
- lossy compression (1)
- manifold (1)
- matrix pencils (1)
- mesh compression (1)
- meta grid (1)
- metabolic networks (1)
- metabolic networks, (1)
- metastable conformation (1)
- micro-fe (1)
- mixed Dirichlet-Neumann boundary conditions (1)
- mixed derivatives (1)
- modules (1)
- molecular dynamics simulations (1)
- monodomain model (1)
- monotone multigrid (1)
- monotone multigrid method (1)
- morphing (1)
- mutual incoherence (1)
- nonlinear Schrödinger equations (1)
- nonlinear configuration space (1)
- nonlinear equations (1)
- odd matrix polynomial (1)
- odd matrix polynomials (1)
- optimal Sobolev regularity (1)
- palindromic matrix polynomials (1)
- parametrizations (1)
- partial differential equation (1)
- partial differential equations (1)
- passive system (1)
- pencil arithmetic (1)
- peptides (1)
- perfectly matched layer method (1)
- phase separation (1)
- piecewise linear 3D flattening (1)
- piecewise linear maps (1)
- pole condition (1)
- polyconvex elasticity (1)
- prime implicand (1)
- projector chain (1)
- purely imaginary eigenvalues (1)
- quai-Newton (1)
- quasi-Newton methods (1)
- rank $k$ (1)
- rate matrix (1)
- regularization (1)
- restricted isometry property (1)
- rough potential energy function (1)
- semilinear parabolic PDEs (1)
- sign characteristic (1)
- simplicial surfaces (1)
- singular value decomposition (1)
- sliding mode simulation (1)
- smooth $QR$ factorization (1)
- smooth QR factorization (1)
- smooth singular value decomposition (1)
- sparse solution (1)
- spectral approximation (1)
- spectral clustering (1)
- spectral deferred correction (1)
- stability (1)
- stationary distribution (1)
- structured backward error (1)
- structured condition number (1)
- structured doubling algorithm (1)
- structured mapping problem (1)
- structured staircase form, structured Kronecker canonical form, symmetric pencil, Hermitian pencil, alternating pencil, palindromic pencil, linear quadratic control, $H_\infty$ control (1)
- subgrid (1)
- subspace recycling (1)
- switched positive systems (1)
- switched system (1)
- symplectic matrix (1)
- symplectic pencil (1)
- systems biology (1)
- thermodynamic constraints (1)
- time integration (1)
- tractability index (1)
- transition state theory (1)
- transmission at material interfaces (1)
- transparent boundary conditions (1)
- trust region (1)
- unit sphere (1)
- variational analysis (1)
- viscoelasticity (1)
- wave equation (1)
- zero curvature (1)
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.
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.
We consider a shape implant design problem that arises in the context of facial surgery. We introduce a reformulation as an optimal control problem, where the control acts as a boundary force. The state is modelled as a minimizer of a polyconvex hyperelastic energy functional. We show existence of optimal solutions and derive - on a formal level - first order optimality conditions. Finally, preliminary numerical results are presented.
The pole condition approach for deriving transparent boundary conditions is extended to the time-dependent, two-dimensional case. Non-physical modes of the solution are identified by the position of poles of the solution's spatial Laplace transform in the complex plane. By requiring the Laplace transform to be analytic on some
problem dependent complex half-plane, these modes can be
suppressed. The resulting algorithm computes a finite number of coefficients of a series expansion of the Laplace transform, thereby providing an approximation to the exact boundary condition. The resulting error decays super-algebraically with the number of coefficients, so relatively few additional degrees of freedom are
sufficient to reduce the error to the level of the discretization error in the interior of the computational domain. The approach shows good results for the Schroedinger and the drift-diffusion equation
but, in contrast to the one-dimensional case, exhibits instabilities for the wave and Klein-Gordon equation. Numerical examples are shown that demonstrate the good performance in the former and the instabilities in the latter case.
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.
This article describes Fortran 77 subroutines for computing eigenvalues and invariant subspaces
of Hamiltonian and skew-Hamiltonian matrices. The implemented algorithms are based on orthogonal
symplectic decompositions, implying numerical backward stability as well as symmetry
preservation for the computed eigenvalues. These algorithms are supplemented with balancing and
block algorithms, which can lead to considerable accuracy and performance improvements. As a
by-product, an efficient implementation for computing symplectic QR decompositions is provided.
We demonstrate the usefulness of the subroutines for several, practically relevant examples.
Stewart's recently introduced Krylov-Schur algorithm
is a modification of the implicitly restarted Arnoldi algorithm which
employs reordered Schur decompositions to perform restarts and de-
ations in a numerically reliable manner. This paper describes a variant
of the Krylov-Schur algorithm suitable for addressing eigenvalue
problems associated with products of large and sparse matrices. It
performs restarts and de
ations via reordered periodic Schur decompositions
and, by taking the product structure into account, it is
capable to achieve qualitatively better approximations to the eigenvalues
of small magnitude.
The role of larger bulges in the QR algorithm is controversial. Large bulges are infamous
for having a strong, negative influence on the convergence of the implicit shifted QR algorithm.
This paper provides a new explanation of this shift blurring effect by connecting the computation of
the first column of the shift polynomial to the notoriously ill-conditioned pole placement problem.
To avoid shift blurring, modern variants of the QR algorithm employ chains of tightly coupled tiny
bulges instead of one large bulge. It turns out that larger bulges still play a positive role in these
variants; a slight increase of the bulge sizes often results in considerable performance improvements.
We investigate the condition number for a complex eigenvalue of a real matrix under
real perturbations. Based on an explicit formula, it is shown that this number is never
smaller than 1/
p
2 times the corresponding condition number with respect to complex
perturbations. This result can be generalized to the condition number of an arbitrary
complex-valued function under real perturbations. This extends to related condition
numbers.