Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms

Beitrag in einer Fachzeitschrift
(Originalarbeit)


Details zur Publikation

Autorinnen und Autoren: Sreedhar B, Wagler A, Kaspereit M, Seidel-Morgenstern A
Zeitschrift: Computers & Chemical Engineering
Verlag: Elsevier
Jahr der Veröffentlichung: 2013
Band: 49
Seitenbereich: 158-169
ISSN: 0098-1354
Sprache: Englisch


Abstract


The determination of accurate cut-times plays an important role in the design and implementation of preparative chromatography. Modeling and optimization studies involving preparative isolation of target components from multi-component mixtures overwhelmingly depend on the target amount collected, defined by specific cut-times. The task of finding these times can be quite challenging for complex chromatograms of experimental or theoretical origin. In this study, two new alternate strategies to find optimal cut-times are introduced. Using simple linear and complex overloaded chromatograms, the performances of these new methods are compared with that an established technique based on evaluating local purities. To demonstrate the methods, concentration profiles were generated theoretically using empirical functions and the equilibrium dispersive model. The methods are compared in terms of their accuracy, speed, robustness and also their ability to find multiple fractionation intervals. © 2012 Elsevier Ltd.



FAU-Autorinnen und Autoren / FAU-Herausgeberinnen und Herausgeber

Kaspereit, Malte Prof. Dr.-Ing.
Professur für Thermische Verfahrenstechnik


Zitierweisen

APA:
Sreedhar, B., Wagler, A., Kaspereit, M., & Seidel-Morgenstern, A. (2013). Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms. Computers & Chemical Engineering, 49, 158-169. https://dx.doi.org/10.1016/j.compchemeng.2012.09.009

MLA:
Sreedhar, Balamurali, et al. "Optimal cut-times finding strategies for collecting a target component from overloaded elution chromatograms." Computers & Chemical Engineering 49 (2013): 158-169.

BibTeX: 

Zuletzt aktualisiert 2019-08-04 um 14:51