Abstract
To solve nonsymmetric saddle point problems, a new generalized variant of the DPSS (NGVDPSS) preconditioner is proposed. The invertibility of the NGVDPSS preconditioner, the convergence of the NGVDPSS iteration method and some properties of the corresponding preconditioned matrix are presented. The degree of minimal polynomials of the preconditioned matrix is obtained. Simultaneously, the algorithm implementation of the NGVDPSS preconditioner is discussed. Numerical experiments are performed to illustrate the availability of the new preconditioner.
Sign-in/Register to access full text options 
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.
