Equivalence between the combined approximations technique and Krylov subspace methods
The objective of this Note is to examine the equivalence between the CA technique and Krylov subspace methods. It is shown that the CA technique is a preconditioned Krylov subspace method. Based on this connection, it is briefly outlined why the CA technique will converge to the exact solution when...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
2002.
|
Subjects: | |
Online Access: | Get fulltext |