MPSolve 3.2.1
Loading...
Searching...
No Matches
jacobi-aberth.h
Go to the documentation of this file.
1/*
2 * This file is part of MPSolve 3.2.1
3 *
4 * Copyright (C) 2001-2020, Dipartimento di Matematica "L. Tonelli", Pisa.
5 * License: http://www.gnu.org/licenses/gpl.html GPL version 3 or higher
6 *
7 * Authors:
8 * Leonardo Robol <leonardo.robol@unipi.it>
9 */
10
17#ifndef MPS_JACOBI_ABERTH_H_
18#define MPS_JACOBI_ABERTH_H_
19
20#include <mps/mps.h>
21
22MPS_BEGIN_DECLS
23
24int mps_faberth_packet (mps_context * ctx, mps_polynomial * p, mps_boolean just_regenerated);
25int mps_daberth_packet (mps_context * ctx, mps_polynomial * p, mps_boolean just_regenerated);
26int mps_maberth_packet (mps_context * ctx, mps_polynomial * p, mps_boolean just_regenerated);
27
28MPS_END_DECLS
29
30#endif /* endif _MPS_JACOBI_ABERTH_H */
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.
Definition: jacobi-aberth.c:472
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.
Definition: jacobi-aberth.c:303
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.
Definition: jacobi-aberth.c:146
Header file for libmps.
this struct holds the state of the mps computation
Definition: context.h:55
Struct that represents an abstract polynomial. All the other real polynomial implementations (such as...
Definition: polynomial.h:111