 |
 |
 |
Journal articles
Algorithmic Probability Method Versus Kolmogorov Complexity with No-Threshold Encoding Scheme for Short Time Series: An Analysis of Day-To-Day Hourly Solar Radiation Time Series over Tropical Western Indian Ocean
Abstract : The complexity of solar radiation fluctuations received on the ground is nowadays of great interest for solar resource in the context of climate change and sustainable development. Over tropical maritime area, there are small inhabited islands for which the prediction of the solar resource at the daily and infra-daily time scales are important to optimize their solar energy systems. Recently, studies show that the theory of the information is a promising way to measure the solar radiation intermittency. Kolmogorov complexity (KC) is a useful tool to address the question of predictability. Nevertheless, this method is inaccurate for small time series size. To overcome this drawback, a new encoding scheme is suggested for converting hourly solar radiation time series values into a binary string for calculation of Kolmogorov complexity (KC-ES). To assess this new approach, we tested this method using the 2004-2006 satellite hourly solar data for the western part of the Indian Ocean. The results were compared with the algorithmic probability (AP) method which is used as the benchmark method to compute the complexity for short string. These two methods are a new approach to compute the complexity of short solar radiation time series. We show that KC-ES and AP methods give comparable results which are in agreement with the physical variability of solar radiation. During the 2004-2006 period, an important interannual SST (sea surface temperature) anomaly over the south of Mozambique Channel encounters in 2005, a strong MJO (Madden-Julian oscillation) took place in May 2005 over the equatorial Indian Ocean, and nine tropical cyclones crossed the western part of the Indian Ocean in 2004-2005 and 2005-2006 austral summer. We have computed KC-ES of the solar radiation time series for these three events. The results show that the Kolmogorov complexity with suggested encoding scheme (KC-ES) gives competitive measure of complexity in regard to the AP method also known as Solomonoff probability.
Cited literature [44 references]
https://hal.univ-reunion.fr/hal-02987984
Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Wednesday, November 4, 2020 - 1:09:07 PM
Last modification on : Wednesday, November 3, 2021 - 4:28:50 AM
Long-term archiving on: : Friday, February 5, 2021 - 6:27:07 PM
Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Wednesday, November 4, 2020 - 1:09:07 PM
Last modification on : Wednesday, November 3, 2021 - 4:28:50 AM
Long-term archiving on: : Friday, February 5, 2021 - 6:27:07 PM
File
entropy-21-00552.pdf
Publication funded by an institution