Anationwide drive of mass education in law has been gathering momentum since 1986, targeting at all citizens who are able to learn. This is, in fact, a government-driven campaign to improve citizens’ law awareness so...Anationwide drive of mass education in law has been gathering momentum since 1986, targeting at all citizens who are able to learn. This is, in fact, a government-driven campaign to improve citizens’ law awareness so that they will be law-abiding while good at using laws to protect展开更多
Corrected explicit-implicit domain decomposition(CEIDD) algorithms are studied for parallel approximation of semilinear parabolic problems on distributed memory processors. It is natural to divide the spatial domain i...Corrected explicit-implicit domain decomposition(CEIDD) algorithms are studied for parallel approximation of semilinear parabolic problems on distributed memory processors. It is natural to divide the spatial domain into some smaller parallel strips and cells using the simplest straightline interface(SI) . By using the Leray-Schauder fixed-point theorem and the discrete energy method,it is shown that the resulting CEIDD-SI algorithm is uniquely solvable,unconditionally stable and convergent. The CEIDD-SI method always suffers from the globalization of data communication when interior boundaries cross into each other inside the domain. To overcome this disadvantage,a composite interface(CI) that consists of straight segments and zigzag fractions is suggested. The corresponding CEIDD-CI algorithm is proven to be solvable,stable and convergent. Numerical experiments are presented to support the theoretical results.展开更多
文摘Anationwide drive of mass education in law has been gathering momentum since 1986, targeting at all citizens who are able to learn. This is, in fact, a government-driven campaign to improve citizens’ law awareness so that they will be law-abiding while good at using laws to protect
基金supported by National Natural Science Foundation of China (Grant No. 10871044)
文摘Corrected explicit-implicit domain decomposition(CEIDD) algorithms are studied for parallel approximation of semilinear parabolic problems on distributed memory processors. It is natural to divide the spatial domain into some smaller parallel strips and cells using the simplest straightline interface(SI) . By using the Leray-Schauder fixed-point theorem and the discrete energy method,it is shown that the resulting CEIDD-SI algorithm is uniquely solvable,unconditionally stable and convergent. The CEIDD-SI method always suffers from the globalization of data communication when interior boundaries cross into each other inside the domain. To overcome this disadvantage,a composite interface(CI) that consists of straight segments and zigzag fractions is suggested. The corresponding CEIDD-CI algorithm is proven to be solvable,stable and convergent. Numerical experiments are presented to support the theoretical results.
