Nelder-Mead algorithm optimization and Galerkin’s method thermal performance analysis of circular porous fins with various profiles in fully wet conditions

Authors

Abstract:

The main objective of this research is to analyze optimization and the thermal performance of circular porous fins with four different profiles, rectangular, convex, triangular and concave under fully wet conditions. In this research, a linear model was used for the relationship between humidity and temperature. Also, modeling is assumed one-dimensional and the temperature changes only in the direction of the radius of the fin. Moreover, the thermal conductivity and heat transfer coefficient are a function of porosity and temperature, respectively. The governing equations are solved using the Galerkin method and the finite difference method and the use of the Gauss-Seidel algorithm. In this study, the effect of different parameters including relative humidity, Darcy number and Rayleigh number and porosity on temperature distribution, fin efficiency, and fin effectiveness was investigated. The results showed that the efficiency, effectiveness, and heat transfer rate to the base for the rectangular profile is higher than other profiles. In this research, the Nelder-Mead algorithm is used for optimization. The results showed that to maintain optimal conditions, the ratio of thickness to fin length should be increased by increasing relative humidity or decreasing the Darcy number, Rayleigh number and porosity.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

Globalized Nelder-Mead Method for Engineering Optimization

One of the fundamental difficulties in engineering design is the multiplicity of local solutions. This has triggered great efforts to develop global search algorithms. Globality, however, often has a prohibitively high numerical cost for real problems. A fixed cost local search, which sequentially becomes global is developed. Globalization is achieved by probabilistic restart. A spacial probabi...

full text

Grid Restrained Nelder-Mead Algorithm

Probably the most popular algorithm for unconstrained minimization for problems of moderate dimension is the Nelder-Mead algorithm published in 1965. Despite its age only limited convergence results exist. Several counterexamples can be found in the literature for which the algorithm performs badly or even fails. A convergent variant derived from the original Nelder-Mead algorithm is presented....

full text

Geometric Generalization of the Nelder-Mead Algorithm

The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Evolution (DE). Geometric Particle Swarm Optimization (GPSO) and Geometric Differential Evolution (GDE) are recently introduced formal generalization of traditional PSO and DE that apply naturally to both continuous and...

full text

Nelder, Mead, and the Other Simplex Method

In the mid-1960s, two English statisticians working at the National Vegetable Research Station invented the Nelder–Mead “simplex” direct search method. The method emerged at a propitious time, when there was great and growing interest in computer solution of complex nonlinear real-world optimization problems. Because obtaining first derivatives of the function f to be optimized was frequently i...

full text

Performance Analysis of Nelder - Mead and A Hybrid Simulated Annealing for Multiple Response Quality Characteristic Optimization

In many real world industrial situations, quality of a product is considered to be a composite of a family of properties or multiple responses, which can often be interacting or correlated with one another, and nearly always measured in a variety of units. Optimal combination of properties rarely results from individual optimal condition of each response, and there is always a trade off between...

full text

Implementing the Nelder-Mead simplex algorithm with adaptive parameters

In this paper, we first prove that the expansion and contraction steps of the Nelder-Mead simplex algorithm possess a descent property when the objective function is uniformly convex. This property provides some new insights on why the standard Nelder-Mead algorithm becomes inefficient in high dimensions. We then propose an implementation of the Nelder-Mead method in which the expansion, contra...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 16  issue 3

pages  37- 57

publication date 2019-09-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023