This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods...This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods always lead to optimal convergence rates and have some other important features, especially the methods can be implemented parallelly.展开更多
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,...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.展开更多
Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often on...Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.展开更多
Let the linear system Ax=b where the coefficient matrix A=(a<sub>ij</sub>)∈R<sup>m,n</sup> is an L-ma-trix(that is,a<sub>ij</sub>】0 (?) i and a<sub>ij</sub>≤0 (?...Let the linear system Ax=b where the coefficient matrix A=(a<sub>ij</sub>)∈R<sup>m,n</sup> is an L-ma-trix(that is,a<sub>ij</sub>】0 (?) i and a<sub>ij</sub>≤0 (?) i≠j),A=I-L-U,I is the identity matrix,-L and-U are,respectively,strictly lower and strictly upper triangular parts of A.In[1]theauthors considered two preconditioned linear systems?x=(?) and ?x=(?)展开更多
This paper considers practical, high-order methods for the iterative location of the roots of nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable to multiple roots of init...This paper considers practical, high-order methods for the iterative location of the roots of nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable to multiple roots of initially known and unknown multiplicity. Efficient methods are presented in this note for the evaluation of the multiplicity index of the root being sought. Also reviewed here are super-linear and super-cubic methods that converge contrarily or alternatingly, enabling us, not only to approach the root briskly and confidently but also to actually bound and bracket it as we progress.展开更多
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 ...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.展开更多
In this article,we construct the most powerful family of simultaneous iterative method with global convergence behavior among all the existing methods in literature for finding all roots of non-linear equations.Conver...In this article,we construct the most powerful family of simultaneous iterative method with global convergence behavior among all the existing methods in literature for finding all roots of non-linear equations.Convergence analysis proved that the order of convergence of the family of derivative free simultaneous iterative method is nine.Our main aim is to check out the most regularly used simultaneous iterative methods for finding all roots of non-linear equations by studying their dynamical planes,numerical experiments and CPU time-methodology.Dynamical planes of iterative methods are drawn by using MATLAB for the comparison of global convergence properties of simultaneous iterative methods.Convergence behavior of the higher order simultaneous iterative methods are also illustrated by residual graph obtained from some numerical test examples.Numerical test examples,dynamical behavior and computational efficiency are provided to present the performance and dominant efficiency of the newly constructed derivative free family of simultaneous iterative method over existing higher order simultaneous methods in literature.展开更多
In a recent paper, Noor and Khan [M. Aslam Noor, & W. A. Khan, (2012) New Iterative Methods for Solving Nonlinear Equation by Using Homotopy Perturbation Method, Applied Mathematics and Computation, 219, 3565-3574...In a recent paper, Noor and Khan [M. Aslam Noor, & W. A. Khan, (2012) New Iterative Methods for Solving Nonlinear Equation by Using Homotopy Perturbation Method, Applied Mathematics and Computation, 219, 3565-3574], suggested a fourth-order method for solving nonlinear equations. Per iteration in this method requires two evaluations of the function and two of its first derivatives;therefore, the efficiency index is 1.41421 as Newton’s method. In this paper, we modified this method and obtained a family of iterative methods for appropriate and suitable choice of the parameter. It should be noted that per iteration for the new methods requires two evaluations of the function and one evaluation of its first derivatives, so its efficiency index equals to 1.5874. Analysis of convergence shows that the methods are fourth-order. Several numerical examples are given to illustrate the performance of the presented methods.展开更多
In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic co...In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.展开更多
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 solutio...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.展开更多
We present a simple yet effective and applicable scheme,based on quadrature,for constructing optimal iterative methods.According to the,still unproved,Kung-Traub conjecture an optimal iterative method based on n+1 eva...We present a simple yet effective and applicable scheme,based on quadrature,for constructing optimal iterative methods.According to the,still unproved,Kung-Traub conjecture an optimal iterative method based on n+1 evaluations could achieve a maximum convergence order of 2n.Through quadrature,we develop optimal iterative methods of orders four and eight.The scheme can further be applied to develop iterative methods of even higher orders.Computational results demonstrate that the developed methods are efficient as compared with many well known methods.展开更多
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...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.展开更多
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-linea...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).展开更多
Cloud computing(CC)is an advanced technology that provides access to predictive resources and data sharing.The cloud environment represents the right type regarding cloud usage model ownership,size,and rights to acces...Cloud computing(CC)is an advanced technology that provides access to predictive resources and data sharing.The cloud environment represents the right type regarding cloud usage model ownership,size,and rights to access.It introduces the scope and nature of cloud computing.In recent times,all processes are fed into the system for which consumer data and cache size are required.One of the most security issues in the cloud environment is Distributed Denial of Ser-vice(DDoS)attacks,responsible for cloud server overloading.This proposed sys-tem ID3(Iterative Dichotomiser 3)Maximum Multifactor Dimensionality Posteriori Method(ID3-MMDP)is used to overcome the drawback and a rela-tively simple way to execute and for the detection of(DDoS)attack.First,the pro-posed ID3-MMDP method calls for the resources of the cloud platform and then implements the attack detection technology based on information entropy to detect DDoS attacks.Since because the entropy value can show the discrete or aggregated characteristics of the current data set,it can be used for the detection of abnormal dataflow,User-uploaded data,ID3-MMDP system checks and read risk measurement and processing,bug ratingfile size changes,orfile name changes and changes in the format design of the data size entropy value.Unique properties can be used whenever the program approaches any data error to detect abnormal data services.Finally,the experiment also verifies the DDoS attack detection capability algorithm.展开更多
In this note we at first briefly review iterative methods for effectively approaching a root of an unknown multiplicity. We describe a first order, then a second order estimate for the multiplicity index m of the appr...In this note we at first briefly review iterative methods for effectively approaching a root of an unknown multiplicity. We describe a first order, then a second order estimate for the multiplicity index m of the approached root. Next we present a second order, two-step method for iteratively nearing a root of an unknown multiplicity. Subsequently, we introduce a novel chord, or a two- step method, not requiring beforehand knowledge of the multiplicity index m of the sought root, nor requiring higher order derivatives of the equilibrium function, which is quadratically convergent for any , and then reverts to superlinear.展开更多
Massive multiple-input multiple-output(MIMO) system is capable of substantially improving the spectral efficiency as well as the capacity of wireless networks relying on equipping a large number of antenna elements at...Massive multiple-input multiple-output(MIMO) system is capable of substantially improving the spectral efficiency as well as the capacity of wireless networks relying on equipping a large number of antenna elements at the base stations. However, the excessively high computational complexity of the signal detection in massive MIMO systems imposes a significant challenge for practical hardware implementations. In this paper, we propose a novel minimum mean square error(MMSE) signal detection using the accelerated overrelaxation(AOR) iterative method without complicated matrix inversion, which is capable of reducing the overall complexity of the classical MMSE algorithm by an order of magnitude. Simulation results show that the proposed AOR-based method can approach the conventional MMSE signal detection with significant complexity reduction.展开更多
In the digital image correlation research of fatigue crack growth rate,the accuracy of the crack tip position determines the accuracy of the calculation of the stress intensity factor,thereby affecting the life predic...In the digital image correlation research of fatigue crack growth rate,the accuracy of the crack tip position determines the accuracy of the calculation of the stress intensity factor,thereby affecting the life prediction.This paper proposes a Gauss-Newton iteration method for solving the crack tip position.The conventional linear fitting method provides an iterative initial solution for this method,and the preconditioned conjugate gradient method is used to solve the ill-conditioned matrix.A noise-added artificial displacement field is used to verify the feasibility of the method,which shows that all parameters can be solved with satisfactory results.The actual stress intensity factor solution case shows that the stress intensity factor value obtained by the method in this paper is very close to the finite element result,and the relative error between the two is only−0.621%;The Williams coefficient obtained by this method can also better define the contour of the plastic zone at the crack tip,and the maximum relative error with the test plastic zone area is−11.29%.The relative error between the contour of the plastic zone defined by the conventional method and the area of the experimental plastic zone reached a maximum of 26.05%.The crack tip coordinates,stress intensity factors,and plastic zone contour changes in the loading and unloading phases are explored.The results show that the crack tip change during the loading process is faster than the change during the unloading process;the stress intensity factor during the unloading process under the same load condition is larger than that during the loading process;under the same load,the theoretical plastic zone during the unloading process is higher than that during the loading process.展开更多
In this work, we applied two electromagnetic models for the characterization of a planar structure including a flat, thick copper conductor. Indeed the first model is consisted by modeling two metal ribbons without bu...In this work, we applied two electromagnetic models for the characterization of a planar structure including a flat, thick copper conductor. Indeed the first model is consisted by modeling two metal ribbons without bulkiness, placed one above the other at a distance of h<sub>2</sub> equal to the thickness of the thick conductor. This approach has been implemented and tested by the iterative method. The results of simulations have been compared with those calculated by the Ansoft HFSS software, and they are in good concordance, validating the method of analysis used. The second model is based on the calculation of the effective permittivity of the medium containing the thick conductor. This medium consists of a metallic region of complex relative permittivity , the rest of this medium is filled with air e<sub>r</sub><sub>2</sub> = 1. The effective permittivity e<sub>eff</sub> calculated from these two relative permittivity e<sub>r</sub><sub>2</sub> and . Comparing the simulation results of this new formulation of the iterative method with those calculated by the software Ansoft HFSS shows that they are in good matching which validates the second model.展开更多
The skin effect is an electromagnetic phenomenon that makes the current flows only on the surface of the conductors at high frequency. This article is based on the phenomenon to model a structure made in coplanar tech...The skin effect is an electromagnetic phenomenon that makes the current flows only on the surface of the conductors at high frequency. This article is based on the phenomenon to model a structure made in coplanar technology. In reality, these types of structures integrated metal layers of different thickness of copper (9 μm, 18 μm, 35 μm, 70 μm). The neglect of this parameter introduces errors, sometimes significant, in the numerical calculations. This is why an iterative method (FWCIP) based on the wave concept was restated. Validation of results was carried out by comparison with those calculated by Ansoft HFSS software and Agilent ADS Technology. They show a good matching.展开更多
The mathematical modeling of solar cells is essential for any optimization operation of the efficiency or the diagnosis of photovoltaic generator. The photovoltaic module is generally represented by an equivalent circ...The mathematical modeling of solar cells is essential for any optimization operation of the efficiency or the diagnosis of photovoltaic generator. The photovoltaic module is generally represented by an equivalent circuit whose parameters are experimentally calculated by using the characteristic current-tension, I-V. The precise determination of these parameters stays a challenge for the researchers, making to a big difference in the models and the digital methods dedicated to their characterizations. In the present paper, We are interested to characterize the parameters of single diode and two diodes models, in order to plan the behavior of the photovoltaic generator under real functioning conditions. We developed an identification method of the parameters using Newton Raphson method by using the software Matlab/Simulink. This method is the faster technique which allows the identification of several parameters and can be used in real time applications. The results of the proposed method show an accordance with the experimental and simulated characteristics of photovoltaic generator.展开更多
基金This work was supported by the National Natural Science Foundation of China
文摘This paper discusses a kind of implicit iterative methods with some variable parameters, which are called control parameters, for solving ill-posed operator equations. The theoretical results show that the new methods always lead to optimal convergence rates and have some other important features, especially the methods can be implemented parallelly.
基金We are grateful for the financial support from UKM’s research Grant GUP-2019-033。
文摘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.
基金partially supported by US NSF under Grant No.NSF-CNS-1066391and No.NSF-CNS-0914371,NSF-CPS-1135814 and NSF-CDI-1125165
文摘Many science and engineering applications involve solvinga linear least-squares system formed from some field measurements. In the distributed cyber-physical systems(CPS),each sensor node used for measurement often only knowspartial independent rows of the least-squares system. To solve the least-squares all the measurements must be gathered at a centralized location and then perform the computa-tion. Such data collection and computation are inefficient because of bandwidth and time constraints and sometimes areinfeasible because of data privacy concerns. Iterative methods are natural candidates for solving the aforementionedproblem and there are many studies regarding this. However,most of the proposed solutions are related to centralized/parallel computations while only a few have the potential to beapplied in distributed networks. Thus distributed computations are strongly preferred or demanded in many of the realworld applications, e.g. smart-grid, target tracking, etc. Thispaper surveys the representative iterative methods for distributed least-squares in networks.
文摘Let the linear system Ax=b where the coefficient matrix A=(a<sub>ij</sub>)∈R<sup>m,n</sup> is an L-ma-trix(that is,a<sub>ij</sub>】0 (?) i and a<sub>ij</sub>≤0 (?) i≠j),A=I-L-U,I is the identity matrix,-L and-U are,respectively,strictly lower and strictly upper triangular parts of A.In[1]theauthors considered two preconditioned linear systems?x=(?) and ?x=(?)
文摘This paper considers practical, high-order methods for the iterative location of the roots of nonlinear equations, one at a time. Special attention is being paid to algorithms also applicable to multiple roots of initially known and unknown multiplicity. Efficient methods are presented in this note for the evaluation of the multiplicity index of the root being sought. Also reviewed here are super-linear and super-cubic methods that converge contrarily or alternatingly, enabling us, not only to approach the root briskly and confidently but also to actually bound and bracket it as we progress.
基金the NSF of China Grants 91937301 and 41675060,the National Key Scientific and Technological Infrastructure Project"EarthLab",and the ONR Grants N000141712375 and N000142012449 to the University of Oklahoma(OU)The numerical experiments were performed at the OU supercomputer SchoonerCIMMS by NOAA/Office of Oceanic and Atmospheric Research under NOAA-OU Cooperative Agreement#NA110AR4320072,U.S.Department of Commerce.
文摘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.
基金the Natural Science Foundation of China(Grant Nos.61673169,11301127,11701176,11626101,and 11601485)The Natural Science Foundation of Huzhou City(Grant No.2018YZ07).
文摘In this article,we construct the most powerful family of simultaneous iterative method with global convergence behavior among all the existing methods in literature for finding all roots of non-linear equations.Convergence analysis proved that the order of convergence of the family of derivative free simultaneous iterative method is nine.Our main aim is to check out the most regularly used simultaneous iterative methods for finding all roots of non-linear equations by studying their dynamical planes,numerical experiments and CPU time-methodology.Dynamical planes of iterative methods are drawn by using MATLAB for the comparison of global convergence properties of simultaneous iterative methods.Convergence behavior of the higher order simultaneous iterative methods are also illustrated by residual graph obtained from some numerical test examples.Numerical test examples,dynamical behavior and computational efficiency are provided to present the performance and dominant efficiency of the newly constructed derivative free family of simultaneous iterative method over existing higher order simultaneous methods in literature.
文摘In a recent paper, Noor and Khan [M. Aslam Noor, & W. A. Khan, (2012) New Iterative Methods for Solving Nonlinear Equation by Using Homotopy Perturbation Method, Applied Mathematics and Computation, 219, 3565-3574], suggested a fourth-order method for solving nonlinear equations. Per iteration in this method requires two evaluations of the function and two of its first derivatives;therefore, the efficiency index is 1.41421 as Newton’s method. In this paper, we modified this method and obtained a family of iterative methods for appropriate and suitable choice of the parameter. It should be noted that per iteration for the new methods requires two evaluations of the function and one evaluation of its first derivatives, so its efficiency index equals to 1.5874. Analysis of convergence shows that the methods are fourth-order. Several numerical examples are given to illustrate the performance of the presented methods.
文摘In this paper, a group of Gauss-Legendre iterative methods with cubic convergence for solving nonlinear systems are proposed. We construct the iterative schemes based on Gauss-Legendre quadrature formula. The cubic convergence and error equation are proved theoretically, and demonstrated numerically. Several numerical examples for solving the system of nonlinear equations and boundary-value problems of nonlinear ordinary differential equations (ODEs) are provided to illustrate the efficiency and performance of the suggested iterative methods.
文摘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.
文摘We present a simple yet effective and applicable scheme,based on quadrature,for constructing optimal iterative methods.According to the,still unproved,Kung-Traub conjecture an optimal iterative method based on n+1 evaluations could achieve a maximum convergence order of 2n.Through quadrature,we develop optimal iterative methods of orders four and eight.The scheme can further be applied to develop iterative methods of even higher orders.Computational results demonstrate that the developed methods are efficient as compared with many well known methods.
基金supported in part by the National Natural Science Foundation of China of No.61903096Guangzhou Key Laboratory of Software‐Defined Low Latency Network of No.202102100006Guangdong Basic and Applied Basic Research Foundation of No.2020A1515110414.
文摘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.
基金support provided by the Ministry of Science and Technology,Taiwan,ROC under Contract No.MOST 110-2221-E-019-044.
文摘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).
文摘Cloud computing(CC)is an advanced technology that provides access to predictive resources and data sharing.The cloud environment represents the right type regarding cloud usage model ownership,size,and rights to access.It introduces the scope and nature of cloud computing.In recent times,all processes are fed into the system for which consumer data and cache size are required.One of the most security issues in the cloud environment is Distributed Denial of Ser-vice(DDoS)attacks,responsible for cloud server overloading.This proposed sys-tem ID3(Iterative Dichotomiser 3)Maximum Multifactor Dimensionality Posteriori Method(ID3-MMDP)is used to overcome the drawback and a rela-tively simple way to execute and for the detection of(DDoS)attack.First,the pro-posed ID3-MMDP method calls for the resources of the cloud platform and then implements the attack detection technology based on information entropy to detect DDoS attacks.Since because the entropy value can show the discrete or aggregated characteristics of the current data set,it can be used for the detection of abnormal dataflow,User-uploaded data,ID3-MMDP system checks and read risk measurement and processing,bug ratingfile size changes,orfile name changes and changes in the format design of the data size entropy value.Unique properties can be used whenever the program approaches any data error to detect abnormal data services.Finally,the experiment also verifies the DDoS attack detection capability algorithm.
文摘In this note we at first briefly review iterative methods for effectively approaching a root of an unknown multiplicity. We describe a first order, then a second order estimate for the multiplicity index m of the approached root. Next we present a second order, two-step method for iteratively nearing a root of an unknown multiplicity. Subsequently, we introduce a novel chord, or a two- step method, not requiring beforehand knowledge of the multiplicity index m of the sought root, nor requiring higher order derivatives of the equilibrium function, which is quadratically convergent for any , and then reverts to superlinear.
基金supported by the key project of the National Natural Science Foundation of China (No. 61431001)Huawei Innovation Research Program, the 5G research program of China Mobile Research Institute (Grant No. [2015] 0615)+2 种基金the open research fund of National Mobile Communications Research Laboratory Southeast University (No.2017D02)Key Laboratory of Cognitive Radio and Information Processing, Ministry of Education (Guilin University of Electronic Technology)the Foundation of Beijing Engineering and Technology Center for Convergence Networks and Ubiquitous Services, and Keysight
文摘Massive multiple-input multiple-output(MIMO) system is capable of substantially improving the spectral efficiency as well as the capacity of wireless networks relying on equipping a large number of antenna elements at the base stations. However, the excessively high computational complexity of the signal detection in massive MIMO systems imposes a significant challenge for practical hardware implementations. In this paper, we propose a novel minimum mean square error(MMSE) signal detection using the accelerated overrelaxation(AOR) iterative method without complicated matrix inversion, which is capable of reducing the overall complexity of the classical MMSE algorithm by an order of magnitude. Simulation results show that the proposed AOR-based method can approach the conventional MMSE signal detection with significant complexity reduction.
基金Supported by National Natural Science Foundation of China(Grant No.51675446)Independent Research Project of State Key Laboratory of Traction Power(Grant No.2019TPL-T13).
文摘In the digital image correlation research of fatigue crack growth rate,the accuracy of the crack tip position determines the accuracy of the calculation of the stress intensity factor,thereby affecting the life prediction.This paper proposes a Gauss-Newton iteration method for solving the crack tip position.The conventional linear fitting method provides an iterative initial solution for this method,and the preconditioned conjugate gradient method is used to solve the ill-conditioned matrix.A noise-added artificial displacement field is used to verify the feasibility of the method,which shows that all parameters can be solved with satisfactory results.The actual stress intensity factor solution case shows that the stress intensity factor value obtained by the method in this paper is very close to the finite element result,and the relative error between the two is only−0.621%;The Williams coefficient obtained by this method can also better define the contour of the plastic zone at the crack tip,and the maximum relative error with the test plastic zone area is−11.29%.The relative error between the contour of the plastic zone defined by the conventional method and the area of the experimental plastic zone reached a maximum of 26.05%.The crack tip coordinates,stress intensity factors,and plastic zone contour changes in the loading and unloading phases are explored.The results show that the crack tip change during the loading process is faster than the change during the unloading process;the stress intensity factor during the unloading process under the same load condition is larger than that during the loading process;under the same load,the theoretical plastic zone during the unloading process is higher than that during the loading process.
文摘In this work, we applied two electromagnetic models for the characterization of a planar structure including a flat, thick copper conductor. Indeed the first model is consisted by modeling two metal ribbons without bulkiness, placed one above the other at a distance of h<sub>2</sub> equal to the thickness of the thick conductor. This approach has been implemented and tested by the iterative method. The results of simulations have been compared with those calculated by the Ansoft HFSS software, and they are in good concordance, validating the method of analysis used. The second model is based on the calculation of the effective permittivity of the medium containing the thick conductor. This medium consists of a metallic region of complex relative permittivity , the rest of this medium is filled with air e<sub>r</sub><sub>2</sub> = 1. The effective permittivity e<sub>eff</sub> calculated from these two relative permittivity e<sub>r</sub><sub>2</sub> and . Comparing the simulation results of this new formulation of the iterative method with those calculated by the software Ansoft HFSS shows that they are in good matching which validates the second model.
文摘The skin effect is an electromagnetic phenomenon that makes the current flows only on the surface of the conductors at high frequency. This article is based on the phenomenon to model a structure made in coplanar technology. In reality, these types of structures integrated metal layers of different thickness of copper (9 μm, 18 μm, 35 μm, 70 μm). The neglect of this parameter introduces errors, sometimes significant, in the numerical calculations. This is why an iterative method (FWCIP) based on the wave concept was restated. Validation of results was carried out by comparison with those calculated by Ansoft HFSS software and Agilent ADS Technology. They show a good matching.
文摘The mathematical modeling of solar cells is essential for any optimization operation of the efficiency or the diagnosis of photovoltaic generator. The photovoltaic module is generally represented by an equivalent circuit whose parameters are experimentally calculated by using the characteristic current-tension, I-V. The precise determination of these parameters stays a challenge for the researchers, making to a big difference in the models and the digital methods dedicated to their characterizations. In the present paper, We are interested to characterize the parameters of single diode and two diodes models, in order to plan the behavior of the photovoltaic generator under real functioning conditions. We developed an identification method of the parameters using Newton Raphson method by using the software Matlab/Simulink. This method is the faster technique which allows the identification of several parameters and can be used in real time applications. The results of the proposed method show an accordance with the experimental and simulated characteristics of photovoltaic generator.