In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed fo...In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed for DPM, which is called the fast DPM(FDPM), and the convergence ratio of the above algorithm is greatly increased. The examples show that the iterative number of the FDPM with optimal parameters decreases much more, which is less than one third of the DPM iteration number. After studying the ...展开更多
文摘In order to solve the electromagnetic problems on the large multi branch domains, the decomposition projective method(DPM) is generalized for multi subspaces in this paper. Furthermore multi parameters are designed for DPM, which is called the fast DPM(FDPM), and the convergence ratio of the above algorithm is greatly increased. The examples show that the iterative number of the FDPM with optimal parameters decreases much more, which is less than one third of the DPM iteration number. After studying the ...