 |
|
|
|
|
 |
|
|
Compression policy for Newton-like iteration of structured matrices
|
|
|
|
|
|
|
|
|
|
|
|
2004 International Mathematica Symposium
|
|
|
|
|
|
Banff, Canada
|
|
|
|
|
|
We review different adaptations of Newton’s iteration for computing the inverse or the Moore–Penrose generalized inverse of a matrix. Then we specialize this approach to the case of structured (and particularly Toeplitz or Toeplitz-like) matrices where all input,output and intermediate auxiliary matrices are represented in a compressed form,via their short displacement generators. We briefly recall the well known policies of compression via the truncation of the smallest singular values of the displacement and via substitution and elaborate upon the more recent policy of the least-squares compression.
|
|
|
|
|
|
|
|
|
|
|
|
compression policy, structured matrices, Moore-Penrose generalized inverse, Toeplitz, truncation
|
|
|
|
|
|
|
|
For the newest resources, visit Wolfram Repositories and Archives »
