An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli (Q2447014): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Principles for Testing Polynomial Zerofinding Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3497179 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A three-stage variable-shift iteration for polynomial zeros and its relation to generalized Rayleigh iteration / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The mathematical basis and a prototype implementation of a new polynomial rootfinder with quadratic convergence / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Improvement on the Lehmer-Schur root detection method / rank | |||
Normal rank | |||
Latest revision as of 10:08, 8 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli |
scientific article |
Statements
An efficient reliable algorithm for the approximation of all polynomial roots based on the method of D. Bernoulli (English)
0 references
23 April 2014
0 references
polynomial roots
0 references
0 references
0 references
