A globally convergent Newton method for solving strongly monotone variational inequalities

Variational inequality problems have been used to formulate and study equilibrium problems, which arise in many fields including economics, operations research and regional sciences. For solving variational inequality problems, various iterative methods such as projection methods and the nonlinear Jacobi method have been developed. These methods are convergent to a solution under certain conditions, but their rates of convergence are typically linear. In this paper we propose to modify the Newton method for variational inequality problems by using a certain differentiable merit function to determine a suitable step length. The purpose of introducing this merit function is to provide some measure of the discrepancy between the solution and the current iterate. It is then shown that, under the strong monotonicity assumption, the method is globally convergent and, under some additional assumptions, the rate of convergence is quadratic. Limited computational experience indicates the high efficiency of the proposed method.     

The Clock Paradox in a Static Homogeneous Gravitational Field1

The gedanken experiment of the clock paradox is solved exactly using the general relativistic equations for a static homogeneous gravitational field. We demonstrate that the general and special relativistic clock paradox solutions are identical and in particular that they are identical for finite acceleration. Practical expressions are obtained for proper time and coordinate time by using the destination distance as the key observable parameter. This solution provides a formal demonstration of the identity between the special and general relativistic clock paradox with finite acceleration and where proper time is assumed to be the same in both formalisms. By solving the equations of motion for a freely falling clock in a static homogeneous field elapsed times are calculated for realistic journeys to the stars. ¹ Both authors contributed equally to this paper.     

A New Family of Cyclic Difference Sets with Singer Parameters in Characteristic Three

We construct a new family of cyclic difference sets with parameters ((3 ^d – 1)/2, (3 ^{d – 1} – 1)/2, (3 ^{d – 2} – 1)/2) for each odd d. The difference sets are constructed with certain maps that form Jacobi sums. These new difference sets are similar to Maschietti's hyperoval difference sets, of the Segre type, in characteristic two. We conclude by calculating the 3-ranks of the new difference sets.     

Hyers–Ulam–Rassias stability of Cauchy equation in the space of Schwartz distributions

We reformulate and prove the Hyers–Ulam–Rassias stability of Cauchy equation in the space of Schwartz tempered distributions and Fourier hyperfunctions.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

The Chaotic Mixmaster and the Suppression of Chaos in Scalar–Tensor Cosmologies

We show that there is a threshold in energy for the onset of chaos in cosmology for the Universe described as a dynamical system derived from the Einstein equations of General Relativity (GR). In the case of the mixmaster model (homogeneous and anisotropic cosmology with a Bianchi IX metric), the chaos occurs precisely at the prescribed necessary value H _vac=0 of the GR for the energy of the Universe while the system is found to be regular for H<0 and chaotic for H>0 with respect to its pure vacuum part. In the case of generalized scalar tensor theories within the Bianchi IX model, we show using the ADM formalism and a conformal transformation that the energy of the dynamical system as compared to vacuum lies below the zero energy threshold. The system is thus not exhibiting chaos and the conclusion still holds in the presence of ordinary matter as well. The suppression of chaos occurs in a similar way for stiff matter alone.     

一般线性模型下方差最小范数二次无偏估计的稳健性

本文给出了一般线性模型下,由最小二乘得到的方差估计与最小范数二次无偏估计相等的充分必要条件,并且当Gauss-Markov估计与最小二乘估计相等时,可以得到一个简单的等价条件。     

可交换随机变量序列的随机极限定理

本文讨论了可交换随机变量序列{X_n:n≥1}的极限定理,得到了可交换随机变量序列的随机强大数律及加权和定理,并推广了文[4]中的结果.     

On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.

     

Partial sums of hypergeometric series of unit argument

The asymptotic behaviour of partial sums of generalized hypergeometric series of unit argument is investigated.