C#,数值计算——插值和外推,Base_interp的计算方法与源程序

1 文本格式

using System;

namespace Legalsoft.Truffer

{

/// <summary>

/// Abstract base class used by all interpolation routines in this chapter.

/// Only the routine interp is called directly by the user.

/// </summary>

public abstract class Base_interp

{

public int n { get; set; }

public int mm { get; set; }

public int jsav { get; set; }

public int cor { get; set; }

public int dj { get; set; }

public double[] xx { get; set; }

public double[] yy { get; set; }

/// <summary>

/// Set up for interpolating on a table of x's and y's of length m. Normally

/// called by a derived class, not by the user.

/// </summary>

/// <param name="x"></param>

/// <param name="y"></param>

/// <param name="m"></param>

public Base_interp(double[] x, double y, int m)

{

this.n = x.Length;

this.mm = m;

this.jsav = 0;

this.cor = 0;

this.xx = x;

this.yy = new double[x.Length];

for (int i = 0; i < yy.Length; i++)

{

yy[i] = y;

}

dj = Math.Max(1, (int)Math.Pow((double)n, 0.25));

}

public double interp(double x)

{

int jlo = (cor != 0) ? hunt(x) : locate(x);

return rawinterp(jlo, x);

}

/// <summary>

/// Given a value x, return a value j such that x is (insofar as possible)

/// centered in the subrange xx[j..j + mm - 1], where xx is the stored pointer.

/// The values in xx must be monotonic, either increasing or decreasing.

/// The returned value is not less than 0, nor greater than n-1.

/// </summary>

/// <param name="x"></param>

/// <returns></returns>

/// <exception cref="Exception"></exception>

public int locate(double x)

{

if (n < 2 || mm < 2 || mm > n)

{

throw new Exception("locate size error");

}

bool ascnd = (xx[n - 1] >= xx[0]);

int jl = 0;

int ju = n - 1;

while (ju - jl > 1)

{

int jm = (ju + jl) >> 1;

if (x >= xx[jm] == ascnd)

{

jl = jm;

}

else

{

ju = jm;

}

}

cor = Math.Abs(jl - jsav) > dj ? 0 : 1;

jsav = jl;

return Math.Max(0, Math.Min(n - mm, jl - ((mm - 2) >> 1)));

}

/// <summary>

/// Given a value x, return a value j such that x is (insofar as possible)

/// centered in the subrange xx[j..j + mm - 1], where xx is the stored pointer.

/// The values in xx must be monotonic, either increasing or decreasing.

/// The returned value is not less than 0, nor greater than n-1.

/// </summary>

/// <param name="x"></param>

/// <returns></returns>

/// <exception cref="Exception"></exception>

public int hunt(double x)

{

int jl = jsav;

int inc = 1;

if (n < 2 || mm < 2 || mm > n)

{

throw new Exception("hunt size error");

}

bool ascnd = (xx[n - 1] >= xx[0]);

int ju;

if (jl < 0 || jl > n - 1)

{

jl = 0;

ju = n - 1;

}

else

{

if (x >= xx[jl] == ascnd)

{

for (; ; )

{

ju = jl + inc;

if (ju >= n - 1)

{

ju = n - 1;

break;

}

else if (x < xx[ju] == ascnd)

{

break;

}

else

{

jl = ju;

inc += inc;

}

}

}

else

{

ju = jl;

for (; ; )

{

jl = jl - inc;

if (jl <= 0)

{

jl = 0;

break;

}

else if (x >= xx[jl] == ascnd)

{

break;

}

else

{

ju = jl;

inc += inc;

}

}

}

}

while (ju - jl > 1)

{

int jm = (ju + jl) >> 1;

if (x >= xx[jm] == ascnd)

{

jl = jm;

}

else

{

ju = jm;

}

}

cor = Math.Abs(jl - jsav) > dj ? 0 : 1;

jsav = jl;

return Math.Max(0, Math.Min(n - mm, jl - ((mm - 2) >> 1)));

}

public abstract double rawinterp(int jlo, double x);

}

}

2 代码格式

cs 复制代码
using System;

namespace Legalsoft.Truffer
{
    /// <summary>
    /// Abstract base class used by all interpolation routines in this chapter.
    /// Only the routine interp is called directly by the user.
    /// </summary>
    public abstract class Base_interp
    {
        public int n { get; set; }
        public int mm { get; set; }
        public int jsav { get; set; }
        public int cor { get; set; }
        public int dj { get; set; }
        public double[] xx { get; set; }
        public double[] yy { get; set; }

        /// <summary>
        /// Set up for interpolating on a table of x's and y's of length m. Normally
        /// called by a derived class, not by the user.
        /// </summary>
        /// <param name="x"></param>
        /// <param name="y"></param>
        /// <param name="m"></param>
        public Base_interp(double[] x, double y, int m)
        {
            this.n = x.Length;
            this.mm = m;
            this.jsav = 0;
            this.cor = 0;
            this.xx = x;
            this.yy = new double[x.Length];
            for (int i = 0; i < yy.Length; i++)
            {
                yy[i] = y;
            }
            dj = Math.Max(1, (int)Math.Pow((double)n, 0.25));
        }

