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: | Nair, Prasanth B. (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
2002.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Krylov subspace estimation
by: Schneider, Michael K. (Michael Klaus)
Published: (2005) -
Generalized Krylov subspace methods with applications
by: Yu, Xuebo
Published: (2014) -
Iterative Solutions of Krylov Subspace Methods
by: Yi-Chih Lu, et al.
Published: (2001) -
Krylov subspace techniques on graphic processing units
by: Mehri Dehnavi, Maryam
Published: (2013) -
Krylov Subspace Solvers and Preconditioners
by: Vuik C.
Published: (2018-01-01)