Comments, with reply, on "Convergence properties of Gram-Schmidt and SMI adaptive algorithms" by K. Gerlach and F.F. Kretschmer, Jr
- 1 November 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 27 (6) , 897-901
- https://doi.org/10.1109/7.104277
Abstract
The commenter summarizes Q-R decomposition techniques for solving the least squares (LS) problem and comments on associated aspects of the work presented by K. Gerlach and F.F. Kretschmer, Jr. (ibid., vol.267, no.1, Jan.90). In response to the commenter's statement that the statistical properties of the LS that determine the convergence performance are well known. Gerlach and Kretschmer assert that this is true only under the assumptions that have been used in the past to analyze the convergence performance of the canceler and for only a limited number of convergence performance measures. Gerlach and Kretschmer also address the commenter's points on overmatching degrees of freedom.Keywords
This publication has 17 references indexed in Scilit:
- Adaptive canceler and pulse compressor interactionsIEEE Transactions on Aerospace and Electronic Systems, 1991
- Adaptive array transient sidelobe levels and remediesIEEE Transactions on Aerospace and Electronic Systems, 1990
- Algorithmic, architectural, and beam pattern issues of sidelobe cancellationIEEE Transactions on Aerospace and Electronic Systems, 1989
- Performance of an adaptive detection algorithm; rejection of unwanted signalsIEEE Transactions on Aerospace and Electronic Systems, 1989
- Detection Loss of the Sample Matrix Inversion TechniqueIEEE Transactions on Aerospace and Electronic Systems, 1984
- Sample Size Considerations for Adaptive ArraysIEEE Transactions on Aerospace and Electronic Systems, 1980
- Rapid Convergence Rate in Adaptive ArraysIEEE Transactions on Aerospace and Electronic Systems, 1974
- Experiments on error growth associated with some linear least-squares proceduresMathematics of Computation, 1968
- Solving linear least squares problems by Gram-Schmidt orthogonalizationBIT Numerical Mathematics, 1967
- Experiments on Gram-Schmidt orthogonalizationMathematics of Computation, 1966