计算机与代数---如何计算log---实现[2]

0.简介

上一篇文章介绍了原理，这里介绍如何实现。

1.泰勒展开
因为拟合的项数比较多，所以用循环可以解决。用下面的代码解决。

#define LN2 0.6931471805599453
double baselog2(double n)
{
	n-=1;
	double x = 1,result = 0;
	for (int i = 1; i < 30; i++) 
	{
        result += (n/i);//累加结果
        n *= (x * (-1));//累乘n，并且计算每项的符号
    }
	return result/LN2;
}

这段代码只能计算(0.5,1]范围内的准确值，简单整合一下代码，变换成如下。

#define LN2 0.6931471805599453
double baselog2(double n)
{
	n-=1;//函数实际计算的是log2(x+1)，这里需要先减1
	double x = -1,result = 0;
	for (int i = 1; i < 30; i++) 
		result += ((x = x * n * -1) / i);
	return result/LN2;
}

2.分情况计算

根据上一篇设计的各种情况，将其分别实现，代码如下。

double mylog2(double n)
{
	double result = 0;
    //计算普通情况
	if (n >= 0.5 && n <= 1)
		result = baselog2(n);
    //计算小于0.5情况，不断乘2放大
	else if (n >= 0.1 && n < 0.5)
	{
		int subn = 0;
		while(n<=1)
		{
			n *= 2;
			++subn;
		}
		result += (baselog2(n/2) - subn+1);
	}
    //计算小于0.1情况，不断放大10倍
	else if (n >= 0 && n < 0.1)
	{
		int addn=0;
		while (n<0.1)
		{
			n *= 10;
			++addn;
		}
		result += ((baselog2(0.8)-3) * addn + mylog2(n));
	}
    //计算大于1的情况
	else if (n > 1)
	{
		double bitnum = 1;
		int bitset = 0;
		while (bitnum <= n)
		{
			bitnum*= 2;
			++bitset;
		}
		result += (bitset + mylog2(n/bitnum));
	}
	return result;
}

3.结果

简单优化了一下，最后所有代码如下。

#include<iostream>
#include<ctime>
using namespace std;
#define LN2 0.6931471805599453
double baselog2(double n)
{
	n-=1;
	double x = -1,result = 0;
	for (int i = 1; i < 30; i++) 
		result += ((x = x * n * -1) / i);
	return result/LN2;
}
double mylog2(double n)
{
	double result = 0;
	if (n >= 0.5 && n <= 1)
		result = baselog2(n);
	else if (n >= 0.1 && n < 0.5)
	{
		while(n<=1)
		{
			n *= 2;
			--result;
		}
		result += (baselog2(n/2) + 1);
	}
	else if (n >= 0 && n < 0.1)
	{
		while (n<0.1)
		{
			n *= 10;
			result += (-0.32192809488736229 - 3);//这里预计算了log2(0.3)-3
		}
		result += (mylog2(n));
	}
	else if (n > 1)
	{
		while (1 <= n)
		{
			//bitnum*= 2;//实际就是每次除以2,让n小于1
			n /= 2;
			++result;
		}
		result += (mylog2(n));
	}
	return result;
}

int main()
{
	double a,b;
	double n =0.000000000000000000001999123;
	cout << "极小数字测试:" <<n<< endl;
	cout <<"log2:   "<< (a=log2(n)) <<endl;
	cout <<"mylog2: "<< (b=mylog2(n))<< endl;
	cout << endl;

	n = 1;
	cout << "边界数字测试:" <<n<< endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	cout << endl;

	n = 0.5;
	cout << "边界数字测试:" <<n<< endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	cout << endl;

	n = 0.1;
	cout << "边界数字测试:" <<n<< endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	cout << endl;

	n = 81929876418.91234;
	cout << "极大数字测试:" <<n<< endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	cout << endl;

	n = 0.567923472397498;
	cout << "普通小数测试:" << n << endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	cout << endl;

	n = 0.112369128631286312873;
	cout << "普通小数测试:" << n << endl;
	cout << "log2:   " << (a = log2(n)) << endl;
	cout << "mylog2: " << (b = mylog2(n)) << endl;
	return 0;
}