Fast Conversion Algorithms for Orthogonal Polynomials

Details Fast Conversion Algorithms for Orthogonal Polynomials Fast Conversion Algorithms for Orthogonal Polynomials

2008-04-15

arxiv.org/abs/0804.2373v1

Computer Science

Symbolic Computation

Scientific paper

We discuss efficient conversion algorithms for orthogonal polynomials. We
describe a known conversion algorithm from an arbitrary orthogonal basis to the
monomial basis, and deduce a new algorithm of the same complexity for the
converse operation.

Affiliated with

Also associated with

No associations

Rating

Fast Conversion Algorithms for Orthogonal Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Conversion Algorithms for Orthogonal Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Conversion Algorithms for Orthogonal Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-653461