@danielsimonjr/mathts-matrix 0.1.2 → 0.1.3

package/README.md

@@ -11,36 +11,32 @@ npm install @danielsimonjr/mathts-matrix
 ## Usage
 
 ```typescript
-import { Matrix, DenseMatrix, backends } from '@danielsimonjr/mathts-matrix';
+import { DenseMatrix } from '@danielsimonjr/mathts-matrix';
 
 // Create a matrix from a 2D array
-const A = Matrix.from([
+const A = DenseMatrix.fromArray([
   [1, 2, 3],
   [4, 5, 6],
-  [7, 8, 9]
+  [7, 8, 9],
 ]);
 
-// Basic operations (coming soon)
-const det = A.determinant();
-const inv = A.inverse();
-const eig = A.eigenvalues();
-
-// Configure backend
-backends.configure({
-  backend: 'wasm',      // Force WASM backend
-  autoBackend: true,    // Or let it auto-select
-  wasmThreshold: 1000,  // Switch to WASM above 1000 elements
-  gpuThreshold: 100000, // Switch to GPU above 100K elements
-});
+// Basic operations
+const sum = A.add(A);
+const product = A.multiply(A);
+const transposed = A.transpose();
+
+// Decompositions (operate on number[][])
+import { svd, eig } from '@danielsimonjr/mathts-matrix';
+const { U, S, V } = svd(A.toArray());
 ```
 
 ## Backends
 
-| Backend | Trigger | Performance |
-|---------|---------|-------------|
-| **JS** | Default | 1x baseline |
-| **WASM** | >1K elements | ~10x faster |
-| **GPU** | >100K elements | ~100x faster |
+| Backend  | Trigger        | Performance  |
+| -------- | -------------- | ------------ |
+| **JS**   | Default        | 1x baseline  |
+| **WASM** | >1K elements   | ~10x faster  |
+| **GPU**  | >100K elements | ~100x faster |
 
 ## Matrix Types
 
@@ -55,11 +51,11 @@ This package is under active development. Currently implemented:
 - [x] Backend infrastructure
 - [x] Dense matrix structure
 - [x] Sparse matrix (CSR) structure
-- [ ] Matrix operations (add, multiply, etc.)
-- [ ] WASM backend
-- [ ] GPU backend
-- [ ] LU/QR/SVD decompositions
-- [ ] Eigenvalue solvers
+- [x] Matrix operations (add, multiply, transpose, etc.)
+- [x] WASM backend (Rust primary, AssemblyScript legacy)
+- [x] GPU backend (WebGPU)
+- [x] SVD decomposition
+- [x] Eigenvalue solvers
 
 ## License
 

package/dist/chunk-PNKVD2UK.js

@@ -0,0 +1,26 @@
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __esm = (fn, res) => function __init() {
+  return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])(fn = 0)), res;
+};
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+export {
+  __esm,
+  __export,
+  __toCommonJS
+};

package/dist/{chunk-I6QDZ7SC.js → chunk-VCPLE6ED.js}

@@ -1,24 +1,3 @@
-var __defProp = Object.defineProperty;
-var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
-var __getOwnPropNames = Object.getOwnPropertyNames;
-var __hasOwnProp = Object.prototype.hasOwnProperty;
-var __esm = (fn, res) => function __init() {
-  return fn && (res = (0, fn[__getOwnPropNames(fn)[0]])(fn = 0)), res;
-};
-var __export = (target, all) => {
-  for (var name in all)
-    __defProp(target, name, { get: all[name], enumerable: true });
-};
-var __copyProps = (to, from, except, desc) => {
-  if (from && typeof from === "object" || typeof from === "function") {
-    for (let key of __getOwnPropNames(from))
-      if (!__hasOwnProp.call(to, key) && key !== except)
-        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
-  }
-  return to;
-};
-var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
-
 // src/operations/eig.ts
 var DEFAULT_MAX_ITERATIONS = 1e3;
 var DEFAULT_TOLERANCE = 1e-12;
@@ -103,7 +82,7 @@ function applyHouseholderRight(A, v, beta, startRow, startCol) {
 function hessenberg(A) {
   const n = A.length;
   const H = cloneMatrix(A);
-  let Q = eye(n);
+  const Q = eye(n);
   for (let k = 0; k < n - 2; k++) {
     const x = [];
     for (let i = k + 1; i < n; i++) {
@@ -300,7 +279,7 @@ function inverseIteration(A, eigenvalue, tolerance, maxIterations) {
       }
     }
   }
-  let v = new Array(n).fill(1);
+  const v = new Array(n).fill(1);
   let prevNorm = 0;
   for (let iter = 0; iter < maxIterations; iter++) {
     const y = new Array(n).fill(0);
@@ -352,10 +331,7 @@ function eig(matrix, options = {}) {
     if (n2 !== Math.floor(n2)) {
       throw new Error("Float64Array length must be a perfect square");
     }
-    A = Array.from(
-      { length: n2 },
-      (_, i) => Array.from({ length: n2 }, (_2, j) => matrix[i * n2 + j])
-    );
+    A = Array.from({ length: n2 }, (_, i) => Array.from({ length: n2 }, (_2, j) => matrix[i * n2 + j]));
   } else {
     A = matrix;
   }
@@ -387,7 +363,10 @@ function eig(matrix, options = {}) {
       const sqrtDisc = Math.sqrt(disc);
       const e1 = (trace + sqrtDisc) / 2;
       const e2 = (trace - sqrtDisc) / 2;
-      values2 = [{ re: e1, im: 0 }, { re: e2, im: 0 }];
+      values2 = [
+        { re: e1, im: 0 },
+        { re: e2, im: 0 }
+      ];
       if (computeVectors) {
         vectors2 = [];
         for (const e of [e1, e2]) {
@@ -488,9 +467,6 @@ function powerIteration(matrix, options = {}) {
 }
 
 export {
-  __esm,
-  __export,
-  __toCommonJS,
   eig,
   eigvals,
   powerIteration

package/dist/{eig-YRLUBCGK.js → eig-D5URIBNL.js}

@@ -2,7 +2,8 @@ import {
   eig,
   eigvals,
   powerIteration
-} from "./chunk-I6QDZ7SC.js";
+} from "./chunk-VCPLE6ED.js";
+import "./chunk-PNKVD2UK.js";
 export {
   eig,
   eigvals,