Semiconvergence in distribution of random closed sets with application to random optimization problems

The paper considers upper semicontinuous behavior in distribution of sequences of random closed sets. Semiconvergence in distribution will be described via convergence in distribution of random variables with values in a suitable topological space. Convergence statements for suitable functions of random sets are proved and the results are employed to derive stability statements for random optimization problems where the objective function and the constraint set are approximated simultaneously. The author is grateful to two anonymous referees for helpful suggestions.     

Error estimation,adaptivity and data transfer in enriched plasticity continua to analysis of shear band localization

In this paper, an adaptive FE analysis is presented based on error estimation, adaptive mesh refinement and data transfer for enriched plasticity continua in the modelling of strain localization. As the classical continuum models suffer from pathological mesh-dependence in the strain softening models, the governing equations are regularized by adding rotational degrees-of-freedom to the conventional degrees-of-freedom. Adaptive strategy using element elongation is applied to compute the distribution of required element size using the estimated error distribution. Once a new mesh is generated, state variables and history-dependent variables are mapped from the old finite element mesh to the new one. In order to transfer the history-dependent variables from the old to new mesh, the values of internal variables available at Gauss point are first projected at nodes of old mesh, then the values of the old nodes are transferred to the nodes of new mesh and finally, the values at Gauss points of new elements are determined with respect to nodal values of the new mesh. Finally, the efficiency of the proposed model and computational algorithms is demonstrated by several numerical examples.     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

A Note on Cactus Trees: Variational vs. Recursive Approach

In this article we deal with the variational approach to cactus trees (Husimi trees) and the more common recursive approach, that are in principle equivalent for finite systems. We discuss in detail the conditions under which the two methods are equivalent also in the analysis of infinite (self-similar) cactus trees, usually investigated to the purpose of approximating ordinary lattice systems. Such issue is hardly ever considered in the literature. We show (on significant test models) that the phase diagram and the thermodynamic quantities computed by the variational method, when they deviates from the exact bulk properties of the cactus system, generally provide a better approximation to the behavior of a corresponding ordinary system. Generalizing a property proved by Kikuchi, we also show that the numerical algorithm usually employed to perform the free energy minimization in the variational approach is always convergent.     

Determining radii of meromorphy via orthogonal polynomials on the unit circle

Using a convergence theorem for Fourier–Padé approximants constructed from orthogonal polynomials on the unit circle, we prove an analogue of Hadamard's theorem for determining the radius of m-meromorphy of a function analytic on the unit disk and apply this to the location of poles of the reciprocal of Szeg functions.     

Direct and inverse estimates for a new family of linear positive operators

In the present paper we introduce a new family of linear positive operators and study some direct and inverse results in simultaneous approximation.     

Proximality and Chebyshev sets

This paper is a companion to a lecture given at the Prague Spring School in Analysis in April 2006. It highlights four distinct variational methods of proving that a finite dimensional Chebyshev set is convex and hopes to inspire renewed work on the open question of whether every Chebyshev set in Hilbert space is convex.     

A new alternating‐direction finite element method for hyperbolic equation

A modified backward difference time discretization is presented for Galerkin approximations for nonlinear hyperbolic equation in two space variables. This procedure uses a local approximation of the coefficients based on patches of finite elements with these procedures, a multidimensional problem can be solved as a series of one‐dimensional problems. Optimal order H₀¹ and L² error estimates are derived. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

系综分布和它的小涨落近似

由“从正则分布出发，在小涨落近似下得出的能量涨落分布公式”求得的能量涨落的二次矩与直接由正则分布求得的二次矩完全相同，但分别由二求得的高次矩并不完全相同。