d9r3.txt

解具有导数的多元函数的无约束极小值点或具有导数的非线性方程组的近似解

public class d9r3
{
	public static void main (String[] args)
	{
		//program d9r3
		//driver for routine covsrt
		int i, j, ma = 10;
		int mfit = 5;
		double covar[] = new double[101];
		int lista[] = new int[6];
        d9r3F g = new d9r3F();
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                covar[(i - 1) * ma + j] = 0.0;
                if (i <= 5 && j <= 5)
				{
                    covar[(i - 1) * ma + j] = i + j - 1;
                }
            }
		}
		System.out.println("Original matrix");
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                System.out.print(covar[(i - 1) * ma + j] + "  "); 
            }
			System.out.println();
		}
		//test 1 - spread by 2
		System.out.println("test #1 - spread by two");
		for (i = 1; i <= mfit; i++)
		{
            lista[i] = 2 * i;
		}
		g.covsrt(covar, ma, ma, lista, mfit);
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                System.out.print(covar[(i - 1) * ma + j] + "  "); 
            }
			System.out.println();
		}
		//test 2 - reverse
		System.out.println("test #2 - reverse");
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                covar[(i - 1) * ma + j] = 0.0;
                if (i <= 5 && j <= 5)
				{
                    covar[(i - 1) * ma + j] = i + j - 1;
                }
            }
		}
		for (i = 1; i <= mfit; i++)
		{
            lista[i] = mfit + 1 - i;
		}
		g.covsrt(covar, ma, ma, lista, mfit);
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                System.out.print(covar[(i - 1) * ma + j] + "  "); 
            }
            System.out.println();
		}
		//test 3 - spread and reverse
		System.out.println("test #3 - spread and reverse");
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                covar[(i - 1) * ma + j] = 0.0;
                if (i <= 5 && j <= 5)
				{
                    covar[(i - 1) * ma+j] = i + j - 1;
                }
            }
		}
		for (i = 1; i <= mfit; i++)
		{
            lista[i] = ma + 2 - 2 * i;
		}
		g.covsrt(covar, ma, ma, lista, mfit);
		for (i = 1; i <= ma; i++)
		{
            for (j = 1; j <= ma; j++)
			{
                System.out.print(covar[(i - 1) * ma + j]+"  "); 
            }
			System.out.println();
		}
	}
}