Search results

[[Category:Circuit theorems]] ...

...lly, Millman's theorem is used to compute the [[voltage]] at the ends of a circuit made up of only [[series and parallel circuits|branches in parallel]]. ...<math>e_k</math>. Then Millman states that the voltage at the ends of the circuit is given by:<ref>Bakshi & Bakshi, p. 7-28</ref> ...

...|Linear Algebra]]: Used to solve systems of linear equations that arise in circuit analysis. Applications include network theory and the analysis of electrica ...Complex Numbers]] and [[Complex analysis|Complex Analysis]]: Important for circuit analysis and impedance calculations. Used in signal processing and to solve ...

[[Category:Theorems about polynomials]] [[Category:Theorems in dynamical systems]] ...

{{Short description|Process of simplifying circuit solutions}} '''Source transformation''' is the process of simplifying a circuit solution, especially with mixed sources, by transforming [[voltage]] source ...

{{Short description|DC circuit analysis technique}} ...es only and ''voltage and current sources can be replaced by an equivalent circuit'' consisting of an equivalent current source in parallel connection with an ...

{{short description|Theoretical circuit which behaves like a given circuit}} ...omodels'' of the original circuit. An example of a macromodel is the Boyle circuit for the 741 [[operational amplifier]].<ref name=Dorf>{{cite book ...

...s is related to the existence of [[one-way function]]s through a number of theorems, collectively referred to as the '''pseudorandom generator theorem'''. ...ributions ''D_n'' is ''pseudorandom'' if for any polynomial size circuit ''C'', and any ''ε'' inversely polynomial in ''n'' ...

{{Confuse|Reciprocal formula (circuit networks)}} [[Category:Theorems in mathematical analysis]] ...

...he '''BEST theorem''' gives a product formula for the number of [[Eulerian circuit]]s in [[directed graph|directed]] (oriented) [[Graph (discrete mathematics) ...once. In 1736, [[Leonhard Euler|Euler]] showed that ''G'' has an Eulerian circuit if and only if ''G'' is [[connected graph|connected]] and the [[Directed gr ...

...if the [[Boolean satisfiability problem]] (SAT) can be solved by [[Boolean circuit]]s with a [[polynomial]] number of logic gates, then ...ss of nondeterministic polynomial time problems, can be contained in the [[Circuit complexity#Uniformity|non-uniform polynomial time]] complexity class [[P/po ...

{{Short description|Theorem in electrical circuit analysis}} ...ge sources and current sources, can be replaced by a Thévenin [[equivalent circuit]] consisting of an equivalent voltage source in series connection with an e ...

% Three theorems about union (proved using extensionality) % Three theorems about subset ...

...commonly known as voltage) in the [[lumped element model]] of [[electrical circuit]]s. They were [[Species description|first described]] in 1845 by German phy [[File:KCL - Kirchhoff's circuit laws.svg|thumb|The current entering any junction is equal to the current le ...

...quations were intensely studied as they can be used to model [[oscillating circuit]]s. Under certain additional assumptions '''Liénard's theorem''' guarantees [[Category:Theorems in dynamical systems]] ...

...ates, <math>m</math> input symbols and <math>p</math> output symbols. Nine theorems are proved about the structure of <math>S</math>, and experiments with <mat ...r directly following problem is the improvement of the bounds given at the theorems 8 and 9.</blockquote> ...

...capacitance. The [[negative impedance converter]] is an example of such a circuit. |[[File:Reactance LC.svg|thumb|150px|Plot of the reactance of a series ''LC'' circuit against frequency]] ...

...load), but the ''magnitude'' of the load power decreases (since the total circuit resistance increases).<ref name="harrison2013">{{Cite journal|last=Harrison [[File:Source and load circuit.svg|thumb|Simplified model for powering a load with resistance ''R<sub>L</s ...

...tion can be implemented directly in a [[switching circuit theory|switching circuit]] using a hierarchy of basic [[multiplexer]] by repeated application of thi [[Category:Theorems in lattice theory]] ...

...heory)|vertex]] exactly once. A '''Hamiltonian cycle''' (or '''Hamiltonian circuit''') is a [[cycle (graph theory)|cycle]] that visits each vertex exactly onc A ''Hamiltonian cycle'', ''Hamiltonian circuit'', ''vertex tour'' or ''graph cycle'' is a [[cycle (graph theory)|cycle]] t ...