Concepedia

Abstract

A survey of various conjugate gradient (CG) algorithms is presented for the minimum/maximum eigen-problems of a fixed symmetric matrix. The CG algorithms are compared to a commonly used conventional method found in IMSL. It is concluded that the CG algorithms are more flexible and efficient than some of the conventional methods used in adaptive spectrum analysis and signal processing.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

References

YearCitations

Page 1