Notes on Hori Method for Non-Canonical Systems

In this paper the new approach for the integration theory of the canonical version of Hori method recently proposed is extended to the non-canonical one. It will be shown that the non-homogeneous ordinary differential equation with an auxiliary parameter t* associated with the mth order equation of the algorithm can also be replaced by a non-homogeneous partial differential equation in the time t. Using a generalized canonical approach, the general algorithm proposed by Sessin is then revised; as well as the Lagrange variational equations for the non-canonical version of Hori method. A simplified algorithm derived from Sessin's algorithm is presented for non-linear oscillations problem.     

一种基于MUSIC算法的天地波识别方法

基于我国BPL长波脉冲信号的特征,利用MUSIC(多信号分类)算法对BPL天、地波延迟进行估计,实现天、地波识别。对传统谱估计IFFT(快速傅里叶逆变换)算法和现代谱估计MUSIC算法进行了仿真和比较,结果表明,这两种方法在较低信噪比条件下可有效分离天、地波,且识别误差都能控制在±5μs内,但MUSIC算法比IFFT算法具有更高的精度和分辨率。     

Correction and simulation of the intensity compensation algorithm used in curvature wavefront sensing

The wavefront measuring range and recovery precision of a curvature sensor can be improved by an intensity compensation algorithm. However, in a focal system with a fast f-number, especially a telescope with a large field of view, the accuracy of this algorithm cannot meet the requirements. A theoretical analysis of the corrected intensity compensation algorithm in a focal system with a fast f-number is first introduced and afterwards the mathematical equations used in this algorithm are expressed.The corrected result is then verified through simulation. The method used by such a simulation can be described as follows. First, the curvature signal from a focal system with a fast f-number is simulated by Monte Carlo ray tracing; then the wavefront result is calculated by the inner loop of the FFT wavefront recovery algorithm and the outer loop of the intensity compensation algorithm. Upon comparing the intensity compensation algorithm of an ideal system with the corrected intensity compensation algorithm, we reveal that the recovered precision of the curvature sensor can be greatly improved by the corrected intensity compensation algorithm.     

A new way to conserve total energy for Eulerian hydrodynamic simulations with self-gravity

We propose a new method to conserve the total energy to round-off error in grid-based codes for hydrodynamic simulations with self-gravity. A formula for the energy flux due to the work done by the self-gravitational force is given, so the change in total energy can be written in conservative form. Numerical experiments with the code Athena show that the total energy is indeed conserved with our new algorithm and the new algorithm is second order accurate. We have performed a set of tests that show the numerical errors in the traditional, non-conservative algorithm can affect the dynamics of the system. The new algorithm only requires one extra solution of the Poisson equation, as compared to the traditional algorithm which includes self-gravity as a source term. If the Poisson solver takes a negligible fraction of the total simulation time, such as when FFTs are used, the new algorithm is almost as efficient as the original method. This new algorithm is useful in Eulerian hydrodynamic simulations with self-gravity, especially when results are sensitive to small energy errors, as for radiation pressure dominated flow.     

Fast Object Detection for Use Onboard Satellites

We propose an object detection algorithm which is efficient and fast enough to be used in (almost) real time with the limited computer capacities onboard satellites. For stars below the saturation limit of the CCD detectors it is based on a four neighbourhood local maximum criterion in order to find the centre of a stellar image. For saturated stars it is based on the assumption that the image is increasing monotonically towards the centre in the unsaturated part of the image. The algorithm also calculates approximate stellar magnitudes and efficiently rejects most of the cosmics which would otherwise lead to a large number of false detections. The quality of the algorithm was evaluated with the help of a large set of simulated data for the DIVA satellite mission; different assumptions were made for the noise level, and the presence of cosmics or for a variable sky background.We could show that our algorithm fulfills the requirements for DIVA; only in the case of simulated images which included the bright galaxy M31 some fainter stars could not be detected in the galaxy's vicinity. Since stellar images contain large areas without any stars, we propose an additional block-skipping algorithm which can be coded on special-purpose hardware. This revised version was published online in July 2006 with corrections to the Cover Date.     

Prediction of trajectories in the Earth's gravitational field with axial symmetry using KS uniform regular elements

In this paper, a motion prediction algorithm based on the KS regular elements is developed for the motion in the Earth's gravitational field with axial symmetry. The algorithm is of recursive nature and general in the sense that it could be applied for any conic motion whatever the number of zonal harmonic coefficientsN 2 may be. Applications of the algorithm for the problem of the final state prediction are illustrated by numerical examples of eight typical ballistic missiles for geopotential model with zonal harmonic terms up toJ ₃₆. A final state of any desired accuracy is obtained for each case study, a result which shows the efficiency and the flexibility of the algorithm.     

A modified genetic algorithm for precise determination the geometrical orbital elements of binary stars

The paper presents a modified genetic algorithm called adapted genetic algorithm with adjusting population size (AGA-POP) for precise determination the orbital elements of binary stars. The proposed approach is a simple, robust way that can be considered to be a new member in the class of self organizing genetic algorithms. The proposed AGA-POP is applied on the star η Bootis of MK type G0 IV to find a set of optimal orbital elements. This leads to obtain the best fitting of Keplerian and phase curves. The modified method is compared with other different methods such as standard genetic algorithm, adapted genetic algorithm (AGA) and least square methods. Simulation results show the effectiveness of using AGA-POP compared with other different classic genetic algorithms in reducing the computation time. Also, better performances have been achieved when using the proposed technique.     

Explicit algorithmic regularization in the few-body problem for velocity-dependent perturbations

A new algorithm is presented for the numerical integration of second-order ordinary differential equations with perturbations that depend on the first derivative of the dependent variables with respect to the independent variable; it is especially designed for few-body problems with velocity-dependent perturbations. The algorithm can be used within extrapolation methods for enhanced accuracy, and it is fully explicit, which makes it a competitive alternative to standard discretization methods.     

Light curve synthesis for binary systems: The stellar wind effect

Synthesis methods for light and radial velocity curves allow one to find the physical parameters of the components of binary systems of different types. We describe the basics of a new light curve synthesis algorithm for binaries that contain stars with extended expanding atmospheres. The algorithm can be used to study, e.g., light curves of binaries that contain Wolf-Rayet stars.     

Detrending time series for astronomical variability surveys

We present a detrending algorithm for the removal of trends in time series. Trends in time series could be caused by various systematic and random noise sources such as cloud passages, changes of airmass, telescope vibration, CCD noise or defects of photometry. Those trends undermine the intrinsic signals of stars and should be removed. We determine the trends from subsets of stars that are highly correlated among themselves. These subsets are selected based on a hierarchical tree clustering algorithm. A bottom-up merging algorithm based on the departure from normal distribution in the correlation is developed to identify subsets, which we call clusters. After identification of clusters, we determine a trend per cluster by weighted sum of normalized light curves. We then use quadratic programming to detrend all individual light curves based on these determined trends. Experimental results with synthetic light curves containing artificial trends and events are presented. Results from other detrending methods are also compared. The developed algorithm can be applied to time series for trend removal in both narrow and wide field astronomy.     

已知e的先验值的初轨寻优算法

本文讨论由短弧测角资料,已知偏心率e的先验值时,初轨的寻优算法。把偏心率的先验值看作是对e的约束条件,再固定观测弧段两端点的观测量与作为约束条件,本文导出了一维(对M_0)非线性寻优算法;针对观测资料中可能存在异常值的情形,本文提出了一种初轨的稳健寻优算法。仿真结果表明,当e的先验值有足够高的精度时,能明显提高周期P的估计精度;稳健算法还可用作剔除观测资料的异常值。     

状态转移矩阵的差分算法及其应用

指出用数值积分方法计算状态转移矩阵在程序实现时存在的困难。根据精密定轨和参数解算的实际需要,提出用差分算法,即通过两条接近的轨道的差来计算状态转移矩阵差分算法的优点是程序具有良好的结构且编程简单,其不足之处是差分时可能损失精度。将差分算法与数值积分方法的结果进行比较,提出克服其不足处的方法。     

Generating dark matter halo merger trees

We present a new Monte Carlo algorithm to generate merger trees describing the formation history of dark matter haloes. The algorithm is a modification of the algorithm of Cole et al. used in the galform semi-analytic galaxy formation model. As such, it is based on the Extended Press–Schechter theory and so should be applicable to hierarchical models with a wide range of power spectra and cosmological models. It is tuned to be in accurate agreement with the conditional mass functions found in the analysis of merger trees extracted from the Λ cold dark matter Millennium N -body simulation. We present a comparison of its predictions not only with these conditional mass functions, but also with additional statistics of the Millennium Simulation halo merger histories. In all cases, we find it to be in good agreement with the Millennium Simulation and thus it should prove to be a very useful tool for semi-analytic models of galaxy formation and for modelling hierarchical structure formation in general. We have made our merger tree generation code and code to navigate the trees available at http://star-www.dur.ac.uk/~cole/merger_trees .     

Automatic morphological classification of galaxy images

We describe an image analysis supervised learning algorithm that can automatically classify galaxy images. The algorithm is first trained using manually classified images of elliptical, spiral and edge-on galaxies. A large set of image features is extracted from each image, and the most informative features are selected using Fisher scores. Test images can then be classified using a simple Weighted Nearest Neighbour rule such that the Fisher scores are used as the feature weights. Experimental results show that galaxy images from Galaxy Zoo can be classified automatically to spiral, elliptical and edge-on galaxies with an accuracy of ∼90 per cent compared to classifications carried out by the author. Full compilable source code of the algorithm is available for free download, and its general-purpose nature makes it suitable for other uses that involve automatic image analysis of celestial objects.     

