Based on the principle of minimality and well applicable for one-point iterative methods the exact relaxation can be adapted also to multi point ones. It accelerates and stabilizes iterative process. Simple effective algorithm to calculate exact relaxation for n-points iterative method is proposed and justified. The algorithm allows to circumvent the problem to find roots of polynomial with degree n > 2. The algorithm calculation price is easy estimated before iteration beginning. This lets a priory to specify expediency of the exact relaxation application. If n = 2 i.e. for secant method, the calculational formulas of exact relaxation are reduced.
展开▼
