A new method for generating conic sections (Q1121018): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
(One intermediate revision by one other user not shown) | |||
Property / cites work | |||
Property / cites work: Q4776831 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on homological dimension / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/bf02943363 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047298205 / rank | |||
Normal rank |
Latest revision as of 10:52, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A new method for generating conic sections |
scientific article |
Statements
A new method for generating conic sections (English)
0 references
1989
0 references
A simple and efficient method for computing the vertices of certan polygons inscribed in a conic section is developed: ``If a positive real number k and initial vectors \(Q_ 0\) and \(Q_ 1\) are chosen properly, the vectors \(Q_ j\) of the sequence \(\{Q_ j\}\) (j\(\geq 0)\) generated by the difference equation \(Q_{j+1}=2k\cdot Q_{j-1}\) \((j=1,2,...)\) are the relative vectors connecting two adjacent vertices of an inscribed polygon of an ellipse \((0<k<1)\), a parabola \((k=1)\) or a hyperbola \((k>1)\), respectively'' (Theorem 3.2). The authors discuss the numerical stability of this ``difference method'' (with respect to parabola, ellipse, hyperbola) and prove that the well- known matrix method and the difference method are equivalent (in the sense of n-order methods). Remark: In the case of a parabola or a hyperbola, the lengths \(dist(Q_ j,Q_{j+1})\) of the edges of the inscribed polygon \(\{Q_ j\}\) may vary within wide ranges; this circumstance, which has not been considered in the paper, may restrict the practical application of the difference method presented here.
0 references
conic sections
0 references
fast graphic algorithm
0 references
approximation of curves
0 references
inscribed polygon
0 references
difference method
0 references