Approximations to the delta function on a computer

Click For Summary
SUMMARY

The discussion focuses on approximations to the delta function for computational use. Key methods mentioned include utilizing the discrete Fourier transform to represent the delta function as a single point and employing Gaussian functions that approach the delta function as their width approaches zero while height increases. Convolution with the delta function is highlighted as a straightforward operation available in most programming languages. These techniques provide effective means to work with delta function approximations in computational contexts.

PREREQUISITES
  • Understanding of delta functions and distributions
  • Familiarity with discrete Fourier transforms
  • Knowledge of Gaussian functions and their properties
  • Basic programming skills for implementing convolution operations
NEXT STEPS
  • Research the implementation of discrete Fourier transforms in programming languages
  • Explore the mathematical properties of Gaussian functions and their limits
  • Learn about convolution operations in libraries such as NumPy or MATLAB
  • Investigate advanced techniques for approximating delta functions in numerical analysis
USEFUL FOR

Mathematicians, computer scientists, and engineers working with signal processing, numerical analysis, or any field requiring the approximation of delta functions in computational applications.

onsagerian
Messages
3
Reaction score
0
Hi,
I am looking for approximations to the delta functoin which I can use on a computer. Although I will never get an exact delta function, I can make an approximation that it can be improved as much as I like.

Would you help me to find the approximation of the delta function so that I can put it on the computer?

Thanks,
Best regards
 
Technology news on Phys.org


This doesn't make much sense without any context. A delta function is a distribution. If you are interested in integrating over it then that is simply evaluating the function at the delta function. You can represent them in a Fourier transform as a single point if you use a discrete Fourier transform. Another way to approximate it would be a Guassian function as you take the limit of its width to zero and increase its height accordingly.
 
Convolving with the delta function is built-in to most programming languages -- it's simply plugging 0 into a function.
 

Similar threads

Python Applying Accelerated Raymarching to Reduce Rendering Time
  • · Replies 0 ·
Replies
0
Views
2K
Conservation of probability issue when solving ODE in Mathematica
  • · Replies 1 ·
Replies
1
Views
2K
Correct numerical modeling of the 3D Dirac Delta function
  • · Replies 13 ·
Replies
13
Views
4K
Undergrad Explicit logical justification for last step in epsilon/delta proof?
  • · Replies 20 ·
Replies
20
Views
3K
Question about finite differences
  • · Replies 10 ·
Replies
10
Views
2K
What is meant by small oscillations for this potential energy function?
  • · Replies 2 ·
Replies
2
Views
1K
Undergrad What Are Common Misconceptions About the Dirac Delta Function?
  • · Replies 25 ·
Replies
25
Views
4K
Undergrad On the approximate solution obtained through Euler's method
  • · Replies 1 ·
Replies
1
Views
4K
Why does my if-statement not work when I have (x-100) instead of x?
  • · Replies 5 ·
Replies
5
Views
2K
The future of mobile computing forensics analysts
  • · Replies 4 ·
Replies
4
Views
2K