• Journal of applied mathematics & informatics
• /
• v.16 no.1_2
• /
• pp.483-488
• /
• 2004

Results on the analytic behavior of the limiting spectral distribution of large dimensional random matrices, studied in Marcenko and Pastur [2], are derived. Using the Stieltjes transform, it is shown that the limiting distribution has a continuous derivative away from zero, the derivative being analytic whenever it is positive [3]. In the present paper, it is derived that the behavior of it resembles the behavior of a square root function near the boundary of its support.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.5
• /
• pp.2468-2483
• /
• 2017

The construction of completely random sensing matrices of Compressive Sensing requires a large number of random numbers while that of deterministic sensing operators often needs complex mathematical operations. Thus both of them have difficulty in acquiring large signals efficiently. This paper focuses on the enhancement of the practicability of the structurally random matrices and proposes a semi-deterministic sensing matrix called Partial Kronecker product of Identity and Hadamard (PKIH) matrix. The proposed matrix can be viewed as a sub matrix of a well-structured, sparse, and orthogonal matrix. Only the row index is selected at random and the positions of the entries of each row are determined by a deterministic sequence. Therefore, the PKIH significantly decreases the requirement of random numbers, which has a complex generating algorithm, in matrix construction and further reduces the complexity of sampling. Besides, in order to process large signals, the corresponding fast sampling algorithm is developed, which can be easily parallelized and realized in hardware. Simulation results illustrate that the proposed sensing matrix maintains almost the same performance but with at least 50% less random numbers comparing with the popular sampling matrices. Meanwhile, it saved roughly 15%-35% processing time in comparison to that of the SRM matrices.

• Communications of the Korean Mathematical Society
• /
• v.18 no.3
• /
• pp.559-568
• /
• 2003

We introduce the notion of two-scale convergence for partial differential equations with random coefficients that gives a very efficient way of finding homogenized differential equations with random coefficients. For an application, we find the homogenized matrices for linear second order elliptic equations with random coefficients. We suggest a natural way of finding the two-scale limit of second order equations by considering the flux term.

• Journal of Communications and Networks
• /
• v.18 no.6
• /
• pp.892-901
• /
• 2016

In the multi-user multiple-input multiple-output (MIMO) system, orthogonal random beamforming (ORBF) scheme is proposed to serve multiple users simultaneously in order to achieve the multi-user diversity gain. The opportunistic space-division multiple access system (OSDMA-S) scheme performs multiple weighting matrices during the training phase and chooses the best weighting matrix to be used to broadcast data during the transmitting phase. The OSDMA-S scheme works better than the original ORBF by decreasing the inter-user interference during the transmitting phase. To save more time in the training phase, a partly random multiple weighting matrices selection scheme is proposed in this paper. In our proposed scheme, the Base Station does not need to use several unitary matrices to broadcast pilot symbol. Actually, only one broadcasting operation is needed. Each subscriber generates several virtual equivalent channels with a set of pre-saved unitary matrices and the channel status information gained from the broadcasting operation. The signal-to-interference and noise ratio (SINR) of each beam in each virtual equivalent channel is calculated and fed back to the base station for the weighting matrix selection and multi-user scheduling. According to the theoretical analysis, the proposed scheme relatively expands the transmitting phase and reduces the interactive complexity between the Base Station and subscribers. The asymptotic analysis and the simulation results show that the proposed scheme improves the throughput performance of the multi-user MIMO system.

• Structural Engineering and Mechanics
• /
• v.4 no.3
• /
• pp.277-301
• /
• 1996

A finite element model of a beam element with flexible connections is used to investigate the effect of the randomness in the stiffness values on the modal properties of the structural system. The linear behavior of the connections is described by a set of random fixity factors. The element mass and stiffness matrices are function of these random parameters. The associated eigenvalue problem leads to eigenvalues and eigenvectors which are also random variables. A second order perturbation technique is used for the solution of this random eigenproblem. Closed form expressions for the 1st and 2nd order derivatives of the element matrices with respect to the fixity factors are presented. The mean and the variance of the eigenvalues and vibration modes are obtained in terms of these derivatives. Two numerical examples are presented and the results are validated with those obtained by a Monte-Carlo simulation. It is found that an almost linear statistical relation exists between the eigenproperties and the stiffness of the connections.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2497-2517
• /
• 2020

For compressed sensing (CS) applications, it is significant to construct deterministic measurement matrices with good practical features, including good sensing performance, low memory cost, low computational complexity and easy hardware implementation. In this paper, a deterministic construction method of bipolar measurement matrices is presented based on binary sequence family (BSF). This method is of interest to be applied for sparse signal restore and image block CS. Coherence is an important tool to describe and compare the performance of various sensing matrices. Lower coherence implies higher reconstruction accuracy. The coherence of proposed measurement matrices is analyzed and derived to be smaller than the corresponding Gaussian and Bernoulli random matrices. Simulation experiments show that the proposed matrices outperform the corresponding Gaussian, Bernoulli, binary and chaotic bipolar matrices in reconstruction accuracy. Meanwhile, the proposed matrices can reduce the reconstruction time compared with their Gaussian counterpart. Moreover, the proposed matrices are very efficient for sensing performance, memory, complexity and hardware realization, which is beneficial to practical CS.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.465-474
• /
• 1998

Results on the analytic behavior to the limiting spectral distribution of matrices of sample convariance type. studied in Marcenko and Pastur [2] are derived. using the Stieltjes transform it is shown that the limiting distrbution has a continuous derivative away from zero the derivative being analytic whenever it is positive and the behavior of it resembles the behavior of a square root function near the boundary of its support.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.55-64
• /
• 2000

We propose a criterion for testing homogeneity of matrix intraclass covariance matrices of K multivariate normal populations, It is based on a variable transformation intended to propose and develop a likelihood ratio criterion that makes use of properties of eigen structures of the matrix intraclass covariance matrices. The criterion then leads to a simple test that uses an asymptotic distribution obtained from Box's (1949) theorem for the general asymptotic expansion of random variables.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.515-521
• /
• 2010

In multivariate analysis, the inversion formula of the Stieltjes transform is used to find the density of a spectral distribution of random matrices of sample covariance type. Let $B_n\;=\;\frac{1}{N}Y_nY_n^TT_n$ where $Y_n\;=\;[Y_{ij}]_{n\;{\times}\;N}$ is with independent, identically distributed entries and $T_n$ is an $n\;{\times}\;n$ symmetric non-negative definite random matrix independent of the $Y_{ij}$'s. In the present paper, using the inversion formula of the Stieltjes transform, we will find that the limiting distribution of $B_n$ has a continuous density function away from zero.

• Journal of the Chungcheong Mathematical Society
• /
• v.22 no.3
• /
• pp.519-524
• /
• 2009

In multivariate analysis, the inversion formula of the Stieltjes transform is used to find the density of a spectral distribution of random matrices of sample covariance type. Let $B_{n}\;=\;\frac{1}{n}Y_{m}^{T}T_{m}Y_{m}$ where $Ym\;=\;[Y_{ij}]_{m{\times}n}$ is with independent, identically distributed entries and $T_m$ is an $m{\times}m$ symmetric nonnegative definite random matrix independent of the $Y_{ij}{^{\prime}}s$. In the present paper, using the inversion formula of the Stieltjes transform, we will find the density function of the limiting distribution of $B_n$ away from zero.