negf_integr_utils::equidistant_nodes_a_b Interface Reference

Public Member Functions
subroutine	equidistant_dnodes_a_b (a, b, nnodes, xnodes)
	Compute equidistant nodes on an interval [a, b], where a and b are complex numbers.
subroutine	equidistant_znodes_a_b (a, b, nnodes, xnodes)
	Compute equidistant nodes on an interval [a, b], where a and b are complex numbers.

Detailed Description

Definition at line 30 of file negf_integr_utils.F.

Member Function/Subroutine Documentation

equidistant_dnodes_a_b()

subroutine negf_integr_utils::equidistant_nodes_a_b::equidistant_dnodes_a_b	(	real(kind=dp), intent(in)	a,
		real(kind=dp), intent(in)	b,
		integer, intent(in)	nnodes,
		real(kind=dp), dimension(nnodes), intent(out)	xnodes
	)

Compute equidistant nodes on an interval [a, b], where a and b are complex numbers.

Parameters

a	lower bound
b	upper bound
nnodes	number of nodes
xnodes	array to store the nodes

History

• 05.2017 created [Sergey Chulkov]

Definition at line 46 of file negf_integr_utils.F.

equidistant_znodes_a_b()

subroutine negf_integr_utils::equidistant_nodes_a_b::equidistant_znodes_a_b	(	complex(kind=dp), intent(in)	a,
		complex(kind=dp), intent(in)	b,
		integer, intent(in)	nnodes,
		complex(kind=dp), dimension(nnodes), intent(out)	xnodes
	)

Compute equidistant nodes on an interval [a, b], where a and b are complex numbers.

Parameters

a	lower bound
b	upper bound
nnodes	number of nodes
xnodes	array to store the nodes

History

• 05.2017 created [Sergey Chulkov]

Definition at line 70 of file negf_integr_utils.F.

---

The documentation for this interface was generated from the following file:

• negf_integr_utils.F