This is checkroots.c in view mode; [Download] [Up]
#include "pv.h"
findpoles( coef, pole, M ) float coef[] ; complex pole[] ; int M ; {
int i ;
complex *a ;
char *malloc() ;
a = (complex *) malloc( (M+1)*sizeof(complex) ) ;
for ( i = 0 ; i <= M ; i++ ) {
a[i].re = coef[i] ;
a[i].im = 0. ;
}
findroots( a, pole, M ) ;
for ( i = 0 ; i < M ; i++ )
pole[i] = cdiv( one, conjg( pole[i] ) ) ;
free( a ) ;
}
These are the contents of the former NiCE NeXT User Group NeXTSTEP/OpenStep software archive, currently hosted by Netfuture.ch.