Uniform Approximation
The subject of uniform approximation is distinctly more complicated than that of least-squares approximation. So,…
The subject of uniform approximation is distinctly more complicated than that of least-squares approximation. So,…
Chebyshev polynomials of the first kind, and Legendre polynomials are both orthogonal on [−1, 1],…
In the previous section there appears to be a problem involved in accurately computing the…
Introduction The necessity to solve linear systems of equations is commonplace in numerical computing. This…
The Taylor series expansions of Section 3.5 might have a large radius of convergence, but…
The Fourier series expansion was introduced briefly in Chapter 1, where the behaviour of this…
The previous section informed us that sequences can converge in different ways, assuming that they…