Cube root can be done with a compass-and-straightedge construction. Newton's method is an iterative method that can be used to calculate the cube root. For real floating-point numbers this method reduces to the following iterative algorithm to produce successively better approximations of the cube root of "a": The method is simply averaging three factors chosen such that at each iteration. Halley's method improves upon this with an algorithm that converges more quickly with each step, albeit consuming more multiplication operations: With either method a poor initial approximation of "x" can give very poor algorithm performance, and coming up with a good initial
Cube only member of that group that is a zonohedron (every face has point symmetry). The cube can be cut into six identical square pyramids. If these square pyramids are then attached to the faces of a second cube, a rhombic dodecahedron is obtained (with pairs of coplanar triangles combined into rhombic faces). The analogue of a cube in four-dimensional Euclidean space has a special name—a tesseract or hypercube. More properly, a hypercube (or "n"-dimensional cube or simply "n"-cube) is the analogue of the cube in "n"-dimensional Euclidean space and a tesseract is the order-4 hypercube. A hypercube is also called