        public double interp(double x)
        {
            int jlo = (cor != 0) ? hunt(x) : locate(x);
            return rawinterp(jlo, x);
        }

        /// <summary>
        /// Given a value x, return a value j such that x is (insofar as possible)
        /// centered in the subrange xx[j..j + mm - 1], where xx is the stored pointer.
        /// The values in xx must be monotonic, either increasing or decreasing.
        /// The returned value is not less than 0, nor greater than n-1.
        /// </summary>
        /// <param name="x"></param>
        /// <returns></returns>
        /// <exception cref="Exception"></exception>
        public int locate(double x)
        {
            if (n < 2 || mm < 2 || mm > n)
            {
                throw new Exception("locate size error");
            }
            bool ascnd = (xx[n - 1] >= xx[0]);
            int jl = 0;
            int ju = n - 1;
            while (ju - jl > 1)
            {
                int jm = (ju + jl) >> 1;
                if (x >= xx[jm] == ascnd)
                {
                    jl = jm;
                }
                else
                {
                    ju = jm;
                }
            }
            cor = Math.Abs(jl - jsav) > dj ? 0 : 1;
            jsav = jl;
            return Math.Max(0, Math.Min(n - mm, jl - ((mm - 2) >> 1)));
        }

        /// <summary>
        /// Given a value x, return a value j such that x is (insofar as possible)
        /// centered in the subrange xx[j..j + mm - 1], where xx is the stored pointer.
        /// The values in xx must be monotonic, either increasing or decreasing.
        /// The returned value is not less than 0, nor greater than n-1.
        /// </summary>
        /// <param name="x"></param>
        /// <returns></returns>
        /// <exception cref="Exception"></exception>
        public int hunt(double x)
        {
            int jl = jsav;
            int inc = 1;
            if (n < 2 || mm < 2 || mm > n)
            {
                throw new Exception("hunt size error");
            }
            bool ascnd = (xx[n - 1] >= xx[0]);
            int ju;
            if (jl < 0 || jl > n - 1)
            {
                jl = 0;
                ju = n - 1;
            }
            else
            {
                if (x >= xx[jl] == ascnd)
                {
                    for (; ; )
                    {
                        ju = jl + inc;
                        if (ju >= n - 1)
                        {
                            ju = n - 1;
                            break;
                        }
                        else if (x < xx[ju] == ascnd)
                        {
                            break;
                        }
                        else
                        {
                            jl = ju;
                            inc += inc;
                        }
                    }
                }
                else
                {
                    ju = jl;
                    for (; ; )
                    {
                        jl = jl - inc;
                        if (jl <= 0)
                        {
                            jl = 0;
                            break;
                        }
                        else if (x >= xx[jl] == ascnd)
                        {
                            break;
                        }
                        else
                        {
                            ju = jl;
                            inc += inc;
                        }
                    }
                }
            }
            while (ju - jl > 1)
            {
                int jm = (ju + jl) >> 1;
                if (x >= xx[jm] == ascnd)
                {
                    jl = jm;
                }
                else
                {
                    ju = jm;
                }
            }
            cor = Math.Abs(jl - jsav) > dj ? 0 : 1;
            jsav = jl;
            return Math.Max(0, Math.Min(n - mm, jl - ((mm - 2) >> 1)));
        }

        public abstract double rawinterp(int jlo, double x);

    }
}
相关推荐
He1955017 分钟前
Go初级之十:错误处理与程序健壮性
开发语言·python·golang
一支鱼14 分钟前
leetcode常用解题方案总结
前端·算法·leetcode
m0_7381207232 分钟前
CTFshow系列——PHP特性Web93-96
开发语言·安全·web安全·php·ctfshow
ulias21233 分钟前
各种背包问题简述
数据结构·c++·算法·动态规划
m0_5704664142 分钟前
代码随想录算法训练营第二十八天 | 买卖股票的最佳实际、跳跃游戏、K次取反后最大化的数组和
java·开发语言·算法
程序喵大人43 分钟前
分享个C++线程池的实现源码
开发语言·c++·线程池
吃着火锅x唱着歌1 小时前
LeetCode 1537.最大得分
算法·leetcode·职场和发展
数模加油站1 小时前
25高教社杯数模国赛【C题超高质量思路+可运行代码】第十弹
算法·数学建模·数模国赛·高教社杯全国大学生数学建模竞赛
ulias2121 小时前
动态规划入门:从记忆化搜索到动态规划
算法·动态规划
山河君1 小时前
webrtc之语音活动上——VAD能量检测原理以及源码详解
算法·音视频·webrtc·信号处理