forked from tsai/mathnet-numerics
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
77 lines
2.8 KiB
77 lines
2.8 KiB
// <copyright file="LU.cs" company="Math.NET">
|
|
// Math.NET Numerics, part of the Math.NET Project
|
|
// http://numerics.mathdotnet.com
|
|
// http://github.com/mathnet/mathnet-numerics
|
|
//
|
|
// Copyright (c) 2009-2013 Math.NET
|
|
//
|
|
// Permission is hereby granted, free of charge, to any person
|
|
// obtaining a copy of this software and associated documentation
|
|
// files (the "Software"), to deal in the Software without
|
|
// restriction, including without limitation the rights to use,
|
|
// copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
// copies of the Software, and to permit persons to whom the
|
|
// Software is furnished to do so, subject to the following
|
|
// conditions:
|
|
//
|
|
// The above copyright notice and this permission notice shall be
|
|
// included in all copies or substantial portions of the Software.
|
|
//
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
|
|
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
|
|
// OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
|
|
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
|
|
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
|
|
// WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
|
|
// FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
|
|
// OTHER DEALINGS IN THE SOFTWARE.
|
|
// </copyright>
|
|
|
|
using MathNet.Numerics.LinearAlgebra.Factorization;
|
|
|
|
namespace MathNet.Numerics.LinearAlgebra.Complex.Factorization
|
|
{
|
|
using Complex = System.Numerics.Complex;
|
|
|
|
/// <summary>
|
|
/// <para>A class which encapsulates the functionality of an LU factorization.</para>
|
|
/// <para>For a matrix A, the LU factorization is a pair of lower triangular matrix L and
|
|
/// upper triangular matrix U so that A = L*U.</para>
|
|
/// <para>In the Math.NET implementation we also store a set of pivot elements for increased
|
|
/// numerical stability. The pivot elements encode a permutation matrix P such that P*A = L*U.</para>
|
|
/// </summary>
|
|
/// <remarks>
|
|
/// The computation of the LU factorization is done at construction time.
|
|
/// </remarks>
|
|
internal abstract class LU : LU<Complex>
|
|
{
|
|
protected LU(Matrix<Complex> factors, int[] pivots)
|
|
: base(factors, pivots)
|
|
{
|
|
}
|
|
|
|
/// <summary>
|
|
/// Gets the determinant of the matrix for which the LU factorization was computed.
|
|
/// </summary>
|
|
public override Complex Determinant
|
|
{
|
|
get
|
|
{
|
|
var det = Complex.One;
|
|
for (var j = 0; j < Factors.RowCount; j++)
|
|
{
|
|
if (Pivots[j] != j)
|
|
{
|
|
det *= -Factors.At(j, j);
|
|
}
|
|
else
|
|
{
|
|
det *= Factors.At(j, j);
|
|
}
|
|
}
|
|
|
|
return det;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|