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:
“Who comes so fast in silence of the night?”
—William Shakespeare (1564–1616)
“You will never be happy if you continue to search for what happiness consists of. You will never live if you are looking for the meaning of life.”
—Albert Camus (1913–1960)
“I have a new method of poetry. All you got to do is look over your notebooks ... or lay down on a couch, and think of anything that comes into your head, especially the miseries.... Then arrange in lines of two, three or four words each, don’t bother about sentences, in sections of two, three or four lines each.”
—Allen Ginsberg (b. 1926)