Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Symbolic simplification by means of graph transformations

From MaRDI portal
Publication:2804632
Jump to:navigation, search

zbMATH Open1335.94111MaRDI QIDQ2804632FDOQ2804632


Authors: Zdenek Kolka, Martin Vlk, Dalibor Biolek, Viera Biolkova Edit this on Wikidata


Publication date: 4 May 2016





Recommendations

  • Symbolic methods in industrial analog circuit design
  • Transient RankingMethods for the Simplification of Nonlinear DAE Systems in Analog Circuit Design
  • scientific article; zbMATH DE number 2125609
  • Algorithms for symbolic reduction of signal flow graphs.
  • Symbolic analysis of analog and digital circuits


zbMATH Keywords

symbolic analysiscircuit theorylinear circuitsCAD toolstopology reductiontwo-graph method


Mathematics Subject Classification ID

Applications of graph theory (05C90) Analytic circuit theory (94C05) Applications of graph theory to circuits and networks (94C15)



Cited In (4)

  • Simplification of signal flow graphs
  • Algorithms for symbolic reduction of signal flow graphs.
  • Delaying Constraint Solving in Symbolic Graph Transformation
  • A novel modeling methodology for memristive systems using homotopy perturbation methods





This page was built for publication: Symbolic simplification by means of graph transformations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2804632)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2804632&oldid=15708064"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 17:28. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki