23.01.2015 Views

Download - Wolfram Research

Download - Wolfram Research

Download - Wolfram Research

SHOW MORE
SHOW LESS
  • No tags were found...

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

144 2. Tutorial<br />

of all terms by least influence. If only one design point is present, the sorting order is obvious, but<br />

it is not obvious for two or more design points. For example, if removing matrix entry X causes a<br />

magnitude error of in design point and an error of in design point while the error<br />

values for matrix entry Y are and respectively, which entry should be removed first<br />

Removing X first would introduce a very small error in design point but an excessively large one<br />

in design point . On the other hand, Y has a much larger influence in design point than X but<br />

the total error in both design points would be smaller if Y is removed first.<br />

SortingMethod is an option which selects the sorting strategy that is applied to the influence list<br />

to obtain the term rankings. By default, terms are ranked by least influence on the solution in<br />

the primary design point, that is design point . In the above example, this strategy would give X<br />

precedence over Y. The corresponding option setting in Options[ApproximateMatrixEquation] is<br />

SortingMethod −> PrimaryDesignPoint<br />

The other available strategy ranks terms by least arithmetic mean influence in all design points,<br />

which would give Y precedence over X:<br />

SortingMethod −> LeastMeanInfluence<br />

Usually, LeastMeanInfluence is the better choice if the calculations involve more than one design<br />

point. To examine the effect of selecting a different term ranking method we repeat the previous<br />

approximation run with SortingMethod −> LeastMeanInfluence.<br />

In[39]:= approxceamp4 = ApproximateMatrixEquation[ceampsta,<br />

V$RL, dpceamp3, CompressEquations −> True,<br />

SortingMethod −> LeastMeanInfluence]<br />

Out[39]= DAEAC, 19 19 <br />

Solving these approximated equations now yields a much simpler expression.<br />

In[40]:= voutsimp4 = V$RL /. First[Solve[approxceamp4, V$RL]]<br />

Out[40]=<br />

C1 C2 gm$Q1 R1 R2 RC RL Rpi$Q1 s 2 V1 <br />

1 C2 RL s R1 R2 gm$Q1 R1 RE Rpi$Q1 <br />

gm$Q1 R2 RE Rpi$Q1 C1 gm$Q1 R1 R2 RE Rpi$Q1 s<br />

Here, we determined the approximation sequence by using the average of the design-point errors as<br />

sorting criterion. In our first approximation run with two design points the term influences on the<br />

second design point at Hz were not taken into consideration when the ranking was computed. The<br />

error bound at design point was reached quickly because some terms were removed first which<br />

had low influence in design point but large influence in design point .

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!