@danielsimonjr/mathts-tensor 0.2.2 → 0.2.4

package/dist/index.d.ts

@@ -78,14 +78,15 @@ declare function idx(dim: number, name?: string, opts?: Omit<IndexOpts, 'name'>)
 
 /**
  * Tensor — rank-N, Float64Array-backed, row-major dense tensor. The
- * compute primitive behind @danielsimonjr/mathts-tensor. Construction +
- * elementwise here; einsum / matMul / transpose / reshape in the same
- * file, added by the next task.
- *
- * Naive O(n) algorithms — a correctness baseline. Mirrors the storage
- * pattern of DenseMatrix (Float64Array, row-major) but generalised to
- * arbitrary rank, filling the `Matrix<T>` base class's documented
- * "generic template for future rank-N support".
+ * compute primitive behind @danielsimonjr/mathts-tensor. Construction,
+ * elementwise, einsum, matMul, transpose, reshape live here.
+ *
+ * Element-wise and data-movement ops are straightforward O(n) loops (a
+ * correctness baseline). Heavy ops delegate to the standard packages rather
+ * than reinventing them: `matMul` uses matrix's backend-selected multiply
+ * (SIMD-WASM for large inputs), and the decompositions (in `operations/`)
+ * route through matrix's `svd`/`eig`/`lu`/`qr`/`cholesky`. Storage mirrors
+ * DenseMatrix (Float64Array, row-major), generalised to arbitrary rank.
  */
 
 type NestedArray = number | NestedArray[];

package/dist/index.js

@@ -1,5 +1,5 @@
 // src/Tensor.ts
-import { DenseMatrix } from "@danielsimonjr/mathts-matrix";
+import { DenseMatrix, backendManager } from "@danielsimonjr/mathts-matrix";
 var Tensor = class _Tensor {
   shape;
   data;
@@ -535,15 +535,11 @@ var Tensor = class _Tensor {
     const [m, k] = this.shape;
     const [k2, n] = other.shape;
     if (k !== k2) throw new Error(`Tensor.matMul: inner dimension mismatch ${k} != ${k2}`);
-    const out = new Float64Array(m * n);
-    for (let i = 0; i < m; i++) {
-      for (let j = 0; j < n; j++) {
-        let sum = 0;
-        for (let q = 0; q < k; q++) sum += this.data[i * k + q] * other.data[q * n + j];
-        out[i * n + j] = sum;
-      }
-    }
-    return new _Tensor([m, n], out);
+    const c = backendManager.multiply(
+      new DenseMatrix(m, k, this.data),
+      new DenseMatrix(k, n, other.data)
+    );
+    return new _Tensor([m, n], c.toFloat64Array());
   }
   static einsum(spec, ...operands) {
     const inStrides = operands.map((o) => _Tensor.rowMajorStrides(o.shape));

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-tensor",
-  "version": "0.2.2",
+  "version": "0.2.4",
   "description": "Rank-N dense Tensor type for MathTS with Float64Array-backed storage",
   "author": "Daniel Simon Jr.",
   "license": "MIT",
@@ -31,8 +31,8 @@
     "build:prod": "tsup src/index.ts --format esm --dts --clean --minify --treeshake"
   },
   "dependencies": {
-    "@danielsimonjr/mathts-core": "^0.3.0",
-    "@danielsimonjr/mathts-matrix": "^0.1.12"
+    "@danielsimonjr/mathts-core": "^0.4.0",
+    "@danielsimonjr/mathts-matrix": "^0.1.14"
   },
   "devDependencies": {
     "@types/node": "^25.5.2",