.png){kind=icon}
返回
Accelerating the parameters identifiability procedure: Set by set selection
.png){kind=icon}
OA
AI
DOI：10.1016/j.compchemeng.2013.04.014.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a numerical procedure based on the binary search is proposed for accelerating the parameters identifiability procedure. Basically, the parameters are selected set by set using a given criterion for ranking the parameters. Since parameters identifiability procedures are strongly dependent on the initial estimates of parameters values, simultaneous parameters re-estimation step has been proposed in this paper. Two examples were used to evaluate the performance of the proposed criterion. In both cases, a significant reduction of the computational time was observed, and the results regard to the model fit are similar to those criteria based on the selection of parameters one by one, as usually presented in the literature. (C) 2013 Elsevier Ltd. All rights reserved.
Keyword:
Parameters identifiability
Binary search
Parameters estimation
Scarce experimental data
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
引用论文
Parameter ranking by orthogonalization - Applied to nonlinear mechanistic models.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容