图书馆订阅: Guest
Begell Digital Portal Begell 数字图书馆 电子图书 期刊 参考文献及会议录 研究收集
国际多尺度计算工程期刊
影响因子: 1.016 5年影响因子: 1.194 SJR: 0.554 SNIP: 0.68 CiteScore™: 1.18

ISSN 打印: 1543-1649
ISSN 在线: 1940-4352

国际多尺度计算工程期刊

DOI: 10.1615/IntJMultCompEng.v6.i2.60
pages 179-190

A Tailored Strategy for PDE-Based Design of Hierarchically Structured Porous Catalysts

Gang Wang
Rensselaer Polytechnic Institute, Howard P. Isermann Department of Chemical and Biological Engineering
Marc-Olivier Coppens
Rensselaer Polytechnic Institute
Chris R. Kleijn
Section of Transport Phenomena, Department of Chemical Engineering, Faculty of Applied Sciences Delft University of Technology and J. M. Burgerscentre for Fluid Dynamics Julianalaan, 2628 BL Delft

ABSTRACT

Optimization problems involving the solution of partial differential equations (PDE) are often encountered in the context of optimal design, optimal control, and parameter estimation. Based on the reduced-gradient method, a general strategy is proposed to solve these problems by reusing existing software. As an illustration, this strategy was employed to solve a PDE-based optimization problem that arises from the optimal design of the network of pore channels in hierarchically structured porous catalysts. A Fortran implementation was developed by combining a gradient-based optimization package, NLPQL, a multigrid solver, MGD9V, and a limited amount of in-house coding. The value and gradient of the objective function are computed by solving the discretized PDE and another system of linear equations using MGD9V. These are subsequently fed into NLPQL to solve the optimization problem. The PDE was discretized in terms of a finite volume method on a matrix of computational cells. The number of the cells ranged from 129 × 129 to 513 × 513, and the number of the optimization variables ranged from 41 to 201. Numerical tests were carried out on a Dell laptop with a 2.16-GHz Intel Core2 Duo processor. The results show that the optimization typically converges in a limited number (i.e., 9−48) of iterations. The CPU time is from 2.52 to 211.52 s. The PDE was solved 36−201 times in each of the numerical tests. This study calls for the use of our strategy to solve PDE-based optimization problems.