The nearest neighbor random walk on subspaces of a vector space and rate of convergence

LetX be the collection ofk-dimensional subspaces of ann-dimensional vector spaceV _n overGF(q). A metric may be defined onX by letting

粘塑性损伤模型模拟准超塑性单轴拉伸行为

发展了Chaboche粘塑性本构模型的大变形隐式算法，用损伤(DM)和无损伤(NDM)模型模拟准超塑性单轴拉伸。发现变形过程可分为三个阶段：均匀变形、颈缩发展、断裂破坏阶段。DM可准确模拟前两个阶段变形，NDM只能较好地模拟均匀变形阶段，表明DM可以较精确地描述稳定发展的动态过程。由于有限元方法只能描述连续介质，因此对于断裂破坏阶段，NDM模拟载荷大于试验结果，DM的载荷小于试验结果，这是由高应变速率敏感性造成。DM能够描述试验中出现地多处颈缩现象，局部应变速率分布随时间演化反映了颈缩发展程度。严重颈缩部位的距离代表着超塑性变形能力，距离越大，抗颈缩能力越好。     

Old and new from SOR

From the long history of Successive Over Relaxation (SOR) between the end of second world war and today three points are considered: (1) Classical results of Young and Varga are described. (2) It is shown how results on semiiterative methods can be used to derive these classical results in a unifying way and to compare SOR with other iterative methods. (3) In the last 15 years the application of SOR to compute the stationary distribution of a homogeneous Markov chain has been discussed. These results are reported, considering especially the term extended convergence introduced by Kontovasilis, Plemmons and Stewart.     

Twin solutions to singular boundary value problems

In this paper we establish the existence of two nonnegative solutions to singular and singular focal boundary value problems. Our nonlinearity may be singular at , and/or .

     

Die Berechnung von Einelektronen-Integralen in der SCF-Xα-SW-Methode: I. Die Normierung

A normalization of the wave functions by means of the theoretical exact Multiple-Scattering-(MS)-formalism is discussed within the framework of the SCF-X-SW-method. For the atomic and extramolecular regions the integrals of normalization can be easily determined and the results can be described by the corresponding electronic charges. The calculation of the integral of the interatomic region is problematic. The needful volume integration is only necessary to theGreen's functions of the wave functions and can be solved by means of the residual theory. The further analytical calculation of the surface integrals leads to a complicated formalism which can be numerically evaluated.

     

Global existence for systems of wave equations with nonresonant nonlinearities and null forms

We consider the Cauchy problem for systems of nonlinear wave equations with different propagation speeds in three space dimensions. We prove global existence of small amplitude solutions for systems with some nonresonant nonlinearities which may depend on both of the unknowns and their derivatives. Our method here can be also adopted to treat the null forms.     

Multiple Wilson and Jacobi–Piñeiro polynomials

We introduce multiple Wilson polynomials, which give a new example of multiple orthogonal polynomials (Hermite–Padé polynomials) of type II. These polynomials can be written as a Jacobi–Piñeiro transform, which is a generalization of the Jacobi transform for Wilson polynomials, found by Koornwinder. Here we need to introduce Jacobi and Jacobi–Piñeiro polynomials with complex parameters. Some explicit formulas are provided for both Jacobi–Piñeiro and multiple Wilson polynomials, one of them in terms of Kampé de Fériet series. Finally, we look at some limiting relations and construct a part of a multiple AT-Askey table.     

Discrete time Markov chains with interval probabilities

The parameters of Markov chain models are often not known precisely. Instead of ignoring this problem, a better way to cope with it is to incorporate the imprecision into the models. This has become possible with the development of models of imprecise probabilities, such as the interval probability model. In this paper we discuss some modelling approaches which range from simple probability intervals to the general interval probability models and further to the models allowing completely general convex sets of probabilities. The basic idea is that precisely known initial distributions and transition matrices are replaced by imprecise ones, which effectively means that sets of possible candidates are considered. Consequently, sets of possible results are obtained and represented using similar imprecise probability models.We first set up the model and then show how to perform calculations of the distributions corresponding to the consecutive steps of a Markov chain. We present several approaches to such calculations and compare them with respect to the accuracy of the results. Next we consider a generalisation of the concept of regularity and study the convergence of regular imprecise Markov chains. We also give some numerical examples to compare different approaches to calculations of the sets of probabilities.     

Relative asymptotic of multiple orthogonal polynomials for Nikishin systems

We prove the relative asymptotic behavior for the ratio of two sequences of multiple orthogonal polynomials with respect to the Nikishin systems of measures. The first Nikishin system is such that for each k, σ_k has a constant sign on its compact support consisting of an interval , on which almost everywhere, and a discrete set without accumulation points in . If denotes the smallest interval containing , we assume that Δ_k∩Δ_k+1=0/, k=1,…,m−1. The second Nikishin system is a perturbation of the first by means of rational functions r_k, k=1,…,m, whose zeros and poles lie in .     

Average-optimal string matching

The exact string matching problem is to find the occurrences of a pattern of length m from a text of length n symbols. We develop a novel and unorthodox filtering technique for this problem. Our method is based on transforming the problem into multiple matching of carefully chosen pattern subsequences. While this is seemingly more difficult than the original problem, we show that the idea leads to very simple algorithms that are optimal on average. We then show how our basic method can be used to solve multiple string matching as well as several approximate matching problems in average optimal time. The general method can be applied to many existing string matching algorithms. Our experimental results show that the algorithms perform very well in practice.