Категории
Образование 
Algorithm просмотров - 73
The steps of the Newton-Raphson method to find the root of an equation f(x) = 0 are
1. Evaluate f¢(x) symbolically
2. Use an initial guess of the root, xi, to estimate the new value of the root xi+1 as
3. Find the absolute relative approximate error, 
as
4. Compare the absolute relative approximate error, with the pre-specified relative error tolerance, 
. If > , then go to step 2, else stop the algorithm. Also, check if the number of iterations has exceeded the maximum number of iterations.
Figure 1.Geometrical illustration of the Newton-Raphson method
Example 1:
You are working for ‘DOWN THE TOILET COMPANY’ that makes floats for ABC commodes. The ball has a specific gravity of 0.6 and has a radius of 5.5 cm. You are asked to find the distance to which the ball will get submerged when floating in water.
Читайте также
Москва, 2011 Учебно-методическое пособие Касторнов А.Ф., Касторнова В.А. Список литературы. 1. Правила устройства электроустановок. г. Астана, 2003 г., 320 стр. (министерство энергетики и министерство ресурсов РК). 2. Неклепаев Б.Н., Крючков И.П., Электрическая часть... [читать подробенее]
Оптимальный алгоритм Одно из последствий открытия аномалии Belady - поиск оптимального алгоритма. Этот алгоритм имеет минимальную частоту fault'ов среди всех алгоритмов. Он прост: замещай страницу, которая не будет использоваться в течение длительного периода... [читать подробенее]
The steps to apply the bisection method to find the root of the equation are 1. Choose and as two guesses for the root such that , or in other words, changes sign between and . 2. Estimate the root, of the equation as the mid-point between and as 3. Now check the following a. If , then the root lies between and ; then and . b. If , then the root lies between and ; then and . c. If ; then the root is . Stop the algorithm if this is true. 4. Find the new... [читать подробенее]
The steps of the Newton-Raphson method to find the root of an equation f(x) = 0 are 1. Evaluate f¢(x) symbolically 2. Use an initial guess of the root, xi, to estimate the new value of the root xi+1 as 3. Find the absolute relative approximate error, as 4. Compare the absolute relative approximate error, with the pre-specified relative error tolerance, . If > , then go to step 2, else stop the algorithm. Also, check if the number of iterations has exceeded the maximum... [читать подробенее]
Метод штрафных функций В целевую функцию алгоритма обучения вводятся штрафы за то, что значения синаптических весов отличны от нуля, например: где L – количество нейронов текущего слоя; n – количество входных сигналов слоя. Метод проекций Синаптический вес... [читать подробенее]
PART 1 We live in the age of the computer revolution. Like any revolution, it is widespread, all-pervasive, and will have a lasting impact. It is as fundamental to our economic and social order as was the industrial revolution. It will affect the thinking patterns and life style of every individual. The industrial revolution was essentially the augmentation of man's physical powers, the amplification of man's muscle. The pressing of a button could cause a large machine to stamp a pattern in... [читать подробенее]
PART 1 We live in the age of the computer revolution. Like any revolution, it is widespread, all-pervasive, and will have a lasting impact. It is as fundamental to our economic and social order as was the industrial revolution. It will affect the thinking patterns and life style of every individual. The industrial revolution was essentially the augmentation of man's physical powers, the amplification of man's muscle. The pressing of a button could cause a large machine to stamp a pattern in... [читать подробенее]