On an algorithm and its use in approximating roots of algebraic equations. (Q5907122): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q29027962, #quickstatements; #temporary_batch_1703769339033 |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2299963 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4231632604 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:08, 19 March 2024
scientific article; zbMATH DE number 2570434
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an algorithm and its use in approximating roots of algebraic equations. |
scientific article; zbMATH DE number 2570434 |
Statements
On an algorithm and its use in approximating roots of algebraic equations. (English)
0 references
1929
0 references
Es wird der durch die Reihe \[ x_1 = q_1(1 - x_2), \quad x_2 = q_2(1 - x_3), \dots \] bestimmte Algorithmus untersucht, wo \(q_1\) für \(x_1 > 1\) die kleinste durch \(x_2 = 1 - \dfrac{x_1}{q_1} > 0\) bestimmte positive ganze Zahl ist, und wo \(q_n = \dfrac{1}{p_n}\) für \(n \geqq 2\) gesetzt wird, wobei \(p_n\) die größte positive ganze Zahl ist, für die \(x_{n+1} = 1 - p_n x_n >0\) ist. Irrationale Wurzeln algebraischer Gleichungen können in obiger Weise durch ein konvergentes Verfahren angenähert werden.
0 references
