Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and...Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and then a constrained condition is configured.Traffic signals are further employed to estimate the channel vector based on the constrained leastsquares criterion. We use the iterative least squares with projection (ILSP) algorithm initializedby the pilot to get the estimation. The accuracy of channel estimation and symbol detection can beprogressively increased through the iteration procedure of the ILSP algorithm. Simulation resultsdemonstrate that the proposed algorithm improves the system performance effectively compared withthe conventional 2-D RAKE receiver.展开更多
The bound-state solution of the position dependent mass Klein-Gordon equation including inversely linear potential is obtained within the framework of the asymptotic iteration method. The relation between the scalar a...The bound-state solution of the position dependent mass Klein-Gordon equation including inversely linear potential is obtained within the framework of the asymptotic iteration method. The relation between the scalar and vector potentials is considered to S（x） = V（x）（β - 1）. In particular, it is shown that the corresponding method exactly reproduces the spectrum of linearly inversely potentials with spatially dependent mass.展开更多
This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be dir...This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.展开更多
While the classical discontinuous deformation analysis(DDA) is applied to the analysis of a given block system, one must preset stiffness parameters for artificial springs to be fixed during the open-close iteration. ...While the classical discontinuous deformation analysis(DDA) is applied to the analysis of a given block system, one must preset stiffness parameters for artificial springs to be fixed during the open-close iteration. To a great degree, success or failure in applying DDA to a practical problem is dependent on the spring stiffness parameters, which is believed to be the biggest obstacle to more extensive applications of DDA. In order to evade the introduction of the artificial springs, this study reformulates DDA as a mixed linear complementarity problem(MLCP) in the primal form. Then, from the fact that the block displacement vector of each block can be expressed in terms of the contact forces acting on the block, the condensed form of MLCP is derived, which is more efficient than the primal form. Some typical examples including those designed by the DDA inventor are reanalyzed, proving that the procedure is feasible.展开更多
基金The National Hi-Tech Development Plan (863-317-03-01-02-04-20).
文摘Based on the fact that the variation of tile direction of arrival (DOA) isslower than that of the channel fading, the steering vector of the desired signal is estimatedfirstly using a subspace decomposition method and then a constrained condition is configured.Traffic signals are further employed to estimate the channel vector based on the constrained leastsquares criterion. We use the iterative least squares with projection (ILSP) algorithm initializedby the pilot to get the estimation. The accuracy of channel estimation and symbol detection can beprogressively increased through the iteration procedure of the ILSP algorithm. Simulation resultsdemonstrate that the proposed algorithm improves the system performance effectively compared withthe conventional 2-D RAKE receiver.
基金supported by the Research Fund of Gaziantep University and the Scientific and Technological Research Council of Turkey (TUBITAK).
文摘The bound-state solution of the position dependent mass Klein-Gordon equation including inversely linear potential is obtained within the framework of the asymptotic iteration method. The relation between the scalar and vector potentials is considered to S（x） = V（x）（β - 1）. In particular, it is shown that the corresponding method exactly reproduces the spectrum of linearly inversely potentials with spatially dependent mass.
基金Supported by the National Natural Science Foundation of China(U1162130)the National High Technology Research and Development Program of China(2006AA05Z226)Outstanding Youth Science Foundation of Zhejiang Province(R4100133)
文摘This paper considers dealing with path constraints in the framework of the improved control vector iteration （CVI） approach. Two available ways for enforcing equality path constraints are presented, which can be directly incorporated into the improved CVI approach. Inequality path constraints are much more difficult to deal with, even for small scale problems, because the time intervals where the inequality path constraints are active are unknown in advance. To overcome the challenge, the ll penalty function and a novel smoothing technique are in-troduced, leading to a new effective approach. Moreover, on the basis of the relevant theorems, a numerical algo-rithm is proposed for nonlinear dynamic optimization problems with inequality path constraints. Results obtained from the classic batch reaCtor operation problem are in agreement with the literature reoorts, and the comoutational efficiency is also high.
基金supported by the National Basic Research Program of China("973"Project)(Grant Nos.2011CB013505&2014CB047100)the National Natural Science Foundation of China(Grant No.11172313)
文摘While the classical discontinuous deformation analysis(DDA) is applied to the analysis of a given block system, one must preset stiffness parameters for artificial springs to be fixed during the open-close iteration. To a great degree, success or failure in applying DDA to a practical problem is dependent on the spring stiffness parameters, which is believed to be the biggest obstacle to more extensive applications of DDA. In order to evade the introduction of the artificial springs, this study reformulates DDA as a mixed linear complementarity problem(MLCP) in the primal form. Then, from the fact that the block displacement vector of each block can be expressed in terms of the contact forces acting on the block, the condensed form of MLCP is derived, which is more efficient than the primal form. Some typical examples including those designed by the DDA inventor are reanalyzed, proving that the procedure is feasible.
