MPSolve 3.2.1
|
Simple routines used to interact with MPSolve without going into the internals. More...
Go to the source code of this file.
Macros | |
#define | mps_new(type) ((type*)mps_malloc (sizeof(type))) |
#define | mps_newv(type, n) ((type*)mps_malloc (sizeof(type) * (n))) |
Functions | |
void | mps_set_default_values (mps_context *s) |
void | mps_mpsolve (mps_context *s) |
Call the real polynomial (or secular equation, or whatever) solver and do the computation. More... | |
void | mps_standard_mpsolve (mps_context *s) |
Main routine of the program that implements the algorithm in the standard polynomial version. More... | |
void * | mps_malloc (size_t size) |
Allocator for memory to be used in mpsolve. | |
void * | mps_realloc (void *pointer, size_t size) |
Reallocator for memory used in MPSolve. | |
void | mps_mpsolve_async (mps_context *s, mps_callback callback, void *user_data) |
Simple routines used to interact with MPSolve without going into the internals.
void mps_mpsolve | ( | mps_context * | s | ) |
Call the real polynomial (or secular equation, or whatever) solver and do the computation.
The algorithm used must be selected before this call with mps_select_algorithm
and the data (the coefficients, or whatever the algorithm may require) should be provided after that.
Roots can then be obtained with the functions mps_context_get_roots_*
void mps_standard_mpsolve | ( | mps_context * | s | ) |
Main routine of the program that implements the algorithm in the standard polynomial version.
The program is divided into many parts
which_case
is 'f'
or 'd'
according to float or dpe case.