CADET-Julia: Efficient and versatile, open-source simulator for batch chromatography in Julia

IF 3.9 2区 工程技术 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS
Jesper Frandsen , Jan Michael Breuer , Johannes Schmölder , Jakob Kjøbsted Huusom , Krist V. Gernaey , Jens Abildskov , Eric von Lieres
{"title":"CADET-Julia: Efficient and versatile, open-source simulator for batch chromatography in Julia","authors":"Jesper Frandsen ,&nbsp;Jan Michael Breuer ,&nbsp;Johannes Schmölder ,&nbsp;Jakob Kjøbsted Huusom ,&nbsp;Krist V. Gernaey ,&nbsp;Jens Abildskov ,&nbsp;Eric von Lieres","doi":"10.1016/j.compchemeng.2024.108913","DOIUrl":null,"url":null,"abstract":"<div><div>This study introduces CADET-Julia, an open-source, versatile and fast chromatography solver implemented in the Julia programming language. The software offers a platform for rapid prototyping and numerical refinement for a range of chromatography models, including the general rate model (GRM). The interstitial column mass balance was spatially discretized using a strong-form discontinuous Galerkin spectral element method (DGSEM) whereas a generalized spatial Galerkin spectral method (GSM) was applied for the particle mass balance. Three different benchmarks showcased the computational efficiency of CADET-Julia: A baseline benchmark was established by comparing the Julia implementation to a C++ implementation that employed the same mathematical methods and time integrator (CADET-DG). Various Julia time integrators were tested, and with the best-performing settings, the Julia implementation was benchmarked against CADET-DG and a finite volume (FV) based implementation in C++ (CADET-FV). Overall, Julia implementations performed better than C++ implementations and Galerkin methods were generally superior to finite volumes.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"192 ","pages":"Article 108913"},"PeriodicalIF":3.9000,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & Chemical Engineering","FirstCategoryId":"5","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0098135424003314","RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This study introduces CADET-Julia, an open-source, versatile and fast chromatography solver implemented in the Julia programming language. The software offers a platform for rapid prototyping and numerical refinement for a range of chromatography models, including the general rate model (GRM). The interstitial column mass balance was spatially discretized using a strong-form discontinuous Galerkin spectral element method (DGSEM) whereas a generalized spatial Galerkin spectral method (GSM) was applied for the particle mass balance. Three different benchmarks showcased the computational efficiency of CADET-Julia: A baseline benchmark was established by comparing the Julia implementation to a C++ implementation that employed the same mathematical methods and time integrator (CADET-DG). Various Julia time integrators were tested, and with the best-performing settings, the Julia implementation was benchmarked against CADET-DG and a finite volume (FV) based implementation in C++ (CADET-FV). Overall, Julia implementations performed better than C++ implementations and Galerkin methods were generally superior to finite volumes.
CADET-Julia:高效、通用、开源的 Julia 批次色谱模拟器
本研究介绍了 CADET-Julia,这是一款开源、多功能、快速的色谱求解器,采用 Julia 编程语言实现。该软件为一系列色谱模型(包括通用速率模型 (GRM))的快速原型设计和数值改进提供了平台。间隙柱质量平衡采用强形式非连续伽勒金谱元法(DGSEM)进行空间离散化,而颗粒质量平衡则采用广义空间伽勒金谱元法(GSM)。三个不同的基准测试展示了 CADET-Julia 的计算效率:通过比较 Julia 实现与采用相同数学方法和时间积分器的 C++ 实现(CADET-DG),建立了基准测试。对各种 Julia 时间积分器进行了测试,并使用性能最佳的设置,将 Julia 实现与 CADET-DG 和基于有限体积 (FV) 的 C++ 实现 (CADET-FV) 进行了基准比较。总体而言,Julia 实现的性能优于 C++ 实现,Galerkin 方法总体上优于有限体积方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computers & Chemical Engineering
Computers & Chemical Engineering 工程技术-工程:化工
CiteScore
8.70
自引率
14.00%
发文量
374
审稿时长
70 days
期刊介绍: Computers & Chemical Engineering is primarily a journal of record for new developments in the application of computing and systems technology to chemical engineering problems.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信