ZOJ--1007：Numerical Summation of a Series

最新推荐文章于 2020-09-29 15:51:42 发布

菜鸟帆

最新推荐文章于 2020-09-29 15:51:42 发布

阅读量931

点赞数

分类专栏： ZOJ 文章标签： ZOJ java

本文链接：https://blog.csdn.net/yf224/article/details/72972737

版权

ZOJ 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

Numerical Summation of a Series

Time Limit: 10 Seconds Memory Limit: 32768 KB Special Judge

Produce a table of the values of the series

Equation 1

for the 2001 values of x, x= 0.000, 0.001, 0.002, ..., 2.000. All entries of the table must have an absolute error less than 0.5e-12 (12 digits of precision). This problem is based on a problem from Hamming (1962), when mainframes were very slow by today's microcomputer standards.

Input

This problem has no input.

Output

The output is to be formatted as two columns with the values of x and y(x) printed as in the C printf or the Pascal writeln.

printf("%5.3f %16.12f\n", x, psix )		writeln(x:5:3, psix:16:12)

As an example, here are 4 acceptable lines out of 2001.

0.000   1.644934066848
...
0.500   1.227411277760
...
1.000   1.000000000000
...
2.000   0.750000000000

The values of x should start at 0.000 and increase by 0.001 until the line with x=2.000 is output.

Hint

The problem with summing the sequence in equation 1 is that too many terms may be required to complete the summation in the given time. Additionally, if enough terms were to be summed, roundoff would render any typical double precision computation useless for the desired precision.

To improve the convergence of the summation process note that

Equation 2

which implies y(1)=1.0. One can then produce a series for y(x) - y(1) which converges faster than the original series. This series not only converges much faster, it also reduces roundoff loss.

This process of finding a faster converging series may be repeated to produce sequences which converge more and more rapidly than the previous ones.

The following inequality is helpful in determining how may items are required in summing the series above.

Equation 3

思路：这是一道数学题我居然看了好久才搞懂题目意思大概就是f(x)-f(1)=(1-x)/(k*(k+x)*(k+1))更加精确，因为此时是1/k^3 所以再加上(1-x)/(2*k*k) 最后加1

public class Numerical_Summation_of_a_Series {
	public static void main(String[] args) {
		double sum;
		for(double i=0;i<=2.000;i+=0.001){
			sum=0;
			for(int j=1;j<10000;j++){
				sum+=(1-i)/(j*(j+i)*(j+1));
			}
			sum=sum+(1-i)/(2*10000*10000)+1;
			System.out.printf("%.3f",i);
			System.out.print(" ");
			System.out.printf("%.12f",sum);
			System.out.println();
		}
	}
}