polycovertmatrix.cpp

qrdrls算法

#include "filein.h"
#include "share.h"
#include "math.h"


int Polycovertmatrix(double *in_1,double *in_2,double *in_3,double *in_4,matrix *C)//把记忆多项式转换成矩阵形式
{
	int i,j,k;

	double abs1;
	
	complex2 **a;
	a = new complex2 *[NUMBER1-N];
	for(i=0;i<NUMBER1-N;i++)
		a[i]=new complex2 [M*N+1];

/*	b = new complex2 *[NUMBER2-N]; 
	for(i=0;i<NUMBER2-N;i++)
		b[i]=new complex2 [M*N];*/

	complex2 x1_in;
	for(i=N;i<NUMBER1;i++)
	{
		for(j=0;j<N;j++)
		{		
			x1_in=complex2(in_1[i-j],in_2[i-j]);
			abs1=sqrt(x1_in.magnitude2());
			for(k=0;k<M;k++)
			{
				a[i-N][j*M+k]=x1_in;
				x1_in=x1_in*abs1;
			}
		}
		a[i-N][N*M]=complex2(in_3[i-N],in_4[i-N]);
	}


/*	for(i=N;i<NUMBER1;i++)
	{
		for(j=0;j<N;j++)
		{		
			x1_in=complex2(in_1[i-j],in_2[i-j]);
			abs1=sqrt(x1_in.magnitude2());
			for(k=0;k<M;k++)
			{
				b[i-N][j*N+k]=x1_in;
				x1_in*=abs1;
			}
		}		
	}*/


	for(i=0;i<M*N+1;i++)
		for(j=0;j<NUMBER1-N;j++)

			C->set_element(i,j,a[j][i]);

	/*for(i=0;i<M*N;i++)
		for(j=0;j<NUMBER2-N;j++)
			D->set_element(i,j,b[j][i]);*/


    for(i=0;i<NUMBER1-N;i++)
		delete [] a[i];
    delete a;
    /*for(i=0;i<NUMBER2-N;i++)
		delete [] b[i];
	delete b;*/

	return 1;   
}