A SPLITTING ITERATION METHOD FOR DOUBLE X_0-BREAKING BIFURCATION POINTS

A splitting iteration method is proposed to compute double X0-breaking bifurcation points. The method will reduce the computational work and storage, it converges linearly with an adjustable speed. Numerical computation shows the effectiveness of splitting iteration method.

TRANSONIC FLOW CALCULATION OF EULER EQUATIONS BY IMPLICIT ITERATING SCHEME WITH FLUX SPLITTING

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.

Weighted total variation using split Bregman fast quantitative susceptibility mapping reconstruction method

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.

HSS METHOD WITH A COMPLEX PARAMETER FOR THE SOLUTION OF COMPLEX LINEAR SYSTEM

In this paper, a complex parameter is employed in the Hermitian and skew-Hermitian splitting （HSS） method （Bai, Golub and Ng： SIAM J. Matrix Anal. Appl., 24（2003）, 603-626） for solving the complex linear system Ax = f. The convergence of the resulting method is proved when the spectrum of the matrix A lie in the right upper （or lower） part of the complex plane. We also derive an upper bound of the spectral radius of the HSS iteration matrix, and a estimated optimal parameter a （denoted by a^st） of this upper bound is presented. Numerical experiments on two modified model problems show that the HSS method with a est has a smaller spectral radius than that with the real parameter which minimizes the corresponding upper hound. In particular, for the ＇dominant＇ imaginary part of the matrix A, this improvement is considerable. We also test the GMRES method preconditioned by the HSS preconditioning matrix with our parameter a est.

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication problems

A fast compound direct iterative algorithm for solving transient line contact elastohydrodynamic lubrication （EHL） problems is presented. First, by introducing a special matrix splitting iteration method into the traditional compound direct iterative method, the full matrices for the linear systems of equations are transformed into sparse banded ones with any half-bandwidth; then, an extended Thomas method which can solve banded linear systems with any half-bandwidth is derived to accelerate the computing speed. Through the above two steps, the computational complexity of each iteration is reduced approximately from O（N^3/3） to O（β^2N）, where N is the total number of nodes, and β is the half-bandwidth. Two kinds of numerical results of transient EHL line contact problems under sinusoidal excitation or pure normal approach process are obtained. The results demonstrate that the new algorithm increases computing speed several times more than the traditional compound direct iterative method with the same numerical precision. Also the results show that the new algorithm can get the best computing speed and robustness when the ratio, half-bandwidth to total number of nodes, is about 7.5% 10.0% in moderate load cases.

Parallel algorithm and its convergence of spatial domain decomposition of discrete ordinates method for solving radiation heat transfer problem

To improve the computational efficiency and hold calculation accuracy at the same time,we study the parallel computation for radiation heat transfer. In this paper, the discrete ordinates method（DOM） and the spatial domain decomposition parallelization（DDP） are combined by message passing interface（MPI） language. The DDP–DOM computation of the radiation heat transfer within the rectangular furnace is described. When the result of DDP–DOM along one-dimensional direction is compared with that along multi-dimensional directions, it is found that the result of the latter one has higher precision without considering the medium scattering. Meanwhile, an in-depth study of the convergence of DDP–DOM for radiation heat transfer is made. Analyzing the cause of the weak convergence, we relate the total number of iteration steps when the convergence is obtained to the number of sub-domains. When we decompose the spatial domain along one-,two- and three-dimensional directions, different linear relationships between the number of total iteration steps and the number of sub-domains will be possessed separately, then several equations are developed to show the relationships. Using the equations, some phenomena in DDP–DOM can be made clear easily. At the same time, the correctness of the equations is verified.