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.

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.

Low-complexity signal detection for massive MIMO systems via trace iterative method

Linear minimum mean square error(MMSE)detection has been shown to achieve near-optimal performance for massive multiple-input multiple-output(MIMO)systems but inevitably involves complicated matrix inversion,which entails high complexity.To avoid the exact matrix inversion,a considerable number of implicit and explicit approximate matrix inversion based detection methods is proposed.By combining the advantages of both the explicit and the implicit matrix inversion,this paper introduces a new low-complexity signal detection algorithm.Firstly,the relationship between implicit and explicit techniques is analyzed.Then,an enhanced Newton iteration method is introduced to realize an approximate MMSE detection for massive MIMO uplink systems.The proposed improved Newton iteration significantly reduces the complexity of conventional Newton iteration.However,its complexity is still high for higher iterations.Thus,it is applied only for first two iterations.For subsequent iterations,we propose a novel trace iterative method(TIM)based low-complexity algorithm,which has significantly lower complexity than higher Newton iterations.Convergence guarantees of the proposed detector are also provided.Numerical simulations verify that the proposed detector exhibits significant performance enhancement over recently reported iterative detectors and achieves close-to-MMSE performance while retaining the low-complexity advantage for systems with hundreds of antennas.

Variational Iteration Method for Solving Time Fractional Burgers Equation Using Maple

The Time Fractional Burger equation was solved in this study using the Mabel software and the Variational Iteration approach. where a number of instances of the Time Fractional Burger Equation were handled using this technique. Tables and images were used to present the collected numerical results. The difference between the exact and numerical solutions demonstrates the effectiveness of the Mabel program’s solution, as well as the accuracy and closeness of the results this method produced. It also demonstrates the Mabel program’s ability to quickly and effectively produce the numerical solution.

The Alternating Group Explicit Iterative Method for the Regularized Long-Wave Equation

An Alternating Group Explicit (AGE) iterative method with intrinsic parallelism is constructed based on an implicit scheme for the Regularized Long-Wave (RLW) equation. The method can be used for the iteration solution of a general tridiagonal system of equations with diagonal dominance. It is not only easy to implement, but also can directly carry out parallel computation. Convergence results are obtained by analysing the linear system. Numerical experiments show that the theory is accurate and the scheme is valid and reliable.

Variational iteration method for solving the mechanism of the Equatorial Eastern Pacific El Nino-Southern Oscillation

A class of coupled system for the E1 Nifio-Southern Oscillation （ENSO） mechanism is studied. Using the method of variational iteration for perturbation theory, the asymptotic expansions of the solution for ENSO model are obtained and the asymptotic behaviour of solution for corresponding problem is considered.

Variational iteration solving method for El Nio phenomenon atmospheric physics of nonlinear model

A class of E1 Niйo atmospheric physics oscillation model is considered. The E1 Niйo atmospheric physics oscillation is an abnormal phenomenon involved in the tropical Pacific ocean-atmosphere interactions. The conceptual oscillator model should consider the variations of both the eastern and western Pacific anomaly patterns. An E1 Niйo atmospheric physics model is proposed using a method for the variational iteration theory. Using the variational iteration method, the approximate expansions of the solution of corresponding problem are constructed. That is, firstly, introducing a set of functional and accounting their variationals, the Lagrange multiplicators are counted, and then the variational iteration is defined, finally, the approximate solution is obtained. From approximate expansions of the solution, the zonal sea surface temperature anomaly in the equatorial eastern Pacific and the thermocline depth anomaly of the sea-air oscillation for E1 Niйo atmospheric physics model can be analyzed. E1 Niйo is a very complicated natural phenomenon. Hence basic models need to be reduced for the sea-air oscillator and are solved. The variational iteration is a simple and valid approximate method.

ON THE MONOTONE CONVERGENCE OF THE PROJECTED ITERATION METHODS FOR LINEAR COMPLEMENTARITY PROBLEMS

Under suitable conditions,the monotone convergence about the projected iteration method for solving linear complementarity problem is proved and the influence of the involved parameter matrix on the convergence rate of this method is investigated.

Doubly Periodic Wave Solutions of Jaulent-Miodek Equations Using Variational Iteration Method Combined with Jacobian-function Method

One of the advantages of the variational iteration method is the free choice of initial guess. In this paper we use the basic idea of the Jacobian-function method to construct a generalized trial function with some unknown parameters. The Jaulent-Miodek equations are used to illustrate effectiveness and convenience of this method, some new explicit exact travelling wave solutions have been obtained, which include bell-type soliton solution, kink-type soliton solutions, solitary wave solutions, and doubly periodic wave solutions.

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.

Iteration dependent interval based open‐closed‐loop iterative learning control for time varying systems with vector relative degree

