Korenberg's "fast Orthogonal Search" Method
Michael Korenberg of Queens University in Kingston, Ontario, developed a method for choosing a sparse set of components from an over-complete set, such as sinusoidal components for spectral analysis, called fast orthogonal search (FOS). Mathematically, FOS uses a slightly modified Cholesky decomposition in a mean-square error reduction (MSER) process, implemented as a sparse matrix inversion. As with the other LSSA methods, FOS avoids the major shortcoming of discrete Fourier analysis, and can achieve highly accurate identifications of embedded periodicities and excels with unequally-spaced data; the fast orthogonal search method has also been applied to other problems such as nonlinear system identification.
Read more about this topic: Least-squares Spectral Analysis
Famous quotes containing the words fast, search and/or method:
“A sure cure for boredom: fast until you are ravenous.”
—Mason Cooley (b. 1927)
“At any age we must cherish illusions, consolatory or merely pleasant; in youth, they are omnipresent; in old age we must search for them, or even invent them. But with all that, boredom is their natural and inevitable accompaniment.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)
“Methinks the human method of expression by sound of tongue is very elementary, & ought to be substituted for some ingenious invention which should be able to give vent to at least six coherent sentences at once.”
—Virginia Woolf (1882–1941)