A linear combination involves summing several terms, each multiplied by a constant coefficient. For polynomials, this looks like combining different polynomials, each multiplied by a specific coefficient, to represent another polynomial.
- If we have polynomials \( P_1(x), P_2(x), \ldots, P_n(x) \)
- We can create a linear combination like \( c_1P_1(x) + c_2P_2(x) + \ldots + c_nP_n(x) \)
We do this when expressing a polynomial like \( x^5 \) using Legendre polynomials.
Suppose we can write \( x^5 \) as a combination of Legendre polynomials as follows:
\[x^5 = a_5P_5(x) + a_4P_4(x) + a_3P_3(x) + a_2P_2(x) + a_1P_1(x) + a_0P_0(x)\]
By finding the right coefficients \( a_i \), we can express any polynomial as a unique combination, thanks to the orthogonality of Legendre polynomials.