Search results
Jump to navigation
Jump to search
- {{Short description|Mathematical circuit analysis technique}} ...ar-mesh transform''', or '''star-polygon transform''', is a mathematical [[circuit analysis]] technique to transform a [[network analysis (electrical circuits ...3 KB (339 words) - 22:10, 25 February 2025
- .../ref> These are two of the fundamental [[electrical element|elements]] in circuit theory. Real electrical generators are most commonly modelled as a non-ide ...unction of [[two-port network]]s; one generator is needed for each [[port (circuit theory)|port]], and it is dependent on either voltage or current at the oth ...4 KB (654 words) - 20:33, 9 January 2024
- ...Randomized algorithm|probabilistic]] [[polynomial-time]] algorithms into [[Circuit complexity|non-uniform polynomial-size circuits]]. ...some function. The averaging argument is the following claim: if we have a circuit <math>C</math> such that <math>C(x, y) = f(x)</math> with probability at le ...4 KB (641 words) - 00:21, 17 October 2022
- {{Short description|Property of a circuit}} ...points. The reciprocity theorem states that the current at one point in a circuit due to a voltage at a second point is the same as the current at the second ...9 KB (1,395 words) - 05:03, 27 December 2024
- {{short description|Point of entry and exit of electrical energy to/from a circuit}} ...ition.svg|thumb|Network {{mvar|N}} has a port connecting it to an external circuit. The port meets the port condition because the current {{mvar|I}} entering ...13 KB (1,985 words) - 16:17, 31 August 2023
- {{Short description|Circuit component performing mathematical integration}} ...tional amplifier integrator''' is an [[Integrator|electronic integration]] circuit. Based on the [[operational amplifier]] (op-amp), it performs the mathemati ...11 KB (1,739 words) - 19:30, 15 August 2024
- ...connected in parallel. The two versions are based on the two [[Kirchhoff's circuit laws]]. .../NTOnLine/T08_THEOREMS/p06MiscTheorems.htm#G7 |title=Miscellaneous network theorems |publisher=Netlecturer.com |accessdate=2013-02-03 |url-status=dead |archive ...24 KB (3,550 words) - 00:52, 13 November 2023
- ...nductor. By a suitable choice for the value of <math>k</math>, a resonant circuit can be extracted from <math>R(s)</math> leaving a function <math>Z'(s)</mat * Wing, Omar, ''Classical Circuit Theory'', Springer, 2008 {{ISBN|0387097406}}. ...7 KB (1,157 words) - 15:25, 25 August 2023
- [[Category:Circuit theorems]] ...2 KB (317 words) - 19:42, 16 September 2019
- ...circuit]] consisting entirely of passive components is called a '''passive circuit''', and has the same properties as a passive component. ...nd other dissipative and energy-neutral components are considered passive. Circuit designers will sometimes refer to this class of components as dissipative, ...15 KB (2,287 words) - 17:24, 30 December 2024
- In [[extremal graph theory]], the '''even circuit theorem''' is a result of [[Paul Erdős]] according to which an {{mvar|n}}-v ...arankiewicz problem]] on forbidden complete bipartite graphs, and the even circuit theorem for this case can be seen as a special case of the Kővári–Sós–Turán ...6 KB (865 words) - 10:39, 23 January 2025
- ...re too small to easily implement as discrete components. C. The prototype circuit transformed to open-wire commensurate lines by Richards' transformation. D ...mped element]] circuits can be directly converted to [[distributed-element circuit]]s of this form by the use of '''Richards' transformation'''. This transfo ...20 KB (2,942 words) - 21:19, 16 April 2024
- ...g, I. M. Ross, Q. Gong, Pseudospectral optimal control and its convergence theorems, Analysis and Design of Nonlinear Control Systems, Springer, pp.109–124, 20 ...\lambda}</math> to Problem <math> B^{\lambda N}</math> thus completing the circuit. ...4 KB (566 words) - 17:35, 26 August 2023
- ...nimum cut are not necessarily equal. Instead, approximate max-flow min-cut theorems provide bounds on how close the maximum flow can get to the minimum cut, wi The theorems have enabled the development of [[approximation algorithm]]s for use in [[g ...16 KB (2,406 words) - 20:49, 12 February 2025
- ...r, in a simple graph:<ref>{{Cite book|last=Lovász|first=L.|chapter=Minimax theorems for hypergraphs |date=1974|editor-last=Berge|editor-first=Claude|editor2-la * [[Hall-type theorems for hypergraphs]] - presents sufficient conditions analogous to Hall's marr ...20 KB (3,012 words) - 02:16, 19 February 2025
- ...-element model]] and consequently [[calculus]] must be used to analyse the circuit. The analysis yields a system of two first order, simultaneous linear [[pa ==Circuit representation== ...21 KB (3,154 words) - 19:56, 15 November 2024
- ...hreshold theorem for quantum computation{{r|MikeNIke|p=481}}:''' A quantum circuit on ''n'' qubits and containing ''p(n)'' gates may be simulated with probabi ...the desired failure probability, which can be used for the desired quantum circuit. According to quantum information theorist [[Scott Aaronson]]:<blockquote>" ...9 KB (1,248 words) - 22:27, 4 May 2024
- A '''cycle''' (or a '''circuit''') in a hypergraph is a cyclic alternating sequence of distinct vertices a ...Berge|first1=Claude|last2=Vergnas|first2=Michel LAS|date=1970|title=Sur Un Theorems Du Type König Pour Hypergraphes|journal=Annals of the New York Academy of S ...10 KB (1,517 words) - 02:06, 19 February 2025
- ...are formed by faces of the cuboid (omitting two opposite faces). The fifth circuit connects two opposite edges of the cuboid, each of which is shared by two o ...two elements for each vertex of the [[diamond graph]], and a four-element circuit for each edge of the diamond graph. ...8 KB (1,148 words) - 01:12, 9 November 2024
- ...the surface. The path would not return to the same z-coordinate after one circuit. Contradiction. [[Category:Eponymous theorems of physics]] ...5 KB (754 words) - 04:40, 6 May 2024