Geodesics without differential equations: general relativistic calculations for introductory modern physics classes

Introductory courses covering modem physics sometimes introduce some elementary ideas from general relativity, though the idea of a geodesic is generally limited to shortest Euclidean length on a curved surface of two spatial dimensions rather than extremal aging in spacetime. It is shown that Epstein charts provide a simple geometric picture of geodesics in one space and one time dimension and that for a hypothetical uniform gravitational field, geodesics are straight lines on a planar diagram. This means that the properties of geodesics in a uniform field can be calculated with only a knowledge of elementary geometry and trigonometry, thus making the calculation of some basic results of general relativity accessible to students even in an algebra-based survey course on physics.

Stochastic delay differential equations for genetic regulatory networks

Time delay is an important aspect in the modelling of genetic regulation due to slow biochemical reactions such as gene transcription and translation, and protein diffusion between the cytosol and nucleus. In this paper we introduce a general mathematical formalism via stochastic delay differential equations for describing time delays in genetic regulatory networks. Based on recent developments with the delay stochastic simulation algorithm, the delay chemical masterequation and the delay reaction rate equation are developed for describing biological reactions with time delay, which leads to stochastic delay differential equations derived from the Langevin approach. Two simple genetic regulatory networks are used to study the impact of' intrinsic noise on the system dynamics where there are delays. (c) 2006 Elsevier B.V. All rights reserved.

Student Difficulties with units in differential equations in modelling contexts

First-year undergraduate engineering students' understanding of the units of factors and terms in first-order ordinary differential equations used in modelling contexts was investigated using diagnostic quiz questions. Few students appeared to realize that the units of each term in such equations must be the same, or if they did, nevertheless failed to apply that knowledge when needed. In addition, few students were able to determine the units of a proportionality factor in a simple equation. These results indicate that lecturers of modelling courses cannot take this foundational knowledge for granted and should explicitly include it in instruction.

Gaussian process approximations of stochastic differential equations

Stochastic differential equations arise naturally in a range of contexts, from financial to environmental modeling. Current solution methods are limited in their representation of the posterior process in the presence of data. In this work, we present a novel Gaussian process approximation to the posterior measure over paths for a general class of stochastic differential equations in the presence of observations. The method is applied to two simple problems: the Ornstein-Uhlenbeck process, of which the exact solution is known and can be compared to, and the double-well system, for which standard approaches such as the ensemble Kalman smoother fail to provide a satisfactory result. Experiments show that our variational approximation is viable and that the results are very promising as the variational approximate solution outperforms standard Gaussian process regression for non-Gaussian Markov processes.

Optimization of chemical plant simulation using double collocation

A method has been constructed for the solution of a wide range of chemical plant simulation models including differential equations and optimization. Double orthogonal collocation on finite elements is applied to convert the model into an NLP problem that is solved either by the VF 13AD package based on successive quadratic programming, or by the GRG2 package, based on the generalized reduced gradient method. This approach is termed simultaneous optimization and solution strategy. The objective functional can contain integral terms. The state and control variables can have time delays. Equalities and inequalities containing state and control variables can be included into the model as well as algebraic equations and inequalities. The maximum number of independent variables is 2. Problems containing 3 independent variables can be transformed into problems having 2 independent variables using finite differencing. The maximum number of NLP variables and constraints is 1500. The method is also suitable for solving ordinary and partial differential equations. The state functions are approximated by a linear combination of Lagrange interpolation polynomials. The control function can either be approximated by a linear combination of Lagrange interpolation polynomials or by a piecewise constant function over finite elements. The number of internal collocation points can vary by finite elements. The residual error is evaluated at arbitrarily chosen equidistant grid-points, thus enabling the user to check the accuracy of the solution between collocation points, where the solution is exact. The solution functions can be tabulated. There is an option to use control vector parameterization to solve optimization problems containing initial value ordinary differential equations. When there are many differential equations or the upper integration limit should be selected optimally then this approach should be used. The portability of the package has been addressed converting the package from V AX FORTRAN 77 into IBM PC FORTRAN 77 and into SUN SPARC 2000 FORTRAN 77. Computer runs have shown that the method can reproduce optimization problems published in the literature. The GRG2 and the VF I 3AD packages, integrated into the optimization package, proved to be robust and reliable. The package contains an executive module, a module performing control vector parameterization and 2 nonlinear problem solver modules, GRG2 and VF I 3AD. There is a stand-alone module that converts the differential-algebraic optimization problem into a nonlinear programming problem.

An iterative method for the reconstruction of a stationary flow

In this article, an iterative algorithm based on the Landweber-Fridman method in combination with the boundary element method is developed for solving a Cauchy problem in linear hydrostatics Stokes flow of a slow viscous fluid. This is an iteration scheme where mixed well-posed problems for the stationary generalized Stokes system and its adjoint are solved in an alternating way. A convergence proof of this procedure is included and an efficient stopping criterion is employed. The numerical results confirm that the iterative method produces a convergent and stable numerical solution. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2007

Theory of optimal power budget in quasi-linear dispersion-managed fibre links

A theory of an optimal distribution of the gain of in-line amplifiers in dispersion-managed transmission systems is developed. As an example of the application of the general method, a design of the line with periodically imbalanced in-line amplification is proposed.

Optimal power budget in quasi-linear dispersion-managed fiber links

We develop a theory of an optimal distribution of the gain of in-line amplifiers in dispersion-managed transmission systems. As an example of the application of the general method we propose a design of the line with periodically imbalanced in-line amplification.

Variational mean-field algorithm for efficient inference in large systems of stochastic differential equations

This work introduces a Gaussian variational mean-field approximation for inference in dynamical systems which can be modeled by ordinary stochastic differential equations. This new approach allows one to express the variational free energy as a functional of the marginal moments of the approximating Gaussian process. A restriction of the moment equations to piecewise polynomial functions, over time, dramatically reduces the complexity of approximate inference for stochastic differential equation models and makes it comparable to that of discrete time hidden Markov models. The algorithm is demonstrated on state and parameter estimation for nonlinear problems with up to 1000 dimensional state vectors and compares the results empirically with various well-known inference methodologies.

Differential Equations in Abstract Cones

We extend the method of quasilinearization to differential equations in abstract normal cones. Under some assumptions, corresponding monotone iterations converge to the unique solution of our problem and this convergence is superlinear or semi–superlinear

Boundary-Value Problems for almost Nonlinear Singularly Perturbed Systems of Ordinary Differential Equations

A boundary-value problems for almost nonlinear singularly perturbed systems of ordinary differential equations are considered. An asymptotic solution is constructed under some assumption and using boundary functions and generalized inverse matrix and projectors.