C# ComplexDoubleMatrix.GetColumn方法代码示例

		public void GetColumnOutOfRange()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			ComplexDoubleVector b = a.GetColumn(3);
		}

//.........这里部分代码省略.........
				throw new RankException("The numer of rows in Y does not match the length of col and row.");
			}

			// check if leading diagonal is zero
			if (col[0] == Complex.Zero)
			{
				throw new SingularMatrixException("One of the leading sub-matrices is singular.");
			}

			// decompose matrix
			int order = col.Length;
			Complex[] A = new Complex[order];
			Complex[] B = new Complex[order];
			Complex[] Z = new Complex[order];
			ComplexDoubleMatrix X = new ComplexDoubleMatrix(order);
			Complex Q, S, Ke, Kr, e;
			Complex Inner;
			int i, j, l;

			// setup the zero order solution
			A[0] = Complex.One;
			B[0] = Complex.One;
			e = Complex.One / col[0];
			X.SetRow(0, e * ComplexDoubleVector.GetRow(Y, 0));

			for (i = 1; i < order; i++)
			{
				// calculate inner products
				Q = Complex.Zero;
				for (j = 0, l = 1; j < i; j++, l++)
				{
					Q += col[l] * A[j];
				}

				S = Complex.Zero;
				for (j = 0, l = 1; j < i; j++, l++)
				{
					S += row[l] * B[j];
				}

				// reflection coefficients
				Kr = -S * e;
				Ke = -Q * e;

				// update lower triangle (in temporary storage)
				Z[0] = Complex.Zero;
				Array.Copy(A, 0, Z, 1, i);
				for (j = 0, l = i - 1; j < i; j++, l--)
				{
					Z[j] += Ke * B[l];
				}

				// update upper triangle
				for (j = i; j > 0; j--)
				{
					B[j] = B[j - 1];
				}

				B[0] = Complex.Zero;
				for (j = 0, l = i - 1; j < i; j++, l--)
				{
					B[j] += Kr * A[l];
				}

				// copy from temporary storage to lower triangle
				Array.Copy(Z, 0, A, 0, i + 1);

				// check for singular sub-matrix)
				if (Ke * Kr == Complex.One)
				{
					throw new SingularMatrixException("One of the leading sub-matrices is singular.");
				}

				// update diagonal
				e = e / (Complex.One - Ke * Kr);

				for (l = 0; l < Y.Rows; l++)
				{
					ComplexDoubleVector W = X.GetColumn(l);
					ComplexDoubleVector M = ComplexDoubleVector.GetColumn(Y, l);

					Inner = M[i];
					for (j = 0; j < i; j++)
					{
						Inner += A[j] * M[j];
					}
					Inner *= e;

					W[i] = Inner;
					for (j = 0; j < i; j++)
					{
						W[j] += Inner * B[j];
					}

					X.SetColumn(l, W);
				}
			}

			return X;
		}

		public void GetColumn()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			a[0, 0] = new Complex(1);
			a[0, 1] = new Complex(2);
			a[1, 0] = new Complex(3);
			a[1, 1] = new Complex(4);
			ComplexDoubleVector b = a.GetColumn(0);
			Assert.AreEqual(b[0], a[0, 0]);
			Assert.AreEqual(b[1], a[1, 0]);
		}