Kronecker product: Difference between revisions

← Older edit

Kronecker product (view source)

Revision as of 15:18, 28 April 2024

4,549 bytes added , 21 days ago

Added Yabasic

Jjuanhdez

2,122

edits

Revision as of 03:11, 24 August 2023 (view source) imported>Maxima enthusiast (→‎{{header\|Maxima}}) ← Older edit		Latest revision as of 15:18, 28 April 2024 (view source) Jjuanhdez (talk \| contribs) (Added Yabasic)
(6 intermediate revisions by 6 users not shown)
Line 1,076: </pre> =={{header\|~~BQN~~BASIC}}== ==={{header\|BASIC256}}=== {{trans\|FreeBASIC}} <syntaxhighlight lang="vbnet">arraybase 1 dim a(2, 2) a[1,1] = 1 : a[1,2] = 2 : a[2,1] = 3 : a[2,2] = 4 dim b(2, 2) b[1,1] = 0 : b[1,2] = 5 : b[2,1] = 6 : b[2,2] = 7 call kronecker_product(a, b) print dim x(3, 3) x[1,1] = 0 : x[1,2] = 1 : x[1,3] = 0 x[2,1] = 1 : x[2,2] = 1 : x[2,3] = 1 x[3,1] = 0 : x[3,2] = 1 : x[3,3] = 0 dim y(3, 4) y[1,1] = 1 : y[1,2] = 1 : y[1,3] = 1 : y[1,4] = 1 y[2,1] = 1 : y[2,2] = 0 : y[2,3] = 0 : y[2,4] = 1 y[3,1] = 1 : y[3,2] = 1 : y[3,3] = 1 : y[3,4] = 1 call kronecker_product(x, y) end subroutine kronecker_product(a, b) ua1 = a[?][] ua2 = a[][?] ub1 = b[?][] ub2 = b[][?] for i = 1 to ua1 for k = 1 to ub1 print "["; for j = 1 to ua2 for l = 1 to ub2 print rjust(a[i, j] * b[k, l], 2); if j = ua1 and l = ub2 then print "]" else print " "; endif next next next next end subroutine</syntaxhighlight> {{out}} <pre>Same as FreeBASIC entry.</pre> ==={{header\|Yabasic}}=== {{trans\|FreeBASIC}} <syntaxhighlight lang="vbnet">print dim a(2, 2) a(1,1) = 1 : a(1,2) = 2 : a(2,1) = 3 : a(2,2) = 4 dim b(2, 2) b(1,1) = 0 : b(1,2) = 5 : b(2,1) = 6 : b(2,2) = 7 kronecker_product(a, b) print dim a(3, 3) a(1,1) = 0 : a(1,2) = 1 : a(1,3) = 0 a(2,1) = 1 : a(2,2) = 1 : a(2,3) = 1 a(3,1) = 0 : a(3,2) = 1 : a(3,3) = 0 dim b(3, 4) b(1,1) = 1 : b(1,2) = 1 : b(1,3) = 1 : b(1,4) = 1 b(2,1) = 1 : b(2,2) = 0 : b(2,3) = 0 : b(2,4) = 1 b(3,1) = 1 : b(3,2) = 1 : b(3,3) = 1 : b(3,4) = 1 kronecker_product(a, b) end sub kronecker_product(a, b) local i, j, k, l ua1 = arraysize(a(), 1) ua2 = arraysize(a(), 2) ub1 = arraysize(b(), 1) ub2 = arraysize(b(), 2) for i = 1 to ua1 for k = 1 to ub1 print "["; for j = 1 to ua2 for l = 1 to ub2 print a(i, j) * b(k, l) using "##"; if j = ua1 and l = ub2 then print "]" else print " "; endif next next next next end sub</syntaxhighlight> {{out}} <pre>Same as FreeBASIC entry.</pre> =={{header\|BQN}}== <syntaxhighlight lang="bqn">KProd ← ∾·<⎉2 ×⌜</syntaxhighlight> Line 1,509 ⟶ 1,603: \| 0 0 0 0 1 0 0 1 0 0 0 0\| \| 0 0 0 0 1 1 1 1 0 0 0 0\| </pre> =={{header\|F_Sharp\|F#}}== <syntaxhighlight lang="fsharp"> // Kronecker product. Nigel Galloway: August 31st., 2023 open MathNet.Numerics open MathNet.Numerics.LinearAlgebra let m1,m2,m3,m4=matrix [[1.0;2.0];[3.0;4.0]],matrix [[0.0;5.0];[6.0;7.0]],matrix [[0.0;1.0;0.0];[1.0;1.0;1.0];[0.0;1.0;0.0]],matrix [[1.0;1.0;1.0;1.0];[1.0;0.0;0.0;1.0];[1.0;1.0;1.0;1.0]] printfn $"{(m1.KroneckerProduct m2).ToMatrixString()}" printfn $"{(m3.KroneckerProduct m4).ToMatrixString()}" </syntaxhighlight> {{out}} <pre> 0 5 0 10 6 7 12 14 0 15 0 20 18 21 24 28 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 1 1 1 1 0 0 0 0 </pre> Line 1,749 ⟶ 1,870: {{FormulaeEntry\|page=https://formulae.org/?script=examples/Kronecker_product}} '''Solution''' Kronecker product is an intrinsec operation in Fōrmulæ '''Test case 1''' [[File:Fōrmulæ - Kronecker product 01.png]] [[File:Fōrmulæ - Kronecker product 02.png]] '''Test case 2''' [[File:Fōrmulæ - Kronecker product 03.png]] [[File:Fōrmulæ - Kronecker product 04.png]] A function to calculate the Kronecker product can also be written: [[File:Fōrmulæ - Kronecker product 05.png]] [[File:Fōrmulæ - Kronecker product 06.png]] [[File:Fōrmulæ - Kronecker product 02.png]] =={{header\|Go}}== Line 2,766 ⟶ 2,911: args(%%), makelist(apply(append,%%[i]),i,1,length(%%)), apply(matrix,%%)); </syntaxhighlight> Another implementation that does not make use of auxkron <syntaxhighlight lang="maxima"> altern_kronecker(MatA,MatB):=block(auxlength:length(first(args(MatA))), makelist(iargs(MatB),i,flatten(args(MatA))), makelist(apply(matrix,%%[i]),i,1,length(%%)), lst_equally_subdivided(%%,auxlength), makelist(apply(addcol,%%[i]),i,1,length(%%)), map(args,%%), apply(append,%%), apply(matrix,%%)); </syntaxhighlight> Line 2,796 ⟶ 2,953: ) / /* altern_kronecker gives the same outputs / </pre> Line 3,936 ⟶ 4,094: ≪ DUP SIZE LIST→ DROP 4 ROLL DUP SIZE LIST→ DROP → b p q a m n ≪ {} m p + n q * + 0 CON 1 m p * '''FOR''' row 1 n q * '''FOR''' col a {} row 1 - p / IP 1 + + col 1 - q / IP 1 + + GET b {} row 1 - p MOD 1 + + col 1 - q MOD 1 + + GET * {} row + col + SWAP PUT '''NEXT NEXT''' ≫ ≫ '<span style="color:blue">KROKR</span>' STO ~~NEXT~~ ====HP-49 version==== ~~≫ ≫~~ ≪ DUP SIZE LIST→ DROP 4 PICK SIZE LIST→ DROP → a b rb cb ra ca ~~´KROKR´ STO~~ ≪ a SIZE b SIZE * 0 CON 0 ra 1 - '''FOR''' j 0 ca 1 - '''FOR''' k { 1 1 } { } j + k + DUP2 ADD a SWAP GET UNROT { } ra + ca + * ADD SWAP b * REPL '''NEXT NEXT''' ≫ ≫ '<span style="color:blue">KROKR</span>' STO [[1, 2], [3, 4]] [[0, 5], [6, 7]] <span style="color:blue">KROKR</span> [[0, 1, 0], [1, 1, 1], [0, 1, 0]] [[1, 1, 1, 1], [1, 0, 0, 1], [1, 1, 1, 1]] <span style="color:blue">KROKR</span> {{out}} <pre> Line 4,846 ⟶ 5,014: {{libheader\|Wren-matrix}} The above module already includes a method to calculate the Kronecker product. <syntaxhighlight lang="~~ecmascript~~wren">import "./fmt" for Fmt import "./matrix" for Matrix var a1 = [