In this paper, we propose DQMR algorithm for the Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax=b where is a singular and in general non-hermitian matrix that has an arb...In this paper, we propose DQMR algorithm for the Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax=b where is a singular and in general non-hermitian matrix that has an arbitrary index. DQMR algorithm for singular systems is analogous to QMR algorithm for non-singular systems. We compare this algorithm with DGMRES by numerical experiments.展开更多
The DGMRES method for solving Drazin-inverse solution of singular linear systems is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates. We show that adding s...The DGMRES method for solving Drazin-inverse solution of singular linear systems is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates. We show that adding some eigenvectors to the subspace can improve the convergence just like the method proposed by R. Morgan in [R. Morgan, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal App1., 16： 1154-1171, 1995. We derive the implementation of this method and present some numerical examples to show the advantages of this method.展开更多
文摘In this paper, we propose DQMR algorithm for the Drazin-inverse solution of consistent or inconsistent linear systems of the form Ax=b where is a singular and in general non-hermitian matrix that has an arbitrary index. DQMR algorithm for singular systems is analogous to QMR algorithm for non-singular systems. We compare this algorithm with DGMRES by numerical experiments.
基金Supported by the National Natural Science Foundation of China(No.11171151)Natural Science Foundation of Jiangsu Province of China(No.BK2011720)
文摘The DGMRES method for solving Drazin-inverse solution of singular linear systems is generally used with restarting. But the restarting often slows down the convergence and DGMRES often stagnates. We show that adding some eigenvectors to the subspace can improve the convergence just like the method proposed by R. Morgan in [R. Morgan, A restarted GMRES method augmented with eigenvectors, SIAM J. Matrix Anal App1., 16： 1154-1171, 1995. We derive the implementation of this method and present some numerical examples to show the advantages of this method.
