It uses recursive multilevel bisection and includes sequential as well as parallel partitioning techniques. The idea to combine the bisection method with the secant method goes back to . The simplest root-finding algorithm is the bisection method. Examples include Newton's method, the bisection method, and Jacobi iteration. The Cheeger bound guarantees that spectral bisection provides partitions with nearly optimal conductance. The thermal component (formula 67) is computed using a bisection algorithm from the following equation. The method of bisection avoids this hypothetical convergence problem. The fat tree topology offers 1&colon;1 oversubscription ratio and full bisection bandwidth. The above proofs of the reflective and tangent bisection properties use a line of calculus. The examples in Figures 1,2 illustrate the spectral bisection approach. For a linear array with n nodes bisection bandwidth is one link bandwidth. Dekker's method requires far more iterations than the bisection method in this case. Uvula piercings may migrate leading to bisection of the uvula, which is harmless. A representative example is interval bisection. However, its rate of convergence can drop below that of the bisection method.