Skip to content

Applied part of my bachelor's thesis titled "Rank-1 tensor completion with group actions". Contains algorithms written in Macaulay2 and C++ for finding out how many of partial tensors of given size are finitely completable for each possible number of observed entries.

Notifications You must be signed in to change notification settings

SakuMyl/TensorCompletion

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

45 Commits
 
 
 
 
 
 

Repository files navigation

This repository contains algorithms for computing how many of partial tensors of given size are finitely completable for each possible number of known entries.

Navigate to source folder: cd src

Compile: g++ completions_random_values.cpp -o main -llapack -larmadillo -lblas

Run: ./main

About

Applied part of my bachelor's thesis titled "Rank-1 tensor completion with group actions". Contains algorithms written in Macaulay2 and C++ for finding out how many of partial tensors of given size are finitely completable for each possible number of observed entries.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published