Numerical Methods of Multifractal Analysis in Information Communication Systems and Networks

In this chapter, the main principles of the theory of fractals and multifractals are stated. A singularity spectrum is introduced for the random telecommunication traffic, concepts of fractal dimensions and scaling functions, and methods used in their determination by means of Wavelet Transform Modulus Maxima (WTMM) are proposed. Algorithm development methods for estimating multifractal spectrum are presented. A method based on multifractal data analysis at network layer level by means of WTMM is proposed for the detection of traffic anomalies in computer and telecommunication networks. The chapter also introduces WTMM as the informative indicator to exploit the distinction of fractal dimen- sions on various parts of a given dataset. A novel approach based on the use of multifractal spectrum parameters is proposed for estimating queuing performance for the generalized multifractal traffic on the input of a buffering device. It is shown that the multifractal character of traffic has significant impact on queuing performance characteristics

Numerical Methods for Quasicrystals

Quasicrystals are one kind of space-filling structures. The traditional crystalline approximant method utilizes periodic structures to approximate quasicrystals. The errors of this approach come from two parts: the numerical discretization, and the approximate error of Simultaneous Diophantine Approximation which also determines the size of the domain necessary for accurate solution. As the approximate error decreases, the computational complexity grows rapidly, and moreover, the approximate error always exits unless the computational region is the full space. In this work we focus on the development of numerical method to compute quasicrystals with high accuracy. With the help of higher-dimensional reciprocal space, a new projection method is developed to compute quasicrystals. The approach enables us to calculate quasicrystals rather than crystalline approximants. Compared with the crystalline approximant method, the projection method overcomes the restrictions of the Simultaneous Diophantine Approximation, and can also use periodic boundary conditions conveniently. Meanwhile, the proposed method efficiently reduces the computational complexity through implementing in a unit cell and using pseudospectral method. For illustrative purpose we work with the Lifshitz-Petrich model, though our present algorithm will apply to more general systems including quasicrystals. We find that the projection method can maintain the rotational symmetry accurately. More significantly, the algorithm can calculate the free energy density to high precision.Comment: 27 pages, 8 figures, 6 table

Numerical Methods for Multilattices

Among the efficient numerical methods based on atomistic models, the quasicontinuum (QC) method has attracted growing interest in recent years. The QC method was first developed for crystalline materials with Bravais lattice and was later extended to multilattices (Tadmor et al, 1999). Another existing numerical approach to modeling multilattices is homogenization. In the present paper we review the existing numerical methods for multilattices and propose another concurrent macro-to-micro method in the numerical homogenization framework. We give a unified mathematical formulation of the new and the existing methods and show their equivalence. We then consider extensions of the proposed method to time-dependent problems and to random materials.Comment: 31 page

Numerical Stability of Lanczos Methods

The Lanczos algorithm for matrix tridiagonalisation suffers from strong numerical instability in finite precision arithmetic when applied to evaluate matrix eigenvalues. The mechanism by which this instability arises is well documented in the literature. A recent application of the Lanczos algorithm proposed by Bai, Fahey and Golub allows quadrature evaluation of inner products of the form $\psi^\dagger g(A) \psi$. We show that this quadrature evaluation is numerically stable and explain how the numerical errors which are such a fundamental element of the finite precision Lanczos tridiagonalisation procedure are automatically and exactly compensated in the Bai, Fahey and Golub algorithm. In the process, we shed new light on the mechanism by which roundoff error corrupts the Lanczos procedureComment: 3 pages, Lattice 99 contributio