| Display title | Successive over-relaxation |
| Default sort key | Successive over-relaxation |
| Page length (in bytes) | 20,500 |
| Namespace ID | 0 |
| Page ID | 2000 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>LinuxGuru |
| Date of page creation | 19:45, 6 February 2024 |
| Latest editor | imported>LinuxGuru |
| Date of latest edit | 19:45, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar method can be used for any slowly converging iterative process.
It was devised simultaneously by David... |
