Seasonal Rainfall Prediction Using the Matrix Decomposition Method

Author(s):  
Hideo Hirose ◽  
Junaida Binti Sulaiman ◽  
Masakazu Tokunaga
Author(s):  
A. M. Krot ◽  
U. A. Sychou

The scope of this work are electric circuits or electronic devices with chaotic regimes, in particular the Chua’s circuit. A nonlinear analysis of chaotic attractors based on the Krot’s method of matrix decomposition of vector functions in state-space of complex systems has been used to investigate the Chua’s circuit with smooth nonlinearity. It includes an analysis of linear term of the matrix series as well as an estimation of influence of high order terms of this series on stability of complex system under investigation. Here the method of matrix decomposition has been applied to analysis of the Chua’s attractor. The terms of matrix series have been used to create a simulation model and to reconstruct an attractor of chaotic modes. The proposed simulation model makes it possible to separate an influence of nonlinearities on forming a chaotic regime of the Chua’s circuit. Usage of both the matrix decomposition method and computational experiment has allowed us to find out that the initial turbulence model proposed by L. D. Landau is suitable for set-up description of the chaotic regime of the Chua’s circuit. It is shown that a mode of hard self-excitation in the Chua’s circuit leads to its chaotic regime operating with a double-scroll attractor in the state-space. The results might be used to generate of chaotic oscillations or data encryption. 


1991 ◽  
Vol 124 (1) ◽  
pp. K11-K14 ◽  
Author(s):  
C. Dos Santos Lourenço ◽  
M. Cilense ◽  
W. Garlipp

Author(s):  
Mariacarla Gonzalez ◽  
Razvigor Ossikovski ◽  
Tatiana Novikova ◽  
Jessica Ramella-Roman

Author(s):  
David Barber

Finding clusters of well-connected nodes in a graph is a problem common to many domains, including social networks, the Internet and bioinformatics. From a computational viewpoint, finding these clusters or graph communities is a difficult problem. We use a clique matrix decomposition based on a statistical description that encourages clusters to be well connected and few in number. The formal intractability of inferring the clusters is addressed using a variational approximation inspired by mean-field theories in statistical mechanics. Clique matrices also play a natural role in parametrizing positive definite matrices under zero constraints on elements of the matrix. We show that clique matrices can parametrize all positive definite matrices restricted according to a decomposable graph and form a structured factor analysis approximation in the non-decomposable case. Extensions to conjugate Bayesian covariance priors and more general non-Gaussian independence models are briefly discussed.


2010 ◽  
Author(s):  
G. K. Er ◽  
S. W. Lan ◽  
V. P. Iu ◽  
Jane W. Z. Lu ◽  
Andrew Y. T. Leung ◽  
...  

2017 ◽  
Vol 2017 ◽  
pp. 1-8 ◽  
Author(s):  
Xiao-min Chen ◽  
Jun-xu Su ◽  
Qiu-ming Zhu ◽  
Xu-jun Hu ◽  
Zhu Fang

The aim of this paper is to investigate a linear precoding scheme design for a multiple-input multiple-output two-way relay system with imperfect channel state information. The scheme design is simplified as an optimal problem with precoding matrix variables, which is deduced with the maximum power constraint at the relay station based on the minimum mean square error criterion. With channel feedback delay at both ends of the channel and the channel estimation errors being taken into account, we propose a matrix decomposition scheme and a joint iterative scheme to minimize the average sum mean square error. The matrix decomposition method is used to derive the closed form of the relay matrix, and the joint iterative algorithm is used to optimize the precoding matrix and the processing matrix. According to numerical simulation results, the matrix decomposition scheme reduces the system bit error rate (BER) effectively and the joint iterative scheme achieves the best performance of BER against existing methods.


2019 ◽  
Vol 35 (22) ◽  
pp. 4748-4753 ◽  
Author(s):  
Ahmad Borzou ◽  
Razie Yousefi ◽  
Rovshan G Sadygov

Abstract Motivation High throughput technologies are widely employed in modern biomedical research. They yield measurements of a large number of biomolecules in a single experiment. The number of experiments usually is much smaller than the number of measurements in each experiment. The simultaneous measurements of biomolecules provide a basis for a comprehensive, systems view for describing relevant biological processes. Often it is necessary to determine correlations between the data matrices under different conditions or pathways. However, the techniques for analyzing the data with a low number of samples for possible correlations within or between conditions are still in development. Earlier developed correlative measures, such as the RV coefficient, use the trace of the product of data matrices as the most relevant characteristic. However, a recent study has shown that the RV coefficient consistently overestimates the correlations in the case of low sample numbers. To correct for this bias, it was suggested to discard the diagonal elements of the outer products of each data matrix. In this work, a principled approach based on the matrix decomposition generates three trace-independent parts for every matrix. These components are unique, and they are used to determine different aspects of correlations between the original datasets. Results Simulations show that the decomposition results in the removal of high correlation bias and the dependence on the sample number intrinsic to the RV coefficient. We then use the correlations to analyze a real proteomics dataset. Availability and implementation The python code can be downloaded from http://dynamic-proteome.utmb.edu/MatrixCorrelations.aspx. Supplementary information Supplementary data are available at Bioinformatics online.


Sign in / Sign up

Export Citation Format

Share Document