Using Exercises 5.10.5 and 5.10.6, prove that n=1 n2 n = pf df dx b a + b a p df dx2 qf2
Chapter 5, Problem 5.10.8(choose chapter or problem)
Using Exercises 5.10.5 and 5.10.6, prove that n=1 n2 n = pf df dx b a + b a p df dx2 qf2 dx. (5.10.15) [Hint: Let g = L(f), assuming that term-by-term differentiation is justified.] Furthermore, Chapter 9 introduces a Greens function G(x, x0), which is shown to satisfy n=1 2 n n = G(x, x). (5.10.17) Using (5.10.15), (5.10.16), and (5.10.17), derive an upper bound for the pointwise error (in cases in which the generalized Fourier series is pointwise convergent). Examples and further discussion of this are given by Weinberger [1995].
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer