In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative meth...In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.展开更多
The three-dimensional localization problem for noncircular sources in near-field with a centro-symmetric cross array is rarely studied.In this paper,we propose an algorithm with improved estimation performance.We deco...The three-dimensional localization problem for noncircular sources in near-field with a centro-symmetric cross array is rarely studied.In this paper,we propose an algorithm with improved estimation performance.We decompose the multiple parameters of the steering vector in a specific order so that it can be converted into the products of several matrices,and each of the matrices includes only one parameter.On this basis,each parameter to be resolved can be estimated by performing a one-dimensional spatial spectral search.Although the computational complexity of the proposed algorithm is several times that of our previous algorithm,the estimation performance,including its error and resolution,with respect to the direction of arrival,is improved,and the range estimation performance can be maintained.The superiority of the proposed algorithm is verified by simulation results.展开更多
文摘In this paper, an iterative method is constructed to find the least-squares solutions of generalized Sylvester equation , where is real matrices group, and satisfies different linear constraint. By this iterative method, for any initial matrix group within a special constrained matrix set, a least squares solution group with satisfying different linear constraint can be obtained within finite iteration steps in the absence of round off errors, and the unique least norm least-squares solution can be obtained by choosing a special kind of initial matrix group. In addition, a minimization property of this iterative method is characterized. Finally, numerical experiments are reported to show the efficiency of the proposed method.
基金supported by the National Natural Science Foundation of China(Nos.61971217,61971218,61631020,and 61601167)。
文摘The three-dimensional localization problem for noncircular sources in near-field with a centro-symmetric cross array is rarely studied.In this paper,we propose an algorithm with improved estimation performance.We decompose the multiple parameters of the steering vector in a specific order so that it can be converted into the products of several matrices,and each of the matrices includes only one parameter.On this basis,each parameter to be resolved can be estimated by performing a one-dimensional spatial spectral search.Although the computational complexity of the proposed algorithm is several times that of our previous algorithm,the estimation performance,including its error and resolution,with respect to the direction of arrival,is improved,and the range estimation performance can be maintained.The superiority of the proposed algorithm is verified by simulation results.
