/* This is the AC netlist solver. It prepares the circuit list for
each requested frequency and solves it then. */
int acsolver::solve (void) {
runs++;
// run additional noise analysis ?
noise = !strcmp (getPropertyString ("Noise"), "yes") ? 1 : 0;
// create frequency sweep if necessary
if (swp == NULL) {
swp = createSweep ("acfrequency");
}
// initialize node voltages, first guess for non-linear circuits and
// generate extra circuits if necessary
init ();
setCalculation ((calculate_func_t) &calc);
solve_pre ();
swp->reset ();
for (int i = 0; i < swp->getSize (); i++) {
freq = swp->next ();
if (progress) logprogressbar (i, swp->getSize (), 40);
#if DEBUG && 0
logprint (LOG_STATUS, "NOTIFY: %s: solving netlist for f = %e\n",
getName (), (double) freq);
#endif
// start the linear solver
eqnAlgo = ALGO_LU_DECOMPOSITION;
solve_linear ();
// compute noise if requested
if (noise) solve_noise ();
// save results
saveAllResults (freq);
}
solve_post ();
if (progress) logprogressclear (40);
return 0;
}
/* This is the DC netlist solver. It prepares the circuit list and
solves it then. */
int dcsolver::solve (void) {
// fetch simulation properties
saveOPs |= !strcmp (getPropertyString ("saveOPs"), "yes") ? SAVE_OPS : 0;
saveOPs |= !strcmp (getPropertyString ("saveAll"), "yes") ? SAVE_ALL : 0;
char * solver = getPropertyString ("Solver");
// initialize node voltages, first guess for non-linear circuits and
// generate extra circuits if necessary
init ();
setCalculation ((calculate_func_t) &calc);
// start the iterative solver
solve_pre ();
// choose a solver
if (!strcmp (solver, "CroutLU"))
eqnAlgo = ALGO_LU_DECOMPOSITION_CROUT;
else if (!strcmp (solver, "DoolittleLU"))
eqnAlgo = ALGO_LU_DECOMPOSITION_DOOLITTLE;
else if (!strcmp (solver, "HouseholderQR"))
eqnAlgo = ALGO_QR_DECOMPOSITION;
else if (!strcmp (solver, "HouseholderLQ"))
eqnAlgo = ALGO_QR_DECOMPOSITION_LS;
else if (!strcmp (solver, "GolubSVD"))
eqnAlgo = ALGO_SV_DECOMPOSITION;
// local variables for the fallback thingies
int retry = -1, error, fallback = 0, preferred;
int helpers[] = {
CONV_SourceStepping,
CONV_GMinStepping,
CONV_SteepestDescent,
CONV_LineSearch,
CONV_Attenuation,
-1 };
// is a certain convergence helper requested?
char * helper = getPropertyString ("convHelper");
convHelper = CONV_None;
if (!strcmp (helper, "LineSearch")) {
convHelper = CONV_LineSearch;
} else if (!strcmp (helper, "SteepestDescent")) {
convHelper = CONV_SteepestDescent;
} else if (!strcmp (helper, "Attenuation")) {
convHelper = CONV_Attenuation;
} else if (!strcmp (helper, "gMinStepping")) {
convHelper = CONV_GMinStepping;
} else if (!strcmp (helper, "SourceStepping")) {
convHelper = CONV_SourceStepping;
}
preferred = convHelper;
if (!subnet->isNonLinear ()) {
// Start the linear solver.
convHelper = CONV_None;
error = solve_linear ();
}
else do {
// Run the DC solver once.
try_running () {
applyNodeset ();
error = solve_nonlinear ();
#if DEBUG
if (!error) {
logprint (LOG_STATUS,
"NOTIFY: %s: convergence reached after %d iterations\n",
getName (), iterations);
}
#endif /* DEBUG */
if (!error) retry = -1;
}
// Appropriate exception handling.
catch_exception () {
case EXCEPTION_NO_CONVERGENCE:
pop_exception ();
if (preferred == helpers[fallback] && preferred) fallback++;
convHelper = helpers[fallback++];
if (convHelper != -1) {
logprint (LOG_ERROR, "WARNING: %s: %s analysis failed, using fallback "
"#%d (%s)\n", getName (), getDescription (), fallback,
getHelperDescription ());
retry++;
restart ();
}
else {
retry = -1;
}
break;
default:
// Otherwise return.
estack.print ();
error++;
break;
}
} while (retry != -1);
// save results and cleanup the solver
saveOperatingPoints ();
saveResults ("V", "I", saveOPs);
solve_post ();
return 0;
}
