In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introduc...In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.展开更多
The complex vibration directly affects the dynamic safety of drill string in ultra-deep wells and extra-deep wells.It is important to understand the dynamic characteristics of drill string to ensure the safety of dril...The complex vibration directly affects the dynamic safety of drill string in ultra-deep wells and extra-deep wells.It is important to understand the dynamic characteristics of drill string to ensure the safety of drill string.Due to the super slenderness ratio of drill string,strong nonlinearity implied in dynamic analysis and the complex load environment,dynamic simulation of drill string faces great challenges.At present,many simulation methods have been developed to analyze drill string dynamics,and node iteration method is one of them.The node iteration method has a unique advantage in dealing with the contact characteristics between drill string and borehole wall,but its drawback is that the calculation consumes a considerable amount of time.This paper presents a dynamic simulation method of drilling string in extra-deep well based on successive over-relaxation node iterative method(SOR node iteration method).Through theoretical analysis and numerical examples,the correctness and validity of this method were verified,and the dynamics characteristics of drill string in extra-deep wells were calculated and analyzed.The results demonstrate that,in contrast to the conventional node iteration method,the SOR node iteration method can increase the computational efficiency by 48.2%while achieving comparable results.And the whirl trajectory of the extra-deep well drill string is extremely complicated,the maximum rotational speed downhole is approximately twice the rotational speed on the ground.The dynamic torque increases rapidly at the position of the bottom stabilizer,and the lateral vibration in the middle and lower parts of drill string is relatively intense.展开更多
Iterative coupled methods are widely used in multi-fidelity simulation of rotating components due to the simple implementation,which iteratively eliminates the errors between the computational fluid dynamics models an...Iterative coupled methods are widely used in multi-fidelity simulation of rotating components due to the simple implementation,which iteratively eliminates the errors between the computational fluid dynamics models and approximate characteristic maps.However,the convergence and accuracy of the iterative coupled method are trapped in characteristic maps.In particular,iterative steps increase sharply as the operation point moves away from the design point.To address these problems,this paper developed an auxiliary iterative coupled method that introduces the static-pressure-auxiliary characteristic maps and modification factor of mass flow into the component-level model.The developed auxiliary method realized the direct transfer of static pressure between the high-fidelity models and the component-level model.Multi-fidelity simulations of the throttle characteristics were carried out using both the auxiliary and traditional iterative coupled methods,and the simulation results were verified using the experimental data.Additionally,the consistency between the auxiliary and traditional iterative coupled methods was confirmed.Subsequently,multi-fidelity simulations of the speed and altitude characteristics were also conducted.The auxiliary and traditional iterative coupled methods were evaluated in terms of convergence speed and accuracy.The evaluation indicated that the auxiliary iterative coupled method significantly reduces iterative steps by approximately 50%at the near-choked state.In general,the auxiliary iterative coupled method is preferred as a development of the traditional iterative coupled method in the near-choked state,and the combined auxiliary-traditional iterative coupled method provides support for successful multi-fidelity simulation in far-off-design conditions.展开更多
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 ent...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.展开更多
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.展开更多
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...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.展开更多
The preconditioned Gauss-Seidel type iterative method for solving linear systems, with the proper choice of the preconditioner, is presented. Convergence of the preconditioned method applied to Z-matrices is discussed...The preconditioned Gauss-Seidel type iterative method for solving linear systems, with the proper choice of the preconditioner, is presented. Convergence of the preconditioned method applied to Z-matrices is discussed. Also the optimal parameter is presented. Numerical results show that the proper choice of the preconditioner can lead to effective by the preconditioned Gauss-Seidel type iterative methods for solving linear systems.展开更多
In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-m...In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.展开更多
Using the monotone iterative method and Monch Fixed point theorem, the existence of solutions and coupled minimal and maximal quasisolutions of initial value problems for mixed monotone second-order integro-differenti...Using the monotone iterative method and Monch Fixed point theorem, the existence of solutions and coupled minimal and maximal quasisolutions of initial value problems for mixed monotone second-order integro-differential equations in Banach spaces are studied. Some existence theorems of solutions and coupled minimal and maximal quasisolutions are obtained.展开更多
In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of th...In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of the mappings which solves some variational inequality. The results presented extend the corresponding results of Shimizu and Takahashi IT. Shimizu, W. Takahashi, Strong convergence to common fixed point of families of nonexpansive mappings, J. Math. Anal. Appl. 211 （1997）, 71-83], and Yao and Chen [Y. Yao, R. Chert, Convergence to common fixed points of average mappings without commutativity assumption in Hilbert spaces, Nonlinear Analysis 67（2007）, 1758-1763].展开更多
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...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.展开更多
Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterativ...Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterative methods and provide a reference for further study and design. Finally, a new iterative method is designed named as the diverse relaxation parameter of the SOR method which, in particular, demonstrates the geometric characteristics. Many examples prove that the method is quite effective.展开更多
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 this paper, the existence of solutions for discontinuous nonlinear parabolic differential IBVP is proved by using a more generalized monotone iterative method. Moreover, the convergence of this method is discussed.
Downward continuation is a key step in processing airborne geomagnetic data. However,downward continuation is a typically ill-posed problem because its computation is unstable; thus, regularization methods are needed ...Downward continuation is a key step in processing airborne geomagnetic data. However,downward continuation is a typically ill-posed problem because its computation is unstable; thus, regularization methods are needed to realize effective continuation. According to the Poisson integral plane approximate relationship between observation and continuation data, the computation formulae combined with the fast Fourier transform（FFT）algorithm are transformed to a frequency domain for accelerating the computational speed. The iterative Tikhonov regularization method and the iterative Landweber regularization method are used in this paper to overcome instability and improve the precision of the results. The availability of these two iterative regularization methods in the frequency domain is validated by simulated geomagnetic data, and the continuation results show good precision.展开更多
Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design...Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.展开更多
Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based ...Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based on the optimal steep descent methods, we present an algorithm which combines the preconditioned bi-conjugated gradient stable method and the multi-grid method to compute the wave propagation and the gradient space. The multiple scale prosperity of the waveform inversion and the multi-grid method can overcome the inverse problems local minima defect and accelerate convergence. The local inhomogeneous three-hole model simulated results and the Marmousi model certify the algorithm effectiveness.展开更多
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 validi...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.展开更多
In this paper, we study the mixed element method for Sobolev equations. A time-discretization procedure is presented and analysed and the optimal order error estimates are derived.For convenience in practical computat...In this paper, we study the mixed element method for Sobolev equations. A time-discretization procedure is presented and analysed and the optimal order error estimates are derived.For convenience in practical computation, an alternating-direction iterative scheme of the mixed fi-nite element method is formulated and its stability and converbence are proved for the linear prob-lem. A numerical example is provided at the end of this paper.展开更多
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 no...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.展开更多
基金Supported by the National Natural Science Foundation of China(12061048)NSF of Jiangxi Province(20232BAB201026,20232BAB201018)。
文摘In this paper,a new technique is introduced to construct higher-order iterative methods for solving nonlinear systems.The order of convergence of some iterative methods can be improved by three at the cost of introducing only one additional evaluation of the function in each step.Furthermore,some new efficient methods with a higher-order of convergence are obtained by using only a single matrix inversion in each iteration.Analyses of convergence properties and computational efficiency of these new methods are made and testified by several numerical problems.By comparison,the new schemes are more efficient than the corresponding existing ones,particularly for large problem sizes.
基金supported by the National Natural Science Foundation of China(52174003,52374008).
文摘The complex vibration directly affects the dynamic safety of drill string in ultra-deep wells and extra-deep wells.It is important to understand the dynamic characteristics of drill string to ensure the safety of drill string.Due to the super slenderness ratio of drill string,strong nonlinearity implied in dynamic analysis and the complex load environment,dynamic simulation of drill string faces great challenges.At present,many simulation methods have been developed to analyze drill string dynamics,and node iteration method is one of them.The node iteration method has a unique advantage in dealing with the contact characteristics between drill string and borehole wall,but its drawback is that the calculation consumes a considerable amount of time.This paper presents a dynamic simulation method of drilling string in extra-deep well based on successive over-relaxation node iterative method(SOR node iteration method).Through theoretical analysis and numerical examples,the correctness and validity of this method were verified,and the dynamics characteristics of drill string in extra-deep wells were calculated and analyzed.The results demonstrate that,in contrast to the conventional node iteration method,the SOR node iteration method can increase the computational efficiency by 48.2%while achieving comparable results.And the whirl trajectory of the extra-deep well drill string is extremely complicated,the maximum rotational speed downhole is approximately twice the rotational speed on the ground.The dynamic torque increases rapidly at the position of the bottom stabilizer,and the lateral vibration in the middle and lower parts of drill string is relatively intense.
基金funded by the Science and Technology Innovation Committee Foundation of Shenzhen,China(Nos.JCYJ20200109141403840 and ZDSYS20220527171405012)the National Natural Science Foundation of China(No.52106045)the Pearl River Talent Recruitment Program,China(No.2019CX01Z084)。
文摘Iterative coupled methods are widely used in multi-fidelity simulation of rotating components due to the simple implementation,which iteratively eliminates the errors between the computational fluid dynamics models and approximate characteristic maps.However,the convergence and accuracy of the iterative coupled method are trapped in characteristic maps.In particular,iterative steps increase sharply as the operation point moves away from the design point.To address these problems,this paper developed an auxiliary iterative coupled method that introduces the static-pressure-auxiliary characteristic maps and modification factor of mass flow into the component-level model.The developed auxiliary method realized the direct transfer of static pressure between the high-fidelity models and the component-level model.Multi-fidelity simulations of the throttle characteristics were carried out using both the auxiliary and traditional iterative coupled methods,and the simulation results were verified using the experimental data.Additionally,the consistency between the auxiliary and traditional iterative coupled methods was confirmed.Subsequently,multi-fidelity simulations of the speed and altitude characteristics were also conducted.The auxiliary and traditional iterative coupled methods were evaluated in terms of convergence speed and accuracy.The evaluation indicated that the auxiliary iterative coupled method significantly reduces iterative steps by approximately 50%at the near-choked state.In general,the auxiliary iterative coupled method is preferred as a development of the traditional iterative coupled method in the near-choked state,and the combined auxiliary-traditional iterative coupled method provides support for successful multi-fidelity simulation in far-off-design conditions.
基金supported by National Natural Science Foundation of China(62371225,62371227)。
文摘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.
文摘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.
文摘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.
基金Project supported by MOE's 2004 New Century Excellent Talent Program (NCET)the Applied Basic Research Foundations of Sichuan Province (No.05JY029-068-2)
文摘The preconditioned Gauss-Seidel type iterative method for solving linear systems, with the proper choice of the preconditioner, is presented. Convergence of the preconditioned method applied to Z-matrices is discussed. Also the optimal parameter is presented. Numerical results show that the proper choice of the preconditioner can lead to effective by the preconditioned Gauss-Seidel type iterative methods for solving linear systems.
文摘In this paper, the asynchronous versions of classical iterative methods for solving linear systems of equations are considered. Sufficient conditions for convergence of asynchronous relaxed processes are given for H-matrix by which nor only the requirements of [3] on coefficient matrix are lowered, but also a larger region of convergence than that in [3] is obtained.
文摘Using the monotone iterative method and Monch Fixed point theorem, the existence of solutions and coupled minimal and maximal quasisolutions of initial value problems for mixed monotone second-order integro-differential equations in Banach spaces are studied. Some existence theorems of solutions and coupled minimal and maximal quasisolutions are obtained.
基金the Thailand Research Fund for financial support under Grant BRG5280016
文摘In this article, we introduce a new viscosity iterative method for two nonexpansive mappings in Hilbert spaces. We also prove, without commutativity assumption, that the iterates converge to a common fixed point of the mappings which solves some variational inequality. The results presented extend the corresponding results of Shimizu and Takahashi IT. Shimizu, W. Takahashi, Strong convergence to common fixed point of families of nonexpansive mappings, J. Math. Anal. Appl. 211 （1997）, 71-83], and Yao and Chen [Y. Yao, R. Chert, Convergence to common fixed points of average mappings without commutativity assumption in Hilbert spaces, Nonlinear Analysis 67（2007）, 1758-1763].
文摘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.
基金Supported by the National Natural Science Foundation of China(61272300)
文摘Two kinds of iterative methods are designed to solve the linear system of equations, we obtain a new interpretation in terms of a geometric concept. Therefore, we have a better insight into the essence of the iterative methods and provide a reference for further study and design. Finally, a new iterative method is designed named as the diverse relaxation parameter of the SOR method which, in particular, demonstrates the geometric characteristics. Many examples prove that the method is quite effective.
基金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.
文摘In this paper, the existence of solutions for discontinuous nonlinear parabolic differential IBVP is proved by using a more generalized monotone iterative method. Moreover, the convergence of this method is discussed.
基金supported by the National Natural Science Foundation of China(41304022,41174026,41104047)the National 973 Foundation(61322201,2013CB733303)+1 种基金the Key laboratory Foundation of Geo-space Environment and Geodesy of the Ministry of Education(13-01-08)the Youth Innovation Foundation of High Resolution Earth Observation(GFZX04060103-5-12)
文摘Downward continuation is a key step in processing airborne geomagnetic data. However,downward continuation is a typically ill-posed problem because its computation is unstable; thus, regularization methods are needed to realize effective continuation. According to the Poisson integral plane approximate relationship between observation and continuation data, the computation formulae combined with the fast Fourier transform（FFT）algorithm are transformed to a frequency domain for accelerating the computational speed. The iterative Tikhonov regularization method and the iterative Landweber regularization method are used in this paper to overcome instability and improve the precision of the results. The availability of these two iterative regularization methods in the frequency domain is validated by simulated geomagnetic data, and the continuation results show good precision.
基金Project supported by the National Natural Science Foundation of China(No.61603322)the Research Foundation of Education Bureau of Hunan Province of China(No.16C1542)
文摘Motivated by the study of regularization for sparse problems,we propose a new regularization method for sparse vector recovery.We derive sufficient conditions on the well-posedness of the new regularization,and design an iterative algorithm,namely the iteratively reweighted algorithm(IR-algorithm),for efficiently computing the sparse solutions to the proposed regularization model.The convergence of the IR-algorithm and the setting of the regularization parameters are analyzed at length.Finally,we present numerical examples to illustrate the features of the new regularization and algorithm.
基金supported by the China State Key Science and Technology Project on Marine Carbonate Reservoir Characterization (No. 2011ZX05004-003)the Basic Research Programs of CNPC during the 12th Five-Year Plan Period (NO.2011A-3603)+1 种基金the Natural Science Foundation of China (No.41104066)the RIPED Young Professional Innovation Fund (NO.2010-13-16-02, 2010-A-26-02)
文摘Although full waveform inversion in the frequency domain can overcome the local minima problem in the time direction, such problem still exists in the space direction because of the media subsurface complexity. Based on the optimal steep descent methods, we present an algorithm which combines the preconditioned bi-conjugated gradient stable method and the multi-grid method to compute the wave propagation and the gradient space. The multiple scale prosperity of the waveform inversion and the multi-grid method can overcome the inverse problems local minima defect and accelerate convergence. The local inhomogeneous three-hole model simulated results and the Marmousi model certify the algorithm effectiveness.
文摘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.
基金the National Natural Science Foundation of China and China State Key Project for Basic Researches
文摘In this paper, we study the mixed element method for Sobolev equations. A time-discretization procedure is presented and analysed and the optimal order error estimates are derived.For convenience in practical computation, an alternating-direction iterative scheme of the mixed fi-nite element method is formulated and its stability and converbence are proved for the linear prob-lem. A numerical example is provided at the end of this paper.
基金work is supported by the Fundamental Research Funds for the Central Universities(No.3102019HTQD014)of Northwestern Polytechnical UniversityFunding of National Key Laboratory of Astronautical Flight DynamicsYoung Talent Support Project of Shaanxi State.
文摘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.
