#include <mpr_numeric.h>
Definition at line 148 of file mpr_numeric.h.
◆ rootArranger() [1/2]
◆ ~rootArranger()
rootArranger::~rootArranger |
( |
| ) |
|
|
inline |
◆ rootArranger() [2/2]
◆ arrange()
void rootArranger::arrange |
( |
| ) |
|
Definition at line 881 of file mpr_numeric.cc.
887 int xkoord, r, rtest, xk, mtest;
891 for ( xkoord= 0; xkoord < anzm; xkoord++ ) {
893 for ( r= 0; r < anzr; r++ ) {
897 for ( xk =0; xk <= xkoord; xk++ )
899 tmp -= (*
roots[xk])[r] *
mu[xkoord]->evPointCoord(xk+1);
903 for ( rtest= r; rtest < anzr; rtest++ ) {
904 zwerg = tmp - (*
roots[xk])[rtest] *
mu[xkoord]->evPointCoord(xk+1);
905 for ( mtest= 0; mtest < anzr; mtest++ )
909 if ( ((zwerg.
real() <= (*
mu[xkoord])[mtest].real() + mprec) &&
910 (zwerg.
real() >= (*
mu[xkoord])[mtest].real() - mprec)) &&
911 ((zwerg.
imag() <= (*
mu[xkoord])[mtest].imag() + mprec) &&
912 (zwerg.
imag() >= (*
mu[xkoord])[mtest].imag() - mprec)) )
922 WarnS(
"rootArranger::arrange: precision lost");
929 Warn(
"rootArranger::arrange: No match? coord %d, root %d.",xkoord,r);
931 WarnS(
"One of these ...");
932 for ( rtest= r; rtest < anzr; rtest++ )
935 for ( xk =0; xk <= xkoord; xk++ )
937 tmp-= (*
roots[xk])[r] *
mu[xkoord]->evPointCoord(xk+1);
939 tmp-= (*
roots[xk])[rtest] *
mu[xkoord]->evPointCoord(xk+1);
942 WarnS(
" ... must match to one of these:");
943 for ( mtest= 0; mtest < anzr; mtest++ )
◆ solve_all()
void rootArranger::solve_all |
( |
| ) |
|
◆ success()
bool rootArranger::success |
( |
| ) |
|
|
inline |
◆ listOfRoots
Definition at line 5038 of file ipshell.cc.
5042 int count=
self->roots[0]->getAnzRoots();
5043 int elem=
self->roots[0]->getAnzElems();
5054 onepoint->
Init(elem);
5055 for (
j= 0;
j < elem;
j++ )
5071 listofroots->
m[
i].
data=(
void *)onepoint;
5079 listofroots->
Init( 0 );
◆ found_roots
bool rootArranger::found_roots |
|
private |
◆ howclean
int rootArranger::howclean |
|
private |
◆ mc
◆ mu
◆ rc
◆ roots
The documentation for this class was generated from the following files: