#include "ladel_types.h"
#include "ladel_constants.h"
#include "ladel_global.h"

Include dependency graph for ladel_pattern.c:

Functions
ladel_int	ladel_nonzero_pattern_of_row_in_L (ladel_sparse_matrix M, ladel_symbolics sym, ladel_int row)
	Computes the pattern of the (next) row in L. More...

ladel_int	ladel_etree_dfs (ladel_sparse_matrix W, ladel_symbolics sym, ladel_int col_in_W, ladel_int maximum_row)
	Computes a depth-first search of the given pattern through the elimination tree. More...

Function Documentation

◆ ladel_etree_dfs()

Computes a depth-first search of the given pattern through the elimination tree.

This routine computes the pattern of the result of a backsolve (with a sparse right hand side).

Note: This pattern is stored in sym->pattern[start] through sym->pattern[m-1], where start is the return value of this function.

Parameters

W	Right hand side vector of the backsolve
sym	Symbolics struct
col_in_W	Column in W to consider
maximum_row	Perform the Gaussian elimination only up until this row (not included)

Definition at line 40 of file ladel_pattern.c.

Here is the caller graph for this function:

ladel_int ladel_nonzero_pattern_of_row_in_L	(	ladel_sparse_matrix *	M,
		ladel_symbolics *	sym,
		ladel_int	row
	)

Computes the pattern of the (next) row in L.

Note: This pattern is stored in sym->pattern[start] through sym->pattern[m-1], where start is the return value of this function.

Parameters

M	Matrix to be factorized
sym	Symbolics of the factorization
row	Row in L of which to compute the pattern

Definition at line 5 of file ladel_pattern.c.

Here is the caller graph for this function: