Changes

Jump to: navigation, search

Ghost

79 bytes added, 23:08, 8 January 2006
no edit summary
Step three: solving
Looks like it's possible to solve an NxM least square problem in O(N*M) time using an iterative algorithm as long as the system matrix is near-orthogonal. If we want to solve '''Ax'''='''b ''' and '''A'''^h*'''A ''' ~= I, then we start with '''x'''(0)='''A'''^h*'''b ''' and then:
:'''x'''(N+1) = '''x'''(N) + '''A'''^h*('''b'''-'''A'''*'''x'''(N))
==== Phase lock loop (PLL) ====

Navigation menu