This paper givers an estimated formula of convergence rate for parallel multisplitting iterative method.Using the formula,we can simplify and unify the proof of convergence of PMI_method.
A class ofparallel nonlinear multisplitting AOR methods is set upby directly ltisplittingthe nonlinear mapping F:D C Rn、R”for solving the nonlinear system of equationsF(x)= 0.The different choices of the relaxati...A class ofparallel nonlinear multisplitting AOR methods is set upby directly ltisplittingthe nonlinear mapping F:D C Rn、R”for solving the nonlinear system of equationsF(x)= 0.The different choices of the relaxation par。ters c。 yield all the kn。n and a lotof new rel8Xatlon methods as well as a M of new relaxatlon parallel nonlinear multisplittingmethods.Thetwrvsided approximation properties and th IMuences on convergence Mmthe relaxatlon parameters about the new methods are shown,and the sufficient conditionsguaranteeing the methods to converge globally are discussed.FlnallL aht ofnumericalresultsshow that the methods are feasible and efficient.展开更多
文摘This paper givers an estimated formula of convergence rate for parallel multisplitting iterative method.Using the formula,we can simplify and unify the proof of convergence of PMI_method.
文摘A class ofparallel nonlinear multisplitting AOR methods is set upby directly ltisplittingthe nonlinear mapping F:D C Rn、R”for solving the nonlinear system of equationsF(x)= 0.The different choices of the relaxation par。ters c。 yield all the kn。n and a lotof new rel8Xatlon methods as well as a M of new relaxatlon parallel nonlinear multisplittingmethods.Thetwrvsided approximation properties and th IMuences on convergence Mmthe relaxatlon parameters about the new methods are shown,and the sufficient conditionsguaranteeing the methods to converge globally are discussed.FlnallL aht ofnumericalresultsshow that the methods are feasible and efficient.
