Fast and Accurate Predictor-Corrector Methods Using Feedback-Accelerated Picard Iteration for Strongly Nonlinear Problems

Although predictor-corrector methods have been extensively applied,they might not meet the requirements of practical applications and engineering tasks,particularly when high accuracy and efficiency are necessary.A novel class of correctors based on feedback-accelerated Picard iteration(FAPI)is proposed to further enhance computational performance.With optimal feedback terms that do not require inversion of matrices,significantly faster convergence speed and higher numerical accuracy are achieved by these correctors compared with their counterparts;however,the computational complexities are comparably low.These advantages enable nonlinear engineering problems to be solved quickly and accurately,even with rough initial guesses from elementary predictors.The proposed method offers flexibility,enabling the use of the generated correctors for either bulk processing of collocation nodes in a domain or successive corrections of a single node in a finite difference approach.In our method,the functional formulas of FAPI are discretized into numerical forms using the collocation approach.These collocated iteration formulas can directly solve nonlinear problems,but they may require significant computational resources because of the manipulation of high-dimensionalmatrices.To address this,the collocated iteration formulas are further converted into finite difference forms,enabling the design of lightweight predictor-corrector algorithms for real-time computation.The generality of the proposed method is illustrated by deriving new correctors for three commonly employed finite-difference approaches:the modified Euler approach,the Adams-Bashforth-Moulton approach,and the implicit Runge-Kutta approach.Subsequently,the updated approaches are tested in solving strongly nonlinear problems,including the Matthieu equation,the Duffing equation,and the low-earth-orbit tracking problem.The numerical findings confirm the computational accuracy and efficiency of the derived predictor-corrector algorithms.

A Unification of the Concepts of the Variational Iteration, Adomian Decomposition and Picard Iteration Methods;and a Local Variational Iteration Method

This paper compares the variational iteration method(VIM),the Adomian decomposition method(ADM)and the Picard iteration method(PIM)for solving a system of first o rder n onlinear o rdinary d ifferential e quations(ODEs).A unification of the concepts underlying these three methods is attempted by considering a very general iterative algorithm for VIM.It is found that all the three methods can be regarded as special cases of using a very general matrix of Lagrange multipliers in the iterative algorithm of VIM.The global variational iteration method is briefly reviewed,and further recast into a Local VIM,which is much more convenient and capable of predicting long term complex dynamic responses of nonlinear systems even if they are chaotic.

Multistage Numerical Picard Iteration Methods for Nonlinear Volterra Integral Equations of the Second Kind

Using the Picard iteration method and treating the involved integration by numerical quadrature formulas, we propose a numerical scheme for the second kind nonlinear Volterra integral equations. For enlarging the convergence region of the Picard iteration method, multistage algorithm is devised. We also introduce an algorithm for problems with some singularities at the limits of integration including fractional integral equations. Numerical tests verify the validity of the proposed schemes.

Integration of the Coupled Orbit-Attitude Dynamics Using Modified Chebyshev-Picard Iteration Methods

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.

Enhancements to Modified Chebyshev-Picard Iteration Efficiency for Perturbed Orbit Propagation

Modified Chebyshev Picard Iteration is an iterative numerical method for solving linear or non-linear ordinary differential equations.In a serial computational environment the method has been shown to compete with,or outperform,current state of practice numerical integrators.This paper presents several improvements to the basic method,designed to further increase the computational efficiency of solving the equations of perturbed orbit propagation.

Efficient Orbit Propagation of Orbital Elements Using Modified Chebyshev Picard Iteration Method

This paper focuses on propagating perturbed two-body motion using orbital elements combined with a novel integration technique.While previous studies show that Modified Chebyshev Picard Iteration(MCPI)is a powerful tool used to propagate position and velocity,the present results show that using orbital elements to propagate the state vector reduces the number of MCPI iterations and nodes required,which is especially useful for reducing the computation time when including computationally-intensive calculations such as Spherical Harmonic gravity,and it also converges for>5.5x as many revolutions using a single segment when compared with cartesian propagation.Results for the Classical Orbital Elements and the Modified Equinoctial Orbital Elements(the latter provides singularity-free solutions)show that state propagation using these variables is inherently well-suited to the propagation method chosen.Additional benefits are achieved using a segmentation scheme,while future expansion to the two-point boundary value problem is expected to increase the domain of convergence compared with the cartesian case.MCPI is an iterative numerical method used to solve linear and nonlinear,ordinary differential equations(ODEs).It is a fusion of orthogonal Chebyshev function approximation with Picard iteration that approximates a long-arc trajectory at every iteration.Previous studies have shown that it outperforms the state of the practice numerical integrators of ODEs in a serial computing environment;since MCPI is inherently massively parallelizable,this capability is expected to increase the computational efficiency of the method presented.

