Please name this subject and let me know if books are written on it

  • Thread starter Thread starter cytochrome
  • Start date Start date
  • Tags Tags
    Books
cytochrome
Messages
163
Reaction score
3
1) I want to learn how to look at a graph of any function and be able to derive the equation for the function given parameters that are observable. Is this parameterization? Are there any books on how to do this by hand?

2) If the function is too complex to observe and derive, I want to be able to enter parameters into a computer that has an algorithm to make a "best fit" function for the curve. What is this called? What kind of algorithm would a program such as this contain? More particularly, as an example: If a picture is taken of a fast particle in motion on a certain path, how could I derive the function for its position?
ThanksEDIT: To make it more specific about what I am trying to find out, I think it goes somewhere along the lines of mathematical modeling, parameterization, mutlivariate methods (maybe). Basically I just want to know how to either look at a function and derive it's equation, or make best fits equations for any curve that could represent the path of a particle. Is there a subject centered around deriving functions from observed paths of particles or observable curves in general?
 
Last edited:
Mathematics news on Phys.org
Hey cytochrome.

There is no "one" resource that will give you this crystal ball, but if I had to recommend some areas I would recommend data mining, statistics, signal processing, numerical analysis (including interpolation and approximation) and other forms of integral transforms not necessarily considered in the normal signal processing literature. Also (and this is important), read information theory.

The thing about what you are asking is that you are essentially asking is that you want some particular representation with the minimal Kolmogorov Complexity under a specific description.

This problem has no known public solution currently, but it is the answer to your question: to take something and find the kolmogorov complexity of that object.

When you start researching this yourself, you will soon see why this is a hard thing to calculate (there are again, no publically known general ways of calculating this).

Here is a wiki link to get you started:

http://en.wikipedia.org/wiki/Kolmogorov_complexity

and I recommend you take a serious look at data mining, since this is exactly the kind of thing they do:

http://en.wikipedia.org/wiki/Data_mining
 
Thanks a lot! That was very helpful
 
There is often no single equation that is 'best'

What, in any case, do you mean by best?

You will never have an infinite range of data and sometimes one equation fits one part better then another equation fits a different segment better.

Sometimes there is a question of accuracy for purpose. There is no point fitting a more accurate equation than is needed for the calculation in hand.

Examples might be whether to use the Ebers Moll equation in semiconducter electronics or some simpler model.

A good sequence of equations to study the development of are the gas equations.

The ideal gas laws
Van De Walls equation
The Virial Equation
Amagat and Andrews curves

More mathematical techniques, in additions to Chiro's long list to look at are

The method of undetermined coefficients.

Plotting non linear axes eg logarithmic or the ratio of two or more of the dataset variables or even more complicated expressions.
Normalisation
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top