Iterative methods used in overlap astrometric reduction techniques do not always converge

Details Iterative methods used in overlap astrometric reduction techniques do not always converge Iterative methods used in overlap astrometric reduction techniques do not always converge

Apr 1993

adsabs.harvard.edu/cgi-bin/nph-data_query?bibcode=1993a%26a...271..645r&link_type=abstract

Astronomy and Astrophysics, Vol. 271, p. 645 (1993)

Astronomy and Astrophysics

Astrophysics

Astrometry, Overlap Methods, Iterative Methods

Scientific paper

In this paper we prove that the classical Gauss-Seidel type iterative methods used for the solution of the reduced normal equations occurring in overlapping reduction methods of astrometry do not always converge. We exhibit examples of divergence.
We then analyze an alternative algorithm proposed by Wang (1985). We prove the consistency of this algorithm and verify that it can be convergent while the Gauss-Seidel method is divergent. We conjecture the convergence of Wang method for the solution of astrometric problems using overlap techniques.

Affiliated with

Also associated with

No associations

Rating

Iterative methods used in overlap astrometric reduction techniques do not always converge 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 Iterative methods used in overlap astrometric reduction techniques do not always converge, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Iterative methods used in overlap astrometric reduction techniques do not always converge will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-1368529