ManagedLapackOfSingle.LUDecompose Method

public override void LUDecompose(
	int m,
	int n,
	Array2D<Complex<float>> a,
	Array1D<int> ipiv,
	out int info
)

Public Overrides Sub LUDecompose ( 
	m As Integer,
	n As Integer,
	a As Array2D(Of Complex(Of Single)),
	ipiv As Array1D(Of Integer),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void LUDecompose(
	int m, 
	int n, 
	Array2D<Complex<float>> a, 
	Array1D<int> ipiv, 
	[OutAttribute] int% info
) override

abstract LUDecompose : 
        m : int * 
        n : int * 
        a : Array2D<Complex<float32>> * 
        ipiv : Array1D<int> * 
        info : int byref -> unit 
override LUDecompose : 
        m : int * 
        n : int * 
        a : Array2D<Complex<float32>> * 
        ipiv : Array1D<int> * 
        info : int byref -> unit 

Parameters

m  Int32

An integer specifying the number of rows of the matrix a. Must be greater than or equal to zero.

n  Int32

An integer specifying the number of columns of the matrix a. Must be greater than or equal to zero.

a  Array2D<Complex<Single>>

complex single precision array specifying the m-by-n matrix to be factored. On exit, the factors L and U from the decomposition A = P*L*U; the unit diagonal elements of L are not stored.

ipiv  Array1D<Int32>

Integer array of length min(m,n) that will hold the pivot indexes. Row i of the matrix was interchanged with row ipiv[i].

info  Int32

Reference to an integer containing a result code. Zero indicates success. Greater than zero indicates U(i,i) is exactly zero. The decomposition has been completed, but the factor U is exactly singular, and division by zero will occur if it is used to solve a system of equations.

public override void LUDecompose(
	int m,
	int n,
	Array2D<float> a,
	Array1D<int> ipiv,
	out int info
)

Public Overrides Sub LUDecompose ( 
	m As Integer,
	n As Integer,
	a As Array2D(Of Single),
	ipiv As Array1D(Of Integer),
	<OutAttribute> ByRef info As Integer
)

public:
virtual void LUDecompose(
	int m, 
	int n, 
	Array2D<float> a, 
	Array1D<int> ipiv, 
	[OutAttribute] int% info
) override

abstract LUDecompose : 
        m : int * 
        n : int * 
        a : Array2D<float32> * 
        ipiv : Array1D<int> * 
        info : int byref -> unit 
override LUDecompose : 
        m : int * 
        n : int * 
        a : Array2D<float32> * 
        ipiv : Array1D<int> * 
        info : int byref -> unit 

Parameters

m  Int32

            The number of rows of the matrix A.  M >= 0.
            

n  Int32

            The number of columns of the matrix A.  N >= 0.
            

a  Array2D<Single>

            Dimension (LDA,N)
            On entry, the M-by-N matrix to be factored.
            On exit, the factors L and U from the factorization
            A = P*L*U; the unit diagonal elements of L are not stored.
            

            The leading dimension of the array A.  LDA >= max(1,M).
            

ipiv  Array1D<Int32>

            Dimension (min(M,N))
            The pivot indices; for 1 <= i <= min(M,N), row i of the
            matrix was interchanged with row IPIV(i).
            

info  Int32

            = 0:  successful exit
            < 0:  if INFO = -i, the i-th argument had an illegal value
            > 0:  if INFO = i, U(i,i) is exactly zero. The factorization
                  has been completed, but the factor U is exactly
                  singular, and division by zero will occur if it is used
                  to solve a system of equations.
            

            The factorization has the form
               A = P * L * U
            where P is a permutation matrix, L is lower triangular with unit
            diagonal elements (lower trapezoidal if m > n), and U is upper
            triangular (upper trapezoidal if m < n).
            This is the right-looking Level 3 BLAS version of the algorithm.
            

This method corresponds to the LAPACK routine DGETRF.

Reference