Calculation of Mass Concrete Temperature Containing Cooling Water Pipe Based on Substructure and Iteration Algorithm

Mathematical physics equations are often utilized to describe physical phenomena in various fields of science and engineering.One such equation is the Fourier equation,which is a commonly used and effective method for evaluating the effectiveness of temperature control measures for mass concrete.One important measure for temperature control in mass concrete is the use of cooling water pipes.However,the mismatch of grids between large-scale concrete models and small-scale cooling pipe models can result in a significant waste of calculation time when using the finite element method.Moreover,the temperature of the water in the cooling pipe needs to be iteratively calculated during the thermal transfer process.The substructure method can effectively solve this problem,and it has been validated by scholars.The Abaqus/Python secondary development technology provides engineers with enough flexibility to combine the substructure method with an iteration algorithm,which enables the creation of a parametric modeling calculation for cooling water pipes.This paper proposes such a method,which involves iterating the water pipe boundary and establishing the water pipe unit substructure to numerically simulate the concrete temperature field that contains a cooling water pipe.To verify the feasibility and accuracy of the proposed method,two classic numerical examples were analyzed.The results showed that this method has good applicability in cooling pipe calculations.When the value of the iteration parameterαis 0.4,the boundary temperature of the cooling water pipes can meet the accuracy requirements after 4∼5 iterations,effectively improving the computational efficiency.Overall,this approach provides a useful tool for engineers to analyze the temperature control measures accurately and efficiently for mass concrete,such as cooling water pipes,using Abaqus/Python secondary development.

Value Iteration-Based Cooperative Adaptive Optimal Control for Multi-Player Differential Games With Incomplete Information

This paper presents a novel cooperative value iteration(VI)-based adaptive dynamic programming method for multi-player differential game models with a convergence proof.The players are divided into two groups in the learning process and adapt their policies sequentially.Our method removes the dependence of admissible initial policies,which is one of the main drawbacks of the PI-based frameworks.Furthermore,this algorithm enables the players to adapt their control policies without full knowledge of others’ system parameters or control laws.The efficacy of our method is illustrated by three examples.

Another SSOR Iteration Method

Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyclic Reduction algorithm is introduced via a decoupling in Kellogg’s method.

Iteration and evaluation of shale oil development technology for continental rift lake basins

By benchmarking with the iteration of drilling technology,fracturing technology and well placement mode for shale oil and gas development in the United States and considering the geological characteristics and development difficulties of shale oil in the Jiyang continental rift lake basin,East China,the development technology system suitable for the geological characteristics of shale oil in continental rift lake basins has been primarily formed through innovation and iteration of the development,drilling and fracturing technologies.The technology system supports the rapid growth of shale oil production and reduces the development investment cost.By comparing it with the shale oil development technology in the United States,the prospect of the shale oil development technology iteration in continental rift lake basins is proposed.It is suggested to continuously strengthen the overall three-dimensional development,improve the precision level of engineering technology,upgrade the engineering technical indicator system,accelerate the intelligent optimization of engineering equipment,explore the application of complex structure wells,form a whole-process integrated quality management system from design to implementation,and constantly innovate the concept and technology of shale oil development,so as to promote the realization of extensive,beneficial and high-quality development of shale oil in continental rift lake basins.

Comparative Studies between Picard’s and Taylor’s Methods of Numerical Solutions of First Ordinary Order Differential Equations Arising from Real-Life Problems

To solve the first-order differential equation derived from the problem of a free-falling object and the problem arising from Newton’s law of cooling, the study compares the numerical solutions obtained from Picard’s and Taylor’s series methods. We have carried out a descriptive analysis using the MATLAB software. Picard’s and Taylor’s techniques for deriving numerical solutions are both strong mathematical instruments that behave similarly. All first-order differential equations in standard form that have a constant function on the right-hand side share this similarity. As a result, we can conclude that Taylor’s approach is simpler to use, more effective, and more accurate. We will contrast Rung Kutta and Taylor’s methods in more detail in the following section.

Accelerated inexact Newton-Landweber iteration method for EIT image reconstruction

The image reconstruction of electrical impedance tomography(EIT)is a nonlinear and ill-posed inverse problem and the imaging results are easily affected by measurement noise,which needs to be solved by using regularization methods.The iterative regularization method has become a focus of the research due to its ease of implementation.To deal with the ill-posed and ill-conditional problems in image reconstruction,the inexact Newton-Landweber iterative method is considered and the Nesterov’s acceleration strategy is introduced.One Nesterov-type accelerated version of the inexact Newton-Landweber iteration is presented to determine the conductivity distributions inside an object from electrical measurements made on the surface.In order to further optimize the acceleration,both the steepest descent step-length and the minimal error step-length are exploited during the iterative image reconstruction process.Landweber iteration and its accelerated version are also implemented for comparison.All algorithms are terminated by the discrepancy principle.Finally,the performance is tested by reporting numerical simulations to verify the remarkable acceleration efficiency of the proposed method.

不动点演化算法

为设计高效稳定的演化算法,将方程求根的不动点迭代思想引入到优化领域,通过将演化算法的寻优过程看作为在迭代框架下方程不动点的逐步显示化过程,设计出一种基于数学模型的演化新算法,即不动点演化算法(fixed point evolution algorithm,FPEA).该算法的繁殖算子是由Aitken加速的不动点迭代模型导出的二次多项式,其整体框架继承传统演化算法(如差分演化算法)基于种群的迭代模式.试验结果表明:在基准函数集CEC2014、CEC2019上,本文算法的最优值平均排名在所有比较算法中排名第1;在4个工程约束设计问题上,FPEA与CSA、GPE等多个算法相比,能以较少的计算开销获得最高的求解精度.

基于Picard迭代原理的非线性离散系统多频输入稳态响应的计算与分析

本文应用picard迭代原理和矩阵论中范数的理论提出了一种计算非线性离散系统多频输入稳态响应的方法,并给出了非线性离散系统多频输入稳态响应的通解.这种方法将一个非线性离散系统多频输入稳态响应计算问题化成计算同一个线性离散系统在不同输入下稳态响应的问题.文章用数学推导证明给出了多频输入的非线性离散系统存在唯一稳态响应的李普希次条件,并给出了判断一个非线性离散系统是否满足规定的李普希次条件的判定方法.基于所构建的求解方法,运用MATLAB语言编制了算法程序,对典型实例进行了仿真计算.大量仿真结果表明,本文提出的方法是正确的,且收敛速度较快.

基于自适应松弛Picard法的高效非饱和渗流有限元分析

有效地模拟非饱和渗流过程对土质边坡稳定性分析、土石坝渗流、污染物迁移等众多领域有着重要的意义。描述非饱和渗流的Richards方程是具有强烈非线性的偏微分方程,通常需要采用有限元等数值方法并结合有效的迭代方法进行求解。Picard迭代法是实用的非线性计算方法,在非饱和渗流领域应用广泛,但经常会出现收敛震荡、速度缓慢和精度降低的问题。为提高计算性能,结合有限元法提出了一种高效的自适应松弛Picard法。通过模拟一维和二维渗流算例,并与传统方法的结果进行对比,对算法和程序的准确性、高效性和鲁棒性进行了验证。测试结果表明,该方法可以在保证计算精度的同时有效地减少数值震荡,提高收敛速度。研究成果对非饱和渗流有限元程序的开发和应用有一定的参考价值。

应用迭代法求二元一次不定方程的整数解

系统地研究了求二元一次不定方程ax+by=c整数解的求解问题,给出了求此类不定方程整数解的辗转相除法并结合迭代法的计算方法,从而完美地解决了此类不定方程求整数解的问题.

右半平面上Laplace-Stieltjes变换的Picard点

用共形映射与亚纯函数值分布理论,研究了Laplace-Stieltjes变换所表示的右半平面上解析函数的值分布,在较弱条件下得到了Laplace-Stieltjes变换所表示的右半平面上解析函数Picard点存在性定理.这拓展了文献(余家荣.数学学报,1963,13(3):471-484.)的结果.

代数体函数与其导数的Picard例外值

本文证明了:(1)设w=w(z)是复平面上v-值整代数体函数a是一个非零复数,整数n≥4v-1,那么w'-aw^n取任何有限复数无穷多次.除非w(z)是代数函数;(2)设w=w(z)是复平面上v-值数体函代数,整数n≥2v+3,那么对任何有限复数b,(w-b)/w”至多有v-1个非零有限Picard例外值,除非w(z)是代数函数.

Picard算子对绝对连续函数的新收敛阶

进一步研究了Picard算子Pn(f,x)=n/2+∞-n t-x f(t)e dt的逼近性质,利用概率型算子基函数的概率性质,-∞通过直接计算相关函数关于Laplace分布的数学期望,导出Picard算子对绝对连续函数的一个新收敛阶的估计。关键词:Picard算子;绝对连续函数;

用Picard迭代法解约束绳索动点坐标的数学说明

Ｐｉｃａｒｄ迭代法可解工程吊装使用的各种约束绳索动点坐标Ｘｉ，Ｙｉ。本文结合这一领域中的实际问题，就Ｐｉｃａｒｄ迭代法解算多元非线性方程组一些数学问题，如收敛条件、收敛性、迭代曲线的几何特征。