geda:spice_polys
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
geda:spice_polys [2012/02/20 15:14] 127.0.0.1 external edit |
geda:spice_polys [2014/04/17 06:43] (current) vzh Add a link to translation |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| + | //Translations of this page are also available in the following languages:// [[spice_polys.ru|Русский]] | ||
| + | |||
| ====== Spice POLY Constructs ====== | ====== Spice POLY Constructs ====== | ||
| - | This is a draft of what I've learned about POLYs. I'm not sure | + | This is a draft of what I've learned about POLYs. I'm not sure |
| it's completely accurate, so anyone should feel free to make corrections. | it's completely accurate, so anyone should feel free to make corrections. | ||
| - | Different versions of spice use different methods of modeling non-linear | + | Different versions of spice use different methods of modeling non-linear |
| dependent sources, Eg. ASRC, Bxxxx, Exxxx, Gxxxx, Fxxxx, Hxxxx, etc... | dependent sources, Eg. ASRC, Bxxxx, Exxxx, Gxxxx, Fxxxx, Hxxxx, etc... | ||
| Line 16: | Line 18: | ||
| The other method is to use an arbitrary expression with something like if-then-else functionality or the piece wise linear functions. They are simpler to formulate but incur the risk of discontinuities which can cause serious convergence problems. However they are much more convenient for hacking something together. | The other method is to use an arbitrary expression with something like if-then-else functionality or the piece wise linear functions. They are simpler to formulate but incur the risk of discontinuities which can cause serious convergence problems. However they are much more convenient for hacking something together. | ||
| - | A lot of effort has gone into having the best of both worlds. The PWL functions often use small curves to smooth the transition from one derivative to the next. and the expressions using the if-then-else | + | A lot of effort has gone into having the best of both worlds. The PWL functions often use small curves to smooth the transition from one derivative to the next. and the expressions using the if-then-else |
| functions are forced to make gradual transitions between different values. In general the libraries use polynomial approximations where they can and constrain them to areas where they are useful. Examples of this in Gnucap are the fit and table statements. | functions are forced to make gradual transitions between different values. In general the libraries use polynomial approximations where they can and constrain them to areas where they are useful. Examples of this in Gnucap are the fit and table statements. | ||
| Line 30: | Line 32: | ||
| --- //[[clif@eugeneweb.com|Clif Eugene]] 2010/11/23 01:31// | --- //[[clif@eugeneweb.com|Clif Eugene]] 2010/11/23 01:31// | ||
| + | |||
geda/spice_polys.txt · Last modified: 2014/04/17 06:43 by vzh
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
