In this paper a new approach to the modelling of ATM-traffic is proposed. The traffic is measured and characterised by its first and second order statistic moments. A Markov Modulated Poisson Process (MMPP) is used to capture the information in these two stochastic moments. Instead of a general MMPP, a circulant MMPP is used to reduce the computational cost. A circulant MMPP (CMMPP) is an MMPP ...

In the literature, there exist several studies on symbol-based multigrid methods for solution of linear systems having structured coefficient matrices. particular, convergence analysis such has been obtained in an elegant form case Toeplitz matrices generated by a scalar-valued function. block-Toeplitz setting, that is, where matrix entries are small generic instead scalars, some algorithms hav...

We introduce the class of skew-circulant lattice rules. These are s-dimensional lattice rules that may be generated by the rows of an s×s skewcirculant matrix. (This is a minor variant of the familiar circulant matrix.) We present briefly some of the underlying theory of these matrices and rules. We are particularly interested in finding rules of specified trigonometric degree d. We describe so...

Structural symmetries in the storage ring of synchrotrons are intentionally created during design phase magnetic lattices, but they not considered control algorithms that stabilize beam accelerated particles. The choice algorithm, however, is limited by speed requirements synchrotron. Standard for based on a singular value decomposition (SVD) orbit response matrix. SVD controllers neither explo...

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inve...

The permanent of an n x n matrix A = (a;j) is the matrix function ( 1) per A = ∑ al1r(1)••• a .. ",( .. )".C~" where the summation is over all permutations in the symmetric group, S ... An n x n matrix A is a circulant if there are scalars ab ... ,a,. such that (2) A= ∑ a;pi-l where P is the n x n permutation matrix corresponding to the cycle (12• .. n) in s". In general the computation of the ...

In the second part of this paper we study condition numbers with respect to componentwise perturbations in the input data for linear systems and for matrix inversion, and the distance to the nearest singular matrix. The structures under investigation are linear structures, namely symmetric, persymmetric, skewsymmetric, symmetric Toeplitz, general Toeplitz, circulant, Hankel, and persymmetric Ha...

A) , (L J regular QC-LDPC code of length N is defined by a parity-check matrix L L p I p I p I p I p I p I p I p I p I H     (1) where 1 1    J j , 1 1    L l and   l j p I , represents the p p  circulant permutation matrix obtained by cyclically right-shifting the p p  identity matrix   0 I by l j p , positions, with. / L N p  For a specific QC-LDPC code we define the correspo...

It is known that extremal doubly-even self-dual codes of length n ≡ 8 or 0 (mod 24) yield 3or 5-designs respectively. In this paper, by using the generator matrices of bordered double circulant doubly-even self-dual codes, we give 3-(n, k; m)-SEEDs with (n, k, m) ∈ {(32, 8, 5), (56, 12, 9), (56, 16, 9), (56, 24, 9), (80, 16, 52)}. With the aid of computer, we obtain 22 generator matrices of bor...

As part of a survey of state-of-the-art kernel approximation algorithms, we present a new sampling algorithm for circulant matrix construction to perform fast kernel matrix inversion in kernel ridge regression, comparing theoretical and experimental performance of that of multilevel circulant kernel approximation, incomplete Cholesky decomposition, and random features, all recent advances in th...