C#,数值计算——函数计算,Epsalg的计算方法与源程序

1 文本格式

using System;

namespace Legalsoft.Truffer

{

/// <summary>

/// Convergence acceleration of a sequence by the algorithm.Initialize by

/// calling the constructor with arguments nmax, an upper bound on the

/// number of terms to be summed, and epss, the desired accuracy.Then make

/// successive calls to the function next, with argument the next partial sum

/// of the sequence. The current estimate of the limit of the sequence is

/// returned by next.The flag cnvgd is set when convergence is detected.

/// </summary>

public class Epsalg

{

private double[] e { get; set; }

private int n { get; set; }

private int ncv { get; set; }

public bool cnvgd { get; set; }

/// <summary>

/// Numbers near machine underflow and overflow limits.

/// </summary>

private double eps { get; set; }

private double small { get; set; }

private double big { get; set; }

private double lastval { get; set; }

private double lasteps { get; set; }

public Epsalg(int nmax, double epss)

{

this.e = new double[nmax];

this.n = 0;

this.ncv = 0;

this.cnvgd = false;

this.eps = epss;

this.lastval = 0.0;

small = float.MinValue * 10.0;

big = double.MaxValue;

}

public double next(double sum)

{

e[n] = sum;

double temp2 = 0.0;

for (int j = n; j > 0; j--)

{

double temp1 = temp2;

temp2 = e[j - 1];

double diff = e[j] - temp2;

if (Math.Abs(diff) <= small)

{

e[j - 1] = big;

}

else

{

e[j - 1] = temp1 + 1.0 / diff;

}

}

n++;

double val = (n & 1) != 0 ? e[0] : e[1];

if (Math.Abs(val) > 0.01 * big)

{

val = lastval;

}

lasteps = Math.Abs(val - lastval);

if (lasteps > eps)

{

ncv = 0;

}

else

{

ncv++;

}

if (ncv >= 3)

{

cnvgd = true;

}

return (lastval = val);

}

}

}

2 代码格式

cs 复制代码
using System;

namespace Legalsoft.Truffer
{
    /// <summary>
    /// Convergence acceleration of a sequence by the algorithm.Initialize by
    /// calling the constructor with arguments nmax, an upper bound on the
    /// number of terms to be summed, and epss, the desired accuracy.Then make
    /// successive calls to the function next, with argument the next partial sum
    /// of the sequence. The current estimate of the limit of the sequence is 
    /// returned by next.The flag cnvgd is set when convergence is detected.
    /// </summary>
    public class Epsalg
    {
        private double[] e { get; set; }
        private int n { get; set; }
        private int ncv { get; set; }
        public bool cnvgd { get; set; }
        /// <summary>
        /// Numbers near machine underflow and overflow limits.
        /// </summary>
        private double eps { get; set; }
        private double small { get; set; }
        private double big { get; set; }
        private double lastval { get; set; }
        private double lasteps { get; set; }

        public Epsalg(int nmax, double epss)
        {
            this.e = new double[nmax];
            this.n = 0;
            this.ncv = 0;
            this.cnvgd = false;
            this.eps = epss;
            this.lastval = 0.0;
            small = float.MinValue * 10.0;
            big = double.MaxValue;
        }

        public double next(double sum)
        {
            e[n] = sum;
            double temp2 = 0.0;
            for (int j = n; j > 0; j--)
            {
                double temp1 = temp2;
                temp2 = e[j - 1];
                double diff = e[j] - temp2;
                if (Math.Abs(diff) <= small)
                {
                    e[j - 1] = big;
                }
                else
                {
                    e[j - 1] = temp1 + 1.0 / diff;
                }
            }
            n++;
            double val = (n & 1) != 0 ? e[0] : e[1];
            if (Math.Abs(val) > 0.01 * big)
            {
                val = lastval;
            }
            lasteps = Math.Abs(val - lastval);
            if (lasteps > eps)
            {
                ncv = 0;
            }
            else
            {
                ncv++;
            }
            if (ncv >= 3)
            {
                cnvgd = true;
            }
            return (lastval = val);
        }

    }
}
相关推荐
Tiandaren8 分钟前
Selenium 4 教程:自动化 WebDriver 管理与 Cookie 提取 || 用于解决chromedriver版本不匹配问题
selenium·测试工具·算法·自动化
nbsaas-boot1 小时前
Java 正则表达式白皮书:语法详解、工程实践与常用表达式库
开发语言·python·mysql
岁忧1 小时前
(LeetCode 面试经典 150 题 ) 11. 盛最多水的容器 (贪心+双指针)
java·c++·算法·leetcode·面试·go
chao_7891 小时前
二分查找篇——搜索旋转排序数组【LeetCode】两次二分查找
开发语言·数据结构·python·算法·leetcode
风无雨2 小时前
GO 启动 简单服务
开发语言·后端·golang
斯普信专业组2 小时前
Go语言包管理完全指南:从基础到最佳实践
开发语言·后端·golang
秋说3 小时前
【PTA数据结构 | C语言版】一元多项式求导
c语言·数据结构·算法
Maybyy3 小时前
力扣61.旋转链表
算法·leetcode·链表
我是苏苏3 小时前
C#基础:Winform桌面开发中窗体之间的数据传递
开发语言·c#
斐波娜娜4 小时前
Maven详解
java·开发语言·maven