Numerical Analysis: Weierstrass & Fourier Analysis

  • Context: Graduate 
  • Thread starter Thread starter talisman2212
  • Start date Start date
  • Tags Tags
    Fourier
Click For Summary

Discussion Overview

The discussion revolves around the similarities and differences between polynomial approximation and Fourier approximation in the context of numerical analysis, specifically focusing on their convergence properties for approximating functions of one variable.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant expresses interest in understanding the comparative effectiveness of polynomial and Fourier approximations for function approximation.
  • Another participant notes that the effectiveness of these approximations depends on the specific application.
  • A further participant clarifies that the application of interest is the approximation of functions of one variable.
  • Questions are raised regarding the nature of the domain (finite or infinite), the continuity of the functions, and the metric used for approximation.
  • One participant specifies that they are considering a finite domain with continuous functions and using the Euclidean metric for approximation.
  • A suggestion is made that polynomial approximation may be superior under the specified conditions, with a reference provided for further reading.

Areas of Agreement / Disagreement

Participants have not reached a consensus on which approximation method is definitively better, as the discussion highlights various factors that influence the effectiveness of each approach.

Contextual Notes

Limitations include the dependence on the specific conditions of the functions being approximated, such as their continuity and the chosen metric for approximation, which remain unresolved.

talisman2212
Messages
20
Reaction score
0
Hi, I am reading numerical analysis and I am very interested in Weierstrass Theorem and Fourier analysis. I want to know what are the similarities and the differences using polynomial approximation and Fourier aproximation for a function and which approximation converge faster and better to a function?
I need much help on this, I can't find yet anything.
 
Physics news on Phys.org
There is no simple answer. It depends very much on the application of interest.
 
The application of interest is on approximation of functions of one variable.
 
Are you concerned with finite or infinite domain? Are the functions continuous? What is the metric used to define the approximation? There may be other questions as well.
 
with finite domain, continuous functions and the Euclidean metric.
 
Last edited:

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
779
  • · Replies 8 ·
Replies
8
Views
5K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
Replies
3
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K