The convergence comparative of the different splitting SOR and AOR iterative method
Gang Lei
Abstract
Gang Lei
Abstract
The iterative method to solve the linear system Ax=b in preconditioned is discussed.A kind of nonnegative split with parameter is given on the base of the preconditioned.This new splitting form is proved to accelerate SOR iterative method convergence not only better than the general iterative method,but also convergence rate surpass the AOR iterative method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The iterative method to solve the linear system Ax=b in preconditioned is discussed.A kind of nonnegative split with parameter is given on the base of the preconditioned.This new splitting form is proved to accelerate SOR iterative method convergence not only better than the general iterative method,but also convergence rate surpass the AOR iterative method.
Key concepts: Iterative method, Convergence (economics), Rate of convergence, Mathematics, Applied mathematics, Mathematical optimization, Computer science, Key (lock)