The Bi-LS method based on QR decomposition provides a convenient framework for de-veloping efficient subspace tracking algorithms.To overcome the shortcoming of the backsubstitution step and improve the parallel archi...The Bi-LS method based on QR decomposition provides a convenient framework for de-veloping efficient subspace tracking algorithms.To overcome the shortcoming of the backsubstitution step and improve the parallel architecture of the Bi-LS algorithms,a Bi-LS subspace tracking algorithm based on Inverse QR(IQR) decomposition is developed.The proposed IQR iterative algorithm for subspace tracking is well suited for the parallel implementation in the systolic array.Simulation results are presented to illustrate the effectiveness of the proposed IQR subspace tracking algorithm.展开更多
By attacking the linear programming problems from their dual side,a new general algorithm for linear programming is developed.At each iteration,the algorithm finds a feasible descent search direction by handling a lea...By attacking the linear programming problems from their dual side,a new general algorithm for linear programming is developed.At each iteration,the algorithm finds a feasible descent search direction by handling a least square problem associated with the dual system,using QR decomposition technique.The new method is a combination of pivot method and interior-point method.It in fact not only reduces the possibility of difficulty arising from degeneracy,but also has the same advantages as pivot method in warm-start to resolve linear programming problems.Numerical results of a group of randomly constructed problems are very encouraging.展开更多
基金Supported in part by the 973 Program (No.2008CB-317109)the National Natural Science Foundation of China (No.60572054)the SRF for ROCS, SEM
文摘The Bi-LS method based on QR decomposition provides a convenient framework for de-veloping efficient subspace tracking algorithms.To overcome the shortcoming of the backsubstitution step and improve the parallel architecture of the Bi-LS algorithms,a Bi-LS subspace tracking algorithm based on Inverse QR(IQR) decomposition is developed.The proposed IQR iterative algorithm for subspace tracking is well suited for the parallel implementation in the systolic array.Simulation results are presented to illustrate the effectiveness of the proposed IQR subspace tracking algorithm.
文摘By attacking the linear programming problems from their dual side,a new general algorithm for linear programming is developed.At each iteration,the algorithm finds a feasible descent search direction by handling a least square problem associated with the dual system,using QR decomposition technique.The new method is a combination of pivot method and interior-point method.It in fact not only reduces the possibility of difficulty arising from degeneracy,but also has the same advantages as pivot method in warm-start to resolve linear programming problems.Numerical results of a group of randomly constructed problems are very encouraging.
