Please use this identifier to cite or link to this item:
|Title:||Computationally-efficient hybrid strategy for mechanistic modeling of fuel cell stacks|
|Keywords:||Fuel cell stacks|
|Citation:||Sharma, A.K., Birgersson, E., Khor, S.H. (2014). Computationally-efficient hybrid strategy for mechanistic modeling of fuel cell stacks. Journal of Power Sources 247 : 481-488. ScholarBank@NUS Repository. https://doi.org/10.1016/j.jpowsour.2013.08.094|
|Abstract:||In general, detailed mechanistic models for fuel cell stacks that seek to capture the local transport phenomena are computationally expensive. In this context, we propose a hybrid modeling strategy, in which the steady-state conservation equations are solved iteratively in two separate groups: The first comprises asymptotically-reduced governing equations for momentum, mass, and species, which are solved as a transient-like propagation problem; the second comprises the full set of equations for energy and charge, which are solved as an elliptic stationary problem. Physically, the segregation is justified by the nature of the dependent variables; in essence, the first group covers local variables on the cell level and the second involves global variables on the stack level. We demonstrate the methodology for a steady-state detailed mechanistic model of a proton exchange membrane fuel cell stack comprising 2 to 350 cells subjected to non-uniform operating conditions across the cells; e.g., a stack comprising 350 cells takes less than an hour to solve. The proposed methodology is generic and can also be employed for other systems where transport phenomena occur on different length scales and involve some form of slenderness. © 2013 Elsevier B.V. All rights reserved.|
|Source Title:||Journal of Power Sources|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jul 9, 2018
WEB OF SCIENCETM
checked on Jun 20, 2018
checked on Jun 29, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.