Model reduction in symbolically semi-separable systems with application to pre-conditioners for 3D sparse systems of equations

6Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Preconditioned iterative solvers are considered to be one of the most promising methods for solving large and sparse linear systems. It has been shown in the literature that their impact can be fairly easily extended to semi-separable systems or even larger classes build on semi-separable ideas. In this paper, we propose and evaluate a new type of preconditioners for the class of matrices that have a two level deep ‘symbolically hierarchical semiseparable form’ meaning that the matrices have a semi-separable like block structure with blocks that are (sequentially) semi-separable themselves. The new preconditioners are based on approximations of Schur complements in a sequential or hierarchical decomposition of the original block matrix. The type of matrices considered commonly occur in 3D modeling problems.

Cite

CITATION STYLE

APA

Dewilde, P., Jiao, H., & Chandrasekaran, S. (2010). Model reduction in symbolically semi-separable systems with application to pre-conditioners for 3D sparse systems of equations. In Operator Theory: Advances and Applications (Vol. 197, pp. 99–132). Springer International Publishing. https://doi.org/10.1007/978-3-0346-0183-2_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free