The influence of random number generators on graph partitioning algorithms.
The instability of some gradient methods for ill-posed problems.
The integral wavelet transform in weighted Sobolev spaces.
The Interaction Between instability and Local Truncation Error Estimate for Predictor - Corrector Methods
The interplay between classical analysis and (numerical) linear algebra -- a tribute to Gene H. Golub.
The intervals of stability of Runge-Kutta methods after Richardson extrapolation
The inverse of the star-discrepancy depends linearly on the dimension
The inversion of cyclic tridiagonal matrices
The invertibility of the isoparametric mappings for triangular quadratic Lagrange finite elements
A reference triangular quadratic Lagrange finite element consists of a right triangle with unit legs , , a local space of quadratic polynomials on and of parameters relating the values in the vertices and midpoints of sides of to every function from . Any isoparametric triangular quadratic Lagrange finite element is determined by an invertible isoparametric mapping . We explicitly describe such invertible isoparametric mappings for which the images , of the segments , are segments,...
The investigation of the stability of the multistep method for the operator valued abstract parabolic equation with the use of associative polynomials.
The investigation of the transient regimes in the nonlinear systems by the generalized classical method.
The island model as a Markov dynamic system
Parallel multi-deme genetic algorithms are especially advantageous because they allow reducing the time of computations and can perform a much broader search than single-population ones. However, their formal analysis does not seem to have been studied exhaustively enough. In this paper we propose a mathematical framework describing a wide class of island-like strategies as a stationary Markov chain. Our approach uses extensively the modeling principles introduced by Vose, Rudolph and their collaborators....
The iteration process for the nonlinear two-dimensional oscillation problem.
The Kendall theorem and its application to the geometric ergodicity of Markov chains
We give an improved quantitative version of the Kendall theorem. The Kendall theorem states that under mild conditions imposed on a probability distribution on the positive integers (i.e. a probability sequence) one can prove convergence of its renewal sequence. Due to the well-known property (the first entrance last exit decomposition) such results are of interest in the stability theory of time-homogeneous Markov chains. In particular this approach may be used to measure rates of convergence of...
The Kolmogorov-Smirnov distance as criterion of choice of estimators with application to the first order auto-regressive case : a Monte Carlo study
The -optimal convolving functions in reconstruction convolution algorithms
The labeling method on two-dimensional networks
The Lattice Structure of Nonlinear Congruential Pseudorandom Numbers.
The Lazy Travelling Salesman Problem in
We study a parameter (σ) dependent relaxation of the Travelling Salesman Problem on . The relaxed problem is reduced to the Travelling Salesman Problem as 0. For increasing σ it is also an ordered clustering algorithm for a set of points in . A dual formulation is introduced, which reduces the problem to a convex optimization, provided the minimizer is in the domain of convexity of the relaxed functional. It is shown that this last condition is generically satisfied, provided σ is large enough. ...
The link between Schröder's iteration methods of the first and second kind.