ccolumn_bmod.c File Reference

performs numeric block updates More...

#include <stdio.h>
#include <stdlib.h>
#include "slu_cdefs.h"

Include dependency graph for ccolumn_bmod.c:

Functions
void	cusolve (int, int, complex *, complex *)
	Solves a dense upper triangular system. More...
void	clsolve (int, int, complex *, complex *)
	Solves a dense UNIT lower triangular system. More...
void	cmatvec (int, int, int, complex *, complex *, complex *)
	Performs a dense matrix-vector multiply: Mxvec = Mxvec + M * vec. More...
int	ccolumn_bmod (const int jcol, const int nseg, complex *dense, complex *tempv, int *segrep, int *repfnz, int fpanelc, GlobalLU_t *Glu, SuperLUStat_t *stat)

Detailed Description

Copyright (c) 2003, The Regents of the University of California, through Lawrence Berkeley National Laboratory (subject to receipt of any required approvals from U.S. Dept. of Energy)

All rights reserved.

The source code is distributed under BSD license, see the file License.txt at the top-level directory.

– SuperLU routine (version 3.0) –
Univ. of California Berkeley, Xerox Palo Alto Research Center,
and Lawrence Berkeley National Lab.
October 15, 2003

Copyright (c) 1994 by Xerox Corporation.  All rights reserved.

THIS MATERIAL IS PROVIDED AS IS, WITH ABSOLUTELY NO WARRANTY
EXPRESSED OR IMPLIED.  ANY USE IS AT YOUR OWN RISK.

 Permission is hereby granted to use or copy this program for any
 purpose, provided the above notices are retained on all copies.
 Permission to modify the code and to distribute modified code is
 granted, provided the above notices are retained, and a notice that
 the code was modified is included with the above copyright notice.

Function Documentation

int ccolumn_bmod	(	const int	jcol,
		const int	nseg,
		complex *	dense,
		complex *	tempv,
		int *	segrep,
		int *	repfnz,
		int	fpanelc,
		GlobalLU_t *	Glu,
		SuperLUStat_t *	stat
	)

Purpose:

Performs numeric block updates (sup-col) in topological order.
It features: col-col, 2cols-col, 3cols-col, and sup-col updates.
Special processing on the supernodal portion of L[*,j]
Return value:   0 - successful return
              > 0 - number of bytes allocated when run out of space

Here is the call graph for this function:

void clsolve	(	int	ldm,
		int	ncol,
		complex *	M,
		complex *	rhs
	)

The unit lower triangular matrix is stored in a 2D array M(1:nrow,1:ncol). The solution will be returned in the rhs vector.

void cmatvec	(	int	ldm,
		int	nrow,
		int	ncol,
		complex *	M,
		complex *	vec,
		complex *	Mxvec
	)

The input matrix is M(1:nrow,1:ncol); The product is returned in Mxvec[].

void cusolve	(	int	ldm,
		int	ncol,
		complex *	M,
		complex *	rhs
	)

The upper triangular matrix is stored in a 2-dim array M(1:ldm,1:ncol). The solution will be returned in the rhs vector.