A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (Q3814803): Difference between revisions
From MaRDI portal
Created a new Item |
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.1137/0217069 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2003933590 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots |
scientific article |
Statements
A Fast Parallel Algorithm for Determining All Roots of a Polynomial with Real Roots (English)
0 references
1988
0 references
parallel algorithms
0 references
polynomials roots
0 references
numerical integration
0 references
root separation
0 references
approximations of zeroes
0 references
complexity class
0 references
Sturm sequence
0 references
