N-dimensional algorithms for the computation of lagrangian finite element universal matrices

• Autores: G. Aiello, S. Alfonzetti, S. Coco
• Localización: Mini and Microcomputers and their applications / Emilio Luque Fadón (ed. lit.), 1988, págs. 159-162
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • N-dimensional algorithms for the computation of universal matrices relative to simplez Langragian finite elements of arbitrary order are shown. Such matrices are expressed in terms of the three primitive matrices T, D and C, from wich universal matrices can be derived by simple algebraic manipulations. Formulae for the primitive matrix computation are presented in a factorized form. These algorithms are employed in ELFIN, a finite-element code developed by the authors for the computation of electromagnetic fields.