Difference between revisions of "Polyadic/full.m"
m (Rename Arguments section heading to Parameters) |
(Update function See also links and function index membership) |
||
| (2 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{DISPLAYTITLE:polyadic/full.m}} __NOTOC__ | {{DISPLAYTITLE:polyadic/full.m}} __NOTOC__ | ||
| − | Converts a polyadic representation | + | Converts a polyadic matrix representation into a full matrix by opening all Kronecker products; the sparse type is not preserved if some cores are sparse. |
==Syntax== | ==Syntax== | ||
answer=full(p) | answer=full(p) | ||
| − | |||
| − | |||
| − | |||
==Parameters== | ==Parameters== | ||
| Line 18: | Line 15: | ||
==See also== | ==See also== | ||
| − | [[polyadic.m]], [[polyadic/inflate.m]], [[polyadic/kron.m]] | + | [[polyadic.m]], [[polyadic/inflate.m]], [[polyadic/kron.m]], [[polinfo.m]], [[polyadic/allfinite.m]], [[polyadic/ctranspose.m]], [[polyadic/gpuArray.m]], [[polyadic/isempty.m]], [[polyadic/minus.m]], [[polyadic/mtimes.m]], [[polyadic/nnz.m]], [[polyadic/plus.m]], [[polyadic/polinfo.m]], [[polyadic/prefix.m]], [[polyadic/simplify.m]], [[polyadic/size.m]], [[polyadic/suffix.m]], [[polyadic/transpose.m]], [[polyadic/validate.m]], [[Tensor_train_module]] |
''Version 2.1, authors: [[Ilya Kuprov]]'' | ''Version 2.1, authors: [[Ilya Kuprov]]'' | ||
Latest revision as of 19:39, 6 June 2026
Converts a polyadic matrix representation into a full matrix by opening all Kronecker products; the sparse type is not preserved if some cores are sparse.
Syntax
answer=full(p)
Parameters
p - a polyadic object
Outputs
answer - a full matrix
See also
polyadic.m, polyadic/inflate.m, polyadic/kron.m, polinfo.m, polyadic/allfinite.m, polyadic/ctranspose.m, polyadic/gpuArray.m, polyadic/isempty.m, polyadic/minus.m, polyadic/mtimes.m, polyadic/nnz.m, polyadic/plus.m, polyadic/polinfo.m, polyadic/prefix.m, polyadic/simplify.m, polyadic/size.m, polyadic/suffix.m, polyadic/transpose.m, polyadic/validate.m, Tensor_train_module
Version 2.1, authors: Ilya Kuprov
