NUMERICAL RESIDUAL ELIMINATION METHOD OF FINITE DIFFERENTIAL EQUATIONS

In this paper, a new elimination of finite differential equations has been discussed. It applies the numerical direct iteration to obtain the residual equations, in which the number of unknowns has been reduced greatly. The solution process is simple and efficient, and the solution is exact

TWO ITERATION METHODS FOR SOLVING LINEAR ALGEBRAIC SYSTEMS WITH LOW ORDER MATRIX A AND HIGH ORDER MATRIX B:Y=(AB)Y+Ф

This paper presents optimum an one-parameter iteration (OOPI) method and a multi-parameter iteration direct (MPID) method for efficiently solving linear algebraic systems with low order matrix A and high order matrix B: Y = (A B)Y + Φ. On parallel computers (also on serial computer) the former will be efficient, even very efficient under certain conditions, the latter will be universally very efficient.

An adaptive beamforming algorithm based on direction vector rotation and joint iterative optimization

An adaptive beamforming algorithm named robust joint iterative optimizationdirection adaptive （RJIO-DA） is proposed for large-array scenarios. Based on the framework of minimum variance distortionless response （MVDR）, the proposed algorithm jointly updates a transforming matrix and a reduced-rank filter. Each column of the transforming matrix is treated as an independent direction vector and updates the weight values of each dimension within a subspace. In addition, the direction vector rotation improves the performance of the algorithm by reducing the uncertainties due to the direction error. Simulation results show that the RJIO-DA algorithm has lower complexity and faster convergence than other conventional reduced-rank algorithms.

Upper Bound Shakedown Analysis of Plates Utilizing the C^(1) Natural Element Method

This paper proposes a numerical solution method for upper bound shakedown analysis of perfectly elasto-plastic thin plates by employing the C^(1) natural element method.Based on the Koiter’s theorem and von Mises yield criterion,the nonlinear mathematical programming formulation for upper bound shakedown analysis of thin plates is established.In this formulation,the trail function of residual displacement increment is approximated by using the C^(1) shape functions,the plastic incompressibility condition is satisfied by introducing a constant matrix in the objective function,and the time integration is resolved by using the Konig’s technique.Meanwhile,the objective function is linearized by distinguishing the non-plastic integral points from the plastic integral points and revising the objective function and associated equality constraints at each iteration.Finally,the upper bound shakedown load multipliers of thin plates are obtained by direct iterative and monotone convergence processes.Several benchmark examples verify the good precision and fast convergence of this proposed method.

Iterative inverse beamforming algorithm and its application in multiple targets detection of passive sonar

With the increasing of detection ability of passive sonar,the weak signal detection problem in multiple interferences becomes more and more important.In the time/bearing record（TBR） display of sonar detection,when there exist traces of multiple interferences,the identification of weak signal is difficult or impossible.The adaptive noise cancellation technique provides the theoretical basis for suppressing strong interferences.But the solution for finding the steady-state optimum filter matrix is quite difficult due to the real time calculation of inverse matrix of input data correlation matrix.The iterative inverse beamforming（IBF） algorithm for solving the optimum filter vector,which is expressed by inverse matrix of the ocean environment data,is derived in this paper,by which,the optimum filter can be eventually expressed as a sum of series simple matrices of constructed from sensor data.Based on the algorithm proposed in this paper,some examples of at sea experiment are provided.The strong interferences are cancelled and the weak signal is emerged,even it didn＇t appear in the conventional beamforming（CBF） processing.

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.