/var/www2/hermes2d/hermes2d/src/matrix_old.cpp File Reference

#include "common.h"
#include "matrix_old.h"

Defines
#define	TINY   1e-20
Functions
void	ludcmp (double **a, int n, int *indx, double *d)
	Given a matrix a[n][n], this routine replaces it by the LU decomposition of a rowwise permutation of itself. a and n are input. a is output, arranged as in equation (2.3.14) above; indx[n] is an output vector that records the row permutation effected by the partial pivoting; d is output as +-1 depending on whether the number of row interchanges was even or odd, respectively. This routine is used in combination with lubksb to solve linear equations or invert a matrix.
void	choldc (double **a, int n, double p[])
	Given a positive-definite symmetric matrix a[n][n], this routine constructs its Cholesky decomposition, A = L*L^T . On input, only the upper triangle of a need be given; it is not modified. The Cholesky factor L is returned in the lower triangle of a, except for its diagonal elements which are returned in p[n].
void	qsort_int (int *pbase, size_t total_elems)

---

Define Documentation

#define TINY   1e-20

---

Function Documentation

void choldc	(	double **	a,
		int	n,
		double	p[]
	)

Given a positive-definite symmetric matrix a[n][n], this routine constructs its Cholesky decomposition, A = L*L^T . On input, only the upper triangle of a need be given; it is not modified. The Cholesky factor L is returned in the lower triangle of a, except for its diagonal elements which are returned in p[n].

void ludcmp	(	double **	a,
		int	n,
		int *	indx,
		double *	d
	)

Given a matrix a[n][n], this routine replaces it by the LU decomposition of a rowwise permutation of itself. a and n are input. a is output, arranged as in equation (2.3.14) above; indx[n] is an output vector that records the row permutation effected by the partial pivoting; d is output as +-1 depending on whether the number of row interchanges was even or odd, respectively. This routine is used in combination with lubksb to solve linear equations or invert a matrix.

void qsort_int	(	int *	pbase,
		size_t	total_elems
	)