Automatic problemsize reduction for on-state semiconductor problems

Two algorithms are presented for the analysis of a large class of on-state semiconductor problems. The algorithms only involve the strictly necessary equations in the discretized problem. Equations that are satisfied and solution values that are found are not unnecessarily present in the calculations. Some examples of their use are shown.