Abstract
This paper discusses Krylov subspace methods to solve a linear system whose coefficient matrix is represented by a hierarchical matrix. We propose a preconditioning technique using a part of the original hierarchical matrix to accelerate the convergence of the Krylov subspace methods. The proposed preconditioning technique is based on the assumption that the submatrices on the original hierarchical matrix are approximated using the adaptive cross approximation or variants thereof. The performance of Krylov subspace methods with the proposed preconditioning technique is examined through numerical experiments on an electrostatic field analysis.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.