We discuss a parallel implementation of a fast algorithm for the discrete poly-nomial Legendre transform. We give an introduction to the Driscoll-Healy algorithm using polynomial arithmetic, and present experimental results on the eciency and accuracy of our implementation. The algorithms were implemented in ANSI C using the BSPlib communications library. Further-more, we present a new algorithm for computing the Chebyshev transform of two vectors at the same time. 1
This paper presents parallel recursive algorithms for the computation of the inverse discrete Legend...
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coeff...
. Consider the Vandermonde--like matrix P := (P k (cos jß N )) N j;k=0 , where the polynomials P ...
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transf...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article we discuss a parallel implementation of efficient algorithms for computation of Lege...
Abstract In this article we discuss a parallel implementation of ecient algorithms for computation...
Abstract. In this article, we discuss a parallel implementation of efficient algorithms for compu-ta...
This paper presents a parallel implementation of the discrete Legendre transform using SIMD machines...
We present a parallel Fast Legendre Transform (FLT) based on the Driscol-Healy algorithm with comput...
Abstract. A fast, simple, and numerically stable transform for converting between Legendre and Cheby...
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coeff...
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fa...
This paper presents parallel recursive algorithms for the computation of the inverse discrete Legend...
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coeff...
. Consider the Vandermonde--like matrix P := (P k (cos jß N )) N j;k=0 , where the polynomials P ...
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transf...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article, we discuss a parallel implementation of efficient algorithms for computation of Leg...
In this article we discuss a parallel implementation of efficient algorithms for computation of Lege...
Abstract In this article we discuss a parallel implementation of ecient algorithms for computation...
Abstract. In this article, we discuss a parallel implementation of efficient algorithms for compu-ta...
This paper presents a parallel implementation of the discrete Legendre transform using SIMD machines...
We present a parallel Fast Legendre Transform (FLT) based on the Driscol-Healy algorithm with comput...
Abstract. A fast, simple, and numerically stable transform for converting between Legendre and Cheby...
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coeff...
We present a new parallel algorithm for the fast generation of discrete Chebyshev polynomials. By fa...
This paper presents parallel recursive algorithms for the computation of the inverse discrete Legend...
A fast, simple, and numerically stable transform for converting between Legendre and Chebyshev coeff...
. Consider the Vandermonde--like matrix P := (P k (cos jß N )) N j;k=0 , where the polynomials P ...