Hessian curve

Hessian curve

The Hessian curve is a curve similar to Folium of Descartes. It is named for the German mathematician Otto Hesse.

References

* Otto Hesse (1844), "Uber die Elimination der Variabeln aus drei algebraischen Gleichungen vom zweiten Grade mit zwei Variabeln", Journal für die reine und angewandte Mathematik, 10, pp. 68-96


Wikimedia Foundation. 2010.

Игры ⚽ Поможем решить контрольную работу

Look at other dictionaries:

  • Elliptic curve cryptography — (ECC) is an approach to public key cryptography based on the algebraic structure of elliptic curves over finite fields. The use of elliptic curves in cryptography was suggested independently by Neal Koblitz[1] and Victor S. Miller[2] in 1985.… …   Wikipedia

  • Cubic plane curve — A selection of cubic curves. See information page for details. Cubic curve redirects here. For information on polynomial functions of degree 3, see Cubic function. In mathematics, a cubic plane curve is a plane algebraic curve C defined by a… …   Wikipedia

  • List of mathematics articles (H) — NOTOC H H cobordism H derivative H index H infinity methods in control theory H relation H space H theorem H tree Haag s theorem Haagerup property Haaland equation Haar measure Haar wavelet Haboush s theorem Hackenbush Hadamard code Hadamard… …   Wikipedia

  • List of curves — This is a list of curves, by Wikipedia page. See also list of curve topics, list of surfaces, Riemann surface. Algebraic curves*Cubic plane curve *Quartic plane curve *Quintic plane curve *Sextic plane curveRational curves*Ampersand curve… …   Wikipedia

  • Heidelberg University Faculty of Mathematics and Computer Science — Infobox University Faculty name = Faculty of Mathematics and Computer Science native name = Fakultät für Mathematik und Informatik established = 2002 dean = Prof. Dr. R. Rannacher staff = 27 students = 1100 website = http://www.math.uni… …   Wikipedia

  • Corner detection — Feature detection Output of a typical corner detection algorithm …   Wikipedia

  • Gauss–Newton algorithm — The Gauss–Newton algorithm is a method used to solve non linear least squares problems. It can be seen as a modification of Newton s method for finding a minimum of a function. Unlike Newton s method, the Gauss–Newton algorithm can only be used… …   Wikipedia

  • Mathematical optimization — For other uses, see Optimization (disambiguation). The maximum of a paraboloid (red dot) In mathematics, computational science, or management science, mathematical optimization (alternatively, optimization or mathematical programming) refers to… …   Wikipedia

  • Non-linear least squares — is the form of least squares analysis which is used to fit a set of m observations with a model that is non linear in n unknown parameters (m > n). It is used in some forms of non linear regression. The basis of the method is to… …   Wikipedia

  • Nonlinear dimensionality reduction — High dimensional data, meaning data that requires more than two or three dimensions to represent, can be difficult to interpret. One approach to simplification is to assume that the data of interest lies on an embedded non linear manifold within… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”