MPSolve 3.2.1
Loading...
Searching...
No Matches
starting.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_STARTING_H_
18#define MPS_STARTING_H_
19
20MPS_BEGIN_DECLS
21
22/* functions in starting.c */
23void mps_fstart (mps_context * s, int n, mps_cluster_item * cluster, double clust_rad,
24 double g, rdpe_t eps_out, double fap[]);
25void mps_dstart (mps_context * s, int n, mps_cluster_item * cluster, rdpe_t clust_rad,
26 rdpe_t g, rdpe_t eps_out, rdpe_t dap[]);
27void mps_mstart (mps_context * s, int n, mps_cluster_item * cluster, rdpe_t clust_rad,
28 rdpe_t g, rdpe_t dap[], mpc_t gg);
29void mps_frestart (mps_context * s);
30void mps_drestart (mps_context * s);
31void mps_mrestart (mps_context * s);
32void mps_fshift (mps_context * s, int m, mps_cluster_item * cluster, double clust_rad,
33 cplx_t g, rdpe_t eps);
34void mps_dshift (mps_context * s, int m, mps_cluster_item * cluster, rdpe_t clust_rad,
35 cdpe_t g, rdpe_t eps);
36void mps_mshift (mps_context * s, int m, mps_cluster_item * cluster, rdpe_t clust_rad,
37 mpc_t g);
38
39/* functions in recursive-starting.c */
40void mps_recursive_fstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
41void mps_recursive_dstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
42void mps_recursive_mstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
43
44/* functions in file-starting.c */
45void mps_file_fstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
46void mps_file_dstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
47void mps_file_mstart (mps_context * ctx, mps_polynomial * poly, mps_approximation ** approximations);
48
49MPS_END_DECLS
50
51#endif /* MPS_STARTING_H_ */
52
void mps_mrestart(mps_context *s)
This function scans the existing clusters and selects the ones where shift in the gravity center must...
Definition: starting.c:1595
void mps_mstart(mps_context *s, int n, mps_cluster_item *cluster, rdpe_t clust_rad, rdpe_t g, rdpe_t dap[], mpc_t gg)
Multiprecision version of mps_fstart()
Definition: starting.c:923
void mps_dshift(mps_context *s, int m, mps_cluster_item *cluster, rdpe_t clust_rad, cdpe_t g, rdpe_t eps)
This routine computes the first coefficients of the shifted polynomial , by performing Horner divis...
Definition: shift.c:91
void mps_dstart(mps_context *s, int n, mps_cluster_item *cluster, rdpe_t clust_rad, rdpe_t g, rdpe_t eps_out, rdpe_t dap[])
Compute new starting approximations to the roots of the polynomial having coefficients of modulus ap...
Definition: starting.c:603
void mps_recursive_fstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select appropriate starting point for the approximation of the roots of the given polynomial by apply...
Definition: recursive-starting.c:65
void mps_drestart(mps_context *s)
This function scans the existing clusters and selects the ones where shift in the gravity center must...
Definition: starting.c:1310
void mps_recursive_dstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select appropriate starting point for the approximation of the roots of the given polynomial by apply...
Definition: recursive-starting.c:173
void mps_frestart(mps_context *s)
This function scans the existing clusters and selects the ones where shift in the gravity center must...
Definition: starting.c:1113
MPS_BEGIN_DECLS void mps_fstart(mps_context *s, int n, mps_cluster_item *cluster, double clust_rad, double g, rdpe_t eps_out, double fap[])
Compute new starting approximations to the roots of the polynomial having coefficients of modulus ap...
Definition: starting.c:295
void mps_mshift(mps_context *s, int m, mps_cluster_item *cluster, rdpe_t clust_rad, mpc_t g)
This routine computes the first coefficients of the shifted polynomial , by performing Horner divis...
Definition: shift.c:137
void mps_file_mstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select the starting points for the polynomial by loading the approximations loaded in the file that h...
Definition: file-starting.c:95
void mps_fshift(mps_context *s, int m, mps_cluster_item *cluster, double clust_rad, cplx_t g, rdpe_t eps)
This routine computes the first coefficients of the shifted polynomial , by performing Horner divis...
Definition: shift.c:42
void mps_recursive_mstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select appropriate starting point for the approximation of the roots of the given polynomial by apply...
Definition: recursive-starting.c:187
void mps_file_fstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select the starting points for the polynomial by loading the approximations loaded in the file that h...
Definition: file-starting.c:65
void mps_file_dstart(mps_context *ctx, mps_polynomial *poly, mps_approximation **approximations)
Select the starting points for the polynomial by loading the approximations loaded in the file that h...
Definition: file-starting.c:80
Definition: approximation.h:24
Cluster held in a mps_clusterization.
Definition: cluster.h:72
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