Some Hypermatrix Algorithms in Linear Algebra
The efficient solution of large linear matrix problems plays a central role in both linear and nonlinear structural analysis. Accordingly, a substantial effort has been allocated for the design of computer software in order to handle standard tasks like the solution of linear equations or eigenreduction.
KeywordsFinite Element Technique Jacobi Method Operation Count Inverse Iteration Hessenberg Matrix
Unable to display preview. Download preview PDF.
- J.H. Wilkinson and C. Reinsch, Handbook for automatic computation, II, Linear Algebra (Springer Verlag, 1971 ).Google Scholar
- G. von Fuchs and E. Schrem, “ASKA - A computer system for structural engineers”, Proceedings of the I.S.S.C. Symposium on finite element techniques, ISD, University of Stuttgart (1969).Google Scholar
- J.H. Argyris, “Continua and Discontinua”, Opening address to the international conference on matrix methods of structural mechanics, Dayton, Ohio. Wright-Patterson U.S.A.F. Base, October 26th, 1965, published in the Proceedings of the Conference by U.S. Government (1967) 1–198.Google Scholar
- G.M. Skagestein, “Rekursiv unterteilte Matrizen und Methoden zur Erstellung von Rechenprogrammen für ihre Verarbeitung”, Dr. Ing. Thesis, University of Stuttgart, 1971.Google Scholar
- J.W. Backus et al, Revised report on the algorithmic language ALGOL 60, IFIP 1962.Google Scholar
- O.E. Brönlund, “Eigenvalues of large matrices”, Symposium on finite element techniques at the ISD, University of Stuttgart (1969).Google Scholar
- K.A. Braun and Th. Lunde Johnsen, “Eigencomputation of symmetric hypermatrices using a generalization of the Householder method”, Lecture given at the 2nd International Conference on Structural Mechanics in Reactor Technology, Berlin, 10–14 Sept. 1973.Google Scholar
- UM 212 ASKA Part II, Linear dynamic analysis, Lecture Notes and example problems. ISD-Report No. 155, University of Stuttgart, 1974.Google Scholar
- G. Dietrich, “A new formulation of the Hyper-QR-decomposition and related algorithms”, Lecture given at the 3rd Post Conference on Computational Aspects of the Finite Element Method, Imperial College, London, 8–9 September 1975.Google Scholar