A generalized Cholesky algorithm for plate and shell theory problems

MaRDI QIDQ1802634zbMATH OpenFDO

Authors A. A. Kobozeva, L. V. Maslovskaya

Publication date 6 September 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

Cuthill-McKee algorithmmixed finite element methodplate bending

Mathematics Subject Classification ID

Membranes (74K15) Plates (74K20) Finite element methods applied to problems in solid mechanics (74S05)

Review text

Systems of linear equations of the type \(Ax-By=f\), \(B^ Tx+Cy=g\) are considered as they arise e.g. in mixed finite element methods applied to plate bending problems. The matrix \(A\) is assumed to be symmetric and positive definite, \(C\) is symmetric and positive semidefinite. (For equations of such type \textit{J. H. Bramble} and \textit{J. E. Pasciak} constructed iteration methods in [Math. Comput. 51, No. 183, 387-388 (1988; Zbl 0649.65061)]). In the present paper the applicability of a generalized Cholesky algorithm and a special numeration technique for the unknowns is investigated.

Recommendations

• Conjugate gradient-like solution algorithms for the mixed finite element approximation of the biharmonic equation, applied to plate bending problems
• scientific article; zbMATH DE number 4143332
• scientific article; zbMATH DE number 4096673
• The conditions for the applicability of the generalized Cholesky algorithm
• scientific article; zbMATH DE number 4135499

Cited in

(2)

• The conditions for the applicability of the generalized Cholesky algorithm
• scientific article; zbMATH DE number 4143332 (Why is no real title available?)

This page was built for publication: A generalized Cholesky algorithm for plate and shell theory problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802634)