<The> simultaneous determination of all zeros of a polynomial.
Konštrukcia triedy adaptívnych iteratívnych metód vyššieho rádu pre simultánne určenie všetkých nulových bodov polynómu. Tieto metódy si zachovávajú rád konvergencie aj v prípade viacnásobných koreňov. Metódy sú ilustrované numerickými príkladmi.
Na minha lista:
| Autor principal: | |
|---|---|
| Formato: | Capítulo de Livro |
| Idioma: | inglês |
| Assuntos: | |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|
Registos relacionados: <The> simultaneous determination of all zeros of a polynomial.
- Schröder-like algorithms for multiple complex zeros of a polynomial.
- Systolic computation of interpolating polynomials.
- Simultaneous self-verified computation of exp(A) and integral (0,1,exp(As)ds).
- Computational aspects of a branch and bound algorithm for quadratic zero-one programming.
- On the determination of the number and multiplicity of zeros of a function.
- On the zeros of Cauchy polynomials with application to optimal depreciation.