我正在构建一个.net页面来模拟电子表格。这张纸包含这个公式。
=ROUND(TREND(AA7:AE7,AA$4:AE$4,AF$4),1)有人能提供相当于C#的TREND()吗?或者,如果有人能提供一条捷径绕过它,那也没关系;我不太熟悉那里的数学,不知道是否有更简单的方法。
这是一些样本数字,如果有帮助的话。
AA7 7:AE7 7 6 8 10 12 14
或10.2 13.6 17.5 20.4 23.8
AA$4:AE$4 600 800 1000 1200 1400
AF$4 650
编辑:这是我想出来的,它似乎产生了与我的电子表格相同的数字。
public static partial class Math2
{
public static double[] Trend(double[] known_y, double[] known_x, params double[] new_x)
{
// return array of new y values
double m, b;
Math2.LeastSquaresFitLinear(known_y, known_x, out m, out b);
List<double> new_y = new List<double>();
for (int j = 0; j < new_x.Length; j++)
{
double y = (m * new_x[j]) + b;
new_y.Add(y);
}
return new_y.ToArray();
}
// found at http://stackoverflow.com/questions/7437660/how-do-i-recreate-an-excel-formula-which-calls-trend-in-c
// with a few modifications
public static void LeastSquaresFitLinear(double[] known_y, double[] known_x, out double M, out double B)
{
if (known_y.Length != known_x.Length)
{
throw new ArgumentException("arrays are unequal lengths");
}
int numPoints = known_y.Length;
//Gives best fit of data to line Y = MC + B
double x1, y1, xy, x2, J;
x1 = y1 = xy = x2 = 0.0;
for (int i = 0; i < numPoints; i++)
{
x1 = x1 + known_x[i];
y1 = y1 + known_y[i];
xy = xy + known_x[i] * known_y[i];
x2 = x2 + known_x[i] * known_x[i];
}
M = B = 0;
J = ((double)numPoints * x2) - (x1 * x1);
if (J != 0.0)
{
M = (((double)numPoints * xy) - (x1 * y1)) / J;
//M = Math.Floor(1.0E3 * M + 0.5) / 1.0E3; // TODO this is disabled as it seems to product results different than excel
B = ((y1 * x2) - (x1 * xy)) / J;
// B = Math.Floor(1.0E3 * B + 0.5) / 1.0E3; // TODO assuming this is the same as above
}
}
}发布于 2011-09-15 21:52:40
考虑趋势是基于Excel函数,LINEST。如果您遵循这个链接,https://support.office.com/en-us/article/LINEST-function-84d7d0d9-6e50-4101-977a-fa7abf772b6d,它将解释LINEST背后的功能。
此外,您将找到它使用的基本公式。

。

发布于 2013-05-23 18:40:34
这篇文章非常有用,因为我们需要在C#中重新创建它。由于Jeff上面的回答,我使用以下方法重新创建了这个公式:
using System;
using System.Collections.Generic;
using System.Linq;
using System.Drawing;
public static class MathHelper
{
/// <summary>
/// Gets the value at a given X using the line of best fit (Least Square Method) to determine the equation
/// </summary>
/// <param name="points">Points to calculate the value from</param>
/// <param name="x">Function input</param>
/// <returns>Value at X in the given points</returns>
public static float LeastSquaresValueAtX(List<PointF> points, float x)
{
float slope = SlopeOfPoints(points);
float yIntercept = YInterceptOfPoints(points, slope);
return (slope * x) + yIntercept;
}
/// <summary>
/// Gets the slope for a set of points using the formula:
/// m = ∑ (x-AVG(x)(y-AVG(y)) / ∑ (x-AVG(x))²
/// </summary>
/// <param name="points">Points to calculate the Slope from</param>
/// <returns>SlopeOfPoints</returns>
private static float SlopeOfPoints(List<PointF> points)
{
float xBar = points.Average(p => p.X);
float yBar = points.Average(p => p.Y);
float dividend = points.Sum(p => (p.X - xBar) * (p.Y - yBar));
float divisor = (float)points.Sum(p => Math.Pow(p.X - xBar, 2));
return dividend / divisor;
}
/// <summary>
/// Gets the Y-Intercept for a set of points using the formula:
/// b = AVG(y) - m( AVG(x) )
/// </summary>
/// <param name="points">Points to calculate the intercept from</param>
/// <returns>Y-Intercept</returns>
private static float YInterceptOfPoints(List<PointF> points, float slope)
{
float xBar = points.Average(p => p.X);
float yBar = points.Average(p => p.Y);
return yBar - (slope * xBar);
}
}由于Point使用整数来定义它的值,所以我选择使用PointF,因为在我们的应用程序中,可以有很多小数位。请原谅任何数学术语,因为我花更多的时间编写代码,而不是开发这样的算法,尽管我希望任何人纠正我,如果我错了一个词。
这肯定比等待Excel在后台加载使用工作簿的趋势方法更快。
发布于 2019-12-18 08:28:44
感谢在javascript中重新创建的代码。
function LeastSquaresFitLinear(known_y, known_x, offset_x)
{
if (known_y.length != known_x.length) return false; //("arrays are unequal lengths");
var numPoints = known_y.length;
var x1=0, y1=0, xy=0, x2=0, J, M, B;
for (var i = 0; i < numPoints; i++)
{
known_x[i] -= offset_x;
x1 = x1 + known_x[i];
y1 = y1 + known_y[i];
xy = xy + known_x[i] * known_y[i];
x2 = x2 + known_x[i] * known_x[i];
}
J = (numPoints * x2) - (x1 * x1);
if (J != 0.0)
{
M = ((numPoints * xy) - (x1 * y1)) / J;
B = ((y1 * x2) - (x1 * xy)) / J;
}
return [M,B];
}https://stackoverflow.com/questions/7437660
复制相似问题