Skip to content

jonas1ara/Numerical-methods-fs

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Numerical methods using fsharp

VG using F# Fsharp makes it easy to use numerical methods even for Van Gogh

Methods

Calculus:

  • Another technique to find roots of equations, especially useful when working with continuous functions on closed intervals.
  • Used to find roots of nonlinear equations. It is a popular technique for solving optimization problems.
  • Numerical differentiation is a technique used to approximate the derivative of a function at a specific point by employing finite differences.
  • The rectangle rule is the simplest method of approximating the value of a definite integral. It approximates the region under the graph of the function f(x) as a single rectangle.
  • The trapezoidal rule is a technique for approximating the definite integral. It approximates the region under the graph of the function f(x) as a trapezoid and calculating its area.
  • Simpson's rule is a technique for approximating the definite integral. It approximates the region under the graph of the function f(x) as a series of parabolic curves and calculating their areas.

Linear algebra:

  • Iterative methods for solving systems of linear equations.
  • Iterative methods for solving systems of linear equations.
  • Used to solve systems of linear equations, especially useful for large matrices.
  • Used to solve systems of linear equations, especially useful for large matrices.

Differential equations:

  • Used to solve ordinary differential equations, which model changes in variables over time.
  • A family of methods for solving ordinary differential equations and systems of differential equations.

Probability and statistics:

  • Techniques to estimate intermediate values between known data points (interpolation) or to fit a curve to a dataset (regression).
  • Techniques to estimate intermediate values between known data points (interpolation) or to fit a curve to a dataset (regression).
  • A statistical-numerical approach for simulation and problem-solving through the generation of random numbers for integration. Monte Carlo integration is a technique for approximating the definite integral. It approximates the region under the graph of the function f(x) as a series of random points and calculating their areas.
  • A statistical-numerical approach for simulation and problem-solving through the generation of random numbers for approximating the value of π.

Optimization:

  • Used to transform signals between the time domain and the frequency domain, essential in signal processing and dynamic systems analysis.
  • Gradient descent to find minima or maxima of functions.

Contributions

Feel free to contribute! If you have additional methods you'd like to add or improve existing descriptions, create a pull request, and I'll be happy to review it but try to keep your solution in the programming style of F#.

About

Fsharp makes it easy to use numerical methods

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages