Efficiently Computing Many Roots of a Function (Q5693188): Difference between revisions
From MaRDI portal
Changed an Item |
Added link to MaRDI item. |
||
(3 intermediate revisions by 2 users not shown) | |||
Property / describes a project that uses | |||
Property / describes a project that uses: CHABIS / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: RFSFNS / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 05:36, 7 March 2024
scientific article; zbMATH DE number 2207151
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficiently Computing Many Roots of a Function |
scientific article; zbMATH DE number 2207151 |
Statements
Efficiently Computing Many Roots of a Function (English)
0 references
22 September 2005
0 references
zerofinding
0 references
bisection based methods
0 references
counting the roots of a function
0 references
very large problems
0 references
Riemann's hypothesis
0 references
zeta-function
0 references
Elbert's conjecture
0 references