Particle swarm optimization based space debris surveillance network scheduling

The increasing number of space debris has created an orbital debris environment that poses increasing impact risks to existing space systems and human space flights. For the safety of in-orbit spacecrafts, we should optimally schedule surveillance tasks for the existing facilities to allocate resources in a manner that most significantly improves the ability to predict and detect events involving affected spacecrafts. This paper analyzes two criteria that mainly affect the performance of a scheduling scheme and introduces an artificial intelligence algorithm into the scheduling of tasks of the space debris surveillance network. A new scheduling algorithm based on the particle swarm optimization algorithm is proposed, which can be implemented in two different ways: individual optimization and joint optimization. Numerical experiments with multiple facilities and objects are conducted based on the proposed algorithm, and simulation results have demonstrated the effectiveness of the proposed algorithm.     

近地小行星轨道演化的数值研究与辛算法有效性的探讨

本文采用改进的显式辛算法（symplecticalgorithm）和嵌套的RKF7（8）积分器对43颗已命名（或编号）的近地小行星的轨道演化进行数值研究．在力学模型上,除考虑各大行星的引力振动外,还增加了后牛顿效应,而在算法上则着重探索辛算法在近地小行星轨道演化研究中的应用前景,特别是当小行星与某一大行星靠近时辛算法的有效性．本文的结果可为了解近地小行星的轨道演化状况和对它们进行监测提供可靠的信息．     

A New Algorithm in Computations of Binary Stars’ Observational Quantities and Its Application

The determination of the orbital parameters of binaries is an important constituent of fundamental astronomy. It is the only reliable way to determine the stellar mass, which is crucial for the studies of stellar dynamics and evolution. And the orbital parameters can be used to compute the motions of component stars, which could improve the population of reference stars in the bright star catalogue reference frame. However, the previous studies on the determination of binaries’ orbital parameters adopted some approximations in the computation of observational quantities. According to the statistical results of hundreds of binaries with bright component stars, it could be found that the approximations in the variation of the tangent plane and the prospective effect of the reference plane have made the deviations of computed observational quantities become larger than the present observational precision (1 mas). In this paper, a new algorithm based on the two-body model and the rigorous relation of solid geometry for computing observational quantities is presented. This new algorithm has been verified by fitting the simulation and actually-observed data. And the fitting results show that the fitted parameters solved by the new algorithm usually have a higher confidence than that solved by the approximate algorithm. Therefore, the new algorithm has certain improvements in the determination of the orbital parameters of binaries, especially, for the wide binaries nearby the solar system.     

四种综合脉冲星时算法比较

由单颗脉冲星定义的脉冲星时受多种噪声源的影响,其短期和长期稳定度都不够好.为了削弱这些噪声源对单脉冲星时的影响,可以采取合适的算法对多个单脉冲星时进行综合得到综合脉冲星时,从而提高综合脉冲星时的长期稳定度.文中介绍4种综合脉冲星时算法:经典加权算法、小波分析算法、维纳滤波算法和小波域中的维纳滤波算法,将这4种算法分别应用于Arecibo天文台对两颗毫秒脉冲星PSR B1855+09和PSRB1937+21观测得到的计时残差并作出比较.     

Defocus spot detection of astronomical optical system

Defocusing spot size detection is especially essential for aberration analysis and correction of optical systems. In the case of far defocusing, the celestial forms a pupil image on the detector, and the size of the image is linearly changed with the defocusing distance, and can be used to correct the optical system and analyze the image quality. Based on the focal plane attitude detection of Large Sky Area MultiObject Fiber Spectroscopy Telescope(LAMOST), this paper uses a variety of methods to detect the size of the defocusing spot of LAMOST telescope. For the particularity of the spot, the average value spacing algorithm, the peak value spacing algorithm, the ellipse fitting algorithm, and the multi-peak Gaussian fitting algorithm are used to detect the spot size. This paper will introduce these four methods, in which the average value spacing algorithm is proposed by the author of this paper. The advantages and disadvantages of the four methods are compared. The experimental results show that the average value spacing algorithm can achieve better accuracy of spot size detection in the four algorithms.     

一种固定选图数的实时幸运成像算法

幸运成像技术是一种从大量短曝光图像中选取少量幸运好图进行配准、叠加的高分辨率图像恢复技术,能够有效减小大气湍流对图像质量的影响,但传统的基于中央处理器(Central Processing Unit,CPU)的幸运成像算法难以实现实时化.利用现场可编程门阵列(Field Programmable Gate Array,...