Many applications require the solution of large un-symmetric linear systems with multiple right-hand sides.Instead of applying an iterative method to each of these systems individually,it is often more efficient to us...Many applications require the solution of large un-symmetric linear systems with multiple right-hand sides.Instead of applying an iterative method to each of these systems individually,it is often more efficient to use a block version of the method that generates iterates for all the systems simultaneously.This paper proposes a new adaptive block QMR version based on the incomplete or-thogomalization method(IOM(q))for solving large multi-ple nusymmetric linear systems.How to incorporate de-flation to drop comverged linear systems,and how to delete linearly and almost liearly dependent vectors in the underlying block Krylov sequences are discussed.Nu-merical experiments show that the new adaptive block method has better practical performance and less compu-tational cost and CPU time than block GMRES and other proposed methods for the solution of systems with multi- ple right-hand sides.展开更多
The numerical solution of the differential-algebraic equations(DAEs) involved in time domain simulation(TDS) of power systems requires the solution of a sequence of large scale and sparse linear systems.The use of ite...The numerical solution of the differential-algebraic equations(DAEs) involved in time domain simulation(TDS) of power systems requires the solution of a sequence of large scale and sparse linear systems.The use of iterative methods such as the Krylov subspace method is imperative for the solution of these large and sparse linear systems.The motivation of the present work is to develop a new algorithm to efficiently precondition the whole sequence of linear systems involved in TDS.As an improvement of dishonest preconditioner(DP) strategy,updating preconditioner strategy(UP) is introduced to the field of TDS for the first time.The idea of updating preconditioner strategy is based on the fact that the matrices in sequence of the linearized systems are continuous and there is only a slight difference between two consecutive matrices.In order to make the linear system sequence in TDS suitable for UP strategy,a matrix transformation is applied to form a new linear sequence with a good shape for preconditioner updating.The algorithm proposed in this paper has been tested with 4 cases from real-life power systems in China.Results show that the proposed UP algorithm efficiently preconditions the sequence of linear systems and reduces 9%-61% the iteration count of the GMRES when compared with the DP method in all test cases.Numerical experiments also show the effectiveness of UP when combined with simple preconditioner reconstruction strategies.展开更多
文摘Many applications require the solution of large un-symmetric linear systems with multiple right-hand sides.Instead of applying an iterative method to each of these systems individually,it is often more efficient to use a block version of the method that generates iterates for all the systems simultaneously.This paper proposes a new adaptive block QMR version based on the incomplete or-thogomalization method(IOM(q))for solving large multi-ple nusymmetric linear systems.How to incorporate de-flation to drop comverged linear systems,and how to delete linearly and almost liearly dependent vectors in the underlying block Krylov sequences are discussed.Nu-merical experiments show that the new adaptive block method has better practical performance and less compu-tational cost and CPU time than block GMRES and other proposed methods for the solution of systems with multi- ple right-hand sides.
基金supported by the National Natural Science Foundation of China (Grant Nos. 60703055 and 60803019)the National High-Tech Research & Development Program of China ("863" Program) (Grant No. 2009AA01A129)+1 种基金State Key Development Program of Basic Research of China (Grant No. 2010CB951903)Tsinghua National Laboratory for Information Science and Technology (THList) Cross-discipline Foundation
文摘The numerical solution of the differential-algebraic equations(DAEs) involved in time domain simulation(TDS) of power systems requires the solution of a sequence of large scale and sparse linear systems.The use of iterative methods such as the Krylov subspace method is imperative for the solution of these large and sparse linear systems.The motivation of the present work is to develop a new algorithm to efficiently precondition the whole sequence of linear systems involved in TDS.As an improvement of dishonest preconditioner(DP) strategy,updating preconditioner strategy(UP) is introduced to the field of TDS for the first time.The idea of updating preconditioner strategy is based on the fact that the matrices in sequence of the linearized systems are continuous and there is only a slight difference between two consecutive matrices.In order to make the linear system sequence in TDS suitable for UP strategy,a matrix transformation is applied to form a new linear sequence with a good shape for preconditioner updating.The algorithm proposed in this paper has been tested with 4 cases from real-life power systems in China.Results show that the proposed UP algorithm efficiently preconditions the sequence of linear systems and reduces 9%-61% the iteration count of the GMRES when compared with the DP method in all test cases.Numerical experiments also show the effectiveness of UP when combined with simple preconditioner reconstruction strategies.
