Method Solve

SRC/material/uniaxial/TriMatrix.cpp:62–95

Solve the system of equations this*x=d given the specified d. Uses the Thomas algorithm described in the wikipedia article: http://en.wikipedia.org/wiki/Tridiagonal_matrix_algorithm Not optimized. Not destructive. Right side of the equation.

		/// </remarks>
		/// <param name="d">Right side of the equation.</param>
		double* TriDiagonalMatrixF::Solve(double* d, int dLength)
		{
			int n = N();


			// cPrime
			double* cPrime = new double[n];
			cPrime[0] = C[0] / B[0];

			for (int i = 1; i < n; i++)
			{
				cPrime[i] = C[i] / (B[i] - cPrime[i-1] * A[i]);
			}

			// dPrime
			double* dPrime = new double[n];
			dPrime[0] = d[0] / B[0];

			for (int i = 1; i < n; i++)
			{
				dPrime[i] = (d[i] - dPrime[i-1]*A[i]) / (B[i] - cPrime[i - 1] * A[i]);
			}

			// Back substitution
			double* x = new double[n];
			x[n - 1] = dPrime[n - 1];

			for (int i = n-2; i >= 0; i--)
			{
				x[i] = dPrime[i] - cPrime[i] * x[i + 1];
			}

			return x;
		}
TriDiagonalMatrixF::TriDiagonalMatrixF(int n)
{
  Lenght = n;