treelet (version 0.2-0)

JTree_Basis: Calculates the basis for the Jacobi tree algorithm (one or more iterations)

Description

Jacobi algorithm

Usage

JTree_Basis(Zpos, T, PCidx, maxlev, all_nodes)

Arguments

Zpos

positions of the two clusters merged; number between 1 and d (the length of the comp vector)

T

Element in the list array contains a 2-by-2 rot matrix

PCidx

ID of principal components; [1 2] or [2 1]

maxlev

default: dim-1 (levels L=0,1,2,...,maxlevel)

all_nodes

node labels

Value

• basis
  Basis functions entered ROW-WISE --- coarse-to-fine where m is the dimension of the data
• sums
  Part of basis funcs of subspaces V1,...,V_{m-1}---- entered rowwise (fine-to-coarse)
• difs
  Basis funcs of subspaces W1,...,W_{m-1}---- entered rowwise (fine-to-coarse)