or
Join Now!
|
|
Home/Science & Technology/Mathematics/Numerical Analysis
|
| Forum |
Ask A Question |
Question Board |
FAQs |
Search |
Return to Question Board
| Question Details |
Asked By |
Asked On |
| Gaussian Quadrature |
slowpofo |
07/06/07 |
I am aware of Gaussian Quadrature used for 2n-1 polynomials; however, this approach is weak for sinusoidal/oscillating functions. Could one suggest a method, more efficient than discrete fourier transform, similar to Gaussian Quadrature to approximate a sinusoidal function. It would be prefereable to have it be power-conserving. Thanks |
|
Your Options |
Additional Options are only visible when you login! !
|
|
|
|
