#include "DataTypes.h"

Include dependency graph for ludec.h:

This graph shows which files directly or indirectly include this file:

Functions
bool	ludcmp (Real *a, size_t n, int indx, Real *d)

void	lubksb (Real *a, size_t n, int indx, Real *b)

Real *	lumult (int n, Real *a, Real b, Real c, int indx)

Real **	mat_mult_ludcmp (int n, Real *a, int indx, Real b, Real c)

void	tridiagDecomp (int n, Real a, Real b, Real *c)

void	tridiagbksb (int n, Real a, Real b, Real c, Real f)

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

void	cholsl (Real **a, int n, Real p[], Real b[], Real x[])

Function Documentation

◆ choldc()

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

Definition at line 253 of file ludec.cc.

◆ cholsl()

void cholsl	(	Real **	a,
		int	n,
		Real	p[],
		Real	b[],
		Real	x[]
	)

Definition at line 272 of file ludec.cc.

◆ lubksb()

void lubksb	(	Real **	a,
		size_t	n,
		int *	indx,
		Real *	b
	)

Definition at line 101 of file ludec.cc.

Here is the caller graph for this function:

◆ ludcmp()

bool ludcmp	(	Real **	a,
		size_t	n,
		int *	indx,
		Real *	d
	)

Compute LU decomposition

Parameters

[in]	a	square matrix
[in]	n	size of matrix
[out]	indx	row swap
[out]	d	odd or even

Precondition: matrix is base 1

Postcondition: indx is filled

Returns: true if successfully decomposed, false otherwise (singular matrix)

Definition at line 22 of file ludec.cc.

Here is the caller graph for this function:

◆ lumult()

Real* lumult	(	int	n,
		Real **	a,
		Real *	b,
		Real *	c,
		int *	indx
	)

Definition at line 128 of file ludec.cc.

◆ mat_mult_ludcmp()

Real** mat_mult_ludcmp	(	int	n,
		Real **	a,
		int *	indx,
		Real **	b,
		Real **	c
	)

Definition at line 168 of file ludec.cc.

◆ tridiagbksb()

void tridiagbksb	(	int	n,
		Real *	a,
		Real *	b,
		Real *	c,
		Real *	f
	)

Definition at line 237 of file ludec.cc.

◆ tridiagDecomp()

void tridiagDecomp	(	int	n,
		Real *	a,
		Real *	b,
		Real *	c
	)

Given the three bands of a tridaigonal matric of order n, alter the contents of the bands to hold the LU decomposition

| a0 c0 | | b1 a1 c1 | | b2 a2 c2 | | cn-2 | | bn-1 an-1 |

Algorithm taken from "Numerical Methods" by Dahlquist and Bjork translated by Anderson