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 |
| LEADER | 00862 am a22001213u 4500 | ||
|---|---|---|---|
| 001 | 22033 | ||
| 042 | |a dc | ||
| 100 | 1 | 0 | |a Nair, Prasanth B. |e author |
| 245 | 0 | 0 | |a Equivalence between the combined approximations technique and Krylov subspace methods |
| 260 | |c 2002. | ||
| 856 | |z Get fulltext |u https://eprints.soton.ac.uk/22033/1/AIAA-1747-998.pdf | ||
| 520 | |a 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 the number of basis vectors is increased. The ramification of the present research on the practical issue of integrating static reanalysis techniques with structural optimization procedures is also discussed. | ||
| 655 | 7 | |a Article | |