Strassen algorithmIn linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix multiplication algorithm for large matrices, with a better asymptotic complexity, although the naive algorithm is often better for smaller matrices. The Strassen algorithm is slower than the fastest known algorithms for extremely large matrices, but such galactic algorithms are not useful in practice, as they are much slower for matrices of practical size.
Matrix multiplication algorithmBecause matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such as counting the paths through a graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where the computational work is spread over multiple processors (perhaps over a network).
I-beamI-beam is a generic lay term for a variety of structural members with an or -shaped cross-section. Technical terms for similar items include H-beam (for universal column, UC), w-beam (for "wide flange"), universal beam (UB), rolled steel joist (RSJ), or double-T (especially in Polish, Bulgarian, Spanish, Italian and German). I-beams are typically made of structural steel and serve a wide variety of construction uses. The horizontal elements of the are called flanges, and the vertical element is known as the "web".
Binary starA binary star or binary star system is a system of two stars that are gravitationally bound to and in orbit around each other. Binary stars in the night sky that are seen as a single object to the naked eye are often resolved using a telescope as separate stars, in which case they are called visual binaries. Many visual binaries have long orbital periods of several centuries or millennia and therefore have orbits which are uncertain or poorly known.
Binary treeIn computer science, a binary tree is a k-ary tree data structure in which each node has at most two children, which are referred to as the and the . A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root. Some authors allow the binary tree to be the empty set as well. From a graph theory perspective, binary (and K-ary) trees as defined here are arborescences.
X-ray binaryX-ray binaries are a class of binary stars that are luminous in X-rays. The X-rays are produced by matter falling from one component, called the donor (usually a relatively normal star), to the other component, called the accretor, which is either a neutron star or black hole. The infalling matter releases gravitational potential energy, up to 30 percent of its rest mass, as X-rays. (Hydrogen fusion releases only about 0.7 percent of rest mass.
T-beamA T-beam (or tee beam), used in construction, is a load-bearing structure of reinforced concrete, wood or metal, with a -shaped cross section. The top of the -shaped cross section serves as a flange or compression member in resisting compressive stresses. The web (vertical section) of the beam below the compression flange serves to resist shear stress. When used for highway bridges the beam incorporates reinforcing bars in the bottom of the beam to resist the tensile stresses which occur during bending.
