|
MPSolve 3.2.2
|
Implementation of the iterations using Jacobi-style updates. More...
#include <mps/mps.h>Go to the source code of this file.
Functions | |
| MPS_BEGIN_DECLS int | mps_faberth_packet (mps_context *ctx, mps_polynomial *p, mps_boolean just_regenerated) |
| Perform a packet of Aberth iterations on the approximation to the roots of p. | |
| int | mps_daberth_packet (mps_context *ctx, mps_polynomial *p, mps_boolean just_regenerated) |
| Perform a packet of Aberth iterations on the approximation to the roots of p. | |
| int | mps_maberth_packet (mps_context *ctx, mps_polynomial *p, mps_boolean just_regenerated) |
| Perform a packet of Aberth iterations on the approximation to the roots of p. | |
Implementation of the iterations using Jacobi-style updates.
| int mps_daberth_packet | ( | mps_context * | ctx, |
| mps_polynomial * | p, | ||
| mps_boolean | just_regenerated ) |
Perform a packet of Aberth iterations on the approximation to the roots of p.
| ctx | Current MPSolve context. |
| p | The polynomial whose roots should be approximated. |
| just | regenrated true if this packet is the first following a regeneration. |
| MPS_BEGIN_DECLS int mps_faberth_packet | ( | mps_context * | ctx, |
| mps_polynomial * | p, | ||
| mps_boolean | just_regenerated ) |
Perform a packet of Aberth iterations on the approximation to the roots of p.
| ctx | Current MPSolve context. |
| p | The polynomial whose roots should be approximated. |
| just | regenrated true if this packet is the first following a regeneration. |
| int mps_maberth_packet | ( | mps_context * | ctx, |
| mps_polynomial * | p, | ||
| mps_boolean | just_regenerated ) |
Perform a packet of Aberth iterations on the approximation to the roots of p.
| ctx | Current MPSolve context. |
| p | The polynomial whose roots should be approximated. |
| just | regenrated true if this packet is the first following a regeneration. |