Re: [eigen] Module for orth. Polynomials

[Christoph Hertzberg <chtz@xxxxxxxxxxxxxxxxxxxxxxxx>]

Definitely sounds interesting.

Independent of that, the polynomial module could need some (very basic) 
functionality, like polynomial multiplication/division and even addition 
(of polynomials with different degree):
http://eigen.tuxfamily.org/bz/show_bug.cgi?id=700
Having that, could simplify writing unit tests.

Christoph

On 25.08.2014 10:16, Roman Pascal Schärer wrote:
> Dear Eigen developers and users,
>
> we developed a small C++ package  for the computation of orthogonal polynomials (OPQ++) as an unsupported module inside Eigen for our own needs.
>
> The main goal of this package is to provide methods to compute an orthogonal set of polynomials for a given weight function. This has been realised with the modified Chebyshev algorithm, which computes the recurrence coefficients of the polynomials. This algorithm makes use of the moments of the weight function, which in general need to be computed using some numerical integration method. For now we provide our own implementations of quadrature formulas (e.q. Gaussian quadratures). With the obtained recurrence coefficients the nodes and weights of a Gaussian quadrature formula for the weight function can be easily computed using e.g. the Golub-Welsch algorithm.
>
> Since this package could be easily integrated in the Eigen library, I’d like to ask if there is interest for such a module to be made public. Since it is a rather small module, it could e.g. also be integrated in the “Polynomials Module”.
>
> If such interest exists, we would be open for suggestions regarding the API and the implementation of more features such as multi-precision floating point number support etc.
>
> Best,
> Roman


--
----------------------------------------------
Dipl.-Inf., Dipl.-Math. Christoph Hertzberg
Cartesium 0.049
Universität Bremen
Enrique-Schmidt-Straße 5
28359 Bremen

Tel: +49 (421) 218-64252
----------------------------------------------