Thrust bearingA thrust bearing is a particular type of rotary bearing. Like other bearings they permanently rotate between parts, but they are designed to support a predominantly axial load. Thrust bearings come in several varieties. Thrust ball bearings, composed of bearing balls supported in a ring, can be used in low thrust applications where there is little axial load. Cylindrical thrust roller bearings consist of small cylindrical rollers arranged flat with their axes pointing to the axis of the bearing.
Fluid bearingFluid bearings are bearings in which the load is supported by a thin layer of rapidly moving pressurized liquid or gas between the bearing surfaces. Since there is no contact between the moving parts, there is no sliding friction, allowing fluid bearings to have lower friction, wear and vibration than many other types of bearings. Thus, it is possible for some fluid bearings to have near-zero wear if operated correctly. They can be broadly classified into two types: fluid dynamic bearings (also known as hydrodynamic bearings) and hydrostatic bearings.
Bearing (mechanical)A bearing is a machine element that constrains relative motion to only the desired motion and reduces friction between moving parts. The design of the bearing may, for example, provide for free linear movement of the moving part or for free rotation around a fixed axis; or, it may prevent a motion by controlling the vectors of normal forces that bear on the moving parts. Most bearings facilitate the desired motion by minimizing friction.
Rolling-element bearingIn mechanical engineering, a rolling-element bearing, also known as a rolling bearing, is a bearing which carries a load by placing rolling elements (such as balls or rollers) between two concentric, grooved rings called races. The relative motion of the races causes the rolling elements to roll with very little rolling resistance and with little sliding. One of the earliest and best-known rolling-element bearings are sets of logs laid on the ground with a large stone block on top.
Plain bearingA plain bearing, or more commonly sliding contact bearing and slide bearing (in railroading sometimes called a solid bearing, journal bearing, or friction bearing), is the simplest type of bearing, comprising just a bearing surface and no rolling elements. Therefore, the journal (i.e., the part of the shaft in contact with the bearing) slides over the bearing surface. The simplest example of a plain bearing is a shaft rotating in a hole. A simple linear bearing can be a pair of flat surfaces designed to allow motion; e.
Nonlinear systemIn mathematics and science, a nonlinear system (or a non-linear system) is a system in which the change of the output is not proportional to the change of the input. Nonlinear problems are of interest to engineers, biologists, physicists, mathematicians, and many other scientists since most systems are inherently nonlinear in nature. Nonlinear dynamical systems, describing changes in variables over time, may appear chaotic, unpredictable, or counterintuitive, contrasting with much simpler linear systems.
Babbitt (alloy)Babbitt metal or bearing metal is any of several alloys used for the bearing surface in a plain bearing. The original Babbitt alloy was invented in 1839 by Isaac Babbitt in Taunton, Massachusetts, United States. He disclosed one of his alloy recipes but kept others as trade secrets. Other formulations were developed later. Like other terms whose eponymous origin is long since deemphasized (such as diesel engine or eustachian tube), the term babbitt metal is frequently styled in lowercase.
ComputationA computation is any type of arithmetic or non-arithmetic calculation that is well-defined. Common examples of computations are mathematical equations and computer algorithms. Mechanical or electronic devices (or, historically, people) that perform computations are known as computers. The study of computation is the field of computability, itself a sub-field of computer science. The notion that mathematical statements should be ‘well-defined’ had been argued by mathematicians since at least the 1600s, but agreement on a suitable definition proved elusive.
Computational complexityIn computer science, the computational complexity or simply complexity of an algorithm is the amount of resources required to run it. Particular focus is given to computation time (generally measured by the number of needed elementary operations) and memory storage requirements. The complexity of a problem is the complexity of the best algorithms that allow solving the problem. The study of the complexity of explicitly given algorithms is called analysis of algorithms, while the study of the complexity of problems is called computational complexity theory.
Theory of computationIn theoretical computer science and mathematics, the theory of computation is the branch that deals with what problems can be solved on a model of computation, using an algorithm, how efficiently they can be solved or to what degree (e.g., approximate solutions versus precise ones). The field is divided into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question: "What are the fundamental capabilities and limitations of computers?".