Equivalence between the combined approximations technique and Krylov subspace methods
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 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.
1021-1023
Nair, Prasanth B.
d4d61705-bc97-478e-9e11-bcef6683afe7
2002
Nair, Prasanth B.
d4d61705-bc97-478e-9e11-bcef6683afe7
Nair, Prasanth B.
(2002)
Equivalence between the combined approximations technique and Krylov subspace methods.
AIAA Journal, 40 (5), .
Abstract
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.
Text
AIAA-1747-998.pdf
- Version of Record
Restricted to Repository staff only
More information
Published date: 2002
Identifiers
Local EPrints ID: 22033
URI: http://eprints.soton.ac.uk/id/eprint/22033
ISSN: 0001-1452
PURE UUID: 65a5d272-c1a9-4bd8-8df0-a6d1d31c8ec6
Catalogue record
Date deposited: 17 Mar 2006
Last modified: 15 Mar 2024 06:34
Export record
Contributors
Author:
Prasanth B. Nair
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics