The numerical algorithms to search for the critical plane in multiaxial random loading by the Maximum Variance Method are discussed. The classical Direct Method using three nested ‘for/end’ loops, and its improved variant based on the eigenvalues/eigenvectors of the shear stress covariant matrix, are summarised from the literature. A faster variant of the Direct Method, which exploits the search for the maximum of a one-dimensional array, is developed. An innovative method that makes use of three-dimensional matrices and Hadamard’s element-wise product is also presented. The algorithm structures are illustrated, and their computation time compared in a numerical case study.
An efficient algorithm for critical plane search in random multiaxial fatigue based on maximum variance method, 3D matrices and Hadamard’s element-wise product
Benasciutti
2024-01-01
Abstract
The numerical algorithms to search for the critical plane in multiaxial random loading by the Maximum Variance Method are discussed. The classical Direct Method using three nested ‘for/end’ loops, and its improved variant based on the eigenvalues/eigenvectors of the shear stress covariant matrix, are summarised from the literature. A faster variant of the Direct Method, which exploits the search for the maximum of a one-dimensional array, is developed. An innovative method that makes use of three-dimensional matrices and Hadamard’s element-wise product is also presented. The algorithm structures are illustrated, and their computation time compared in a numerical case study.| File | Dimensione | Formato | |
|---|---|---|---|
|
06 VAL5_Benasciutti_Max Variance Method 3D Hadamard matrices_FINAL.pdf
embargo fino al 31/12/2050
Descrizione: file articolo
Tipologia:
Versione Editoriale (PDF)
Licenza:
Creative commons
Dimensione
320.08 kB
Formato
Adobe PDF
|
320.08 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.


