Efficiently Computing Many Roots of a Function (Q5693188): Difference between revisions
From MaRDI portal
Changed an 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/s1064827502406531 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2014855291 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:13, 30 July 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