On the maximal domain of attraction of Tracy–Widom distribution for Gaussian unitary ensembles

The asymptotic distribution of the largest eigenvalue of various classes of random matrices has been shown to have the Tracy–Widom distribution. In this article, we prove that the standardised maximum of an independent and identically distributed sequence of random variables having the Tracy–Widom distribution arising from the Gaussian unitary ensemble belongs to the Gumbel domain of attraction.     

Clustering Visualizations of Multidimensional Data

Many graphical methods for displaying multivariate data consist of arrangements of multiple displays of one or two variables; scatterplot matrices and parallel coordinates plots are two such methods. In principle these methods generalize to arbitrary numbers of variables but become difficult to interpret for even moderate numbers of variables. This article demonstrates that the impact of high dimensions is much less severe when the component displays are clustered together according to some index of merit. Effectively, this clustering reduces the dimensionality and makes interpretation easier. For scatterplot matrices and parallel coordinates plots clustering of component displays is achieved by finding suitable permutations of the variables. I discuss algorithms based on cluster analysis for finding permutations, and present examples using various indices of merit.     

Equilibrium and stability analysis of delayed neural networks under parameter uncertainties

This paper proposes new results for the existence, uniqueness and global asymptotic stability of the equilibrium point for neural networks with multiple time delays under parameter uncertainties. By using Lyapunov stability theorem and applying homeomorphism mapping theorem, new delay-independent stability criteria are obtained. The obtained results are in terms of network parameters of the neural system only and therefore they can be easily checked. We also present some illustrative numerical examples to demonstrate that our result are new and improve corresponding results derived in the previous literature.     

The equivalence of generalized Hölder and Cesáro matrices

We show that the generalized Hölder and Cesáro matrices of order α > −1 are equivalent. We also show that the corresponding is true for doubly infinite generalized Hölder and Cesáro matrices.     

Transfer function identification from impulse response via a new set of orthogonal hybrid functions (HF)

The present work proposes a new set of hybrid functions (HF) which evolved from the synthesis of sample-and-hold functions (SHF) and triangular functions (TF). Traditional block pulse functions (BPF) still continue to be attractive to many researchers in the arena of control theory. Block pulse functions also gave birth to a few useful variants. Two such variants are SHF and TF. The former is efficient for analyzing sample-and-hold control systems, while triangular functions established their superiority in obtaining piecewise linear solution of various control problems. After developing the basic theory of HF, a few square integrable functions are approximated via this set in a piecewise linear manner. For such approximation, it is shown, the mean integral square error (MISE) is much less than block pulse function based approximation. The operational matrices for integration in HF domain are also derived. Finally, this new set is employed for solving identification problem from impulse response data. The results are compared with the solutions obtained via BPF, SHF, TF, etc. and many illustrations are presented.     

On Haar wavelet operational matrix of general order and its application for the numerical solution of fractional Bagley Torvik equation

In the present analysis, the motion of an immersed plate in a Newtonian fluid described by Torvik and Bagley’s fractional differential equation [1] has been considered. This Bagley Torvik equation has been solved by operational matrix of Haar wavelet method. The obtained result is compared with analytical solution suggested by Podlubny [2]. Haar wavelet method is used because its computation is simple as it converts the problem into algebraic matrix equation.     

Three-level parallel J-Jacobi algorithms for Hermitian matrices

The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal load balancing between all available processors/cores is obtained. A similar blocking technique can be used to exploit local cache memory of each processor to further speed up the process. Due to diversity of modern computer architectures, each of the algorithms described here may be the method of choice for a particular hardware and a given matrix size. All proposed block algorithms compute the eigenvalues with relative accuracy similar to the original non-blocked Jacobi algorithm.     

Logarithms of iteration matrices, and proof of a conjecture by Shadrin and Zvonkine

A proof of a conjecture by Shadrin and Zvonkine, relating the entries of a matrix arising in the study of Hurwitz numbers to a certain sequence of rational numbers, is given. The main tools used are iteration matrices of formal power series and their (matrix) logarithms.     

Linear relations of refined enumerations of alternating sign matrices

In recent papers we have studied refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows. The present paper is a first step towards extending these considerations to alternating sign matrices where in addition some left and right columns are fixed. The main result is a simple linear relation between the number of n×n alternating sign matrices where the top row as well as the left and the right column is fixed and the number of n×n alternating sign matrices where the two top rows and the bottom row are fixed. This may be seen as a first indication for the fact that the refined enumerations of alternating sign matrices with respect to a fixed set of top and bottom rows as well as left and right columns can possibly be reduced to the refined enumerations where only some top and bottom rows are fixed. For the latter numbers we provide a system of linear equations that conjecturally determines them uniquely.