Graphviz 12.0.1~dev.20240716.0800
Loading...
Searching...
No Matches
pca.c File Reference
#include <cgraph/alloc.h>
#include <neatogen/matrix_ops.h>
#include <neatogen/pca.h>
#include <neatogen/closest.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
Include dependency graph for pca.c:

Go to the source code of this file.

Functions

void PCA_alloc (DistType **coords, int dim, int n, double **new_coords, int new_dim)
 
bool iterativePCA_1D (double **coords, int dim, int n, double *new_direction)
 

Variables

static int num_pairs = 4
 

Function Documentation

◆ iterativePCA_1D()

bool iterativePCA_1D ( double **  coords,
int  dim,
int  n,
double *  new_direction 
)

Definition at line 72 of file pca.c.

References closest_pairs2graph(), eval(), free(), mult_dense_mat_d(), mult_sparse_dense_mat_transpose(), NULL, num_pairs, and power_iteration().

Referenced by sparse_stress_subspace_majorization_kD().

Here is the call graph for this function:
Here is the caller graph for this function:

◆ PCA_alloc()

void PCA_alloc ( DistType **  coords,
int  dim,
int  n,
double **  new_coords,
int  new_dim 
)

Definition at line 23 of file pca.c.

References free(), gv_calloc(), and power_iteration().

Referenced by sparse_stress_subspace_majorization_kD().

Here is the call graph for this function:
Here is the caller graph for this function:

Variable Documentation

◆ num_pairs

int num_pairs = 4
static

Definition at line 20 of file pca.c.

Referenced by closest_pairs2graph(), find_closest_pairs(), and iterativePCA_1D().