For linear time varying(LTV)multiple input multiple output(MIMO)systems with vector relative degree,an open‐closed‐loop iterative learning control(ILC)strategy is developed in this article,where the time interval of operation is iteration dependent.To compensate the missing tracking signal caused by iteration dependent interval,the feedback control is introduced in ILC design.As the tracking signal of many continuous iterations is lost in a certain interval,the feedback control part can employ the tracking signal of current iteration for compensation.Under the assumption that the initial state vibrates around the desired initial state uniformly in mathematical expectation sense,the expectation of ILC tracking error can converge to zero as the number of iteration tends to infinity.Under the circumstance that the initial state varies around the desired initial state with a bound,as the number of iteration tends to infinity,the expectation of ILC tracking error can be driven to a bounded range,whose upper bound is proportional to the fluctuation.It is revealed that the convergence condition is dependent on the feed-forward control gains,while the feedback control can accelerate convergence speed by selecting appropriate feedback control gains.As a special case,the controlled system with integrated high relative degree is also addressed by proposing a simplified iteration dependent interval based open‐closed‐loop ILC method.Finally,the effectiveness of the developed iteration dependent interval based open‐closed‐loop ILC is illustrated by a simulation example with two cases on initial state.

Nonlinear Algebraic Equations Solved by an Optimal Splitting-Linearizing Iterative Method

How to accelerate the convergence speed and avoid computing the inversion of a Jacobian matrix is important in the solution of nonlinear algebraic equations(NAEs).This paper develops an approach with a splitting-linearizing technique based on the nonlinear term to reduce the effect of the nonlinear terms.We decompose the nonlinear terms in the NAEs through a splitting parameter and then linearize the NAEs around the values at the previous step to a linear system.Through the maximal orthogonal projection concept,to minimize a merit function within a selected interval of splitting parameters,the optimal parameters can be quickly determined.In each step,a linear system is solved by the Gaussian elimination method,and the whole iteration procedure is convergent very fast.Several numerical tests show the high performance of the optimal split-linearization iterative method(OSLIM).

Solutions of the Duffin-Kemmer-Petiau equation in the presence of Hulthn potential in(1+2) dimensions for unity spin particles using the asymptotic iteration method

The relativistic Duffin-Kemmer-Petiau equation in the presence of Hulthen potential in （1 ＋2） dimensions for spin-one particles is studied. Hence, the asymptotic iteration method is used for obtaining energy eigenvalues and eigenfunctions.

Parametric Iteration Method for Solving Linear Optimal Control Problems

This article presents the Parametric Iteration Method (PIM) for finding optimal control and its corresponding trajectory of linear systems. Without any discretization or transformation, PIM provides a sequence of functions which converges to the exact solution of problem. Our emphasis will be on an auxiliary parameter which directly affects on the rate of convergence. Comparison of PIM and the Variational Iteration Method (VIM) is given to show the preference of PIM over VIM. Numerical results are given for several test examples to demonstrate the applicability and efficiency of the method.

IMPROVED HOMOTOPY ITERATION METHOD AND APPLIED TO THE NINE-POINT PATH SYNTHESIS PROBLEM FOR FOUR-BAR LINKAGES

A new algorithm called homotopy iteration method based on the homotopy function is studied and improved. By the improved homotopy iteration method, Polynomial systems with high Order and deficient can be solved fast and efficiently comparing to the original homotopy iteration method. Numerical examples for the ninepoint path synthesis of four-bar linkages show the advantages and efficiency of the improved homotopy iteration method.

Some geometrical iteration methods for nonlinear equations

This paper describes geometrical essentials of some iteration methods （e.g. Newton iteration, secant line method, etc.） for solving nonlinear equations and advances some geometrical methods of iteration that are flexible and efficient.

A New Multidimensional Time Series Forecasting Method Based on the EOF Iteration Scheme

In this paper a new .mnultidimensional time series forecasting scheme based on the empirical orthogonal function (EOF) stepwise iteration process is introduced. The scheme is tested in a series of forecast experiments of Nino3 SST anomalies and Tahiti-Darwin SO index. The results show that the scheme is feasible and ENSO predictable.

Multilevel Iteration Methods for Solving Linear Operator Equations of the First Kind

In this paper we develop two multilevel iteration methods for solving linear systems resulting from the Galerkin method and Tikhonov regularization for linear ill-posed problems. The two algorithms and their convergence analyses are presented in an abstract framework.

An Iteration Method Based on Homotopy Function for Solving Polynomial Systems and Application to Mechanisms Problems

A new iterating method based on homotopy function is developed in this paper. All solutions can be found easily without the need of choosing proper initial values. Compared to the homotopy continuation method, the solution process of the present method is simplified, and the computation efficiency as well as the reliability for obtaining all solutions is also improved. By application of the method to the mechanisms problems, the results are satisfactory.

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.