“Cut-glue” Approximation based on evolutionary-genetic algorithm for essentially nonlinear parametric dependencies of mathematical models

R. Neydorf, V. Polyakh, D. Vucinic
{"title":"“Cut-glue” Approximation based on evolutionary-genetic algorithm for essentially nonlinear parametric dependencies of mathematical models","authors":"R. Neydorf, V. Polyakh, D. Vucinic","doi":"10.1109/EWDTS.2017.8110040","DOIUrl":null,"url":null,"abstract":"The paper presents the mathematical modeling of fragments by applying the polynomial regression to experimental data of arbitrary dimension. This approach aims to find out the minimal complexity polynomial structure defining the coefficients, which are optimized by the least squares criterion, enabling the error control when describing fragments. This mathematical formulation to approximate experimental data is essentially nonlinear as it uses piecewise approximation on small data fragments. The overall mathematical model requires maximum simplification when modeling each fragment, to ensure its small size and avoiding areas with high curvatures. The structural-parametric optimization for fragment models is implemented with a hybrid of classical regression analysis and a modified evolutionary-genetic algorithm, which varies and optimizes the polynomial structure describing the fragment. The specially developed software tool defines the optimal approximation for high-dimensional fragments, which usage in approximating fragments and the obtained results are demonstrated for real experimental data.","PeriodicalId":141333,"journal":{"name":"2017 IEEE East-West Design & Test Symposium (EWDTS)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE East-West Design & Test Symposium (EWDTS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EWDTS.2017.8110040","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The paper presents the mathematical modeling of fragments by applying the polynomial regression to experimental data of arbitrary dimension. This approach aims to find out the minimal complexity polynomial structure defining the coefficients, which are optimized by the least squares criterion, enabling the error control when describing fragments. This mathematical formulation to approximate experimental data is essentially nonlinear as it uses piecewise approximation on small data fragments. The overall mathematical model requires maximum simplification when modeling each fragment, to ensure its small size and avoiding areas with high curvatures. The structural-parametric optimization for fragment models is implemented with a hybrid of classical regression analysis and a modified evolutionary-genetic algorithm, which varies and optimizes the polynomial structure describing the fragment. The specially developed software tool defines the optimal approximation for high-dimensional fragments, which usage in approximating fragments and the obtained results are demonstrated for real experimental data.
基于进化-遗传算法的数学模型非线性参数依赖的“切胶”近似
本文通过对任意维的实验数据进行多项式回归,建立了碎片的数学模型。该方法旨在找出定义系数的最小复杂度多项式结构,并根据最小二乘准则对其进行优化,从而实现片段描述时的误差控制。这种近似实验数据的数学公式本质上是非线性的,因为它对小数据片段使用分段近似。在对每个片段建模时,整体数学模型要求最大程度地简化,以确保其小尺寸并避免高曲率区域。采用经典回归分析和改进的进化遗传算法相结合的方法,对描述碎片的多项式结构进行变化和优化,实现了碎片模型的结构参数优化。专门开发的软件工具定义了高维碎片的最优近似,并将其用于碎片近似,所得结果与实际实验数据进行了验证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信