Article
Version 1
This version is not peer-reviewed
A High Accurate and Stable Legendre Transform Based on Block Partitioning and Butterfly Algorithm for NWP
Version 1
: Received: 21 September 2019 / Approved: 22 September 2019 / Online: 22 September 2019 (15:40:27 CEST)
A peer-reviewed article of this Preprint also exists.
Yin, F.; Wu, J.; Song, J.; Yang, J. A High Accurate and Stable Legendre Transform Based on Block Partitioning and Butterfly Algorithm for NWP. Mathematics 2019, 7, 966. Yin, F.; Wu, J.; Song, J.; Yang, J. A High Accurate and Stable Legendre Transform Based on Block Partitioning and Butterfly Algorithm for NWP. Mathematics 2019, 7, 966.
Abstract
In this paper, we proposed a high accurate and stable Legendre transform algorithm which can reduce the potential instability for very high order at a very small increase in the computational time. The error analysis of interpolative decomposition for Legendre transform is presented. By employing block partitioning of Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(N(logN)^2/loglogN) in theory and less than O(N(logN)^4) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.
Keywords
legendre transform; block partitioning; interpolative decomposition; butterfly algorithm
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment