A generalized Cholesky algorithm for plate and shell theory problems (Q1802634): Difference between revisions

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.