vcoord_gen
1.11.0
|
Lower and upper triangular decomposition. More...
Go to the source code of this file.
Functions/Subroutines | |
subroutine | lubksb (a, n, np, indx, b) |
Lower and upper triangular back substitution. More... | |
subroutine | ludcmp (a, n, np, indx, d) |
This subprogram decomposes a matrix into a product of lower and upper triangular matrices. More... | |
subroutine lubksb | ( | real, dimension(np,np), intent(in) | a, |
integer, intent(in) | n, | ||
integer, intent(in) | np, | ||
integer, dimension(n), intent(in) | indx, | ||
real, dimension(n), intent(inout) | b | ||
) |
Lower and upper triangular back substitution.
This subprogram back substitutes to solve decomposed lower and upper triangular matrices as outputted by ludcmp.
[in] | a | real(np,np) LU-decomposed matrix (from ludcmp) |
[in] | n | integer order of matrix |
[in] | np | integer dimension of matrix |
[in] | indx | integer(n) pivot indices (from ludcmp) |
[in,out] | b | - input real(n) rhs vector of linear problem (will be overwritten)
|
Definition at line 101 of file matrix_utils.f90.
Referenced by vcoord_gen().
subroutine ludcmp | ( | real, dimension(np,np), intent(inout) | a, |
integer, intent(in) | n, | ||
integer, intent(in) | np, | ||
integer, dimension(n), intent(out) | indx, | ||
real, intent(out) | d | ||
) |
This subprogram decomposes a matrix into a product of lower and upper triangular matrices.
[in,out] | a | - input: a real(np,np) matrix (will be overwritten) output:
|
[in] | n | integer order of matrix |
[in] | np | integer dimension of matrix |
[out] | indx | integer(n) pivot indices (original A rows are permuted in order i with indx(i)) |
[out] | d | real determinant permutation (1 or -1, or 0 if singular) (determinant is output diagonal product times d) |
Definition at line 21 of file matrix_utils.f90.
Referenced by vcoord_gen().