DocumentCode
229371
Title
Exact relaxation of multy point iterative methods
Author
Miheev, Serge E.
Author_Institution
St.-Peterburg State Univ., St. Petersburg, Russia
fYear
2014
fDate
June 30 2014-July 4 2014
Firstpage
116
Lastpage
117
Abstract
Simple effective algorithm to calculate n-points iterative method exact relaxation 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.
Keywords
iterative methods; polynomials; exact relaxation; multipoint iterative methods; polynomial roots; Approximation algorithms; Chebyshev approximation; Educational institutions; Mathematical model; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Technologies in Physical and Engineering Applications (ICCTPEA), 2014 International Conference on
Conference_Location
St. Petersburg
Print_ISBN
978-1-4799-5315-8
Type
conf
DOI
10.1109/ICCTPEA.2014.6893311
Filename
6893311
Link To Document