| Parallel solutions of correlation dimension calculation |
| |
| 作者姓名： | 蒋廷耀 李庆华 |
| |
| 作者单位： | Coll .of Electrical Engineering and Information Technology，China Three Gorges Univ，Coll .of Computer Science and Technology，Huazhong Univ .of Science and Technology Yichang 443000，P. R. China，Coll .of Computer Science and Technology，Huazhong Univ .of Science and Technology，Wuhan 430074，P. R. China，Wuhan 430074，P. R. China |
| |
| 基金项目： | This project was supported by the National Natural Science Foundation of China(60273075) . |
| |
| 摘 要： | 1 .INTRODUCTIONIn the recent decades ,the fractals1]has found manyi mportant applicationsinthe field of biology,geogra-phy, physics , graphics and so on. It has excellentperformance in describing the actual living phe-nomenon that is unstable ,irregular ,and complexity,such as ti mes series of chaotic signs . The calculationof correlation di mensionis a key probleminfractal di-mension2 ,3]. The standard solution of correlation di-mension calculation requiresO( N2)ti me , whereNis numbe…
|
Parallel solutions of correlation dimension calculation |
| |
| Jiang Tingyao,Li Qinghua.Parallel solutions of correlation dimension calculation[J].Journal of Systems Engineering and Electronics,2005,16(3). |
| |
| Authors: | Jiang Tingyao Li Qinghua |
| |
| Institution: | 1. Coll.of Electrical Engineering and Information Technology,China Three Gorges Univ.,Yichang 443000,P.R.China;Coll.of Computer Science and Technology,Huazhong Univ.of Science and Technology,Wuhan 430074,P.R.China
2. Coll.of Computer Science and Technology,Huazhong Univ.of Science and Technology,Wuhan 430074,P.R.China |
| |
| Abstract: | The calculation of correlation dimension is a key problem of the fractals. The standard algorithm requires (O(N~2)) computations. The previous improvement methods endeavor to sequentially reduce redundant computation on condition that there are many different dimensional phase spaces, whose application area and performance improvement degree are limited. This paper presents two fast parallel algorithms: O(N~2/p+logp) time p processors PRAM algorithm and O(N~2/p) time p processors LARPBS algorithm. Analysis and results of numeric computation indicate that the speedup of parallel algorithms relative to sequence algorithms is efficient. Compared with the PRAM algorithm, The LARPBS algorithm is practical, optimally scalable and cost optimal. |
| |
| Keywords: | correlation dimension algorithm parallel |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
