"use strict"; Object.defineProperty(exports, "__esModule", { value: true }); exports.createZpk2tf = void 0; var _factory = require("../../utils/factory.js"); const name = 'zpk2tf'; const dependencies = ['typed', 'add', 'multiply', 'Complex', 'number']; const createZpk2tf = exports.createZpk2tf = /* #__PURE__ */(0, _factory.factory)(name, dependencies, _ref => { let { typed, add, multiply, Complex, number } = _ref; /** * Compute the transfer function of a zero-pole-gain model. * * Syntax: * math.zpk2tf(z, p, k) * * Examples: * math.zpk2tf([1, 2], [-1, -2], 1) // returns [[1, -3, 2], [1, 3, 2]] * * See also: * freqz * * @param {Array} z Array of zeros values * @param {Array} p Array of poles values * @param {number} k Gain value * @return {Array} Two dimensional array containing the numerator (first row) and denominator (second row) polynomials * */ return typed(name, { 'Array,Array,number': function (z, p, k) { return _zpk2tf(z, p, k); }, 'Array,Array': function (z, p) { return _zpk2tf(z, p, 1); }, 'Matrix,Matrix,number': function (z, p, k) { return _zpk2tf(z.valueOf(), p.valueOf(), k); }, 'Matrix,Matrix': function (z, p) { return _zpk2tf(z.valueOf(), p.valueOf(), 1); } }); function _zpk2tf(z, p, k) { // if z is bignumber, convert it to number if (z.some(el => el.type === 'BigNumber')) { z = z.map(el => number(el)); } // if p is bignumber, convert it to number if (p.some(el => el.type === 'BigNumber')) { p = p.map(el => number(el)); } let num = [Complex(1, 0)]; let den = [Complex(1, 0)]; for (let i = 0; i < z.length; i++) { let zero = z[i]; if (typeof zero === 'number') zero = Complex(zero, 0); num = _multiply(num, [Complex(1, 0), Complex(-zero.re, -zero.im)]); } for (let i = 0; i < p.length; i++) { let pole = p[i]; if (typeof pole === 'number') pole = Complex(pole, 0); den = _multiply(den, [Complex(1, 0), Complex(-pole.re, -pole.im)]); } for (let i = 0; i < num.length; i++) { num[i] = multiply(num[i], k); } return [num, den]; } function _multiply(a, b) { const c = []; for (let i = 0; i < a.length + b.length - 1; i++) { c[i] = Complex(0, 0); for (let j = 0; j < a.length; j++) { if (i - j >= 0 && i - j < b.length) { c[i] = add(c[i], multiply(a[j], b[i - j])); } } } return c; } });