Absil, PA and Sepulchre, R and Van Dooren, P and Mahony, R (2005) Cubically convergent iterations for invariant subspace computation. SIAM Journal on Matrix Analysis and Applications, 26. pp. 70-96. ISSN 0895-4798Full text not available from this repository.
We propose a Newton-like iteration that evolves on the set of fixed dimensional subspaces of ℝ n and converges locally cubically to the invariant subspaces of a symmetric matrix. This iteration is compared in terms of numerical cost and global behavior with three other methods that display the same property of cubic convergence. Moreover, we consider heuristics that greatly improve the global behavior of the iterations.
|Divisions:||Div F > Control|
|Depositing User:||Cron Job|
|Date Deposited:||15 Dec 2015 13:19|
|Last Modified:||04 May 2016 05:29|