Search

In this paper, a symplectic algorithm is utilized to investigate constrained Hamiltonian systems. However, the symplectic method cannot be applied directly to the constrained Hamiltonian equations due to the non-canonicity. We firstly discuss the canonicalization method of the constrained Hamiltonian systems. The symplectic method is used to constrain Hamiltonian systems on the basis of the canonicalization, and then the numerical simulation of the system is carried out. An example is presented to illustrate the application of the results. By using the symplectic method of constrained Hamiltonian systems, one can solve the singular dynamic problems of nonconservative constrained mechanical systems, nonholonomic constrained mechanical systems as well as physical problems in quantum dynamics, and also available in many electromechanical coupled systems. [ABSTRACT FROM AUTHOR]

The novel rotating rectangular aperture (RRA) system provides a good solution for space-based, large-aperture, high-resolution imaging tasks. Its imaging quality depends largely on the image synthesis algorithm, and the mainstream multi-frame deblurring approach is sophisticated and time-consuming. In this paper, we propose a novel full-aperture image synthesis algorithm for the RRA system, based on Fourier spectrum restoration. First, a numerical simulation model is established to analyze the RRA system's characteristics and obtain the point spread functions (PSFs) rapidly. Then, each image is used iteratively to calculate the increment size and update the final restored Fourier spectrum. Both the simulation's results and the practical experiment's results show that our algorithm performs well in terms of objective evaluation and time consumption. [ABSTRACT FROM AUTHOR]

The increasing complexity of advanced devices and systems increases the scale of mathematical models used in computer simulations. Multiparametric analysis and study on long-term time intervals of large-scale systems are computationally expensive. Therefore, efficient numerical methods are required to reduce time costs. Recently, semi-explicit and semi-implicit Adams–Bashforth–Moulton methods have been proposed, showing great computational efficiency in low-dimensional systems simulation. In this study, we examine the numerical stability of these methods by plotting stability regions. We explicitly show that semi-explicit methods possess higher numerical stability than the conventional predictor–corrector algorithms. The second contribution of the reported research is a novel algorithm to generate an optimized finite-difference scheme of semi-explicit and semi-implicit Adams–Bashforth–Moulton methods without redundant computation of predicted values that are not used for correction. The experimental part of the study includes the numerical simulation of the three-body problem and a network of coupled oscillators with a fixed and variable integration step and finely confirms the theoretical findings. [ABSTRACT FROM AUTHOR]