Betz's lawIn aerodynamics, Betz's law indicates the maximum power that can be extracted from the wind, independent of the design of a wind turbine in open flow. It was published in 1919 by the German physicist Albert Betz. The law is derived from the principles of conservation of mass and momentum of the air stream flowing through an idealized "actuator disk" that extracts energy from the wind stream. According to Betz's law, no turbine can capture more than 16/27 (59.3%) of the kinetic energy in wind. The factor 16/27 (0.
Francis turbineThe Francis turbine is a type of water turbine. It is an inward-flow reaction turbine that combines radial and axial flow concepts. Francis turbines are the most common water turbine in use today, and can achieve over 95% efficiency. The process of arriving at the modern Francis runner design took from 1848 to approximately 1920. It became known as the Francis turbine around 1920, being named after British-American engineer James B. Francis who in 1848 created a new turbine design.
Mathematical optimizationMathematical optimization (alternatively spelled optimisation) or mathematical programming is the selection of a best element, with regard to some criterion, from some set of available alternatives. It is generally divided into two subfields: discrete optimization and continuous optimization. Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
Combinatorial optimizationCombinatorial optimization is a subfield of mathematical optimization that consists of finding an optimal object from a finite set of objects, where the set of feasible solutions is discrete or can be reduced to a discrete set. Typical combinatorial optimization problems are the travelling salesman problem ("TSP"), the minimum spanning tree problem ("MST"), and the knapsack problem. In many such problems, such as the ones previously mentioned, exhaustive search is not tractable, and so specialized algorithms that quickly rule out large parts of the search space or approximation algorithms must be resorted to instead.
PropfanA propfan, also called an open rotor engine, or unducted fan (as opposed to a ducted fan), is a type of aircraft engine related in concept to both the turboprop and turbofan, but distinct from both. The design is intended to offer the speed and performance of a turbofan, with the fuel economy of a turboprop. A propfan is typically designed with a large number of short, highly twisted blades, similar to the (ducted) fan in a turbofan engine. For this reason, the propfan has been variously described as an "unducted fan" (UDF) or an "ultra-high-bypass (UHB) turbofan".
Small wind turbineSmall wind turbines, also known as micro wind turbines, generate electricity for small-scale use. These turbines are typically smaller than those found in wind farms. Small wind turbines often have passive yaw systems as opposed to active ones. They use a direct drive generator and use a tail fin to point into the wind, whereas larger turbines have geared powertrains that are actively pointed into the wind. They usually produce between 500 W and 10 kW, with some as small as 50 W.
Program optimizationIn computer science, program optimization, code optimization, or software optimization, is the process of modifying a software system to make some aspect of it work more efficiently or use fewer resources. In general, a computer program may be optimized so that it executes more rapidly, or to make it capable of operating with less memory storage or other resources, or draw less power. Although the word "optimization" shares the same root as "optimal", it is rare for the process of optimization to produce a truly optimal system.
Convex optimizationConvex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets (or, equivalently, maximizing concave functions over convex sets). Many classes of convex optimization problems admit polynomial-time algorithms, whereas mathematical optimization is in general NP-hard.
Optimizing compilerIn computing, an optimizing compiler is a compiler that tries to minimize or maximize some attributes of an executable computer program. Common requirements are to minimize a program's execution time, memory footprint, storage size, and power consumption (the last three being popular for portable computers). Compiler optimization is generally implemented using a sequence of optimizing transformations, algorithms which take a program and transform it to produce a semantically equivalent output program that uses fewer resources or executes faster.
