The fast solution of linear equations has always been one of the hot spots in scientific computing.A kind of the diagonal matrix splitting iteration methods are provided,which is different from the classical matrix sp...The fast solution of linear equations has always been one of the hot spots in scientific computing.A kind of the diagonal matrix splitting iteration methods are provided,which is different from the classical matrix splitting methods.Taking the decomposition of the diagonal elements for coefficient matrix as the key point,some new preconditioners are constructed.Taking the tri-diagonal coefficient matrix as an example,the convergence domains and optimal relaxation factor of the new method are analyzed theoretically.The presented new iteration methods are applied to solve linear algebraic equations,even 2D and 3D diffusion problems with the fully implicit discretization.The results of numerical experiments are matched with the theoretical analysis,and show that the iteration numbers are reduced greatly.The superiorities of presented iteration methods exceed some classical iteration methods dramatically.展开更多
In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.1...In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.展开更多
Several preconditioners are proposed for improving the convergence rate of the iterative method derived from splitting. In this paper, the comparison theorem of preconditioned iterative method for regular splitting is...Several preconditioners are proposed for improving the convergence rate of the iterative method derived from splitting. In this paper, the comparison theorem of preconditioned iterative method for regular splitting is proved. And the convergence and comparison theorem for any preconditioner are indicated. This comparison theorem indicates the possibility of finding new preconditioner and splitting. The purpose of this paper is to show that the preconditioned iterative method yields a new splitting satisfying the regular or weak regular splitting. And new combination preconditioners are proposed. In order to denote the validity of the comparison theorem, some numerical examples are shown.展开更多
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).展开更多
In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged ...In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.展开更多
Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly im...Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly implicit alternating sweeping is implemented in the direction of the third dimension. Very rapid convergence rate is obtained with CFL number reaching the order of 100. The memory resources can be greatly saved too. It is verified that the reflection boundary condition can not be used with flux vector splitting since it will produce too large numerical dissipation. The computed flow fields agree well with experimental results. Only one or two grid points are there within the shock transition zone.展开更多
For stabilized saddle-point problems, we apply the two iteration parameters idea for regularized Hermitian and skew-Hermitian splitting (RHSS) method and establish accelerated RHSS (ARHSS) iteration method. Theoretica...For stabilized saddle-point problems, we apply the two iteration parameters idea for regularized Hermitian and skew-Hermitian splitting (RHSS) method and establish accelerated RHSS (ARHSS) iteration method. Theoretical analysis shows that the ARHSS method converges unconditionally to the unique solution of the saddle point problem. Finally, we use a numerical example to confirm the effectiveness of the method.展开更多
Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A 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.展开更多
This paper deals with an efficient two-step time split explicit/implicit scheme applied to a two-dimensional nonlinear unsteady convection-diffusionreaction equation.The computational cost of the new algorithm at each...This paper deals with an efficient two-step time split explicit/implicit scheme applied to a two-dimensional nonlinear unsteady convection-diffusionreaction equation.The computational cost of the new algorithm at each time level is equivalent to solving a pentadiagonalmatrix equation with strictly dominant diagonal elements.Such a bandwidth matrix can be easily inverted using the Gaussian Decomposition and the corresponding linear system should be solved by the back substitutionmethod.The proposed approach is unconditionally stable,temporal second-order accuracy and fourth-order convergence in space.These results suggest that the developed technique is faster and more efficient than a large class of numerical methods studied in the literature for the considered initial-boundary value problem.Numerical experiments are carried out to confirm the theoretical analysis and to demonstrate the performance of the constructed numerical scheme.展开更多
The discretization of the fractional regime-switching option pricing model leads to the linear system with the block diagonal and Kronecker product structure.A fast matrix splitting iteration method is presented to so...The discretization of the fractional regime-switching option pricing model leads to the linear system with the block diagonal and Kronecker product structure.A fast matrix splitting iteration method is presented to solve the discrete system.Theoretical analyses prove the convergence of the proposed iteration method.Numerical experiments show that the new method is efficient and outperforms the existing methods in terms of the number of iteration steps and the elapsed CPU time.展开更多
This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to ...This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to improve the convergence. And its convergence is proved un- der some suitable conditions. Numerical results illustrate that the bi-extrapolated subgradient projection algorithm converges more quickly than the existing algorithms.展开更多
An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. Howe...An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. However, in clinical diagnosis, it is necessary to reconstruct a susceptibility map efficiently with an appropriate method. Here, a modified QSM reconstruction method called weighted total variation using split Bregman （WTVSB） is proposed. It reconstructs the susceptibility map with fast computational speed and effective artifact suppression by incorporating noise-suppressed data weighting with split Bregman iteration. The noise-suppressed data weighting is determined using the Laplacian of the calculated local field, which can prevent the noise and errors in field maps from spreading into the susceptibility inversion. The split Bregman iteration accelerates the solution of the Ll-regularized reconstruction model by utilizing a preconditioned conjugate gradient solver. In an experiment, the proposed reconstruction method is compared with truncated k-space division （TKD）, morphology enabled dipole inversion （MEDI）, total variation using the split Bregman （TVSB） method for numerical simulation, phantom and in vivo human brain data evaluated by root mean square error and mean structure similarity. Experimental results demonstrate that our proposed method can achieve better balance between accuracy and efficiency of QSM reconstruction than conventional methods, and thus facilitating clinical applications of QSM.展开更多
Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudaf...Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.展开更多
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.展开更多
基金The National Natural Science Foundations of China (12202219)the Natural Science Foundations of Ningxia (2024AAC02009, 2023AAC05001)the Ningxia Youth Top Talents Training Project。
文摘The fast solution of linear equations has always been one of the hot spots in scientific computing.A kind of the diagonal matrix splitting iteration methods are provided,which is different from the classical matrix splitting methods.Taking the decomposition of the diagonal elements for coefficient matrix as the key point,some new preconditioners are constructed.Taking the tri-diagonal coefficient matrix as an example,the convergence domains and optimal relaxation factor of the new method are analyzed theoretically.The presented new iteration methods are applied to solve linear algebraic equations,even 2D and 3D diffusion problems with the fully implicit discretization.The results of numerical experiments are matched with the theoretical analysis,and show that the iteration numbers are reduced greatly.The superiorities of presented iteration methods exceed some classical iteration methods dramatically.
基金supported by the Scientific Computing Research Innovation Team of Guangdong Province(no.2021KCXTD052)the Science and Technology Development Fund,Macao SAR(no.0096/2022/A,0151/2022/A)+3 种基金University of Macao(no.MYRG2020-00035-FST,MYRG2022-00076-FST)the Guangdong Key Construction Discipline Research Capacity Enhancement Project(no.2022ZDJS049)Technology Planning Project of Shaoguan(no.210716094530390)the ScienceFoundation of Shaoguan University(no.SZ2020KJ01).
文摘In this paper,a two-step iteration method is established which can be viewed as a generalization of the existing modulus-based methods for vertical linear complementarity problems given by He and Vong(Appl.Math.Lett.134:108344,2022).The convergence analysis of the proposed method is established,which can improve the existing results.Numerical examples show that the proposed method is efficient with the two-step technique.
文摘Several preconditioners are proposed for improving the convergence rate of the iterative method derived from splitting. In this paper, the comparison theorem of preconditioned iterative method for regular splitting is proved. And the convergence and comparison theorem for any preconditioner are indicated. This comparison theorem indicates the possibility of finding new preconditioner and splitting. The purpose of this paper is to show that the preconditioned iterative method yields a new splitting satisfying the regular or weak regular splitting. And new combination preconditioners are proposed. In order to denote the validity of the comparison theorem, some numerical examples are shown.
基金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).
文摘In this paper, we use resolvent operator technology to construct a viscosity approximate algorithm to approximate a common solution of split variational inclusion problem and split fixed point problem for an averaged mapping in real Hilbert spaces. Further, we prove that the sequences generated by the proposed iterative method converge strongly to a common solution of split variational inclusion problem and split fixed point problem for averaged mappings which is also the unique solution of the variational inequality problem. The results presented here improve and extend the corresponding results in this area.
文摘Three dimensional Euler equations are solved in the finite volume form with van Leer's flux vector splitting technique. Block matrix is inverted by Gauss-Seidel iteration in two dimensional plane while strongly implicit alternating sweeping is implemented in the direction of the third dimension. Very rapid convergence rate is obtained with CFL number reaching the order of 100. The memory resources can be greatly saved too. It is verified that the reflection boundary condition can not be used with flux vector splitting since it will produce too large numerical dissipation. The computed flow fields agree well with experimental results. Only one or two grid points are there within the shock transition zone.
文摘For stabilized saddle-point problems, we apply the two iteration parameters idea for regularized Hermitian and skew-Hermitian splitting (RHSS) method and establish accelerated RHSS (ARHSS) iteration method. Theoretical analysis shows that the ARHSS method converges unconditionally to the unique solution of the saddle point problem. Finally, we use a numerical example to confirm the effectiveness of the method.
文摘Kellogg gave a version of the Peaceman-Radford method. In this paper, we introduce a SSOR iteration method which uses Kellogg’s method. The new algorithm has some advantages over the traditional SSOR algorithm. A Cyclic Reduction algorithm is introduced via a decoupling in Kellogg’s method.
文摘This paper deals with an efficient two-step time split explicit/implicit scheme applied to a two-dimensional nonlinear unsteady convection-diffusionreaction equation.The computational cost of the new algorithm at each time level is equivalent to solving a pentadiagonalmatrix equation with strictly dominant diagonal elements.Such a bandwidth matrix can be easily inverted using the Gaussian Decomposition and the corresponding linear system should be solved by the back substitutionmethod.The proposed approach is unconditionally stable,temporal second-order accuracy and fourth-order convergence in space.These results suggest that the developed technique is faster and more efficient than a large class of numerical methods studied in the literature for the considered initial-boundary value problem.Numerical experiments are carried out to confirm the theoretical analysis and to demonstrate the performance of the constructed numerical scheme.
基金supported by the National Natural Science Foundation of China(No.11971354).
文摘The discretization of the fractional regime-switching option pricing model leads to the linear system with the block diagonal and Kronecker product structure.A fast matrix splitting iteration method is presented to solve the discrete system.Theoretical analyses prove the convergence of the proposed iteration method.Numerical experiments show that the new method is efficient and outperforms the existing methods in terms of the number of iteration steps and the elapsed CPU time.
基金Supported by Natural Science Foundation of Shanghai(14ZR1429200)National Science Foundation of China(11171221)+4 种基金Shanghai Leading Academic Discipline Project(XTKX2012)Innovation Program of Shanghai Municipal Education Commission(14YZ094)Doctoral Program Foundation of Institutions of Higher Educationof China(20123120110004)Doctoral Starting Projection of the University of Shanghai for Science and Technology(ID-10-303-002)Young Teacher Training Projection Program of Shanghai for Science and Technology
文摘This paper deals with a bi-extrapolated subgradient projection algorithm by intro- ducing two extrapolated factors in the iterative step to solve the multiple-sets split feasibility problem. The strategy is intend to improve the convergence. And its convergence is proved un- der some suitable conditions. Numerical results illustrate that the bi-extrapolated subgradient projection algorithm converges more quickly than the existing algorithms.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11474236,81671674,and 11775184)the Science and Technology Project of Fujian Province,China(Grant No.2016Y0078)
文摘An ill-posed inverse problem in quantitative susceptibility mapping （QSM） is usually solved using a regularization and optimization solver, which is time consuming considering the three-dimensional volume data. However, in clinical diagnosis, it is necessary to reconstruct a susceptibility map efficiently with an appropriate method. Here, a modified QSM reconstruction method called weighted total variation using split Bregman （WTVSB） is proposed. It reconstructs the susceptibility map with fast computational speed and effective artifact suppression by incorporating noise-suppressed data weighting with split Bregman iteration. The noise-suppressed data weighting is determined using the Laplacian of the calculated local field, which can prevent the noise and errors in field maps from spreading into the susceptibility inversion. The split Bregman iteration accelerates the solution of the Ll-regularized reconstruction model by utilizing a preconditioned conjugate gradient solver. In an experiment, the proposed reconstruction method is compared with truncated k-space division （TKD）, morphology enabled dipole inversion （MEDI）, total variation using the split Bregman （TVSB） method for numerical simulation, phantom and in vivo human brain data evaluated by root mean square error and mean structure similarity. Experimental results demonstrate that our proposed method can achieve better balance between accuracy and efficiency of QSM reconstruction than conventional methods, and thus facilitating clinical applications of QSM.
基金supported by National Natural Science Foundation of China(61503385)Fundamental Research Funds for the Central Universities of China(3122016L002)
文摘Let H;, H;, H;be real Hilbert spaces, let A : H;→ H;, B : H;→ H;be two bounded linear operators. The split equality common fixed point problem（SECFP） in the infinite-dimensional Hilbert spaces introduced by Moudafi（Alternating CQ-algorithm for convex feasibility and split fixed-point problems. Journal of Nonlinear and Convex Analysis）is to find x ∈ F（U）, y ∈ F（T） such that Ax = By,（1）where U : H;→ H;and T : H;→ H;are two nonlinear operators with nonempty fixed point sets F（U） = {x ∈ H;: Ux = x} and F（T） = {x ∈ H;: Tx = x}. Note that,by taking B = I and H;= H;in（1）, we recover the split fixed point problem originally introduced in Censor and Segal. Recently, Moudafi introduced alternating CQ-algorithms and simultaneous iterative algorithms with weak convergence for the SECFP（1） of firmly quasi-nonexpansive operators. In this paper, we introduce two viscosity iterative algorithms for the SECFP（1） governed by the general class of quasi-nonexpansive operators. We prove the strong convergence of algorithms. Our results improve and extend previously discussed related problems and algorithms.
文摘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.
