A more relaxed sufficient condition for the convergence of filtered-X LMS (FXLMS) algorithm is presented. It is pointed out that if some positive real condition for secondary path transfer function and its estimates i...A more relaxed sufficient condition for the convergence of filtered-X LMS (FXLMS) algorithm is presented. It is pointed out that if some positive real condition for secondary path transfer function and its estimates is satisfied within all the frequency bands, FXLMS algorithm converges whatever the reference signal is like. But if the above positive real condition is satisfied only within some frequency bands, the convergence of FXLMS algorithm is dependent on the distribution of power spectral density of the reference signal, and the convergence step size is determined by the distribution of some specific correlation matrix eigenvalues.Applying the conclusion above to the Delayed LMS (DLMS) algorithm, it is shown that DLMS algorithm with some error of time delay estimation converges in certain discrete frequency bands, and the width of which are determined only by the 'time-delay estimation error frequency' which is equal to one fourth of the inverse of estimated error of the time delay.展开更多
Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability ...Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability one. Discrete tracingalong this honlotopic curve leads 10 a class of Durand-Kerner algorithm with stepparameters. The convergernce of this class of algorithms is given, which solves theconjecture about the global property of Durand-Kerner algorithm. The.problem forsteplength selection is thoroughly discussed Finally, sufficient numerical examples areused to verify our theory展开更多
In this paper, we propose a general path following method, in which the starting point can be any feasible interior pair and each iteration uses a step with the largest possible reduction in duality gap. The algorithm...In this paper, we propose a general path following method, in which the starting point can be any feasible interior pair and each iteration uses a step with the largest possible reduction in duality gap. The algorithm maintains the O (nL) ineration complexity It enjoys quadratic convergence if the optimal vertex is nondegenerate.展开更多
文摘A more relaxed sufficient condition for the convergence of filtered-X LMS (FXLMS) algorithm is presented. It is pointed out that if some positive real condition for secondary path transfer function and its estimates is satisfied within all the frequency bands, FXLMS algorithm converges whatever the reference signal is like. But if the above positive real condition is satisfied only within some frequency bands, the convergence of FXLMS algorithm is dependent on the distribution of power spectral density of the reference signal, and the convergence step size is determined by the distribution of some specific correlation matrix eigenvalues.Applying the conclusion above to the Delayed LMS (DLMS) algorithm, it is shown that DLMS algorithm with some error of time delay estimation converges in certain discrete frequency bands, and the width of which are determined only by the 'time-delay estimation error frequency' which is equal to one fourth of the inverse of estimated error of the time delay.
文摘Making use of the theory of continuous homotopy and the relation betweensymmetric polynomtal and polynomtal in one variable the arthors devoted ims article to constructing a regularly homotopic curve with probability one. Discrete tracingalong this honlotopic curve leads 10 a class of Durand-Kerner algorithm with stepparameters. The convergernce of this class of algorithms is given, which solves theconjecture about the global property of Durand-Kerner algorithm. The.problem forsteplength selection is thoroughly discussed Finally, sufficient numerical examples areused to verify our theory
文摘In this paper, we propose a general path following method, in which the starting point can be any feasible interior pair and each iteration uses a step with the largest possible reduction in duality gap. The algorithm maintains the O (nL) ineration complexity It enjoys quadratic convergence if the optimal vertex is nondegenerate.
