int
CKTpzSetup(CKTcircuit *ckt, int type)
{
extern SPICEdev **DEVices;
PZAN *pzan = (PZAN *) ckt->CKTcurJob;
SMPmatrix *matrix;
int error;
int i, temp, solution_col, balance_col;
int input_pos, input_neg, output_pos, output_neg;
NIdestroy(ckt);
error = NIinit(ckt);
if (error)
return(error);
matrix = ckt->CKTmatrix;
/* Really awful . . . */
ckt->CKTnumStates = 0;
for (i = 0; i < DEVmaxnum; i++) {
if (DEVices[i] && DEVices[i]->DEVpzSetup != NULL && ckt->CKThead[i] != NULL) {
error = (*DEVices[i]->DEVpzSetup)(matrix, ckt->CKThead[i],
ckt, &ckt->CKTnumStates);
if (error != OK)
return(error);
}
}
solution_col = 0;
balance_col = 0;
input_pos = pzan->PZin_pos;
input_neg = pzan->PZin_neg;
if (type == PZ_DO_ZEROS) {
/* Vo/Ii in Y */
output_pos = pzan->PZout_pos;
output_neg = pzan->PZout_neg;
} else if (pzan->PZinput_type == PZ_IN_VOL) {
/* Vi/Ii in Y */
output_pos = pzan->PZin_pos;
output_neg = pzan->PZin_neg;
} else {
/* Denominator */
output_pos = 0;
output_neg = 0;
input_pos = 0;
input_neg = 0;
}
if (output_pos) {
solution_col = output_pos;
if (output_neg)
balance_col = output_neg;
} else {
solution_col = output_neg;
temp = input_pos;
input_pos = input_neg;
input_neg = temp;
}
if (input_pos)
pzan->PZdrive_pptr = SMPmakeElt(matrix, input_pos, solution_col);
else
pzan->PZdrive_pptr = NULL;
if (input_neg)
pzan->PZdrive_nptr = SMPmakeElt(matrix, input_neg, solution_col);
else
pzan->PZdrive_nptr = NULL;
pzan->PZsolution_col = solution_col;
pzan->PZbalance_col = balance_col;
pzan->PZnumswaps = 1;
error = NIreinit(ckt);
if (error)
return(error);
return OK;
}
///<param name = "*ckt"> Circuit to operate on </param>
///<param name = "maxIter"> Maximum number of iterations to attempt </param>
int NIiter(register CKTcircuit *ckt, int maxIter)
{
int iterno;
int ipass;
int error;
int i, j; /* temporaries for finding error location */
char *message; /* temporary message buffer */
double *temp;
double startTime;
static char *msg = "Too many iterations without convergence";
iterno = 0;
ipass = 0;
if ((ckt->CKTmode & MODETRANOP) && (ckt->CKTmode & MODEUIC))
{
temp = ckt->CKTrhsOld;
ckt->CKTrhsOld = ckt->CKTrhs;
ckt->CKTrhs = temp;
error = CKTload(ckt);
if (error)
{
return(error);
}
return(OK);
}
#ifdef HAS_SENSE2
if (ckt->CKTsenInfo)
{
error = NIsenReinit(ckt);
if (error)
return(error);
}
#endif
if (ckt->CKTniState & NIUNINITIALIZED)
{
error = NIreinit(ckt);
if (error)
{
#ifdef STEPDEBUG
printf("re-init returned error \n");
#endif
return(error);
}
}
while (1)
{
ckt->CKTnoncon = 0;
#ifdef NEWPRED
if (!(ckt->CKTmode & MODEINITPRED))
{
#else /* NEWPRED */
if (1)
{ /* } */
#endif /* NEWPRED */
error = CKTload(ckt);
/*printf("loaded, noncon is %d\n",ckt->CKTnoncon);*/
/*fflush(stdout);*/
iterno++;
if (error)
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("load returned error \n");
#endif
return(error);
}
/*printf("after loading, before solving\n");*/
/*CKTdump(ckt);*/
if (!(ckt->CKTniState & NIDIDPREORDER))
{
error = SMPpreOrder(ckt->CKTmatrix);
if (error)
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("pre-order returned error \n");
#endif
return(error); /* badly formed matrix */
}
ckt->CKTniState |= NIDIDPREORDER;
}
if ((ckt->CKTmode & MODEINITJCT) || ((ckt->CKTmode & MODEINITTRAN) && (iterno == 1)))
{
ckt->CKTniState |= NISHOULDREORDER;
}
if (ckt->CKTniState & NISHOULDREORDER)
{
startTime = (*(SPfrontEnd->IFseconds))();
error = SMPreorder(ckt->CKTmatrix, ckt->CKTpivotAbsTol, ckt->CKTpivotRelTol, ckt->CKTdiagGmin);
ckt->CKTstat->STATreorderTime += (*(SPfrontEnd->IFseconds))() - startTime;
if (error)
{
/* new feature - we can now find out something about what is
* wrong - so we ask for the troublesome entry
*/
SMPgetError(ckt->CKTmatrix, &i, &j);
message = (char *)MALLOC(1000); /* should be enough */
(void)sprintf(message, "singular matrix: check nodes %s and %s\n", NODENAME(ckt, i), NODENAME(ckt, j));
(*(SPfrontEnd->IFerror))(ERR_WARNING, message, (IFuid *)NULL);
FREE(message);
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("reorder returned error \n");
#endif
return(error); /* can't handle these errors - pass up! */
}
ckt->CKTniState &= ~NISHOULDREORDER;
}
else
{
startTime = (*(SPfrontEnd->IFseconds))();
error = SMPluFac(ckt->CKTmatrix, ckt->CKTpivotAbsTol, ckt->CKTdiagGmin);
ckt->CKTstat->STATdecompTime += (*(SPfrontEnd->IFseconds))() - startTime;
if (error)
{
if (error == E_SINGULAR)
{
ckt->CKTniState |= NISHOULDREORDER;
DEBUGMSG(" forced reordering....\n");
continue;
}
/*CKTload(ckt);*/
/*SMPprint(ckt->CKTmatrix,stdout);*/
/* seems to be singular - pass the bad news up */
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("lufac returned error \n");
#endif
return(error);
}
}
startTime = (*(SPfrontEnd->IFseconds))();
SMPsolve(ckt->CKTmatrix, ckt->CKTrhs, ckt->CKTrhsSpare);
ckt->CKTstat->STATsolveTime += (*(SPfrontEnd->IFseconds))() - startTime;
#ifdef STEPDEBUG
/*XXXX*/
if (*ckt->CKTrhs != 0.0)
printf("NIiter: CKTrhs[0] = %g\n", *ckt->CKTrhs);
if (*ckt->CKTrhsSpare != 0.0)
printf("NIiter: CKTrhsSpare[0] = %g\n", *ckt->CKTrhsSpare);
if (*ckt->CKTrhsOld != 0.0)
printf("NIiter: CKTrhsOld[0] = %g\n", *ckt->CKTrhsOld);
/*XXXX*/
#endif
*ckt->CKTrhs = 0;
*ckt->CKTrhsSpare = 0;
*ckt->CKTrhsOld = 0;
if (iterno > maxIter)
{
/*printf("too many iterations without convergence: %d iter's\n",
iterno);*/
ckt->CKTstat->STATnumIter += iterno;
errMsg = MALLOC(strlen(msg) + 1);
strcpy(errMsg, msg);
#ifdef STEPDEBUG
printf("iterlim exceeded \n");
#endif
return(E_ITERLIM);
}
if (ckt->CKTnoncon == 0 && iterno != 1)
{
ckt->CKTnoncon = NIconvTest(ckt);
}
else
{
ckt->CKTnoncon = 1;
}
}
if (ckt->CKTmode & MODEINITFLOAT)
{
if ((ckt->CKTmode & MODEDC) && (ckt->CKThadNodeset))
{
if (ipass)
{
ckt->CKTnoncon = ipass;
}
ipass = 0;
}
if (ckt->CKTnoncon == 0)
{
ckt->CKTstat->STATnumIter += iterno;
return(OK);
}
}
else if (ckt->CKTmode & MODEINITJCT)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFIX;
ckt->CKTniState |= NISHOULDREORDER;
}
else if (ckt->CKTmode & MODEINITFIX)
{
if (ckt->CKTnoncon == 0)
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
ipass = 1;
}
else if (ckt->CKTmode & MODEINITSMSIG)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else if (ckt->CKTmode & MODEINITTRAN)
{
if (iterno <= 1)
ckt->CKTniState |= NISHOULDREORDER;
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else if (ckt->CKTmode & MODEINITPRED)
{
ckt->CKTmode = (ckt->CKTmode&(~INITF)) | MODEINITFLOAT;
}
else
{
ckt->CKTstat->STATnumIter += iterno;
#ifdef STEPDEBUG
printf("bad initf state \n");
#endif
return(E_INTERN);
/* impossible - no such INITF flag! */
}
/* build up the lvnim1 array from the lvn array */
temp = ckt->CKTrhsOld;
ckt->CKTrhsOld = ckt->CKTrhs;
ckt->CKTrhs = temp;
/*printf("after loading, after solving\n");*/
/*CKTdump(ckt);*/
}
/*NOTREACHED*/
}
