WIT Press

Construction Of Universal Matrices With Conventional Programming Languages

Price

Free (open access)

Paper DOI

10.2495/ES960381

Volume

11

Pages

9

Published

1996

Size

721 kb

Author(s)

S. Alfonzetti

Abstract

Algorithms and data structures are described to compute arbitrary simplex finite element universal matrices in integer form by means of conventional programming languages. A special representation of integers by prime factors is used to avoid integer overflows in factorial evaluations. This allows both run- time computation in the FEM processing phase and simple development of new universal matrix routines when required. 1 Introduction The finite element method (FEM) is unanimously recognized as the most powerful and flexible method for the numerical solution of boundary-value problems. In this context the element matrix computing time and errors are minimized by using numerical universal matrices for simplex finite elements with straight s

Keywords