Premium
Recursive least squares scheme for operating a class of continuous fermentation processes at optimal steady state productivity
Author(s) -
Nguang Sing Kiong,
Chen Xiao Dong
Publication year - 1998
Publication title -
journal of chemical technology and biotechnology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.64
H-Index - 117
eISSN - 1097-4660
pISSN - 0268-2575
DOI - 10.1002/(sici)1097-4660(1998110)73:3<227::aid-jctb954>3.0.co;2-g
Subject(s) - steady state (chemistry) , least squares function approximation , recursive least squares filter , mathematics , mathematical optimization , scheme (mathematics) , process (computing) , computer science , control theory (sociology) , algorithm , statistics , chemistry , artificial intelligence , mathematical analysis , adaptive filter , operating system , control (management) , estimator
This paper has developed a recursive least squares scheme for operating a class of continuous fermentation processes at the optimal steady state productivity. More precisely, the class of continuous fermentation processes under investigation is described by a widely accepted non‐segregated fermentation process model. Based on a recursive least squares algorithm, an on‐line estimation scheme for estimating the optimal set points for feed substrate concentration and dilution rate is developed. Finally, via simulation, it is shown that this on‐line estimation scheme is robust against measurement time (sampling time). © 1998 Society of Chemical Industry