#include <mpr_numeric.h>
Definition at line 149 of file mpr_numeric.h.
rootArranger::~rootArranger |
( |
| ) |
|
|
inline |
void rootArranger::arrange |
( |
| ) |
|
Definition at line 896 of file mpr_numeric.cc.
901 int xkoord,
r, rtest, xk, mtest;
905 for ( xkoord= 0; xkoord < anzm; xkoord++ ) {
907 for ( r= 0; r < anzr; r++ ) {
911 for ( xk =0; xk <= xkoord; xk++ )
913 tmp -= (*
roots[xk])[r] *
mu[xkoord]->evPointCoord(xk+1);
917 for ( rtest= r; rtest < anzr; rtest++ ) {
918 zwerg = tmp - (*
roots[xk])[rtest] *
mu[xkoord]->evPointCoord(xk+1);
919 for ( mtest= 0; mtest < anzr; mtest++ )
923 if ( ((zwerg.
real() <= (*
mu[xkoord])[mtest].real() + mprec) &&
924 (zwerg.
real() >= (*
mu[xkoord])[mtest].real() - mprec)) &&
925 ((zwerg.
imag() <= (*
mu[xkoord])[mtest].imag() + mprec) &&
926 (zwerg.
imag() >= (*
mu[xkoord])[mtest].imag() - mprec)) )
936 WarnS(
"rootArranger::arrange: precision lost");
943 Warn(
"rootArranger::arrange: No match? coord %d, root %d.",xkoord,r);
945 WarnS(
"One of these ...");
946 for ( rtest= r; rtest < anzr; rtest++ )
949 for ( xk =0; xk <= xkoord; xk++ )
951 tmp-= (*
roots[xk])[r] *
mu[xkoord]->evPointCoord(xk+1);
953 tmp-= (*
roots[xk])[rtest] *
mu[xkoord]->evPointCoord(xk+1);
956 WarnS(
" ... must match to one of these:");
957 for ( mtest= 0; mtest < anzr; mtest++ )
bool swapRoots(const int from, const int to)
gmp_complex numbers based on
char * complexToStr(gmp_complex &c, const unsigned int oprec, const coeffs src)
Rational pow(const Rational &a, int e)
void rootArranger::solve_all |
( |
| ) |
|
Definition at line 871 of file mpr_numeric.cc.
878 for ( i= 0; i <
rc; i++ )
886 for ( i= 0; i <
mc; i++ )
bool rootArranger::success |
( |
| ) |
|
|
inline |
Definition at line 4983 of file ipshell.cc.
4986 int count=
self->roots[0]->getAnzRoots();
4987 int elem=
self->roots[0]->getAnzElems();
4993 listofroots->
Init( count );
4995 for (i=0; i <
count; i++)
4998 onepoint->
Init(elem);
4999 for ( j= 0; j < elem; j++ )
5015 listofroots->
m[
i].
data=(
void *)onepoint;
5023 listofroots->
Init( 0 );
int status int void size_t count
ring currRing
Widely used global variable which specifies the current polynomial ring for Singular interpreter and ...
static BOOLEAN rField_is_long_C(const ring r)
INLINE_THIS void Init(int l=0)
static FORCE_INLINE number n_Copy(number n, const coeffs r)
return a copy of 'n'
char * complexToStr(gmp_complex &c, const unsigned int oprec, const coeffs src)
bool rootArranger::found_roots |
|
private |
int rootArranger::howclean |
|
private |
The documentation for this class was generated from the following files: