parametrization method
Recently Published Documents


TOTAL DOCUMENTS

50
(FIVE YEARS 7)

H-INDEX

8
(FIVE YEARS 0)

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Shuyi Zhang ◽  
Bo Yang

Abstract In this paper, an improved aerodynamic performance optimization method for 3-D low Reynolds number (Re) rotor blade is proposed. A conventional optimization procedure of blade is usually divided into three parts, such as the parameterization method, the fitness value evaluation and the optimization algorithm. This work is mainly focused on the first two parts. The parametrization method, Camber-FFD, is presented based on the camber parametrization method and the free-form deformation algorithm (FFD). The shape of 3-D blade is parameterized by the incidence angles and the coordinates of the maximum camber points. The fitness value evaluation has been realized with the help of an adaptive topological back propagation multi-layer forward artificial neural network (BP-MLFANN). During the training of BP-MLFANN, the hybrid particle swarm optimization method combined with the modified very fast simulate annealing algorithm (HPSO-MVFSA) is adopted to determine the neural network topology adaptively. To verify the effectiveness of this aerodynamic optimization method, the aerodynamic performance of a 3-D low-Re blade, such as Blade D900, is optimized, and the results are compared and analyzed based on the experiments and simulations. It is proved that this aerodynamic optimization method is feasible.


2021 ◽  
Vol 168 ◽  
pp. 764-778
Author(s):  
Chenxi Li ◽  
Yongheng Yang ◽  
Sergiu Spataru ◽  
Kanjian Zhang ◽  
Haikun Wei

2021 ◽  
pp. 102987
Author(s):  
Roberto Agromayor ◽  
Nitish Anand ◽  
Jens-Dominik Müller ◽  
Matteo Pini ◽  
Lars O. Nord

2018 ◽  
Vol 8 (4) ◽  
pp. 46
Author(s):  
Diego F. G. Coelho ◽  
Renato J. Cintra ◽  
Fábio M. Bayer ◽  
Sunera Kulasekera ◽  
Arjuna Madanayake ◽  
...  

This paper introduced a matrix parametrization method based on the Loeffler discrete cosine transform (DCT) algorithm. As a result, a new class of 8-point DCT approximations was proposed, capable of unifying the mathematical formalism of several 8-point DCT approximations archived in the literature. Pareto-efficient DCT approximations are obtained through multicriteria optimization, where computational complexity, proximity, and coding performance are considered. Efficient approximations and their scaled 16- and 32-point versions are embedded into image and video encoders, including a JPEG-like codec and H.264/AVC and H.265/HEVC standards. Results are compared to the unmodified standard codecs. Efficient approximations are mapped and implemented on a Xilinx VLX240T FPGA and evaluated for area, speed, and power consumption.


Sign in / Sign up

Export Citation Format

Share Document