%0 Journal Article %1 hachtel1971sparse %A Hachtel, Gary D. %A Brayton, Robert K. %A Gustavson, Fred G. %D 1971 %I IEEE %J Circuit Theory, IEEE Transactions on %K 68u20-computational-simulation 94c05-analytic-circuit-theory %N 1 %P 101--113 %R 10.1109/tct.1971.1083223 %T The Sparse Tableau Approach to Network Analysis and Design %U https://ieeexplore.ieee.org/document/1083223 %V 18 %X The tableau approach to automated network design optimization via implicit, variable order, variable time-step integration, and adjoint sensitivity computation is described. In this approach, the only matrix operation required is that of repeatedly solving linear algebraic equations of fixed sparsity structure. Required partial derivatives and numerical integration is done at the branch level leading to a simple input language, complete generality and maximum sparsity of the characteristic coefficient matrix. The bulk of computation and program complexity is thus located in the sparse matrix routines; described herein are the routines OPTORD and 1-2-3 GNSO. These routines account for variability type of the matrix elements in producing a machine code for solution ofAx=bin nested iterations for which a weighted sum of total operations count and round-off error incurred in the optimization is minimized.

@article{hachtel1971sparse, abstract = {The tableau approach to automated network design optimization via implicit, variable order, variable time-step integration, and adjoint sensitivity computation is described. In this approach, the only matrix operation required is that of repeatedly solving linear algebraic equations of fixed sparsity structure. Required partial derivatives and numerical integration is done at the branch level leading to a simple input language, complete generality and maximum sparsity of the characteristic coefficient matrix. The bulk of computation and program complexity is thus located in the sparse matrix routines; described herein are the routines OPTORD and 1-2-3 GNSO. These routines account for variability type of the matrix elements in producing a machine code for solution ofAx=bin nested iterations for which a weighted sum of total operations count and round-off error incurred in the optimization is minimized.}, added-at = {2017-06-29T07:13:07.000+0200}, author = {Hachtel, Gary D. and Brayton, Robert K. and Gustavson, Fred G.}, biburl = {https://www.bibsonomy.org/bibtex/2547c9000fe3929091221752130f44456/gdmcbain}, citeulike-article-id = {10375356}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/tct.1971.1083223}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs\_all.jsp?arnumber=1083223}, comment = {(private-note)cited in Wikipedia `Modified nodal analysis' as an earlier method which that was to replace}, doi = {10.1109/tct.1971.1083223}, interhash = {a57d1271c4b0c1921ef1e7e4efc39fea}, intrahash = {547c9000fe3929091221752130f44456}, issn = {0018-9324}, journal = {Circuit Theory, IEEE Transactions on}, keywords = {68u20-computational-simulation 94c05-analytic-circuit-theory}, month = jan, number = 1, pages = {101--113}, posted-at = {2012-02-21 23:20:16}, priority = {2}, publisher = {IEEE}, timestamp = {2024-03-15T04:28:50.000+0100}, title = {{The Sparse Tableau Approach to Network Analysis and Design}}, url = {https://ieeexplore.ieee.org/document/1083223}, volume = 18, year = 1971 }