多项式最小二次拟合

本文介绍了如何利用gamma函数实现多项式数据的最小二乘拟合,与MATLAB代码进行对比分析,探讨其在数值计算中的应用。
摘要由CSDN通过智能技术生成

gamma.h

#include <cmath>
#include <cstdlib>

static long double
gammln ( const long double &xx )
{
    long double     x,
    tmp,
    ser;
    static long double cof[6] = { 76.18009173, -86.50532033, 24.01409822,
                                  -1.231739516, 0.120858003e-2, -0.536382e-5
                                };
    int             j;

    x = xx - 1.0;
    tmp = x + 5.5;
    tmp -= ( x + 0.5 ) * log ( tmp );
    ser = 1.0;
    for ( j = 0; j <= 5; j++ )
    {
        x += 1.0;
        ser += cof[j] / x;
    }
    return -tmp + log ( 2.50662827465 * ser );
}

static void
gcf ( long double *gammcf,
      const long double &a, const long double &x, long double *gln )
{
    const unsigned int ITMAX = 100;
    const long double EPS = 3.0e-7;
    unsigned int    n = 0;
    long double     gold = 0.0,
                           g,
                           fac = 1.0,
                                 b1 = 1.0;
    long double     b0 = 0.0,
                         anf,
                         ana,
                         an,
                         a1,
                         a0 = 1.0;

    *gln = gammln ( a );
    a1 = x;
    for ( n = 1; n <= ITMAX; n++ )
    {
        an = ( float ) n;
        ana = an - a;
        a0 = ( a1 + a0 * ana ) * fac;
        b0 = ( b1 + b0 * ana ) * fac;
        anf = an * fac;
        a1 = x * a0 + anf * a1;
        b1 = x * b0 + anf * b1;
        if ( a1 )
        {
            fac = 1.0 / a1;
            g = b1 * fac;
            if ( fabs ( ( g - gold ) / g ) < EPS )
            {
                *gammcf = exp ( -x + a * log ( x ) - ( *gln ) ) * g;
                return;
            }
            gold = g;
        }
    }
    if ( "a too large, ITMAX too small in routine GCF" )
        exit ( EXIT_FAILURE );
}

static void
gser ( long double *gamser,
       const long double &a, const long double &x, long double *gln )
{
    const unsigned int ITMAX = 100;
    const long double EPS = 3.0e-7;
    unsigned int    n = 0;
    long double     sum,
 
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值