954 resultados para Aerodynamic loads
Resumo:
Plakhov, A.Y.; Torres, D., (2005) 'Newton's aerodynamic problem in media of chaotically moving particles', Sbornik: Mathematics 196(6) pp.885-933 RAE2008
Resumo:
For the numerical solution of the linearized Euler equations, an optimized computational scheme is considered. It is based on fully staggered (in space and time) regular meshes and on a simple mirroring procedure at the stepwise solid walls. There is no need to define ghost points into the solid ohjects that reflect the sound waves. Test results demonstrate the accuracy of the method that may be used for aeroacoustic problems with complex geometries.
Resumo:
Comprehensive, aggregate nutrient budgets were established for two compartments of the North Sea, the shallow coastal and deeper open regions, and for three different periods, representing pre-eutrophication (∼1950), eutrophication (∼1990) and contemporary (∼2000) phases. The aim was to quantify the major budget components, to identify their sources of variability, to specify the anthropogenic components, and to draw implications for past and future policy. For all three periods, open North Sea budgets were dominated (75%) by fluxes from and to the North-East Atlantic; sediment exchange was of secondary importance (18%). For the coastal North Sea, fluxes during the eutrophication period were dominated by sediment exchange (49% of all inputs), followed by exchange with the open sea (21%), and anthropogenic inputs (19%). Between 1950 and 1990, N-loading of coastal waters increased by a factor of 1.62 and P-loading by 1.45. These loads declined after 1990. Interannual variability in Atlantic inflow was found to correspond to a variability of 11% in nutrient load to the open North Sea. Area-specific external loads of both the open and coastal North Sea were below Vollenweider-type critical loads when expressed relative to depth and flushing. External area-specific load of the coastal North Sea has declined since 1990 from 1.8 to about 1.4 g P m−2 y−1 in 2000, which is close to the estimate of 1.3 for 1950. N-load declined less, leading to an increase in N/P ratio.
Resumo:
This paper presents a new method for complex power flow tracing that can be used for allocating the transmission loss to loads or generators. Two algorithms for upstream tracing (UST) and downstream tracing (DST) of the complex power are introduced. UST algorithm traces the complex power extracted by loads back to source nodes and assigns a fraction of the complex power flow through each line to each load. DST algorithm traces the output of the generators down to the sink nodes determining the contributions of each generator to the complex power flow and losses through each line. While doing so, active- and reactive-power flows as well as complex losses are considered simultaneously, not separately as most of the available methods do. Transmission losses are taken into consideration during power flow tracing. Unbundling line losses are carried out using an equation, which has a physical basis, and considers the coupling between active- and reactive-power flows as well as the cross effects of active and reactive powers on active and reactive losses. The tracing algorithms introduced can be considered direct to a good extent, as there is no need for exhaustive search to determine the flow paths as these are determined in a systematic way during the course of tracing. Results of application of the proposed method are also presented.
Resumo:
This paper presents a new method for calculating the individual generators’ shares in line flows, line losses and loads. The method is described and illustrated on active power flows, but it can be applied in the same way to reactive power flows. Starting from a power flow solution, the line flow matrix is formed. This matrix is used for identifying node types, tracing the power flow from generators downstream to loads, and to determine generators’ participation factors to lines and loads. Neither exhaustive search nor matrix inversion is required. Hence, the method is claimed to be the least computationally demanding amongst all of the similar methods.