simplex_nodes Namespace Reference

Functions
def	multiindex_equal (d, k)
	A generator for :math:d-tuple multi-indices whose sum is :math:k.
def	_recursive (dims, degree, alpha, family)
	Compute the recursive elaboration of a 1D node family to the simplex.
def	recursive_nodes (dims, degree, family)

Function Documentation

_recursive()

def simplex_nodes._recursive (   dims,   degree,   alpha,   family  )

protected

Compute the recursive elaboration of a 1D node family to the simplex.

This function is taken verbatim from the branch python_basis.

multiindex_equal()

def simplex_nodes.multiindex_equal	(		d,
			k
	)

A generator for :math:d-tuple multi-indices whose sum is :math:k.

Args:
    d (int): The length of the tuples
    k (int): The sum of the entries in the tuples

Yields:
    tuple: tuples of length `d` whose entries sum to `k`, in lexicographic
    order.

Example:
    >>> for i in multiindex_equal(3, 2): print(i)
    (0, 0, 2)
    (0, 1, 1)
    (0, 2, 0)
    (1, 0, 1)
    (1, 1, 0)
    (2, 0, 0)

recursive_nodes()

def simplex_nodes.recursive_nodes	(		dims,
			degree,
			family
	)