Iterative Algorithm for the Effects of Atmospheric Refraction on the Equatorial Coordinates of a Star Valid for any Zenith Distance
Journal Title: JOURNAL OF ADVANCES IN MATHEMATICS - Year 2014, Vol 7, Issue 1
Abstract
In the present paper an efficient algorithm will be established for the effects of atmospheric refraction on the equatorial coordinates of a star valid for any zenith distance The algorithm uses two new iterative schemes, the first is linear iterative scheme for the equatorial coordinates due to atmospheric refraction. The second is the quadratic Newton iterative scheme for obtaining the true zenith distance from Bennent formulae for the atmospheric refraction. Description of the algorithm was also given together with numerical applications.
Authors and Affiliations
Mohammed Sharaf
Keywords
Related Articles
- EP ID EP651369
- DOI 10.24297/jam.v7i1.6846
- Views 146
- Downloads 0
ORACLE INEQUALITIES FOR LASSO AND DANTZIG SELECTOR IN HIGH-DIMENSIONAL LINEAR REGRESSION
During the last few years, a great deal attention has been focused on lasso and Dantzig selector in high-dimensional linear regression under a sparsity scenario, that is, when the number of variables can be much larger t...
Three IndicesCalculationof Certain Crown Molecular Graphs
As molecular graph invariant topological indices, harmonic index, zeroth-order general Randic index and Co-PI index have been studied in recent years for prediction of chemicalphenomena. In this paper, we determine the h...
The Real Matrices forms of the Bicomplex Numbers and Homothetic Exponential motions
In this paper, a bicomplex number is described in four- dimensional space and its a variety of algebraic properties is presented. In addition, Pauli-spin matrix elements corresponding to base the real matrices forms of t...
Complexity Measure in Simple Type Food Chain System
Study of complexities arising during evolution of a food chain system has been investigated. Regular and chaotic motions have been observed for certain sets of values of a parameter of the system. For some detailed furth...
Edge Jump Distance Graphs
The concept of edge jump between graphs and distance between graphs was introduced by Gary Chartrand et al. in [5]. A graph H is obtained from a graph G by an edge jump if G contains four distinct vertices u, v, w, and x...