Traité élémentaire de calcul différentiel et de calcul intégral.

Available on demand as hard copy or computer file from Cornell University Library.

Theorie der linearen Differenzengleichungen,

Available on demand as hard copy or computer file from Cornell University Library.

A numerical approach to modeling the catalytic voltammetry of surface-confined redox enzymes

A finite difference method for simulating voltammograms of electrochemically driven enzyme catalysis is presented. The method enables any enzyme mechanism to be simulated. The finite difference equations can be represented as a matrix equation containing a nonlinear sparse matrix. This equation has been solved using the software package Mathematica. Our focus is on the use of cyclic voltammetry since this is the most commonly employed electrochemical method used to elucidate mechanisms. The use of cyclic voltammetry to obtain data from systems obeying Michaelis-Menten kinetics is discussed, and we then verify our observations on the Michaelis-Menten system using the finite difference simulation. Finally, we demonstrate how the method can be used to obtain mechanistic information on a real redox enzyme system, the complex bacterial molybdoenzyme xanthine dehydrogenase.

The dynamics of a genetic algorithm for a simple learning problem

A formalism for describing the dynamics of Genetic Algorithms (GAs) using method s from statistical mechanics is applied to the problem of generalization in a perceptron with binary weights. The dynamics are solved for the case where a new batch of training patterns is presented to each population member each generation, which considerably simplifies the calculation. The theory is shown to agree closely to simulations of a real GA averaged over many runs, accurately predicting the mean best solution found. For weak selection and large problem size the difference equations describing the dynamics can be expressed analytically and we find that the effects of noise due to the finite size of each training batch can be removed by increasing the population size appropriately. If this population resizing is used, one can deduce the most computationally efficient size of training batch each generation. For independent patterns this choice also gives the minimum total number of training patterns used. Although using independent patterns is a very inefficient use of training patterns in general, this work may also prove useful for determining the optimum batch size in the case where patterns are recycled.

The dynamics of a genetic algorithm under stabilizing selection

A formalism recently introduced by Prugel-Bennett and Shapiro uses the methods of statistical mechanics to model the dynamics of genetic algorithms. To be of more general interest than the test cases they consider. In this paper, the technique is applied to the subset sum problem, which is a combinatorial optimization problem with a strongly non-linear energy (fitness) function and many local minima under single spin flip dynamics. It is a problem which exhibits an interesting dynamics, reminiscent of stabilizing selection in population biology. The dynamics are solved under certain simplifying assumptions and are reduced to a set of difference equations for a small number of relevant quantities. The quantities used are the population's cumulants, which describe its shape, and the mean correlation within the population, which measures the microscopic similarity of population members. Including the mean correlation allows a better description of the population than the cumulants alone would provide and represents a new and important extension of the technique. The formalism includes finite population effects and describes problems of realistic size. The theory is shown to agree closely to simulations of a real genetic algorithm and the mean best energy is accurately predicted.

Discrete Generalization of Gronwall-Bellman Inequality with Maxima and Application

Снежана Христова, Кремена Стефанова, Лиляна Ванкова - В работата са решени няколко нови видове линейни дискретни неравенства, които съдържат максимума на неизвестната функция в отминал интервал от време. Някои от тези неравенства са приложени за изучаване непрекъснатата зависимост от смущения при дискретни уравнения с максимуми.

A Finite Variable Difference Relaxation Scheme for hyperbolic-parabolic equations

Using the framework of a new relaxation system, which converts a nonlinear viscous conservation law into a system of linear convection-diffusion equations with nonlinear source terms, a finite variable difference method is developed for nonlinear hyperbolic-parabolic equations. The basic idea is to formulate a finite volume method with an optimum spatial difference, using the Locally Exact Numerical Scheme (LENS), leading to a Finite Variable Difference Method as introduced by Sakai [Katsuhiro Sakai, A new finite variable difference method with application to locally exact numerical scheme, journal of Computational Physics, 124 (1996) pp. 301-308.], for the linear convection-diffusion equations obtained by using a relaxation system. Source terms are treated with the well-balanced scheme of Jin [Shi Jin, A steady-state capturing method for hyperbolic systems with geometrical source terms, Mathematical Modeling Numerical Analysis, 35 (4) (2001) pp. 631-645]. Bench-mark test problems for scalar and vector conservation laws in one and two dimensions are solved using this new algorithm and the results demonstrate the efficiency of the scheme in capturing the flow features accurately.

Numerical solution of the incompressible Navier-Stokes equations with an upwind compact difference scheme

A new finite difference method for the discretization of the incompressible Navier-Stokes equations is presented. The scheme is constructed on a staggered-mesh grid system. The convection terms are discretized with a fifth-order-accurate upwind compact difference approximation, the viscous terms are discretized with a sixth-order symmetrical compact difference approximation, the continuity equation and the pressure gradient in the momentum equations are discretized with a fourth-order difference approximation on a cell-centered mesh. Time advancement uses a three-stage Runge-Kutta method. The Poisson equation for computing the pressure is solved with preconditioning. Accuracy analysis shows that the new method has high resolving efficiency. Validation of the method by computation of Taylor's vortex array is presented.

Compact finite difference - Fourier spectral method for three-dimensional incompressible Navier-Stokes equations

A new compact finite difference-Fourier spectral hybrid method for solving the three dimensional incompressible Navier-Stokes equations is developed in the present paper. The fifth-order upwind compact finite difference schemes for the nonlinear convection terms in the physical space, and the sixth-order center compact schemes for the derivatives in spectral space are described, respectively. The fourth-order compact schemes in a single nine-point cell for solving the Helmholtz equations satisfied by the velocities and pressure in spectral space is derived and its preconditioned conjugate gradient iteration method is studied. The treatment of pressure boundary conditions and the three dimensional non-reflecting outflow boundary conditions are presented. Application to the vortex dislocation evolution in a three dimensional wake is also reported.

H4 exponential finite-difference scheme for convective diffusion-equations

Perturbations are applied to the convective coefficients and source term of a convection-diffusion equation so that second-order corrections may be applied to a second-order exponential scheme. The basic Structure of the equations in the resulting fourth-order scheme is identical to that for the second order. Furthermore, the calculations are quite simple as the second-order corrections may be obtained in a single pass using a second-order scheme. For one to three dimensions, the fourth-order exponential scheme is unconditionally stable. As examples, the method is applied to Burgers' and other fluid mechanics problems. Compared with schemes normally used, the accuracies are found to be good and the method is applicable to regions with large gradients.

Cabaret finite-difference schemes for the one-dimensional Euler equations

In the present paper we consider second order compact upwind schemes with a space split time derivative (CABARET) applied to one-dimensional compressible gas flows. As opposed to the conventional approach associated with incorporating adjacent space cells we use information from adjacent time layer to improve the solution accuracy. Taking the first order Roe scheme as the basis we develop a few higher (i.e. second within regions of smooth solutions) order accurate difference schemes. One of them (CABARET3) is formulated in a two-time-layer form, which makes it most simple and robust. Supersonic and subsonic shock-tube tests are used to compare the new schemes with several well-known second-order TVD schemes. In particular, it is shown that CABARET3 is notably more accurate than the standard second-order Roe scheme with MUSCL flux splitting.