A new method for generating conic sections (Q1121018): Difference between revisions

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.