From: Henry B. <hb...@pi...> - 2018-01-19 18:55:40
|
Ok, after some amount of Google searching, I found that there are two main methods in use: "STA" and "MNA". STA = "Sparse Tableau Analysis" (now deprecated) MNA = "Modified Nodal Analysis" (used in Spice, et al) Since I'm interested in *understanding*, rather than *implementation*, I don't care so much about high speed, so MNA is too complicated. STA is pretty close, as it puts the equations in "incidence matrix" form, but I haven't found a fully worked example. Also, since I'm only interested in *linear* circuits, which can be solved symbolically, I don't care about time-stepped (Euler?) simulations. I want to show the simplest mapping of circuit topology to sparse symbolic matrices, and then use Maxima to solve the set of simultaneous equations for voltages and currents. Even better if everything is in terms of *complex* values rather than real values, as exponentials are far easier to deal with symbolically than sines & cosines. A good example would be a simple RLC circuit. www.falstad.com/circuit is very cool, but doesn't show how to set up the equations. At 06:45 AM 1/19/2018, Henry Baker wrote: >Hi: > >I was looking for a trivial linear circuit analysis example for Maxima. > >I want to show how the circuit of R's, L's, and C's maps into a matrix. > >In particular, the matrix should "mirror" the topology of the circuit. > >Thanks in advance for any pointers. > >Henry Baker |