A large unsymmetric linear system problem is transformed into the problem of computing the eigenvector of a large symmetric nonnegative definite matrix associated with the eigenvalue zero, i.e., the computation of the...A large unsymmetric linear system problem is transformed into the problem of computing the eigenvector of a large symmetric nonnegative definite matrix associated with the eigenvalue zero, i.e., the computation of the elgenvector of the cross-product matrix of an augmented matrix associated with the eigenvalue zero. The standard Lanczos method and an improved refined Lanczos method are proposed that compute approximate eigenvectors and return approximate solutions of the linear system. An implicitly restarted Lanczos algorithm and its refined version are developed. Theoretical analysis and numerical experiments show the refined method is better than the standard one. If the large matrix has small eigenvalues, the two new algorithms are much faster than the unpreconditioned restarted GMRES.展开更多
In this paper,we present a kind of pre-symmetrizers for the nonsymmetric linear systems arising from the discretization of nonself-adjoint second order scalar elliptic equation.Based on combination these pre-symmetriz...In this paper,we present a kind of pre-symmetrizers for the nonsymmetric linear systems arising from the discretization of nonself-adjoint second order scalar elliptic equation.Based on combination these pre-symmetrizers with CG method, the new algorithm, LRSCG algorithm, is presented.The numerical results show that the LRSCG algorithm is better than BiCG, CGS, BiCGSTAB, GMRES, QMR and SGMRES methods for thses nonsymmetric linear systems.展开更多
文摘A large unsymmetric linear system problem is transformed into the problem of computing the eigenvector of a large symmetric nonnegative definite matrix associated with the eigenvalue zero, i.e., the computation of the elgenvector of the cross-product matrix of an augmented matrix associated with the eigenvalue zero. The standard Lanczos method and an improved refined Lanczos method are proposed that compute approximate eigenvectors and return approximate solutions of the linear system. An implicitly restarted Lanczos algorithm and its refined version are developed. Theoretical analysis and numerical experiments show the refined method is better than the standard one. If the large matrix has small eigenvalues, the two new algorithms are much faster than the unpreconditioned restarted GMRES.
文摘In this paper,we present a kind of pre-symmetrizers for the nonsymmetric linear systems arising from the discretization of nonself-adjoint second order scalar elliptic equation.Based on combination these pre-symmetrizers with CG method, the new algorithm, LRSCG algorithm, is presented.The numerical results show that the LRSCG algorithm is better than BiCG, CGS, BiCGSTAB, GMRES, QMR and SGMRES methods for thses nonsymmetric linear systems.
基金supported by the National Natural Science Foundation of China(6117030961202098+2 种基金91130024)the Key Project of Development Foundation of Science and Technology of CAEP(2011A0202012: 2012A0202008)the Foundation of National Key Laboratory of Computational Physics
