Abstract
The optimal preconditioner cU(A) of a given matrix A was proposed in 1988 by T. Chan [6]. Since then, it has been proved to be efficient for solving a large class of structured systems. In this paper, we construct the optimal preconditioners for different functions of matrices. More precisely, let f be a function of matrices from Cn×n to Cn×n. Given A∈Cn×n, there are two possible optimal preconditioners for f(A): cU(f(A)) and f(cU(A)). In the paper, we study properties of both cU(f(A)) and f(cU(A)) for different functions of matrices. Numerical experiments are given to illustrate the efficiency of the optimal preconditioners when they are used to solve f(A)x=b.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
