Linear approximation by interpretive testing

Barry Barlow
{"title":"Linear approximation by interpretive testing","authors":"Barry Barlow","doi":"10.1145/503643.503676","DOIUrl":null,"url":null,"abstract":"This paper deals with a model designed to fit a curve to data subject to error. In approximating functions, the criterion of goodness of fit is to some degree arbitrary as there are several criterion which may be used. By letting f(~) denote the true functional value at xL, y(~) denote the approximating functional value at x6, and d~ denote (f(x~)-y(~)) in all cases, it is possible to list a few of these criterion as follows: a)Criterion i suggests making~.od ~ a minimum, where n is i less than the number of data points given. This is attractive because of its s~mplicity but is of little use in that it leads to ambiguous results. b)Criterion 2 suggests making~[d~ a minimum. This has some usage but can~ -allow one erroneous value to overly influence the evaluation of the summation value. c)The Mini-Max or Cnebychev criterion suggests that a boundary (d) be placed on the error (~) and one should strive to keep the error within the upper and lower limits of the boundaries. The approach used by this model is known as the Least-Squares criterion. The concept of linear approximation in the Least-Squares approach states that the best approximation in this sense is one where the A~'s are determined such that the sum of the squared difference of the true and approximating functions is made a minimum, where A~ are the coefficients of the approximating function It can also be stated~[f(x~-y(~)]~a minimum. As the title o~'this~=°'--paper implies, this model only deals with approximations of linear curves by Least Squares, ie. functions of the form: f(x)~A,@~(x) where n is the degree of the polynomial, AK is the coeffieient of the term K, and ~(x) is the argument of A~. For example, in the function y(x)=Ao+A,x+ A~x z , the following holds true: ¢o(X):],~,(x)=x, $ ¢~(x):x ~. The A~'s will be approximated by deriving a set of simultaneous equations using the following formula and then solving the.matrix: The equations given by this method are termed the Least-Squares equations. The ~} or aggregate notation is used for both discrete and continuous models. Depending upon the approximating function, one would substitute the i for a model having discrete data, and ~ for a model having continuous data. Deriving the LeastSquares normal equations for f(x)=Ao+Aox gives the following:","PeriodicalId":166583,"journal":{"name":"Proceedings of the 16th annual Southeast regional conference","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1978-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 16th annual Southeast regional conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/503643.503676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper deals with a model designed to fit a curve to data subject to error. In approximating functions, the criterion of goodness of fit is to some degree arbitrary as there are several criterion which may be used. By letting f(~) denote the true functional value at xL, y(~) denote the approximating functional value at x6, and d~ denote (f(x~)-y(~)) in all cases, it is possible to list a few of these criterion as follows: a)Criterion i suggests making~.od ~ a minimum, where n is i less than the number of data points given. This is attractive because of its s~mplicity but is of little use in that it leads to ambiguous results. b)Criterion 2 suggests making~[d~ a minimum. This has some usage but can~ -allow one erroneous value to overly influence the evaluation of the summation value. c)The Mini-Max or Cnebychev criterion suggests that a boundary (d) be placed on the error (~) and one should strive to keep the error within the upper and lower limits of the boundaries. The approach used by this model is known as the Least-Squares criterion. The concept of linear approximation in the Least-Squares approach states that the best approximation in this sense is one where the A~'s are determined such that the sum of the squared difference of the true and approximating functions is made a minimum, where A~ are the coefficients of the approximating function It can also be stated~[f(x~-y(~)]~a minimum. As the title o~'this~=°'--paper implies, this model only deals with approximations of linear curves by Least Squares, ie. functions of the form: f(x)~A,@~(x) where n is the degree of the polynomial, AK is the coeffieient of the term K, and ~(x) is the argument of A~. For example, in the function y(x)=Ao+A,x+ A~x z , the following holds true: ¢o(X):],~,(x)=x, $ ¢~(x):x ~. The A~'s will be approximated by deriving a set of simultaneous equations using the following formula and then solving the.matrix: The equations given by this method are termed the Least-Squares equations. The ~} or aggregate notation is used for both discrete and continuous models. Depending upon the approximating function, one would substitute the i for a model having discrete data, and ~ for a model having continuous data. Deriving the LeastSquares normal equations for f(x)=Ao+Aox gives the following:
解释检验的线性近似
本文讨论了一种用于拟合有误差的数据曲线的模型。在逼近函数时,拟合优度的判据在一定程度上是任意的,因为可以使用的判据有好几个。让f(~)表示在xL处的真实泛函值,y(~)表示在x6处的近似泛函值,d~表示(f(x~)-y(~)),在所有情况下,可以列出以下几个准则:a)准则i建议制作~。Od ~一个最小值,其中n小于给定的数据点数。这是有吸引力的,因为它的s~隐含性,但很少使用,因为它会导致模棱两可的结果。b)标准2建议将~[d]设为最小值。这有一些用途,但可能会允许一个错误的值过度影响求和值的计算。c) Mini-Max或Cnebychev准则建议在误差(~)上设置一个边界(d),并应努力使误差保持在边界的上下限内。该模型使用的方法被称为最小二乘准则。最小二乘方法中的线性近似的概念表明,在这种意义上,最佳近似是A~的确定使得真函数和近似函数的平方差之和达到最小,其中A~是近似函数的系数。它也可以表示为~[f(x~-y(~)]~为最小值。正如这篇论文的标题所暗示的那样,这个模型只处理线性曲线的最小二乘近似,即。函数的形式为:f(x)~A,@~(x)其中n是多项式的次,AK是K项的系数,~(x)是A~的参数。例如,在函数y(x)=Ao+A,x+ A~x z中,下列情况成立:¢(x):],~,(x)=x, $¢~(x):x ~。用下面的公式推导出一组联立方程,然后求解。用这种方法得到的方程称为最小二乘方程。离散模型和连续模型都使用~}或聚合符号。根据近似函数的不同,可以用i代替具有离散数据的模型,用~代替具有连续数据的模型。推导f(x)=Ao+Aox的最小二乘正态方程得到:
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信