Polyadic.m - Revision history

Kuprov: Update function See also links and function index membership

2026-06-06T18:39:54Z

Update function See also links and function index membership

Kuprov: Polish opening prose above Syntax section

2026-06-05T18:16:10Z

Polish opening prose above Syntax section

Kuprov: Move Description section into pre-Syntax prose

2026-06-05T18:01:43Z

Move Description section into pre-Syntax prose

Kuprov: Rename Arguments section heading to Parameters

2026-06-05T17:51:10Z

Rename Arguments section heading to Parameters

Kuprov: Spot-edit Spinach function page first-line NOTOC and template fields

2026-06-05T17:28:25Z

Spot-edit Spinach function page first-line NOTOC and template fields

Kuprov: Normalise sequential blank lines

2026-04-25T11:28:28Z

Normalise sequential blank lines

Kuprov: Created page with "{{DISPLAYTITLE:polyadic.m}} Creates an object of a polyadic class. ==Syntax== p=polyadic(cores) ==Description== A polyadic is a matrix formed by a Kronecker product, w..."

2017-12-25T13:41:51Z

Created page with "{{DISPLAYTITLE:polyadic.m}} Creates an object of a polyadic class. ==Syntax== p=polyadic(cores) ==Description== A polyadic is a matrix formed by a Kronecker product, w..."

New page

{{DISPLAYTITLE:polyadic.m}}
Creates an object of a polyadic class.

==Syntax==

p=polyadic(cores)

==Description==
A polyadic is a matrix formed by a Kronecker product, with those products stored unopened. For example,

cores={{A,B,C},{D,E}}

corresponds to A(x)B(x)C + D(x)E matrix. Any multiplicative action by this matrix may be computed without opening the Kronecker products. This can save orders of magnitude in CPU time.

==Arguments==

cores - a cell array of cell arrays of matrices
whose Konecker products make up the mat-
rix of interest.

==Outputs==

p - a polyadic representation of a matrix
that behaves in many respects like the
matrix it represents.

==Notes==
Nested polyadics are permitted - the input matrices may be polyadics themselves.

==See also==
[[kronm.m]]

''Version 2.1, authors: [[Ilya Kuprov]]''

@@ Line 1: / Line 1: @@
 {{DISPLAYTITLE:polyadic.m}} __NOTOC__
-Creates an object of a polyadic class.
+Creates a polyadic object representing a matrix as a sum of unopened Kronecker products, for example a two-term object with cores {A,B,C} and {D,E} represents A(x)B(x)C + D(x)E; multiplicative actions can then be computed without expanding the Kronecker products, which can save orders of magnitude in CPU time.
 ==Syntax==

← Older revision		Revision as of 17:28, 5 June 2026
Line 1:		Line 1:
−	{{DISPLAYTITLE:polyadic.m}}	+	{{DISPLAYTITLE:polyadic.m}} __NOTOC__
	Creates an object of a polyadic class.		Creates an object of a polyadic class.

@@ Line 22: / Line 22: @@
 ==See also==
-[[kronm.m]]
+[[kronm.m]], [[ttclass.m]], [[Tensor_train_module]]
 ''Version 2.1, authors: [[Ilya Kuprov]]''

@@ Line 2: / Line 2: @@
 Creates an object of a polyadic class.
 A polyadic is a matrix formed by a Kronecker product, with those products stored unopened. For example,
@@ Line 12: / Line 7: @@
 corresponds to A(x)B(x)C + D(x)E matrix. Any multiplicative action by this matrix may be computed without opening the Kronecker products. This can save orders of magnitude in CPU time.
 ==Parameters==

@@ Line 13: / Line 13: @@
 corresponds to A(x)B(x)C + D(x)E matrix. Any multiplicative action by this matrix may be computed without opening the Kronecker products. This can save orders of magnitude in CPU time.
-==Arguments==
+==Parameters==
           cores -    a cell array of cell arrays of matrices