Click or drag to resize

BLASdgesv Method

Computes the solution to the system of linear equations with a square matrix A and multiple right-hand sides. It uses an LU decomposition with partial pivoting and row interchanges, solving
Copy
(P*L*U)*X = B

Namespace:  DHIMath.Numerics
Assembly:  DHI.Mike1D.Generic (in DHI.Mike1D.Generic.dll) Version: 16.0.0.0 (11.1.1.1111)
Syntax
C#
Copy
public static int dgesv(
	int n,
	int nrhs,
	double[] a,
	int lda,
	int[] ipiv,
	double[] b,
	int ldb
)

Parameters

n
Type: SystemInt32
The number of linear equations, the size of A
nrhs
Type: SystemInt32
Number of right hand sides
a
Type: SystemDouble
The matrix A in column major format, on return the LU factors
lda
Type: SystemInt32
Leading dimension of A, usually n but can be larger
ipiv
Type: SystemInt32
The pivot indices that define the permutation matrix P
b
Type: SystemDouble
The right hand sides, n x nrhs
ldb
Type: SystemInt32
Leading dimension of B, usually n but can be larger

Return Value

Type: Int32
0 on success. i, when U(i, i) (computed in double precision for mixed precision subroutines) is exactly zero. The factorization has been completed, but the factor U is exactly singular, so the solution could not be computed
See Also