This paper presents a set of methods for time integration of problems arising from finite element semidiscretizations. The purpose is to obtain computationally efficient methods which possess higher-order accuracy and controllable dissipation in the spurious high modes. The methods are developed and analysed by a general collocation methodology which leads to the class of Norsett approximants. An algorithmic parameter is used to achieve an effective control over numerical dissipation. Moreover, a simple and efficient implementation scheme is presented. At each time step, algorithms based on p-order collocation polynomials require the solution of p sets of linear algebraic equations with the same coefficient matrix. In this way, a single factorization is needed and no transformations are required to recover the approximate solution at the end or within the time interval. To demonstrate the performance of the proposed algorithms, a wide experimental evaluation is carried out on typical test problems in finite element transient analysis. (C) 2002 Elsevier Science B.V. All rights reserved.
The Norsett time integration methodology for finite element transient analysis / Mancuso, Massimo; Ubertini, F.. - In: COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING. - ISSN 0045-7825. - STAMPA. - 191:29-30(2002), pp. 3297-3327. [10.1016/S0045-7825(02)00264-5]
The Norsett time integration methodology for finite element transient analysis
MANCUSO, Massimo;
2002
Abstract
This paper presents a set of methods for time integration of problems arising from finite element semidiscretizations. The purpose is to obtain computationally efficient methods which possess higher-order accuracy and controllable dissipation in the spurious high modes. The methods are developed and analysed by a general collocation methodology which leads to the class of Norsett approximants. An algorithmic parameter is used to achieve an effective control over numerical dissipation. Moreover, a simple and efficient implementation scheme is presented. At each time step, algorithms based on p-order collocation polynomials require the solution of p sets of linear algebraic equations with the same coefficient matrix. In this way, a single factorization is needed and no transformations are required to recover the approximate solution at the end or within the time interval. To demonstrate the performance of the proposed algorithms, a wide experimental evaluation is carried out on typical test problems in finite element transient analysis. (C) 2002 Elsevier Science B.V. All rights reserved.Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris