Double star orbits with semi-definite programming and alternatives

Details Double star orbits with semi-definite programming and alternatives Double star orbits with semi-definite programming and alternatives

Nov 2009

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=2009a%26a...507.1107b&link_type=abstract

Astronomy and Astrophysics, Volume 507, Issue 2, 2009, pp.1107-1115

Astronomy and Astrophysics

Astrophysics

1

Binaries: Visual, Methods: Numerical

Scientific paper

Many methods have been proposed to calculate the apparent orbit of a double star. Semi-definite programming (SDP) offers numerous advantages, but is mathematically and computationally demanding. Aitken suggested seventy years ago a simpler method that uses ordinary least squares to calculate the coefficients of a conic section to represent the apparent ellipse. But although simpler, this approach obfuscates what is being minimized geometrically, and the calculated ellipse appears inferior to that found from SDP. An alternative, proposed in various investigations, uses nonlinear least squares to minimize the square of the deviations in distance and position angle. This method can suffer from divergence or convergence, if it occurs, to a local rather than to a global minimum. All three methods are applied to three binary systems RST 4816, Wolf 424, and HR 466.

Affiliated with

Also associated with

No associations

Rating

Double star orbits with semi-definite programming and alternatives does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Double star orbits with semi-definite programming and alternatives, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Double star orbits with semi-definite programming and alternatives will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1535279