Abstract
In this paper, we proposed a high accurate and stable Legendre transform algorithm, which can reduce the potential instability for a 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 the Legendre-Vandermonde matrix and butterfly algorithm, a new Legendre transform algorithm with computational complexity O(Nlog2N /loglogN) in theory and O(Nlog3N) in practical application is obtained. Numerical results are provided to demonstrate the efficiency and numerical stability of the new algorithm.
Funder
National Natural Science Foundation of China
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献