@theerapat-s28/ts-structural-eng-tools 1.5.0 → 2.1.0

package/dist/rc/rc-section-properties.js

@@ -0,0 +1,59 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.rectBeamToSectionProperties = void 0;
+const frame_constant_1 = require("../core/constants/frame.constant");
+const general_1 = require("./general");
+/**
+ * Saint-Venant torsion constant of a solid rectangle:
+ * `J = a·t³·(1/3 − 0.21·(t/a)·(1 − t⁴/(12a⁴)))`, with a the longer and t the shorter side.
+ */
+const rectangleTorsionConstant = (b, h) => {
+    const a = Math.max(b, h);
+    const t = Math.min(b, h);
+    return a * t ** 3 * (1 / 3 - 0.21 * (t / a) * (1 - t ** 4 / (12 * a ** 4)));
+};
+/**
+ * Converts a rectangular RC beam section into `SectionProperties` for frame analysis.
+ *
+ * Local 2 is taken along the depth `h` and local 3 along the width `b`, so
+ * `I33 = m·b·h³/12` (major axis) and `I22 = m·h·b³/12`, where m is the inertia modifier.
+ * The modifier is applied to the bending inertias only; A and J are gross values, and the
+ * unit weight (for self-weight) acts on the gross area.
+ *
+ * @param section - Rectangular RC section (uses `fc_`, `b` and `h`)
+ * @param options - Member type or explicit inertia modifier, Poisson's ratio
+ * @returns Object containing `sectionProperties`, `calculationDetails`, `unit`, and `warnings`
+ */
+const rectBeamToSectionProperties = (section, options = {}) => {
+    const warnings = [];
+    const member = options.member ?? "beam";
+    const modifier = options.inertiaModifier ??
+        (member === "beam" ? frame_constant_1.BEAM_INERTIA_MODIFIER : member === "column" ? frame_constant_1.COLUMN_INERTIA_MODIFIER : 1);
+    const nu = options.poissonRatio ?? frame_constant_1.CONCRETE_POISSON_RATIO;
+    const unitWeight = options.unitWeight ?? frame_constant_1.CONCRETE_UNIT_WEIGHT;
+    const { fc_, b, h } = section;
+    if (modifier === 1) {
+        warnings.push({
+            reference: "ACI318-19, 6.6.3.1.1",
+            message: "Gross-section inertia used; elastic analysis at factored load level should use the reduced moments of inertia (0.35Ig beams, 0.70Ig columns).",
+        });
+    }
+    const E = (0, general_1.concreteElasticModulus)(fc_);
+    const sectionProperties = {
+        E,
+        G: E / (2 * (1 + nu)),
+        A: b * h,
+        I22: (modifier * h * b ** 3) / 12,
+        I33: (modifier * b * h ** 3) / 12,
+        J: rectangleTorsionConstant(b, h),
+        unitWeight,
+    };
+    return {
+        sectionProperties,
+        calculationDetails: { inertiaModifier: modifier, poissonRatio: nu, unitWeight },
+        unit: "N, mm, MPa",
+        warnings,
+    };
+};
+exports.rectBeamToSectionProperties = rectBeamToSectionProperties;
+//# sourceMappingURL=rc-section-properties.js.map

package/dist/rc/rc-section-properties.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rc-section-properties.js","sourceRoot":"","sources":["../../src/rc/rc-section-properties.ts"],"names":[],"mappings":";;;AAAA,uEAK4C;AAK5C,uCAAmD;AAanD;;;GAGG;AACH,MAAM,wBAAwB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAChE,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC9E,CAAC,CAAC;AAEF;;;;;;;;;;;GAWG;AACI,MAAM,2BAA2B,GAAG,CACzC,OAAiD,EACjD,UAAoC,EAAE,EACtC,EAAE;IACF,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,MAAM,CAAC;IACxC,MAAM,QAAQ,GACZ,OAAO,CAAC,eAAe;QACvB,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,sCAAqB,CAAC,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,wCAAuB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClG,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,IAAI,uCAAsB,CAAC;IAC1D,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,IAAI,qCAAoB,CAAC;IAC9D,MAAM,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,GAAG,OAAO,CAAC;IAE9B,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;QACnB,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS,EAAE,sBAAsB;YACjC,OAAO,EACL,+IAA+I;SAClJ,CAAC,CAAC;IACL,CAAC;IAED,MAAM,CAAC,GAAG,IAAA,gCAAsB,EAAC,GAAG,CAAC,CAAC;IACtC,MAAM,iBAAiB,GAAsB;QAC3C,CAAC;QACD,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACrB,CAAC,EAAE,CAAC,GAAG,CAAC;QACR,GAAG,EAAE,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE;QACjC,GAAG,EAAE,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE;QACjC,CAAC,EAAE,wBAAwB,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,UAAU;KACX,CAAC;IAEF,OAAO;QACL,iBAAiB;QACjB,kBAAkB,EAAE,EAAE,eAAe,EAAE,QAAQ,EAAE,YAAY,EAAE,EAAE,EAAE,UAAU,EAAE;QAC/E,IAAI,EAAE,YAAY;QAClB,QAAQ;KACT,CAAC;AACJ,CAAC,CAAC;AAtCW,QAAA,2BAA2B,+BAsCtC"}

