General method of parameterization

  • Context: Graduate 
  • Thread starter Thread starter DivergentSpectrum
  • Start date Start date
  • Tags Tags
    General Method
Click For Summary

Discussion Overview

The discussion revolves around the possibility of parameterizing equations, specifically whether a general formula or algorithm exists to convert implicit functions like f(x,y)=0 or g(x,y,z)=0 into parametric forms such as x(t), y(t) or x(u,v), y(u,v), z(u,v). Participants explore the conditions under which such parameterizations can be achieved and the limitations involved.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested

Main Points Raised

  • One participant inquires if a general method exists for parameterizing equations, questioning the feasibility of expressing functions in terms of elementary functions.
  • Another participant asserts that the ability to parameterize depends on the properties of the function, suggesting that a general answer is no.
  • A further inquiry is made about the existence of algorithms that could generate an ordered set of points from a function like f(x,y)=0.
  • In response, it is noted that the feasibility of generating points also depends on the specific function, and that memory limitations would prevent obtaining the full set of points. Suggestions are made to use contour plotting functions in software like MATLAB or Mathematica for reasonable approximations.

Areas of Agreement / Disagreement

Participants express differing views on the existence of a general parameterization method, with some asserting it is not universally applicable while others seek practical algorithms for specific cases. The discussion remains unresolved regarding the generality of parameterization.

Contextual Notes

Limitations include the dependence on the properties of the functions in question and the challenges posed by memory limitations in computational approaches.

DivergentSpectrum
Messages
149
Reaction score
15
is there a general formula/algorithm to parameterize an equation?

for example if i have a function
f(x,y)=0
then can i always change it to the form x(t),y(t)?

or if i had g(x,y,z)=0

then can i change it to something like x(u,v),y(u,v),z(u,v)

i know of examples, like if i have x^2+y^2=1 then i know its cos(t),sin(t) but there's a lot of other functions out there.

I guess what I am asking, is if there is always a parameterization in terms of elementary functions, and if not, what kinds of numeric algorithms are available?
 
Physics news on Phys.org
This depends on the properties of the function. The general answer is no.
 
so is there an algorithm i could use in computer programming that takes f(x,y)=0 for example and returns an ordered set of points?
 
This is again going to depend on your function. Perhaps the only functions you will encounter are nice enough. A computer code will never give you the full set of points simply because of memory limitations. You might want a finite set of points that give you a reasonable approximation? The contour plotting function of softwares like MATLAB or mathematica should be able to do that for you.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
3
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 14 ·
Replies
14
Views
5K