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:
“Time flies like an arrow; the days and nights alternate as fast as a weaver’s shuttle.”
—Chinese proverb.
“At the ground of all these noble races, the beast of prey, the splendid, blond beast, lustfully roving in search of spoils and victory, cannot be mistaken.”
—Friedrich Nietzsche (1844–1900)
“You know, I have a method all my own. If you’ll notice, the coat came first, then the tie, then the shirt. Now, according to Hoyle, after that the pants should be next. There’s where I’m different. I go for the shoes next. First the right, then the left. After that, it’s every man for himself.”
—Robert Riskin (1897–1955)