Parallel (operator)

From testwiki
Revision as of 10:01, 9 February 2025 by imported>Witger (Coalescence of independent probability density functions.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Template:Short description Template:About Template:Bots Template:Use dmy dates Template:Use list-defined references

Graphical interpretation of the parallel operator with ab=c.

The parallel operator (pronounced "parallel",[1] following the parallel lines notation from geometry;[2][3] also known as reduced sum, parallel sum or parallel addition) is a binary operation which is used as a shorthand in electrical engineering,[4][5][6][nb 1] but is also used in kinetics, fluid mechanics and financial mathematics.[7][8] The name parallel comes from the use of the operator computing the combined resistance of resistors in parallel.

Overview

The parallel operator represents the reciprocal value of a sum of reciprocal values (sometimes also referred to as the "reciprocal formula" or "harmonic sum") and is defined by:[9][6][10][11]

ab:=11a+1b=aba+b,

where Template:Mvar, Template:Mvar, and ab are elements of the extended complex numbers ={}.[12][13]

The operator gives half of the harmonic mean of two numbers a and b.[7][8]

As a special case, for any number a:

aa=12/a=12a.

Further, for all distinct numbers Template:Nobr

|ab|>12min(|a|,|b|),

with |ab| representing the absolute value of ab, and min(x,y) meaning the minimum (least element) among Template:Mvar and Template:Mvar.

If a and b are distinct positive real numbers then 12min(a,b)<|ab|<min(a,b).

The concept has been extended from a scalar operation to matrices[14][15][16][17][18] and further generalized.[19]

Notation

The operator was originally introduced as reduced sum by Sundaram Seshu in 1956,[20][21][14] studied as operator  by Kent E. Erickson in 1959,[22][23][14] and popularized by Richard James Duffin and William Niles Anderson, Jr. as parallel addition or parallel sum operator : in mathematics and network theory since 1966.[15][16][1] While some authors continue to use this symbol up to the present,[7][8] for example, Sujit Kumar Mitra used as a symbol in 1970.[14] In applied electronics, a  sign became more common as the operator's symbol around 1974.[24][25][26][27][28][nb 1][nb 2] This was often written as doubled vertical line (||) available in most character sets (sometimes italicized as //[29][30]), but now can be represented using Unicode character U+2225 ( ∥ ) for "parallel to". In LaTeX and related markup languages, the macros \| and \parallel are often used (and rarely \smallparallel is used) to denote the operator's symbol.

Properties

Let ~ represent the extended complex plane excluding zero, ~:={}{0}, and φ the bijective function from to ~ such that φ(z)=1/z. One has identities

φ(zt)=φ(z)φ(t),

and

φ(z+t)=φ(z)φ(t)

This implies immediately that ~ is a field where the parallel operator takes the place of the addition, and that this field is isomorphic to .

The following properties may be obtained by translating through φ the corresponding properties of the complex numbers.

Field properties

As for any field, (~,,) satisfies a variety of basic identities.

It is commutative under parallel and multiplication:

ab=baab=ba

It is associative under parallel and multiplication:[12][7][8]

(ab)c=a(bc)=abc=11a+1b+1c=abcab+ac+bc,(ab)c=a(bc)=abc.

Both operations have an identity element; for parallel the identity is while for multiplication the identity is Template:Math:

a=a=11a+0=a,1a=a1=a.

Every element a of ~ has an inverse under parallel, equal to a, the additive inverse under addition. (But Template:Math has no inverse under parallel.)

a(a)=11a1a=.

The identity element is its own inverse, =.

Every element a of ~ has a multiplicative inverse Template:Nobr

a1a=1.

Multiplication is distributive over parallel:[1][7][8]

k(ab)=k1a+1b=11ka+1kb=kakb.

Repeated parallel

Repeated parallel is equivalent to division,

aaan times=11a+1a++1an times=an.

Or, multiplying both sides by Template:Mvar,

n(aaan times)=a.

Unlike for repeated addition, this does not commute:

abbaimpliesaaab timesbbba times.

Binomial expansion

Using the distributive property twice, the product of two parallel binomials can be expanded as

(ab)(cd)=a(cd)b(cd)=acadbcbd.

The square of a binomial is

(ab)2=a2abbab2=a212abb2.

The cube of a binomial is

(ab)3=a313a2b13ab2b3.

In general, the Template:Mvarth power of a binomial can be expanded using binomial coefficients which are the reciprocal of those under addition, resulting in an analog of the binomial formula:

(ab)n=an(n0)an1b(n1)ankbk(nk)bn(nn).

Logarithm and exponential

The following identities hold:

1log(ab)=1log(a)1log(b),
exp(1ab)=exp(1a)exp(1b)

Factoring parallel polynomials

As with a polynomial under addition, a parallel polynomial with coefficients ak in ~ (with Template:Nobr can be factored into a product of monomials:

a0xna1xn1an=a0(xr1)(xr2)(xrn)

for some roots rk (possibly repeated) in ~.

Analogous to polynomials under addition, the polynomial equation

(xr1)(xr2)(xrn)=

implies that x=rk for some Template:Mvar.

Quadratic formula

A linear equation can be easily solved via the parallel inverse:

axb=x=ba.

To solve a parallel quadratic equation, complete the square to obtain an analog of the quadratic formula

ax2bxc=x2bax=cax2bax4b2a2=(ca)4b2a2(x2ba)2=b214ac14a2x=(b)±b214ac12a.

Including zero

The extended complex numbers including zero, :=, is no longer a field under parallel and multiplication, because Template:Math has no inverse under parallel. (This is analogous to the way (,+,) is not a field because has no additive inverse.)

For every non-zero Template:Mvar,

a0=11a+10=0

The quantity 0(0)=00 can either be left undefined (see indeterminate form) or defined to equal Template:Math.

Precedence

In the absence of parentheses, the parallel operator is defined as taking precedence over addition or subtraction, similar to multiplication.[1][31][9][10]

Applications

There are applications of the parallel operator in electronics, optics, and study of periodicity:

Circuit analysis

In electrical engineering, the parallel operator can be used to calculate the total impedance of various serial and parallel electrical circuits.[nb 2] There is a duality between the usual (series) sum and the parallel sum.[7][8]

For instance, the total resistance of resistors connected in parallel is the reciprocal of the sum of the reciprocals of the individual resistors.

A diagram of several resistors, side by side, both leads of each connected to the same wires.
1Req=1R1+1R2++1RnReq=R1R2Rn.

Likewise for the total capacitance of serial capacitors.[nb 2]

Coalescence of independent probability density functions.

The coalesced density function fcoalesced(x) of n independent probability density functions f1(x), f2(x), …, fn(x), is equal to the reciprocal of the sum of the reciprocal densities.[32]

1fcoalesced(x)=1f1(x)+1f2(x)++1fn(x)

Lens equation

In geometric optics the thin lens approximation to the lens maker's equation.

f=ρvirtualρobject

Synodic period

The time between conjunctions of two orbiting bodies is called the synodic period. If the period of the slower body is T2, and the period of the faster is T1, then the synodic period is

Tsyn=T1(T2).

Examples

Question:

Three resistors R1=270kΩ, R2=180kΩ and R3=120kΩ are connected in parallel. What is their resulting resistance?

Answer:

R1R2R3=270kΩ180kΩ120kΩ=11270kΩ+1180kΩ+1120kΩ56.84kΩ
The effectively resulting resistance is ca. 57 kΩ.

Question:[7][8]

A construction worker raises a wall in 5 hours. Another worker would need 7 hours for the same work. How long does it take to build the wall if both workers work in parallel?

Answer:

t1t2=5h7h=115h+17h2.92h
They will finish in close to 3 hours.

Implementation

WP 34S with parallel operator () on the Template:Keypress key.

Suggested already by Kent E. Erickson as a subroutine in digital computers in 1959,[22] the parallel operator is implemented as a keyboard operator on the Reverse Polish Notation (RPN) scientific calculators WP 34S since 2008[33][34][35] as well as on the WP 34C[36] and WP 43S since 2015,[37][38] allowing to solve even cascaded problems with few keystrokes like Template:KeypressTemplate:KeypressTemplate:KeypressTemplate:KeypressTemplate:KeypressTemplate:Keypress.

Projective view

Given a field F there are two embeddings of F into the projective line P(F): z → [z : 1] and z → [1 : z]. These embeddings overlap except for [0:1] and [1:0]. The parallel operator relates the addition operation between the embeddings. In fact, the homographies on the projective line are represented by 2 x 2 matrices M(2,F), and the field operations (+ and ×) are extended to homographies. Each embedding has its addition a + b represented by the following matrix multiplications in M(2,A):

(10a1)(10b1)=(10a+b1),(1a01)(1b01)=(1a+b01).

The two matrix products show that there are two subgroups of M(2,F) isomorphic to (F,+), the additive group of F. Depending on which embedding is used, one operation is +, the other is .

Notes

Template:Reflist

References

Template:Reflist

Further reading

  1. 1.0 1.1 1.2 1.3 Cite error: Invalid <ref> tag; no text was provided for refs named Duffin_1971
  2. Cite error: Invalid <ref> tag; no text was provided for refs named Kersey_1673
  3. Cite error: Invalid <ref> tag; no text was provided for refs named Cajori_1928
  4. Cite error: Invalid <ref> tag; no text was provided for refs named TI_2004
  5. Cite error: Invalid <ref> tag; no text was provided for refs named Bober_2016
  6. 6.0 6.1 Cite error: Invalid <ref> tag; no text was provided for refs named EECS_2018
  7. 7.0 7.1 7.2 7.3 7.4 7.5 7.6 Cite error: Invalid <ref> tag; no text was provided for refs named Ellerman_1995
  8. 8.0 8.1 8.2 8.3 8.4 8.5 8.6 Cite error: Invalid <ref> tag; no text was provided for refs named Ellerman_2004
  9. 9.0 9.1 Cite error: Invalid <ref> tag; no text was provided for refs named Basso_2016
  10. 10.0 10.1 Cite error: Invalid <ref> tag; no text was provided for refs named ECE_2019
  11. Cite error: Invalid <ref> tag; no text was provided for refs named Boecker_2019
  12. 12.0 12.1 Cite error: Invalid <ref> tag; no text was provided for refs named Georg_1999
  13. Template:Wikibooks-inline
  14. 14.0 14.1 14.2 14.3 Cite error: Invalid <ref> tag; no text was provided for refs named Mitra_1970
  15. 15.0 15.1 Cite error: Invalid <ref> tag; no text was provided for refs named Duffin_1966
  16. 16.0 16.1 Cite error: Invalid <ref> tag; no text was provided for refs named Anderson-Duffin_1969
  17. Cite error: Invalid <ref> tag; no text was provided for refs named Mitra-Puri_1973
  18. Cite error: Invalid <ref> tag; no text was provided for refs named Mitra-Bhimasankaram-Malik_2010
  19. Cite error: Invalid <ref> tag; no text was provided for refs named Eriksson-Bique-Leutwiler_1989
  20. Cite error: Invalid <ref> tag; no text was provided for refs named Seshu_1956
  21. Cite error: Invalid <ref> tag; no text was provided for refs named Seshu_1957
  22. 22.0 22.1 Cite error: Invalid <ref> tag; no text was provided for refs named Erickson_1959
  23. Cite error: Invalid <ref> tag; no text was provided for refs named Kaufman_1963
  24. Cite error: Invalid <ref> tag; no text was provided for refs named Senturia-Wedlock_1974
  25. Cite error: Invalid <ref> tag; no text was provided for refs named Wolf_1977
  26. Cite error: Invalid <ref> tag; no text was provided for refs named MIT_1978
  27. Cite error: Invalid <ref> tag; no text was provided for refs named Wedlock_1978
  28. Cite error: Invalid <ref> tag; no text was provided for refs named McWane_1981
  29. Cite error: Invalid <ref> tag; no text was provided for refs named TI_2015
  30. Cite error: Invalid <ref> tag; no text was provided for refs named ST_2020
  31. Cite error: Invalid <ref> tag; no text was provided for refs named Paul_2014
  32. Van Droogenbroeck, Frans J., 'Coalescence, unlocking insights in the intricacies of merging independent probability density functions' (2025).
  33. Cite error: Invalid <ref> tag; no text was provided for refs named Bonin_2012
  34. Cite error: Invalid <ref> tag; no text was provided for refs named Bonin_2015
  35. Cite error: Invalid <ref> tag; no text was provided for refs named Bonin_2016
  36. Cite error: Invalid <ref> tag; no text was provided for refs named Dowrick_2015
  37. Cite error: Invalid <ref> tag; no text was provided for refs named Bonin_2019_OG
  38. Cite error: Invalid <ref> tag; no text was provided for refs named Bonin_2019_RG


Cite error: <ref> tags exist for a group named "nb", but no corresponding <references group="nb"/> tag was found