3D eikonal equation is a partial differential equation for the calculation of first-arrival traveltimes and has been widely applied in many scopes such as ray tracing,source localization,reflection migration,seismic m...3D eikonal equation is a partial differential equation for the calculation of first-arrival traveltimes and has been widely applied in many scopes such as ray tracing,source localization,reflection migration,seismic monitoring and tomographic imaging.In recent years,many advanced methods have been developed to solve the 3D eikonal equation in heterogeneous media.However,there are still challenges for the stable and accurate calculation of first-arrival traveltimes in 3D strongly inhomogeneous media.In this paper,we propose an adaptive finite-difference(AFD)method to numerically solve the 3D eikonal equation.The novel method makes full use of the advantages of different local operators characterizing different seismic wave types to calculate factors and traveltimes,and then the most accurate factor and traveltime are adaptively selected for the convergent updating based on the Fermat principle.Combined with global fast sweeping describing seismic waves propagating along eight directions in 3D media,our novel method can achieve the robust calculation of first-arrival traveltimes with high precision at grid points either near source point or far away from source point even in a velocity model with large and sharp contrasts.Several numerical examples show the good performance of the AFD method,which will be beneficial to many scientific applications.展开更多
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.展开更多
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.展开更多
Background Co-salient object detection(Co-SOD)aims to identify and segment commonly salient objects in a set of related images.However,most current Co-SOD methods encounter issues with the inclusion of irrelevant info...Background Co-salient object detection(Co-SOD)aims to identify and segment commonly salient objects in a set of related images.However,most current Co-SOD methods encounter issues with the inclusion of irrelevant information in the co-representation.These issues hamper their ability to locate co-salient objects and significantly restrict the accuracy of detection.Methods To address this issue,this study introduces a novel Co-SOD method with iterative purification and predictive optimization(IPPO)comprising a common salient purification module(CSPM),predictive optimizing module(POM),and diminishing mixed enhancement block(DMEB).Results These components are designed to explore noise-free joint representations,assist the model in enhancing the quality of the final prediction results,and significantly improve the performance of the Co-SOD algorithm.Furthermore,through a comprehensive evaluation of IPPO and state-of-the-art algorithms focusing on the roles of CSPM,POM,and DMEB,our experiments confirmed that these components are pivotal in enhancing the performance of the model,substantiating the significant advancements of our method over existing benchmarks.Experiments on several challenging benchmark co-saliency datasets demonstrate that the proposed IPPO achieves state-of-the-art performance.展开更多
Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyc...Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyclic Reduction algorithm is introduced via a decoupling in Kellogg’s method.展开更多
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.展开更多
The Time Fractional Burger equation was solved in this study using the Mabel software and the Variational Iteration approach. where a number of instances of the Time Fractional Burger Equation were handled using this ...The Time Fractional Burger equation was solved in this study using the Mabel software and the Variational Iteration approach. where a number of instances of the Time Fractional Burger Equation were handled using this technique. Tables and images were used to present the collected numerical results. The difference between the exact and numerical solutions demonstrates the effectiveness of the Mabel program’s solution, as well as the accuracy and closeness of the results this method produced. It also demonstrates the Mabel program’s ability to quickly and effectively produce the numerical solution.展开更多
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.展开更多
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.展开更多
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.展开更多
Equivalent staggered-grid(ESG) as a new family of schemes has been utilized in seismic modeling,imaging,and inversion.Traditionally,the Taylor series expansion is often applied to calculate finite-difference(FD) coeff...Equivalent staggered-grid(ESG) as a new family of schemes has been utilized in seismic modeling,imaging,and inversion.Traditionally,the Taylor series expansion is often applied to calculate finite-difference(FD) coefficients on spatial derivatives,but the simulation results suffer serious numerical dispersion on a large frequency zone.We develop an optimized equivalent staggered-grid(OESG) FD method that can simultaneously suppress temporal and spatial dispersion for solving the second-order system of the 3 D elastic wave equation.On the one hand,we consider the coupling relations between wave speeds and spatial derivatives in the elastic wave equation and give three sets of FD coefficients with respect to the P-wave,S-wave,and converted-wave(C-wave) terms.On the other hand,a novel plane wave solution for the 3 D elastic wave equation is derived from the matrix decomposition method to construct the time-space dispersion relations.FD coefficients of the OESG method can be acquired by solving the new dispersion equations based on the Newton iteration method.Finally,we construct a new objective function to analyze P-wave,S-wave,and C-wave dispersion concerning frequencies.The dispersion analyses show that the presented method produces less modeling errors than the traditional ESG method.The synthetic examples demonstrate the effectiveness and superiority of the presented method.展开更多
基金The authors thank the funds supported by the China National Nuclear Corporation under Grants Nos.WUQNYC2101 and WUHTLM2101-04National Natural Science Foundation of China(42074132,42274154).
文摘3D eikonal equation is a partial differential equation for the calculation of first-arrival traveltimes and has been widely applied in many scopes such as ray tracing,source localization,reflection migration,seismic monitoring and tomographic imaging.In recent years,many advanced methods have been developed to solve the 3D eikonal equation in heterogeneous media.However,there are still challenges for the stable and accurate calculation of first-arrival traveltimes in 3D strongly inhomogeneous media.In this paper,we propose an adaptive finite-difference(AFD)method to numerically solve the 3D eikonal equation.The novel method makes full use of the advantages of different local operators characterizing different seismic wave types to calculate factors and traveltimes,and then the most accurate factor and traveltime are adaptively selected for the convergent updating based on the Fermat principle.Combined with global fast sweeping describing seismic waves propagating along eight directions in 3D media,our novel method can achieve the robust calculation of first-arrival traveltimes with high precision at grid points either near source point or far away from source point even in a velocity model with large and sharp contrasts.Several numerical examples show the good performance of the AFD method,which will be beneficial to many scientific applications.
基金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.
基金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.
基金Supported by the National Natural Science Foundation of China under Grant(62301330,62101346)the Guangdong Basic and Applied Basic Research Foundation(2024A1515010496,2022A1515110101)+1 种基金the Stable Support Plan for Shenzhen Higher Education Institutions(20231121103807001)the Guangdong Provincial Key Laboratory under(2023B1212060076).
文摘Background Co-salient object detection(Co-SOD)aims to identify and segment commonly salient objects in a set of related images.However,most current Co-SOD methods encounter issues with the inclusion of irrelevant information in the co-representation.These issues hamper their ability to locate co-salient objects and significantly restrict the accuracy of detection.Methods To address this issue,this study introduces a novel Co-SOD method with iterative purification and predictive optimization(IPPO)comprising a common salient purification module(CSPM),predictive optimizing module(POM),and diminishing mixed enhancement block(DMEB).Results These components are designed to explore noise-free joint representations,assist the model in enhancing the quality of the final prediction results,and significantly improve the performance of the Co-SOD algorithm.Furthermore,through a comprehensive evaluation of IPPO and state-of-the-art algorithms focusing on the roles of CSPM,POM,and DMEB,our experiments confirmed that these components are pivotal in enhancing the performance of the model,substantiating the significant advancements of our method over existing benchmarks.Experiments on several challenging benchmark co-saliency datasets demonstrate that the proposed IPPO achieves state-of-the-art performance.
文摘Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyclic Reduction algorithm is introduced via a decoupling in Kellogg’s method.
基金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.
文摘The Time Fractional Burger equation was solved in this study using the Mabel software and the Variational Iteration approach. where a number of instances of the Time Fractional Burger Equation were handled using this technique. Tables and images were used to present the collected numerical results. The difference between the exact and numerical solutions demonstrates the effectiveness of the Mabel program’s solution, as well as the accuracy and closeness of the results this method produced. It also demonstrates the Mabel program’s ability to quickly and effectively produce the numerical solution.
文摘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.
文摘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.
文摘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.
文摘Equivalent staggered-grid(ESG) as a new family of schemes has been utilized in seismic modeling,imaging,and inversion.Traditionally,the Taylor series expansion is often applied to calculate finite-difference(FD) coefficients on spatial derivatives,but the simulation results suffer serious numerical dispersion on a large frequency zone.We develop an optimized equivalent staggered-grid(OESG) FD method that can simultaneously suppress temporal and spatial dispersion for solving the second-order system of the 3 D elastic wave equation.On the one hand,we consider the coupling relations between wave speeds and spatial derivatives in the elastic wave equation and give three sets of FD coefficients with respect to the P-wave,S-wave,and converted-wave(C-wave) terms.On the other hand,a novel plane wave solution for the 3 D elastic wave equation is derived from the matrix decomposition method to construct the time-space dispersion relations.FD coefficients of the OESG method can be acquired by solving the new dispersion equations based on the Newton iteration method.Finally,we construct a new objective function to analyze P-wave,S-wave,and C-wave dispersion concerning frequencies.The dispersion analyses show that the presented method produces less modeling errors than the traditional ESG method.The synthetic examples demonstrate the effectiveness and superiority of the presented method.
