Search results
Results from the WOW.Com Content Network
The typical example of a branch cut is the complex logarithm. If a complex number is represented in polar form z = re iθ, then the logarithm of z is = +. However, there is an obvious ambiguity in defining the angle θ: adding to θ any integer multiple of 2 π will yield another possible angle.
A branch cut, usually along the negative real axis, can limit the imaginary part so it lies between −π and π. These are the chosen principal values. This is the principal branch of the log function. Often it is defined using a capital letter, Log z.
Branch and cut [1] is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are restricted to integer values. [2] Branch and cut involves running a branch and bound algorithm and using cutting planes to tighten
For example, the principal branch has a branch cut along the negative real axis. If the function L ( z ) {\displaystyle \operatorname {L} (z)} is extended to be defined at a point of the branch cut, it will necessarily be discontinuous there; at best it will be continuous "on one side", like Log z {\displaystyle \operatorname {Log} z ...
The branch cut in this example does not have to lie along the real axis; it does not even have to be a straight line. Any continuous curve connecting the origin z = 0 with the point at infinity would work. In some cases the branch cut doesn't even have to pass through the point at infinity. For example, consider the relationship
However, the important thing to note is that z 1/2 = e (Log z)/2, so z 1/2 has a branch cut. This affects our choice of the contour C. Normally the logarithm branch cut is defined as the negative real axis, however, this makes the calculation of the integral slightly more complicated, so we define it to be the positive real axis.
For complex arguments z with | z | ≥ 1 it can be analytically continued along any path in the complex plane that avoids the branch points 1 and infinity. In practice, most computer implementations of the hypergeometric function adopt a branch cut along the line z ≥ 1. As c → −m, where m is a non-negative integer, one has 2 F 1 (z) → ∞.
The branch point for the principal branch is at z = − 1 / e , with a branch cut that extends to −∞ along the negative real axis. This branch cut separates the principal branch from the two branches W −1 and W 1. In all branches W k with k ≠ 0, there is a branch point at z = 0 and a branch cut along the entire negative real axis.