Newton polynomial basis for CA-CG, elsewhere

[weinbe2]

In contrast to the Chebyshev polynomial basis, which is a 3-term recursion, the Newton basis is a 2-term recursion with similar stability properties, in contrast to the generally unstable power basis. We should investigate this for use in CA-CG (and potentially polynomial acceleration to eigensolvers, CA-GCR, etc).

Reference: https://hal.inria.fr/inria-00433009/document