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);

    }
}
相关推荐
浮生如梦_1 小时前
Halcon基于laws纹理特征的SVM分类
图像处理·人工智能·算法·支持向量机·计算机视觉·分类·视觉检测
△曉風殘月〆1 小时前
WPF MVVM入门系列教程(二、依赖属性)
c#·wpf·mvvm
XiaoLeisj2 小时前
【JavaEE初阶 — 多线程】单例模式 & 指令重排序问题
java·开发语言·java-ee
励志成为嵌入式工程师3 小时前
c语言简单编程练习9
c语言·开发语言·算法·vim
逐·風3 小时前
unity关于自定义渲染、内存管理、性能调优、复杂物理模拟、并行计算以及插件开发
前端·unity·c#
捕鲸叉3 小时前
创建线程时传递参数给线程
开发语言·c++·算法
A charmer3 小时前
【C++】vector 类深度解析:探索动态数组的奥秘
开发语言·c++·算法
Peter_chq3 小时前
【操作系统】基于环形队列的生产消费模型
linux·c语言·开发语言·c++·后端
wheeldown4 小时前
【数据结构】选择排序
数据结构·算法·排序算法
记录成长java5 小时前
ServletContext,Cookie,HttpSession的使用
java·开发语言·servlet