C# ComplexDoubleMatrix.SetColumn方法代码示例

		/// <summary>
		/// Solve a square Toeplitz system with a right-side matrix.
		/// </summary>
		/// <param name="Y">The right-side matrix</param>
		/// <returns>The solution matrix.</returns>
		/// <exception cref="ArgumentNullException">
		/// Parameter <B>Y</B> is a null reference.
		/// </exception>
		/// <exception cref="RankException">
		/// The number of rows in <B>Y</B> is not equal to the number of rows in the Toeplitz matrix.
		/// </exception>
		/// <exception cref="SingularMatrixException">
		/// The Toeplitz matrix or one of the the leading sub-matrices is singular.
		/// </exception>
		/// <remarks>
		/// This member solves the linear system <B>TX</B> = <B>Y</B>, where <B>T</B> is
		/// a square Toeplitz matrix, <B>X</B> is the unknown solution matrix
		/// and <B>Y</B> is a known matrix.
		/// <para>
		/// The class implicitly decomposes the inverse Toeplitz matrix into a <b>UDL</b> factorisation
		/// using the Levinson algorithm, before calculating the solution vector.
		/// </para>
		/// </remarks>
		public ComplexDoubleMatrix Solve(IROComplexDoubleMatrix Y)
		{
			ComplexDoubleMatrix X;
			Complex Inner;
			Complex[] a, b, x, y;
			int i, j, l;

			// check parameters
			if (Y == null)
			{
				throw new System.ArgumentNullException("Y");
			}
			else if (m_Order != Y.Columns)
			{
				throw new RankException("The numer of rows in Y is not equal to the number of rows in the Toeplitz matrix.");
			}

			Compute();

			if (m_IsSingular == true)
			{
				throw new SingularMatrixException("One of the leading sub-matrices is singular.");
			}

			// allocate memory for solution
			X = new ComplexDoubleMatrix(m_Order, Y.Rows);
			x = new Complex[m_Order];

			for (l = 0; l < Y.Rows; l++)
			{
				// get right-side column
				y = ComplexDoubleVector.GetColumnAsArray(Y, l);

				// solve left-side column
				for (i = 0; i < m_Order; i++)
				{
					a = m_LowerTriangle[i];
					b = m_UpperTriangle[i];

					Inner = y[i];
					for (j = 0; j < i; j++)
					{
						Inner += a[j] * y[j];
					}
					Inner *= m_Diagonal[i];

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

				// insert left-side column into the matrix
				X.SetColumn(l, x);
			}

			return X;
		}

		public void SetColumnArrayWrongRank()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			Complex[] b = new Complex[3];
			a.SetColumn(1, b);
		}

		public void SetColumnArrayOutOfRange()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			Complex[] b = new Complex[2];
			a.SetColumn(2, b);
		}

		public void SetColumnArray()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			Complex[] b = new Complex[2];
			b[0] = new Complex(1, 1);
			b[1] = new Complex(2, 2);
			a.SetColumn(0, b);
			Assert.AreEqual(b[0], a[0, 0]);
			Assert.AreEqual(b[1], a[1, 0]);
		}

		public void SetColumnWrongRank()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			ComplexDoubleVector b = new ComplexDoubleVector(3);
			a.SetColumn(1, b);
		}

		public void SetColumnOutOfRange()
		{
			ComplexDoubleMatrix a = new ComplexDoubleMatrix(2, 2);
			ComplexDoubleVector b = new ComplexDoubleVector(2);
			a.SetColumn(2, b);
		}

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