cholesky_implementation Submodule

Uses

- Ancestors:
- tools_math
Help
Graph Key

Nodes of different colours represent the following:

Solid arrows point from a submodule to the (sub)module which it is descended from. Dashed arrows point from a module or program unit to modules which it uses. Where possible, edges connecting nodes are given different colours to make them easier to distinguish in large graphs.

Contents

Module Procedures

cholesky_fact_m cholesky_solve_m cholesky_solve_v choloesky_fact_v

Module Procedures

module procedure cholesky_fact_m module subroutine cholesky_fact_m(a)

Arguments

Type	Intent	Optional	Attributes		Name
real(kind=psb_dpk_),	intent(inout)			::	a(:,:)

module procedure cholesky_solve_m module subroutine cholesky_solve_m(a, b)

Description: Solves a linear system Ax=b, where A has been previously decomposed according to the Cholesky factorization. A: type REAL, rank 2.

Arguments

Type	Intent	Optional	Attributes		Name
real(kind=psb_dpk_),	intent(in)			::	a(:,:)
real(kind=psb_dpk_),	intent(inout)			::	b(:)

module procedure cholesky_solve_v module subroutine cholesky_solve_v(a, b)

$Id$

Arguments

Type	Intent	Optional	Attributes		Name
real(kind=psb_dpk_),	intent(in)			::	a(:)
real(kind=psb_dpk_),	intent(inout)			::	b(:)

module procedure choloesky_fact_v module subroutine choloesky_fact_v(a)

Arguments

Type	Intent	Optional	Attributes		Name
real(kind=psb_dpk_),	intent(inout)			::	a(:)