This paper presents Modified Chebyshev-Picard Iteration(MCPI)methods for long-term integration of the coupled orbit and attitude dynamics.Although most orbit predictions for operational satellites have assumed that th...This paper presents Modified Chebyshev-Picard Iteration(MCPI)methods for long-term integration of the coupled orbit and attitude dynamics.Although most orbit predictions for operational satellites have assumed that the attitude dynamics is decoupled from the orbit dynamics,the fully coupled dynamics is required for the solutions of uncontrolled space debris and space objects with high area-to-mass ratio,for which cross sectional area is constantly changing leading to significant change on the solar radiation pressure and atmospheric drag.MCPI is a set of methods for solution of initial value problems and boundary value problems.The methods refine an orthogonal function approximation of long-time-interval segments of state trajectories iteratively by fusing Chebyshev polynomials with the classical Picard iteration and have been applied to multiple challenging aerospace problems.Through the studies on integrating a torque-free rigid body rotation and a long-term integration of the coupled orbit-attitude dynamics through the effect of solar radiation pressure,MCPI methods are shown to achieve several times speedup over the Runge-Kutta 7(8)methods with several orders of magnitudes of better accuracy.MCPI methods are further optimized by integrating the decoupled dynamics at the beginning of the iteration and coupling the full dynamics when the attitude solutions and orbit solutions are converging during the iteration.The approach of decoupling and then coupling during iterations provides a unique and promising perspective on the way to warm start the solution process for the longterm integration of the coupled orbit-attitude dynamics.Furthermore,an attractive feature of MCPI in maintaining the unity constraint for the integration of quaternions within machine accuracy is illustrated to be very appealing.展开更多
This work presents a stochastic Chebyshev-Picard iteration method to efficiently solve nonlinear differential equations with random inputs.If the nonlinear problem involves uncertainty,we need to characterize the unce...This work presents a stochastic Chebyshev-Picard iteration method to efficiently solve nonlinear differential equations with random inputs.If the nonlinear problem involves uncertainty,we need to characterize the uncer-tainty by using a few random variables.The nonlinear stochastic problems require solving the nonlinear system for a large number of samples in the stochastic space to quantify the statistics of the system of response and explore the uncertainty quantification.The computational cost is very expensive.To overcome the difficulty,a low rank approximation is introduced to the solution of the corresponding nonlinear problem and admits a variable-separation form in terms of stochastic basis functions and deterministic basis functions.No it-eration is performed at each enrichment step.These basis functions are model-oriented and involve offline computation.To efficiently identify the stochastic basis functions,we utilize the greedy algorithm to select some optimal sam-ples.Then the modified Chebyshev-Picard iteration method is used to solve the nonlinear system at the selected optimal samples,the solutions of which are used to train the deterministic basis functions.With the deterministic basis functions,we can obtain the corresponding stochastic basis functions by solv-ing linear differential systems.The computation of the stochastic Chebyshev-Picard method decomposes into an offline phase and an online phase.This is very desirable for scientific computation.Several examples are presented to illustrate the efficacy of the proposed method for different nonlinear differential equations.展开更多
文摘This paper presents Modified Chebyshev-Picard Iteration(MCPI)methods for long-term integration of the coupled orbit and attitude dynamics.Although most orbit predictions for operational satellites have assumed that the attitude dynamics is decoupled from the orbit dynamics,the fully coupled dynamics is required for the solutions of uncontrolled space debris and space objects with high area-to-mass ratio,for which cross sectional area is constantly changing leading to significant change on the solar radiation pressure and atmospheric drag.MCPI is a set of methods for solution of initial value problems and boundary value problems.The methods refine an orthogonal function approximation of long-time-interval segments of state trajectories iteratively by fusing Chebyshev polynomials with the classical Picard iteration and have been applied to multiple challenging aerospace problems.Through the studies on integrating a torque-free rigid body rotation and a long-term integration of the coupled orbit-attitude dynamics through the effect of solar radiation pressure,MCPI methods are shown to achieve several times speedup over the Runge-Kutta 7(8)methods with several orders of magnitudes of better accuracy.MCPI methods are further optimized by integrating the decoupled dynamics at the beginning of the iteration and coupling the full dynamics when the attitude solutions and orbit solutions are converging during the iteration.The approach of decoupling and then coupling during iterations provides a unique and promising perspective on the way to warm start the solution process for the longterm integration of the coupled orbit-attitude dynamics.Furthermore,an attractive feature of MCPI in maintaining the unity constraint for the integration of quaternions within machine accuracy is illustrated to be very appealing.
基金supported by the National Natural Science Foundation of China (Grant No.12101217)by the China Postdoctoral Science Foundation (Grant No.2022M713875)by the Natural Science Foundation of Hunan Province (Grant No.2022J40113).
文摘This work presents a stochastic Chebyshev-Picard iteration method to efficiently solve nonlinear differential equations with random inputs.If the nonlinear problem involves uncertainty,we need to characterize the uncer-tainty by using a few random variables.The nonlinear stochastic problems require solving the nonlinear system for a large number of samples in the stochastic space to quantify the statistics of the system of response and explore the uncertainty quantification.The computational cost is very expensive.To overcome the difficulty,a low rank approximation is introduced to the solution of the corresponding nonlinear problem and admits a variable-separation form in terms of stochastic basis functions and deterministic basis functions.No it-eration is performed at each enrichment step.These basis functions are model-oriented and involve offline computation.To efficiently identify the stochastic basis functions,we utilize the greedy algorithm to select some optimal sam-ples.Then the modified Chebyshev-Picard iteration method is used to solve the nonlinear system at the selected optimal samples,the solutions of which are used to train the deterministic basis functions.With the deterministic basis functions,we can obtain the corresponding stochastic basis functions by solv-ing linear differential systems.The computation of the stochastic Chebyshev-Picard method decomposes into an offline phase and an online phase.This is very desirable for scientific computation.Several examples are presented to illustrate the efficacy of the proposed method for different nonlinear differential equations.
