@danielsimonjr/mathts-matrix 0.4.5 → 0.5.0

package/dist/index.d.ts

@@ -1986,8 +1986,24 @@ interface EigResult {
         re: number;
         im: number;
     }>;
-    /** Eigenvectors as columns (each column is an eigenvector) */
+    /**
+     * Eigenvectors as columns (each column is an eigenvector). For a real
+     * eigenvalue this is the full (real) eigenvector, unit-normalised. For a
+     * complex-conjugate eigenvalue pair this holds the REAL PART of the
+     * corresponding complex eigenvector — see {@link vectorsIm} for the
+     * imaginary part.
+     */
     vectors: number[][];
+    /**
+     * Imaginary parts of the eigenvector columns (same shape as {@link vectors}).
+     * All-zero for real eigenvalues. For a complex-conjugate eigenvalue pair at
+     * indices `j`/`j+1`, the full complex eigenvectors are
+     * `vectors[j] + i*vectorsIm[j]` (for `values[j]`) and
+     * `vectors[j+1] - i*vectorsIm[j] === vectors[j+1] + i*vectorsIm[j+1]` (for
+     * the conjugate `values[j+1]`), each unit-normalised by the complex 2-norm
+     * `sqrt(sum(re_i^2 + im_i^2))`.
+     */
+    vectorsIm: number[][];
     /** Whether the matrix was symmetric */
     isSymmetric: boolean;
 }

package/dist/index.js

@@ -5740,11 +5740,13 @@ function eigGeneral(A, computeVectors, symmetric) {
   const values = [];
   for (let j = 0; j < nn; j++) values.push({ re: d[j], im: e[j] });
   let vectors;
+  let vectorsIm;
   if (computeVectors) {
     vectors = [];
-    for (let j = 0; j < nn; j++) {
-      const vec = new Array(nn).fill(0);
+    vectorsIm = [];
+    for (let j = 0; j < nn; ) {
       if (e[j] === 0) {
+        const vec = new Array(nn).fill(0);
         let colNorm = 0;
         for (let i = 0; i < nn; i++) colNorm += V[i * nn + j] * V[i * nn + j];
         colNorm = Math.sqrt(colNorm);
@@ -5753,13 +5755,42 @@ function eigGeneral(A, computeVectors, symmetric) {
         } else {
           for (let i = 0; i < nn; i++) vec[i] = V[i * nn + j];
         }
+        vectors.push(vec);
+        vectorsIm.push(new Array(nn).fill(0));
+        j++;
+      } else {
+        const vecRe = new Array(nn).fill(0);
+        const vecIm = new Array(nn).fill(0);
+        let colNorm = 0;
+        for (let i = 0; i < nn; i++) {
+          const re = V[i * nn + j];
+          const im = V[i * nn + (j + 1)];
+          colNorm += re * re + im * im;
+        }
+        colNorm = Math.sqrt(colNorm);
+        if (colNorm > 1e-300) {
+          for (let i = 0; i < nn; i++) {
+            vecRe[i] = V[i * nn + j] / colNorm;
+            vecIm[i] = V[i * nn + (j + 1)] / colNorm;
+          }
+        } else {
+          for (let i = 0; i < nn; i++) {
+            vecRe[i] = V[i * nn + j];
+            vecIm[i] = V[i * nn + (j + 1)];
+          }
+        }
+        vectors.push(vecRe);
+        vectorsIm.push(vecIm);
+        vectors.push(vecRe.slice());
+        vectorsIm.push(vecIm.map((x2) => -x2));
+        j += 2;
       }
-      vectors.push(vec);
     }
   } else {
     vectors = eye(nn);
+    vectorsIm = Array.from({ length: nn }, () => new Array(nn).fill(0));
   }
-  return { values, vectors, isSymmetric: symmetric };
+  return { values, vectors, vectorsIm, isSymmetric: symmetric };
 }
 function eig(matrix2, options = {}) {
   const { computeVectors = true } = options;
@@ -5775,7 +5806,7 @@ function eig(matrix2, options = {}) {
   }
   const n = A.length;
   if (n === 0) {
-    return { values: [], vectors: [], isSymmetric: true };
+    return { values: [], vectors: [], vectorsIm: [], isSymmetric: true };
   }
   for (let i = 0; i < n; i++) {
     if (A[i].length !== n) {
@@ -5787,6 +5818,7 @@ function eig(matrix2, options = {}) {
     return {
       values: [{ re: A[0][0], im: 0 }],
       vectors: [[1]],
+      vectorsIm: [[0]],
       isSymmetric: symmetric
     };
   }
@@ -6224,7 +6256,7 @@ function normFro(matrix2) {
 async function eigWasm(matrix2, options) {
   const n = matrix2.length;
   if (n === 0) {
-    return { values: [], vectors: [], isSymmetric: true };
+    return { values: [], vectors: [], vectorsIm: [], isSymmetric: true };
   }
   for (let i = 0; i < n; i++) {
     if (matrix2[i].length !== n) {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@danielsimonjr/mathts-matrix",
-  "version": "0.4.5",
+  "version": "0.5.0",
   "description": "Matrix operations for MathTS with WASM/WebGPU backend support",
   "author": "Daniel Simon Jr.",
   "license": "MIT",