论文部分内容阅读
在数据处理和工程计算中,函数逼近是广泛遇到的一类数值计算问题。通常需要将某些曲线(族)或表列数据拟合成解析函数。特别当采用计算机计算时尤有必要。一元函数逼近的方法较多,现成的程序易于查到。而二元以上的则较少见。但是二元和三元函数的处理却经常遇到。本刊1983年第4期所刊“正交多项式函数逼近”一文概述了该法的特点并列出了一元函数逼近的算法程序。这里进一步就该法扩展到三元函数的问题加以介绍。
In data processing and engineering calculations, function approximation is a type of numerical calculation that is widely encountered. It is often necessary to fit some of the curves (family) or tabular data into analytic functions. Especially when using computer computing is especially necessary. There are many ways to approximate unary functions, and the ready-made programs are easy to find. The more than two are rare. However, the handling of binary and ternary functions is often encountered. The article “The Approximation of Orthogonal Polynomial Functions”, published in the 4th issue of 1983, outlined the characteristics of this method and listed the algorithm procedures for the approximation of univariate functions. Here to further expand on the law to the issue of ternary functions to be introduced.