package/dist/utils/index.d.ts

@@ -1,2 +1,6 @@
 export { solveQuadratic, roundToDecimalPlaces } from "./math";
 export { mergeWarnings } from "./merge-warning";
+export type { Matrix } from "./matrix";
+export { zeros, identity, transpose, matMul, matVec, choleskyFactor, choleskySolveFactored, choleskySolve, solveLinearSystem, } from "./matrix";
+export type { SkylineMatrix } from "./skyline";
+export { createSkyline, skylineAdd, skylineGet, skylineSize, skylineFactor, skylineSolve, reverseCuthillMcKee, } from "./skyline";

package/dist/utils/index.js

@@ -1,9 +1,27 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.mergeWarnings = exports.roundToDecimalPlaces = exports.solveQuadratic = void 0;
+exports.reverseCuthillMcKee = exports.skylineSolve = exports.skylineFactor = exports.skylineSize = exports.skylineGet = exports.skylineAdd = exports.createSkyline = exports.solveLinearSystem = exports.choleskySolve = exports.choleskySolveFactored = exports.choleskyFactor = exports.matVec = exports.matMul = exports.transpose = exports.identity = exports.zeros = exports.mergeWarnings = exports.roundToDecimalPlaces = exports.solveQuadratic = void 0;
 var math_1 = require("./math");
 Object.defineProperty(exports, "solveQuadratic", { enumerable: true, get: function () { return math_1.solveQuadratic; } });
 Object.defineProperty(exports, "roundToDecimalPlaces", { enumerable: true, get: function () { return math_1.roundToDecimalPlaces; } });
 var merge_warning_1 = require("./merge-warning");
 Object.defineProperty(exports, "mergeWarnings", { enumerable: true, get: function () { return merge_warning_1.mergeWarnings; } });
+var matrix_1 = require("./matrix");
+Object.defineProperty(exports, "zeros", { enumerable: true, get: function () { return matrix_1.zeros; } });
+Object.defineProperty(exports, "identity", { enumerable: true, get: function () { return matrix_1.identity; } });
+Object.defineProperty(exports, "transpose", { enumerable: true, get: function () { return matrix_1.transpose; } });
+Object.defineProperty(exports, "matMul", { enumerable: true, get: function () { return matrix_1.matMul; } });
+Object.defineProperty(exports, "matVec", { enumerable: true, get: function () { return matrix_1.matVec; } });
+Object.defineProperty(exports, "choleskyFactor", { enumerable: true, get: function () { return matrix_1.choleskyFactor; } });
+Object.defineProperty(exports, "choleskySolveFactored", { enumerable: true, get: function () { return matrix_1.choleskySolveFactored; } });
+Object.defineProperty(exports, "choleskySolve", { enumerable: true, get: function () { return matrix_1.choleskySolve; } });
+Object.defineProperty(exports, "solveLinearSystem", { enumerable: true, get: function () { return matrix_1.solveLinearSystem; } });
+var skyline_1 = require("./skyline");
+Object.defineProperty(exports, "createSkyline", { enumerable: true, get: function () { return skyline_1.createSkyline; } });
+Object.defineProperty(exports, "skylineAdd", { enumerable: true, get: function () { return skyline_1.skylineAdd; } });
+Object.defineProperty(exports, "skylineGet", { enumerable: true, get: function () { return skyline_1.skylineGet; } });
+Object.defineProperty(exports, "skylineSize", { enumerable: true, get: function () { return skyline_1.skylineSize; } });
+Object.defineProperty(exports, "skylineFactor", { enumerable: true, get: function () { return skyline_1.skylineFactor; } });
+Object.defineProperty(exports, "skylineSolve", { enumerable: true, get: function () { return skyline_1.skylineSolve; } });
+Object.defineProperty(exports, "reverseCuthillMcKee", { enumerable: true, get: function () { return skyline_1.reverseCuthillMcKee; } });
 //# sourceMappingURL=index.js.map

package/dist/utils/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":";;;AAAA,+BAA8D;AAArD,sGAAA,cAAc,OAAA;AAAE,4GAAA,oBAAoB,OAAA;AAC7C,iDAAgD;AAAvC,8GAAA,aAAa,OAAA"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/utils/index.ts"],"names":[],"mappings":";;;AAAA,+BAA8D;AAArD,sGAAA,cAAc,OAAA;AAAE,4GAAA,oBAAoB,OAAA;AAC7C,iDAAgD;AAAvC,8GAAA,aAAa,OAAA;AAEtB,mCAUkB;AAThB,+FAAA,KAAK,OAAA;AACL,kGAAA,QAAQ,OAAA;AACR,mGAAA,SAAS,OAAA;AACT,gGAAA,MAAM,OAAA;AACN,gGAAA,MAAM,OAAA;AACN,wGAAA,cAAc,OAAA;AACd,+GAAA,qBAAqB,OAAA;AACrB,uGAAA,aAAa,OAAA;AACb,2GAAA,iBAAiB,OAAA;AAGnB,qCAQmB;AAPjB,wGAAA,aAAa,OAAA;AACb,qGAAA,UAAU,OAAA;AACV,qGAAA,UAAU,OAAA;AACV,sGAAA,WAAW,OAAA;AACX,wGAAA,aAAa,OAAA;AACb,uGAAA,YAAY,OAAA;AACZ,8GAAA,mBAAmB,OAAA"}

package/dist/utils/matrix.d.ts

@@ -0,0 +1,45 @@
+export type Matrix = number[][];
+/** Returns an m×n zero matrix. */
+export declare const zeros: (m: number, n: number) => Matrix;
+/** Returns the n×n identity matrix. */
+export declare const identity: (n: number) => Matrix;
+/** Returns the transpose of a matrix. */
+export declare const transpose: (A: Matrix) => Matrix;
+/** Returns the product A·B of an m×n and an n×p matrix. */
+export declare const matMul: (A: Matrix, B: Matrix) => Matrix;
+/** Returns the product A·x of an m×n matrix and an n-vector. */
+export declare const matVec: (A: Matrix, x: number[]) => number[];
+/**
+ * Cholesky factorisation A = L·Lᵀ of a symmetric positive-definite matrix.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The lower-triangular factor L, or `null` when A is not positive definite (singular or a mechanism)
+ */
+export declare const choleskyFactor: (A: Matrix, tolerance?: number) => Matrix | null;
+/**
+ * Solves A·x = b from the Cholesky factor L of A (forward then back substitution), so one
+ * factorisation serves any number of right-hand sides.
+ *
+ * @param L - Lower-triangular factor from `choleskyFactor`
+ * @param b - Right-hand side
+ */
+export declare const choleskySolveFactored: (L: Matrix, b: number[]) => number[];
+/**
+ * Solves A·x = b for a symmetric positive-definite A by Cholesky factorisation.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param b - Right-hand side
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The solution, or `null` when A is not positive definite (singular or a mechanism)
+ */
+export declare const choleskySolve: (A: Matrix, b: number[], tolerance?: number) => number[] | null;
+/**
+ * Solves A·X = B for a general square A by Gaussian elimination with partial pivoting.
+ *
+ * @param A - n×n matrix
+ * @param B - n×p right-hand-side matrix
+ * @param tolerance - A pivot at or below `tolerance` times the largest entry of A is treated as zero
+ * @returns The n×p solution, or `null` when A is singular
+ */
+export declare const solveLinearSystem: (A: Matrix, B: Matrix, tolerance?: number) => Matrix | null;

package/dist/utils/matrix.js

@@ -0,0 +1,157 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.solveLinearSystem = exports.choleskySolve = exports.choleskySolveFactored = exports.choleskyFactor = exports.matVec = exports.matMul = exports.transpose = exports.identity = exports.zeros = void 0;
+/** Returns an m×n zero matrix. */
+const zeros = (m, n) => Array.from({ length: m }, () => new Array(n).fill(0));
+exports.zeros = zeros;
+/** Returns the n×n identity matrix. */
+const identity = (n) => {
+    const I = (0, exports.zeros)(n, n);
+    for (let i = 0; i < n; i++)
+        I[i][i] = 1;
+    return I;
+};
+exports.identity = identity;
+/** Returns the transpose of a matrix. */
+const transpose = (A) => {
+    const m = A.length;
+    const n = A[0].length;
+    const T = (0, exports.zeros)(n, m);
+    for (let i = 0; i < m; i++) {
+        for (let j = 0; j < n; j++)
+            T[j][i] = A[i][j];
+    }
+    return T;
+};
+exports.transpose = transpose;
+/** Returns the product A·B of an m×n and an n×p matrix. */
+const matMul = (A, B) => {
+    const m = A.length;
+    const n = B.length;
+    const p = B[0].length;
+    const C = (0, exports.zeros)(m, p);
+    for (let i = 0; i < m; i++) {
+        for (let k = 0; k < n; k++) {
+            const aik = A[i][k];
+            if (aik === 0)
+                continue;
+            for (let j = 0; j < p; j++)
+                C[i][j] += aik * B[k][j];
+        }
+    }
+    return C;
+};
+exports.matMul = matMul;
+/** Returns the product A·x of an m×n matrix and an n-vector. */
+const matVec = (A, x) => A.map((row) => row.reduce((sum, a, j) => sum + a * x[j], 0));
+exports.matVec = matVec;
+/**
+ * Cholesky factorisation A = L·Lᵀ of a symmetric positive-definite matrix.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The lower-triangular factor L, or `null` when A is not positive definite (singular or a mechanism)
+ */
+const choleskyFactor = (A, tolerance = 1e-12) => {
+    const n = A.length;
+    const L = (0, exports.zeros)(n, n);
+    for (let i = 0; i < n; i++) {
+        for (let j = 0; j <= i; j++) {
+            let sum = A[i][j];
+            for (let k = 0; k < j; k++)
+                sum -= L[i][k] * L[j][k];
+            if (i === j) {
+                if (!(sum > tolerance * A[i][i]))
+                    return null;
+                L[i][i] = Math.sqrt(sum);
+            }
+            else {
+                L[i][j] = sum / L[j][j];
+            }
+        }
+    }
+    return L;
+};
+exports.choleskyFactor = choleskyFactor;
+/**
+ * Solves A·x = b from the Cholesky factor L of A (forward then back substitution), so one
+ * factorisation serves any number of right-hand sides.
+ *
+ * @param L - Lower-triangular factor from `choleskyFactor`
+ * @param b - Right-hand side
+ */
+const choleskySolveFactored = (L, b) => {
+    const n = L.length;
+    const y = new Array(n).fill(0);
+    for (let i = 0; i < n; i++) {
+        let sum = b[i];
+        for (let k = 0; k < i; k++)
+            sum -= L[i][k] * y[k];
+        y[i] = sum / L[i][i];
+    }
+    const x = new Array(n).fill(0);
+    for (let i = n - 1; i >= 0; i--) {
+        let sum = y[i];
+        for (let k = i + 1; k < n; k++)
+            sum -= L[k][i] * x[k];
+        x[i] = sum / L[i][i];
+    }
+    return x;
+};
+exports.choleskySolveFactored = choleskySolveFactored;
+/**
+ * Solves A·x = b for a symmetric positive-definite A by Cholesky factorisation.
+ *
+ * @param A - Symmetric matrix (only the lower triangle is read)
+ * @param b - Right-hand side
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns The solution, or `null` when A is not positive definite (singular or a mechanism)
+ */
+const choleskySolve = (A, b, tolerance = 1e-12) => {
+    const L = (0, exports.choleskyFactor)(A, tolerance);
+    return L ? (0, exports.choleskySolveFactored)(L, b) : null;
+};
+exports.choleskySolve = choleskySolve;
+/**
+ * Solves A·X = B for a general square A by Gaussian elimination with partial pivoting.
+ *
+ * @param A - n×n matrix
+ * @param B - n×p right-hand-side matrix
+ * @param tolerance - A pivot at or below `tolerance` times the largest entry of A is treated as zero
+ * @returns The n×p solution, or `null` when A is singular
+ */
+const solveLinearSystem = (A, B, tolerance = 1e-12) => {
+    const n = A.length;
+    const p = B[0].length;
+    const M = A.map((row, i) => [...row, ...B[i]]);
+    const scale = Math.max(...A.map((row) => Math.max(...row.map(Math.abs))));
+    for (let col = 0; col < n; col++) {
+        let pivot = col;
+        for (let r = col + 1; r < n; r++) {
+            if (Math.abs(M[r][col]) > Math.abs(M[pivot][col]))
+                pivot = r;
+        }
+        if (!(Math.abs(M[pivot][col]) > tolerance * scale))
+            return null;
+        [M[col], M[pivot]] = [M[pivot], M[col]];
+        for (let r = col + 1; r < n; r++) {
+            const factor = M[r][col] / M[col][col];
+            if (factor === 0)
+                continue;
+            for (let c = col; c < n + p; c++)
+                M[r][c] -= factor * M[col][c];
+        }
+    }
+    const X = (0, exports.zeros)(n, p);
+    for (let c = 0; c < p; c++) {
+        for (let i = n - 1; i >= 0; i--) {
+            let sum = M[i][n + c];
+            for (let k = i + 1; k < n; k++)
+                sum -= M[i][k] * X[k][c];
+            X[i][c] = sum / M[i][i];
+        }
+    }
+    return X;
+};
+exports.solveLinearSystem = solveLinearSystem;
+//# sourceMappingURL=matrix.js.map

package/dist/utils/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../src/utils/matrix.ts"],"names":[],"mappings":";;;AAEA,kCAAkC;AAC3B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE,CACpD,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AADnD,QAAA,KAAK,SAC8C;AAEhE,uCAAuC;AAChC,MAAM,QAAQ,GAAG,CAAC,CAAS,EAAU,EAAE;IAC5C,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;QAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACxC,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAJW,QAAA,QAAQ,YAInB;AAEF,yCAAyC;AAClC,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE;IAC7C,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AARW,QAAA,SAAS,aAQpB;AAEF,2DAA2D;AACpD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IACrD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,GAAG,KAAK,CAAC;gBAAE,SAAS;YACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAbW,QAAA,MAAM,UAajB;AAEF,gEAAgE;AACzD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAE,CAAW,EAAY,EAAE,CACzD,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AADlD,QAAA,MAAM,UAC4C;AAE/D;;;;;;GAMG;AACI,MAAM,cAAc,GAAG,CAAC,CAAS,EAAE,SAAS,GAAG,KAAK,EAAiB,EAAE;IAC5E,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,CAAC,CAAC,GAAG,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;oBAAE,OAAO,IAAI,CAAC;gBAC9C,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAhBW,QAAA,cAAc,kBAgBzB;AAEF;;;;;;GAMG;AACI,MAAM,qBAAqB,GAAG,CAAC,CAAS,EAAE,CAAW,EAAY,EAAE;IACxE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,MAAM,CAAC,GAAG,IAAI,KAAK,CAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAfW,QAAA,qBAAqB,yBAehC;AAEF;;;;;;;GAOG;AACI,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,CAAW,EAAE,SAAS,GAAG,KAAK,EAAmB,EAAE;IAC1F,MAAM,CAAC,GAAG,IAAA,sBAAc,EAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACvC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAA,6BAAqB,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAChD,CAAC,CAAC;AAHW,QAAA,aAAa,iBAGxB;AAEF;;;;;;;GAOG;AACI,MAAM,iBAAiB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,SAAS,GAAG,KAAK,EAAiB,EAAE;IAC1F,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACnB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACtB,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,EAAE,CAAC;QACjC,IAAI,KAAK,GAAG,GAAG,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC;gBAAE,KAAK,GAAG,CAAC,CAAC;QAC/D,CAAC;QACD,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,GAAG,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAChE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxC,KAAK,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAC3B,KAAK,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClE,CAAC;IACH,CAAC;IACD,MAAM,CAAC,GAAG,IAAA,aAAK,EAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAChC,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACzD,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AA3BW,QAAA,iBAAiB,qBA2B5B"}

package/dist/utils/skyline.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Symmetric matrix in skyline (variable-band, column profile) storage: column `j` holds rows
+ * `first[j]` … `j` of the upper triangle, so memory follows the band of each column instead of
+ * n². Cholesky factorisation stays inside this profile.
+ */
+export interface SkylineMatrix {
+    n: number;
+    /** First stored row of each column. */
+    first: Int32Array;
+    /** `columns[j][i − first[j]]` = A[i][j] for `first[j] ≤ i ≤ j`. */
+    columns: Float64Array[];
+}
+/** Creates a zero skyline matrix with the given first row of each column (`first[j] ≤ j`). */
+export declare const createSkyline: (first: ArrayLike<number>) => SkylineMatrix;
+/** Adds `value` to A[i][j] (and so to A[j][i]); the entry must lie inside the profile. */
+export declare const skylineAdd: (S: SkylineMatrix, i: number, j: number, value: number) => void;
+/** Reads A[i][j] (0 outside the profile). */
+export declare const skylineGet: (S: SkylineMatrix, i: number, j: number) => number;
+/** Number of stored entries, a measure of memory and of factorisation work. */
+export declare const skylineSize: (S: SkylineMatrix) => number;
+/**
+ * Factorises a symmetric positive-definite skyline matrix in place as A = Uᵀ·U (U upper
+ * triangular, same profile).
+ *
+ * @param S - Matrix, overwritten by U
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns `{ ok: true }`, or `{ ok: false, failedPivot }` with the index of the first pivot that
+ *   failed (A is singular or indefinite there — for a structure, a mechanism involving that DOF)
+ */
+export declare const skylineFactor: (S: SkylineMatrix, tolerance?: number) => {
+    ok: true;
+} | {
+    ok: false;
+    failedPivot: number;
+};
+/**
+ * Solves A·x = b from the factor produced by `skylineFactor` (forward then back substitution).
+ * One factorisation serves any number of right-hand sides.
+ */
+export declare const skylineSolve: (U: SkylineMatrix, b: ArrayLike<number>) => number[];
+/**
+ * Reverse Cuthill–McKee ordering of a graph, which keeps connected vertices close together and
+ * so narrows the band of the matrix built on it. Each connected component starts from a
+ * pseudo-peripheral vertex.
+ *
+ * @param adjacency - Neighbours of each vertex (undirected)
+ * @returns The vertices in their new order (`order[k]` = original index of the k-th vertex)
+ */
+export declare const reverseCuthillMcKee: (adjacency: number[][]) => number[];

package/dist/utils/skyline.js

@@ -0,0 +1,161 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reverseCuthillMcKee = exports.skylineSolve = exports.skylineFactor = exports.skylineSize = exports.skylineGet = exports.skylineAdd = exports.createSkyline = void 0;
+/** Creates a zero skyline matrix with the given first row of each column (`first[j] ≤ j`). */
+const createSkyline = (first) => {
+    const n = first.length;
+    const firstRows = Int32Array.from(first);
+    const columns = Array.from({ length: n }, (_, j) => new Float64Array(j - firstRows[j] + 1));
+    return { n, first: firstRows, columns };
+};
+exports.createSkyline = createSkyline;
+/** Adds `value` to A[i][j] (and so to A[j][i]); the entry must lie inside the profile. */
+const skylineAdd = (S, i, j, value) => {
+    const row = Math.min(i, j);
+    const col = Math.max(i, j);
+    const offset = row - S.first[col];
+    if (offset < 0)
+        throw new Error(`Skyline entry (${row}, ${col}) is outside the profile.`);
+    S.columns[col][offset] += value;
+};
+exports.skylineAdd = skylineAdd;
+/** Reads A[i][j] (0 outside the profile). */
+const skylineGet = (S, i, j) => {
+    const row = Math.min(i, j);
+    const col = Math.max(i, j);
+    const offset = row - S.first[col];
+    return offset < 0 ? 0 : S.columns[col][offset];
+};
+exports.skylineGet = skylineGet;
+/** Number of stored entries, a measure of memory and of factorisation work. */
+const skylineSize = (S) => S.columns.reduce((sum, column) => sum + column.length, 0);
+exports.skylineSize = skylineSize;
+/**
+ * Factorises a symmetric positive-definite skyline matrix in place as A = Uᵀ·U (U upper
+ * triangular, same profile).
+ *
+ * @param S - Matrix, overwritten by U
+ * @param tolerance - A pivot at or below `tolerance` times its own diagonal term is treated as zero
+ * @returns `{ ok: true }`, or `{ ok: false, failedPivot }` with the index of the first pivot that
+ *   failed (A is singular or indefinite there — for a structure, a mechanism involving that DOF)
+ */
+const skylineFactor = (S, tolerance = 1e-12) => {
+    const { n, first, columns } = S;
+    for (let j = 0; j < n; j++) {
+        const colJ = columns[j];
+        const fj = first[j];
+        for (let i = fj; i < j; i++) {
+            const colI = columns[i];
+            const fi = first[i];
+            const k0 = Math.max(fi, fj);
+            let sum = colJ[i - fj];
+            for (let k = k0; k < i; k++)
+                sum -= colI[k - fi] * colJ[k - fj];
+            colJ[i - fj] = sum / colI[i - fi];
+        }
+        const diagonal = colJ[j - fj];
+        let sum = diagonal;
+        for (let k = fj; k < j; k++)
+            sum -= colJ[k - fj] * colJ[k - fj];
+        if (!(sum > tolerance * diagonal))
+            return { ok: false, failedPivot: j };
+        colJ[j - fj] = Math.sqrt(sum);
+    }
+    return { ok: true };
+};
+exports.skylineFactor = skylineFactor;
+/**
+ * Solves A·x = b from the factor produced by `skylineFactor` (forward then back substitution).
+ * One factorisation serves any number of right-hand sides.
+ */
+const skylineSolve = (U, b) => {
+    const { n, first, columns } = U;
+    const y = Array.from(b);
+    // Uᵀ·y = b
+    for (let j = 0; j < n; j++) {
+        const col = columns[j];
+        const fj = first[j];
+        let sum = y[j];
+        for (let k = fj; k < j; k++)
+            sum -= col[k - fj] * y[k];
+        y[j] = sum / col[j - fj];
+    }
+    // U·x = y
+    for (let j = n - 1; j >= 0; j--) {
+        const col = columns[j];
+        const fj = first[j];
+        y[j] /= col[j - fj];
+        const xj = y[j];
+        for (let k = fj; k < j; k++)
+            y[k] -= col[k - fj] * xj;
+    }
+    return y;
+};
+exports.skylineSolve = skylineSolve;
+/**
+ * Reverse Cuthill–McKee ordering of a graph, which keeps connected vertices close together and
+ * so narrows the band of the matrix built on it. Each connected component starts from a
+ * pseudo-peripheral vertex.
+ *
+ * @param adjacency - Neighbours of each vertex (undirected)
+ * @returns The vertices in their new order (`order[k]` = original index of the k-th vertex)
+ */
+const reverseCuthillMcKee = (adjacency) => {
+    const n = adjacency.length;
+    const degree = adjacency.map((neighbours) => neighbours.length);
+    const visited = new Uint8Array(n);
+    const order = [];
+    /** Breadth-first levels from `start`, within unvisited vertices. */
+    const levels = (start) => {
+        const level = new Int32Array(n).fill(-1);
+        level[start] = 0;
+        const queue = [start];
+        let last = start;
+        for (let q = 0; q < queue.length; q++) {
+            const v = queue[q];
+            for (const w of adjacency[v]) {
+                if (!visited[w] && level[w] < 0) {
+                    level[w] = level[v] + 1;
+                    queue.push(w);
+                    if (level[w] > level[last] || (level[w] === level[last] && degree[w] < degree[last])) {
+                        last = w;
+                    }
+                }
+            }
+        }
+        return { depth: level[last], last };
+    };
+    const byDegree = Array.from({ length: n }, (_, i) => i).sort((a, b) => degree[a] - degree[b]);
+    for (const seed of byDegree) {
+        if (visited[seed])
+            continue;
+        // pseudo-peripheral start: move to the far end of the BFS until the depth stops growing
+        let start = seed;
+        let { depth, last } = levels(start);
+        for (let iteration = 0; iteration < 8; iteration++) {
+            const next = levels(last);
+            if (next.depth <= depth)
+                break;
+            start = last;
+            depth = next.depth;
+            last = next.last;
+        }
+        const component = [start];
+        visited[start] = 1;
+        for (let q = 0; q < component.length; q++) {
+            const neighbours = adjacency[component[q]]
+                .filter((w) => !visited[w])
+                .sort((a, b) => degree[a] - degree[b]);
+            for (const w of neighbours) {
+                if (!visited[w]) {
+                    visited[w] = 1;
+                    component.push(w);
+                }
+            }
+        }
+        order.push(...component);
+    }
+    return order.reverse();
+};
+exports.reverseCuthillMcKee = reverseCuthillMcKee;
+//# sourceMappingURL=skyline.js.map

package/dist/utils/skyline.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"skyline.js","sourceRoot":"","sources":["../../src/utils/skyline.ts"],"names":[],"mappings":";;;AAaA,8FAA8F;AACvF,MAAM,aAAa,GAAG,CAAC,KAAwB,EAAiB,EAAE;IACvE,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IACvB,MAAM,SAAS,GAAG,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,YAAY,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5F,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,CAAC;AAC1C,CAAC,CAAC;AALW,QAAA,aAAa,iBAKxB;AAEF,0FAA0F;AACnF,MAAM,UAAU,GAAG,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAS,EAAE,KAAa,EAAQ,EAAE;IACxF,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,MAAM,GAAG,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,kBAAkB,GAAG,KAAK,GAAG,2BAA2B,CAAC,CAAC;IAC1F,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;AAClC,CAAC,CAAC;AANW,QAAA,UAAU,cAMrB;AAEF,6CAA6C;AACtC,MAAM,UAAU,GAAG,CAAC,CAAgB,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;IAC3E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,MAAM,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IAClC,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC;AACjD,CAAC,CAAC;AALW,QAAA,UAAU,cAKrB;AAEF,+EAA+E;AACxE,MAAM,WAAW,GAAG,CAAC,CAAgB,EAAU,EAAE,CACtD,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,CAAC,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;AAD/C,QAAA,WAAW,eACoC;AAE5D;;;;;;;;GAQG;AACI,MAAM,aAAa,GAAG,CAC3B,CAAgB,EAChB,SAAS,GAAG,KAAK,EACkC,EAAE;IACrD,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACxB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAC5B,IAAI,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YACvB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAAE,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;YAChE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACpC,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,QAAQ,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QAChE,IAAI,CAAC,CAAC,GAAG,GAAG,SAAS,GAAG,QAAQ,CAAC;YAAE,OAAO,EAAE,EAAE,EAAE,KAAK,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC;QACxE,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IACD,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;AACtB,CAAC,CAAC;AAvBW,QAAA,aAAa,iBAuBxB;AAEF;;;GAGG;AACI,MAAM,YAAY,GAAG,CAAC,CAAgB,EAAE,CAAoB,EAAY,EAAE;IAC/E,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,WAAW;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;IAC3B,CAAC;IACD,UAAU;IACV,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACvB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC;QACpB,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAAE,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACxD,CAAC;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AApBW,QAAA,YAAY,gBAoBvB;AAEF;;;;;;;GAOG;AACI,MAAM,mBAAmB,GAAG,CAAC,SAAqB,EAAY,EAAE;IACrE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;IAC3B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAChE,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,oEAAoE;IACpE,MAAM,MAAM,GAAG,CAAC,KAAa,EAAE,EAAE;QAC/B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACjB,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,KAAK,MAAM,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;oBAChC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACd,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;wBACrF,IAAI,GAAG,CAAC,CAAC;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC;IACtC,CAAC,CAAC;IAEF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,OAAO,CAAC,IAAI,CAAC;YAAE,SAAS;QAC5B,wFAAwF;QACxF,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QACpC,KAAK,IAAI,SAAS,GAAG,CAAC,EAAE,SAAS,GAAG,CAAC,EAAE,SAAS,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,IAAI,CAAC,KAAK,IAAI,KAAK;gBAAE,MAAM;YAC/B,KAAK,GAAG,IAAI,CAAC;YACb,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;YACnB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QAED,MAAM,SAAS,GAAa,CAAC,KAAK,CAAC,CAAC;QACpC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;iBACvC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;iBAC1B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;gBAC3B,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;oBAChB,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACf,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,CAAC;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AACzB,CAAC,CAAC;AAzDW,QAAA,mBAAmB,uBAyD9B"}

package/package.json

@@ -1,28 +1,46 @@
 {
   "name": "@theerapat-s28/ts-structural-eng-tools",
-  "version": "1.5.0",
-  "description": "TypeScript structural-engineering helper functions and beam design utilities",
+  "version": "2.1.0",
+  "description": "Headless structural analysis and design engine for TypeScript: 3D frame analysis (direct stiffness method), RC beam design per ACI 318-19 and strengthening methods",
   "main": "dist/index.js",
   "types": "dist/index.d.ts",
+  "module": "dist/esm/index.js",
+  "sideEffects": false,
   "exports": {
     ".": {
       "types": "./dist/index.d.ts",
+      "import": "./dist/esm/index.js",
+      "require": "./dist/index.js",
       "default": "./dist/index.js"
     },
     "./rc": {
       "types": "./dist/rc/index.d.ts",
+      "import": "./dist/esm/rc/index.js",
+      "require": "./dist/rc/index.js",
       "default": "./dist/rc/index.js"
     },
     "./strengthening": {
       "types": "./dist/strengthening/index.d.ts",
+      "import": "./dist/esm/strengthening/index.js",
+      "require": "./dist/strengthening/index.js",
       "default": "./dist/strengthening/index.js"
     },
+    "./fea": {
+      "types": "./dist/fea/index.d.ts",
+      "import": "./dist/esm/fea/index.js",
+      "require": "./dist/fea/index.js",
+      "default": "./dist/fea/index.js"
+    },
     "./core": {
       "types": "./dist/core/index.d.ts",
+      "import": "./dist/esm/core/index.js",
+      "require": "./dist/core/index.js",
       "default": "./dist/core/index.js"
     },
     "./utils": {
       "types": "./dist/utils/index.d.ts",
+      "import": "./dist/esm/utils/index.js",
+      "require": "./dist/utils/index.js",
       "default": "./dist/utils/index.js"
     }
   },
@@ -33,6 +51,12 @@
   ],
   "keywords": [
     "structural-engineering",
+    "structural-analysis",
+    "analysis-engine",
+    "frame-analysis",
+    "finite-element",
+    "fea",
+    "direct-stiffness-method",
     "beam-design",
     "reinforced-concrete",
     "ACI-318",
@@ -40,7 +64,7 @@
     "steel-jacketing",
     "typescript"
   ],
-  "author": "",
+  "author": "theerapat-s28",
   "license": "ISC",
   "homepage": "https://theerapat-s28.github.io/ts-structural-eng/",
   "repository": {
@@ -67,7 +91,7 @@
   },
   "scripts": {
     "dev": "ts-node -r tsconfig-paths/register examples/basic-usage.ts",
-    "build": "rm -rf dist && tsc -p tsconfig.build.json && tsc-alias -p tsconfig.build.json",
+    "build": "rm -rf dist && tsc -p tsconfig.build.json && tsc-alias -p tsconfig.build.json && tsc -p tsconfig.esm.json && tsc-alias -p tsconfig.esm.json --resolve-full-paths && node -e \"require('fs').writeFileSync('dist/esm/package.json', JSON.stringify({ type: 'module' }))\"",
     "lint": "eslint src/",
     "lint:fix": "eslint src/ --fix",
     "format": "prettier --write \"src/**/*.ts\" \"tests/**/*.ts\" \"examples/**/*.ts\"",