In this work a fast solver for large-scale three-dimensional elastodynamic crack problems is presented, implemented, and tested. The dual boundary element method in the Laplace transform domain is used for the accurate dynamic analysis of cracked bodies. The fast solution procedure is based on the use of hierarchical matrices for the representation of the collocation matrix for each computed value of the Laplace parameter. An ACA (adaptive cross approximation) algorithm is used for the population of the low rank blocks and its performance at varying Laplace parameters is investigated. A preconditioned GMRES is used for the solution of the resulting algebraic system of equations. The preconditioners are built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. An original strategy, based on the computation of some local preconditioners only, is presented and tested to further speed up the overall analysis. The reported numerical results demonstrate the effectiveness of the technique for both uncracked and cracked solids and show significant reductions in terms of both memory storage and computational time.
Benedetti, I., Aliabadi, M.H. (2010). A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems. INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING, 84, 1038-1067 [10.1002/nme.2929].
A fast hierarchical dual boundary element method for three-dimensional elastodynamic crack problems
BENEDETTI, Ivano;
2010-01-01
Abstract
In this work a fast solver for large-scale three-dimensional elastodynamic crack problems is presented, implemented, and tested. The dual boundary element method in the Laplace transform domain is used for the accurate dynamic analysis of cracked bodies. The fast solution procedure is based on the use of hierarchical matrices for the representation of the collocation matrix for each computed value of the Laplace parameter. An ACA (adaptive cross approximation) algorithm is used for the population of the low rank blocks and its performance at varying Laplace parameters is investigated. A preconditioned GMRES is used for the solution of the resulting algebraic system of equations. The preconditioners are built exploiting the hierarchical arithmetic and taking full advantage of the hierarchical format. An original strategy, based on the computation of some local preconditioners only, is presented and tested to further speed up the overall analysis. The reported numerical results demonstrate the effectiveness of the technique for both uncracked and cracked solids and show significant reductions in terms of both memory storage and computational time.File | Dimensione | Formato | |
---|---|---|---|
2929_ftp.pdf
Solo gestori archvio
Dimensione
393.79 kB
Formato
Adobe PDF
|
393.79 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.