<div style="text-align:justify;"> STMV beamforming algorithm needs inversion operation of matrix, and its engineering application is limited due to its huge computational cost. This paper proposed bloc...<div style="text-align:justify;"> STMV beamforming algorithm needs inversion operation of matrix, and its engineering application is limited due to its huge computational cost. This paper proposed block iterative STMV algorithm based on one-phase regressive filter, matrix inversion lemma and inversion of block matrix. The computational cost is reduced approximately as 1/4 M times as original algorithm when array number is M. The simulation results show that this algorithm maintains high azimuth resolution and good performance of detecting multi-targets. Within 1 - 2 dB directional index and higher azimuth discrimination of block iterative STMV algorithm are achieved than STMV algorithm for sea trial data processing. And its good robustness lays the foundation of its engineering application. </div>展开更多
The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidi...The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidiagonalization methods derived from a symmetric augmented multiple linear systems and make a comparison with the block GMRES and block biconjugate gradient methods.展开更多
The constrained total variation minimization has been developed successfully for image reconstruction in computed tomography. In this paper, the block component averaging and diagonally-relaxed orthogonal projection m...The constrained total variation minimization has been developed successfully for image reconstruction in computed tomography. In this paper, the block component averaging and diagonally-relaxed orthogonal projection methods are proposed to incorporate with the total variation minimization in the compressed sensing framework. The convergence of the algorithms under a certain condition is derived. Examples are given to illustrate their convergence behavior and noise performance.展开更多
The purpose of this paper is by using the modified block iterative method to propose an algorithm for finding a common element in the intersection of the set of common fixed points of an infinite family of quasi-C-asy...The purpose of this paper is by using the modified block iterative method to propose an algorithm for finding a common element in the intersection of the set of common fixed points of an infinite family of quasi-C-asymptotically nonexpansive and the set of solutions to an equilibrium problem and the set of solutions to a variational inequality. Under suitable conditions some strong convergence theorems are established in 2-uniformly convex and uniformly smooth Banach spaces. As applications we utilize the results presented in the paper to solving the convex feasibility problem （CFP） and zero point problem of maximal monotone mappings in Banach spaces. The results presented in the paper improve and extend the corresponding results announced by many authors.展开更多
This paper proposes a class of asynchronous block iterative methods for solving large scale nonlinear equations F(x)=0 and proves local convergence. This method splits F into p blocks, then does the asynch...This paper proposes a class of asynchronous block iterative methods for solving large scale nonlinear equations F(x)=0 and proves local convergence. This method splits F into p blocks, then does the asynchronous parallel iteration on the p multiprocessor with shared memory. Because each processor need only solve equations with a low dimension and there is no synchronous waiting time, the parallel efficiency can be increased. Finally, we give the results of the numerical test of three kinds of Newton like asynchronous block iteration methods which run well on a multiprocessor system. These results show that the parallel efficiency is very high.展开更多
文摘<div style="text-align:justify;"> STMV beamforming algorithm needs inversion operation of matrix, and its engineering application is limited due to its huge computational cost. This paper proposed block iterative STMV algorithm based on one-phase regressive filter, matrix inversion lemma and inversion of block matrix. The computational cost is reduced approximately as 1/4 M times as original algorithm when array number is M. The simulation results show that this algorithm maintains high azimuth resolution and good performance of detecting multi-targets. Within 1 - 2 dB directional index and higher azimuth discrimination of block iterative STMV algorithm are achieved than STMV algorithm for sea trial data processing. And its good robustness lays the foundation of its engineering application. </div>
基金The research of this author was supported by the National Natural Science Foundation of China,the JiangsuProvince Natural Science Foundation,the Jiangsu Province"333Engineering" Foundation and the Jiangsu Province"Qinglan Engineering" Foundation
文摘The symmetric linear system gives us many simplifications and a possibility to adapt the computations to the computer at hand in order to achieve better performance. The aim of this paper is to consider the block bidiagonalization methods derived from a symmetric augmented multiple linear systems and make a comparison with the block GMRES and block biconjugate gradient methods.
文摘The constrained total variation minimization has been developed successfully for image reconstruction in computed tomography. In this paper, the block component averaging and diagonally-relaxed orthogonal projection methods are proposed to incorporate with the total variation minimization in the compressed sensing framework. The convergence of the algorithms under a certain condition is derived. Examples are given to illustrate their convergence behavior and noise performance.
基金Supported by Natural Science Foundation of Yibin University(Z-2009,No.3)
文摘The purpose of this paper is by using the modified block iterative method to propose an algorithm for finding a common element in the intersection of the set of common fixed points of an infinite family of quasi-C-asymptotically nonexpansive and the set of solutions to an equilibrium problem and the set of solutions to a variational inequality. Under suitable conditions some strong convergence theorems are established in 2-uniformly convex and uniformly smooth Banach spaces. As applications we utilize the results presented in the paper to solving the convex feasibility problem （CFP） and zero point problem of maximal monotone mappings in Banach spaces. The results presented in the paper improve and extend the corresponding results announced by many authors.
基金Supported by the National Natural Scie-nce Foundation of China
文摘This paper proposes a class of asynchronous block iterative methods for solving large scale nonlinear equations F(x)=0 and proves local convergence. This method splits F into p blocks, then does the asynchronous parallel iteration on the p multiprocessor with shared memory. Because each processor need only solve equations with a low dimension and there is no synchronous waiting time, the parallel efficiency can be increased. Finally, we give the results of the numerical test of three kinds of Newton like asynchronous block iteration methods which run well on a multiprocessor system. These results show that the parallel efficiency is very high.
