Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 101
PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON PARALLEL, DISTRIBUTED, GRID AND CLOUD COMPUTING FOR ENGINEERING Edited by:
Paper 1
On Generalized Inverses in Solving Two-By-Two Block Linear Systems T. Kozubek and A. Markopoulos
VŠB-Technical University Ostrava, Czech Republic T. Kozubek, A. Markopoulos, "On Generalized Inverses in Solving Two-By-Two Block Linear Systems", in , (Editors), "Proceedings of the Third International Conference on Parallel, Distributed, Grid and Cloud Computing for Engineering", Civil-Comp Press, Stirlingshire, UK, Paper 1, 2013. doi:10.4203/ccp.101.1
Keywords: singular matrix, regularization, fixing nodes, factorization, TFETI.
Summary
Due to the rounding errors, effective elimination of the
displacements of "floating'' subdomains is a nontrivial aspect
of the implementation of the FETI domain decomposition methods, since it can be difficult to
recognize the positions of zero pivots when the nonsingular diagonal
block of A is ill-conditioned. Moreover, even if the zero
pivots are recognized properly, it turns out that the
ill-conditioning of the nonsingular submatrix defined by the nonzero
pivots can have a devastating effect on the precision of the
solution.
Most of the results are related to the first problem, i.e., to identify reliably the zero pivots. Thus [1] proposed to combine the Cholesky decomposition with the singular value decomposition (SVD) of the related Schur complement S in order to guarantee a proper rank of the generalized inverse. The dimension of S is typically very small but not for ill-conditioned problems. Here we review the results of [2], where we proposed a regularization technique enabling us to define a non-singular matrix whose inverse is the generalized inverse to A. It avoids the necessity to identify zero pivots. The favourable feature of our regularization is that an extra fill-in effect in the pattern of the matrix may be negligible. The regularization is based on the fixing nodes strategies (uniform, kernel, and geometrical) described in [3,4,2] and demonstrated on both academic and engineering problems of mechanics therein. For the numerical solution we used the total FETI, a variant [5] of the FETI domain decomposition method that implements both prescribed displacements and interface conditions by the Lagrange multipliers. Thus the kernels of the stiffness matrices of the subdomains, i.e., their rigid body motions, are known a priori and we can use them in combination with fixing nodes for the effective regularization. References
purchase the full-text of this paper (price £20)
go to the next paper |
|