The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG meth...The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG method is an effective method for symmetric coefficient matrices A (i). In this paper, the FOM method is employed to solve multiple linear sy stems when coefficient matrices are non-symmetric matrices. One of the systems is selected as the seed system which generates a Krylov subspace, then the resi duals of other systems are projected onto the generated Krylov subspace to get t he approximate solutions for the unsolved ones. The whole process is repeated u ntil all the systems are solved.展开更多
基金Project supported by the National Natural Science Foundation of China (Grant No.10271075)
文摘The seed method is used for solving multiple linear systems A (i)x (i) =b (i) for 1≤i≤s, where the coefficient matrix A (i) and the right-hand side b (i) are different in general. It is known that the CG method is an effective method for symmetric coefficient matrices A (i). In this paper, the FOM method is employed to solve multiple linear sy stems when coefficient matrices are non-symmetric matrices. One of the systems is selected as the seed system which generates a Krylov subspace, then the resi duals of other systems are projected onto the generated Krylov subspace to get t he approximate solutions for the unsolved ones. The whole process is repeated u ntil all the systems are solved.