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 Family of Fifth-order Iterative Methods for Solving Nonlinear Equations

In this paper, we present and analyze a family of fifth-order iterative methods free from second derivative for solving nonlinear equations. It is established that the family of iterative methods has convergence order five. Numerical examples show that the new methods are comparable with the well known existing methods and give better results in many aspects.

TOPOLOGY SYNTHESIS OF GEOMETRICALLY NONLINEAR COMPLIANT MECHANISMS USING MESHLESS METHODS

This paper presents a new method for topology optimization of geometrical nonlinear compliant mechanisms using the element-free Galerkin method （EFGM）. The EFGM is employed as an alternative scheme to numerically solve the state equations by fully taking advantage of its capability in dealing with large displacement problems. In the meshless method, the imposition of essential boundary conditions is also addressed. The popularly studied solid isotropic material with the penalization （SIMP） scheme is used to represent the nonlinear dependence between material properties and regularized discrete densities. The output displacement is regarded as the objective function and the adjoint method is applied to finding the sensitivity of the design functions. As a result, the optimization of compliant mechanisms is mathematically established as a nonlinear programming problem, to which the method of moving asymptotes （MMA） belonging to the sequential convex programming can be applied. The availability of the present method is finally demonstrated with several widely investigated numerical examples.

Projection and Contraction Methods for Nonlinear Complementarity Problem

We applied the projection and contraction method to nonlinear complementarity problem (NCP). Moveover, we proposed an inexact implicit method for (NCP) and proved the convergence.

Study of nonlinear filter methods: particle filter

Extended Kalman filter （EKF） is one of the most widely used methods for nonlinear system estimation. A new filtering algorithm, called particle filtering （PF） is introduced. PF can yield better performance than that of EKF, because PF does not involve the linearization approximating to nonlinear systems, that is required by the EKF. PF has been shown to be a superior alternative to the EKF in a variety of applications. The base idea of PF is the approximation of relevant probabifity distributions using the concepts of sequential importance sampling and approximation of probability distributions using a set of discrete random samples with associated weights. PF methods still need to be improved in the aspects of accuracy and calculating speed.

ITERATIVE REGULARIZATION METHODS FOR NONLINEAR ILL-POSED OPERATOR EQUATIONS WITH M-ACCRETIVE MAPPINGS IN BANACH SPACES

In this paper, a modified Newton type iterative method is considered for ap- proximately solving ill-posed nonlinear operator equations involving m-accretive mappings in Banach space. Convergence rate of the method is obtained based on an a priori choice of the regularization parameter. Our analysis is not based on the sequential continuity of the normalized duality mapping.

New Optimal Newton-Householder Methods for Solving Nonlinear Equations and Their Dynamics

The classical iterative methods for finding roots of nonlinear equations,like the Newton method,Halley method,and Chebyshev method,have been modified previously to achieve optimal convergence order.However,the Householder method has so far not been modified to become optimal.In this study,we shall develop two new optimal Newton-Householder methods without memory.The key idea in the development of the new methods is the avoidance of the need to evaluate the second derivative.The methods fulfill the Kung-Traub conjecture by achieving optimal convergence order four with three functional evaluations and order eight with four functional evaluations.The efficiency indices of the methods show that methods perform better than the classical Householder’s method.With the aid of convergence analysis and numerical analysis,the efficiency of the schemes formulated in this paper has been demonstrated.The dynamical analysis exhibits the stability of the schemes in solving nonlinear equations.Some comparisons with other optimal methods have been conducted to verify the effectiveness,convergence speed,and capability of the suggested methods.

New Fourth and Fifth-Order Iterative Methods for Solving Nonlinear Equations

In this paper, we establish two new iterative methods of order four and five by using modified homotopy perturbation technique. We also present the convergence analysis of these iterative methods. To assess the validity and performance of these iterative methods, we have applied to solve some nonlinear problems.

Computational Methods for Three Coupled Nonlinear Schrödinger Equations

In this work, we will derive numerical schemes for solving 3-coupled nonlinear Schrödinger equations using finite difference method and time splitting method combined with finite difference method. The resulting schemes are highly accurate, unconditionally stable. We use the exact single soliton solution and the conserved quantities to check the accuracy and the efficiency of the proposed schemes. Also, we use these methods to study the interaction dynamics of two solitons. It is found that both elastic and inelastic collision can take place under suitable parametric conditions. We have noticed that the inelastic collision of single solitons occurs in two different manners: enhancement or suppression of the amplitude.

Iterative Methods for Solving the Nonlinear Balance Equation with Optimal Truncation

Two types of existing iterative methods for solving the nonlinear balance equation(NBE)are revisited.In the first type,the NBE is rearranged into a linearized equation for a presumably small correction to the initial guess or the subsequent updated solution.In the second type,the NBE is rearranged into a quadratic form of the absolute vorticity with the positive root of this quadratic form used in the form of a Poisson equation to solve NBE iteratively.The two methods are rederived by expanding the solution asymptotically upon a small Rossby number,and a criterion for optimally truncating the asymptotic expansion is proposed to obtain the super-asymptotic approximation of the solution.For each rederived method,two iterative procedures are designed using the integral-form Poisson solver versus the over-relaxation scheme to solve the boundary value problem in each iteration.Upon testing with analytically formulated wavering jet flows on the synoptic,sub-synoptic and meso-αscales,the iterative procedure designed for the first method with the Poisson solver,named M1a,is found to be the most accurate and efficient.For the synoptic wavering jet flow in which the NBE is entirely elliptic,M1a is extremely accurate.For the sub-synoptic wavering jet flow in which the NBE is mostly elliptic,M1a is sufficiently accurate.For the meso-αwavering jet flow in which the NBE is partially hyperbolic so its boundary value problem becomes seriously ill-posed,M1a can effectively reduce the solution error for the cyclonically curved part of the wavering jet flow,but not for the anti-cyclonically curved part.

Nonlinear Flap-Wise Vibration Characteristics ofWind Turbine Blades Based onMulti-Scale AnalysisMethod

This work presents a novel approach to achieve nonlinear vibration response based on the Hamilton principle.We chose the 5-MW reference wind turbine which was established by the National Renewable Energy Laboratory(NREL),to research the effects of the nonlinear flap-wise vibration characteristics.The turbine wheel is simplified by treating the blade of a wind turbine as an Euler-Bernoulli beam,and the nonlinear flap-wise vibration characteristics of the wind turbine blades are discussed based on the simplification first.Then,the blade’s large-deflection flap-wise vibration governing equation is established by considering the nonlinear term involving the centrifugal force.Lastly,it is truncated by the Galerkin method and analyzed semi-analytically using the multi-scale analysis method,and numerical simulations are carried out to compare the simulation results of finite elements with the numerical simulation results using Campbell diagram analysis of blade vibration.The results indicated that the rotational speed of the impeller has a significant impact on blade vibration.When the wheel speed of 12.1 rpm and excitation amplitude of 1.23 the maximum displacement amplitude of the blade has increased from 0.72 to 3.16.From the amplitude-frequency curve,it can be seen that the multi-peak characteristic of blade amplitude frequency is under centrifugal nonlinearity.Closed phase trajectories in blade nonlinear vibration,exhibiting periodic motion characteristics,are found through phase diagrams and Poincare section diagrams.

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.

Dynamical Comparison of Several Third-Order Iterative Methods for Nonlinear Equations

There are several ways that can be used to classify or compare iterative methods for nonlinear equations,for instance;order of convergence,informational efficiency,and efficiency index.In this work,we use another way,namely the basins of attraction of the method.The purpose of this study is to compare several iterative schemes for nonlinear equations.All the selected schemes are of the third-order of convergence and most of them have the same efficiency index.The comparison depends on the basins of attraction of the iterative techniques when applied on several polynomials of different degrees.As a comparison,we determine the CPU time(in seconds)needed by each scheme to obtain the basins of attraction,besides,we illustrate the area of convergence of these schemes by finding the number of convergent and divergent points in a selected range for all methods.Comparisons confirm the fact that basins of attraction differ for iterative methods of different orders,furthermore,they vary for iterative methods of the same order even if they have the same efficiency index.Consequently,this leads to the need for a new index that reflects the real efficiency of the iterative scheme instead of the commonly used efficiency index.

Synchronization Phenomena Investigation of a New Nonlinear Dynamical System 4D by Gardano’s and Lyapunov’s Methods

Synchronization is one of the most important characteristics of dynamic systems.For this paper,the authors obtained results for the nonlinear systems controller for the custom Synchronization of two 4D systems.The findings have allowed authors to develop two analytical approaches using the second Lyapunov(Lyp)method and the Gardanomethod.Since the Gardano method does not involve the development of special positive Lyp functions,it is very efficient and convenient to achieve excessive systemSYCR phenomena.Error is overcome by using Gardano and overcoming some problems in Lyp.Thus we get a great investigation into the convergence of error dynamics,the authors in this paper are interested in giving numerical simulations of the proposed model to clarify the results and check them,an important aspect that will be studied is Synchronization Complete hybrid SYCR and anti-Synchronization,by making use of the Lyapunov expansion analysis,a proposed control method is developed to determine the actual.The basic idea in the proposed way is to receive the evolution of between two methods.Finally,the present model has been applied and showing in a new attractor,and the obtained results are compared with other approximate results,and the nearly good coincidence was obtained.

A Family of Methods for Solving Nonlinear Equations with Twelfth-Order Convergence

This paper presents a new family of twelfth-order methods for solving simple roots of nonlinear equations which greatly improves the order of convergence and the computational efficiency of the Newton’s method and some other known methods.

Compact implicit integration factor methods for some complex-valued nonlinear equations

The compact implicit integration factor （cIIF） method is an efficient time discretization scheme for stiff nonlinear diffusion equations in two and three spatial dimensions. In the current work, we apply the cIIF method to some complex-valued nonlinear evolutionary equations such as the nonlinear SchrSdinger （NLS） equation and the complex Ginzburg-Landau （GL） equation. Detailed algorithm formulation and practical implementation of cIIF method are performed. The numerical results indicate that this method is very accurate and efficient.

On Newton-Like Methods for Solving Nonlinear Equations

In this paper, we present a family of general New to n-like methods with a parametric function for finding a zero of a univariate fu nction, permitting f′(x)=0 in some points. The case of multiple roots is n ot treated. The methods are proved to be quadratically convergent provided the w eak condition. Thus the methods remove the severe condition f′(x)≠0. Based on the general form of the Newton-like methods, a family of new iterative meth ods with a variable parameter are developed.

Highly Accurate Golden Section Search Algorithms and Fictitious Time Integration Method for Solving Nonlinear Eigenvalue Problems

This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.

New Predictor-Corrector Methods Based on Exponential Time Differencing forSystems of Nonlinear Differential Equations

We present the new predictor-corrector methods for systems of nonlinear differential equations, based on the method of exponential time differencing. We compare the present schemes with the explicit multistep exponential time differencing and Adams–Bashforth–Moulton method. The numerical results show that the schemes are more accurate and more efficient than Adams predictor-corrector method. The exponential time differencing method has been developed and perfected by the present studies.