[{"_1":2,"_22934":-5,"_22935":-5},"loaderData",{"_3":4,"_11":12},"root",{"_5":6,"_7":8},"isAuthenticated",false,"features",{"_9":10},"billing",true,"routes/packages.$packageId",{"_13":14,"_3929":3930},"package",{"_15":16,"_17":18,"_19":20,"_21":22,"_23":24,"_25":26,"_27":28},"id","mfem-generated","name","Finite Element (MFEM)","description","Finite element library powered by MFEM compiled to WebAssembly. Provides mesh generation, finite element spaces, bilinear/linear forms, coefficients, and iterative solvers.","tier","free","icon","🔷","namespace","mfem","functions",[29,49,63,72,88,106,121,130,139,151,158,167,176,185,195,203,213,230,241,248,261,269,281,291,303,313,321,329,338,347,358,377,394,411,424,436,445,458,474,485,498,508,518,531,541,554,564,572,582,591,603,613,624,634,643,658,670,680,689,698,707,720,733,743,752,765,777,790,801,812,821,831,840,851,862,871,879,887,896,904,912,920,928,938,950,961,969,976,984,993,1000,1009,1017,1025,1032,1040,1048,1058,1067,1075,1083,1091,1100,1110,1118,1132,1143,1155,1169,1181,1192,1200,1209,1218,1230,1237,1253,1264,1275,1286,1296,1306,1316,1329,1339,1348,1359,1370,1380,1389,1399,1411,1426,1436,1448,1457,1472,1484,1494,1505,1515,1525,1534,1545,1560,1578,1589,1600,1614,1626,1638,1648,1659,1670,1680,1691,1700,1708,1716,1729,1742,1751,1764,1773,1785,1795,1804,1814,1823,1831,1843,1851,1859,1868,1876,1887,1893,1900,1906,1912,1919,1925,1931,1938,1945,1952,1958,1964,1971,1980,1991,2000,2009,2017,2024,2035,2045,2055,2065,2078,2085,2100,2107,2116,2124,2137,2147,2157,2165,2179,2189,2196,2203,2210,2217,2232,2243,2250,2256,2263,2275,2286,2296,2306,2320,2329,2339,2348,2355,2362,2370,2377,2388,2395,2404,2411,2419,2426,2437,2444,2451,2458,2469,2478,2484,2494,2502,2509,2516,2523,2531,2538,2545,2551,2557,2564,2576,2584,2592,2600,2612,2623,2632,2641,2650,2659,2668,2677,2686,2695,2708,2717,2726,2733,2745,2756,2768,2780,2800,2819,2832,2846,2857,2867,2879,2888,2899,2914,2926,2937,2950,2958,2973,2986,2995,3003,3011,3019,3028,3036,3047,3059,3067,3074,3084,3095,3106,3118,3126,3136,3145,3156,3166,3178,3185,3195,3204,3211,3218,3225,3232,3239,3246,3253,3260,3267,3274,3281,3288,3295,3305,3312,3319,3326,3335,3342,3349,3356,3363,3370,3377,3384,3391,3398,3405,3412,3420,3429,3436,3448,3456,3467,3475,3485,3495,3502,3509,3516,3525,3532,3539,3546,3553,3560,3569,3577,3584,3592,3600,3608,3616,3623,3630,3637,3644,3651,3658,3666,3675,3683,3692,3698,3705,3711,3717,3728,3736,3747,3763,3773,3786,3798,3808,3814,3821,3828,3835,3842,3849,3855,3863,3873,3882,3889,3896,3909,3919],{"_17":30,"_31":32,"_33":34,"_19":35,"_36":37,"_45":46,"_47":48},"mfem.bilinearForms.addBoundaryMassIntegrator","signature","mfem.bilinearForms.addBoundaryMassIntegrator(blf, coeff?)","summary","Add a boundary mass integrator to the bilinear form.\r","Add a boundary mass integrator to the bilinear form.\r\n\r\nComputes: ∫_∂Ω c * u * v ds","params",[38,42],{"_17":39,"_19":40,"_41":6},"blf","- BilinearForm instance","optional",{"_17":43,"_19":44,"_41":10},"coeff","- Optional scalar coefficient","returns","void","examples",[],{"_17":50,"_31":51,"_33":52,"_19":53,"_36":54,"_45":46,"_47":62},"mfem.bilinearForms.addConvectionIntegrator","mfem.bilinearForms.addConvectionIntegrator(blf, velocity, alpha?)","Add a convection integrator (v · ∇u) to the bilinear form.\r","Add a convection integrator (v · ∇u) to the bilinear form.\r\n\r\nComputes: ∫ α * (β · ∇u) * v dx",[55,56,59],{"_17":39,"_19":40,"_41":6},{"_17":57,"_19":58,"_41":6},"velocity","- Vector coefficient for velocity field",{"_17":60,"_19":61,"_41":10},"alpha","- Scaling factor (defaults to 1.0)",[],{"_17":64,"_31":65,"_33":66,"_19":67,"_36":68,"_45":46,"_47":71},"mfem.bilinearForms.addCurlCurlIntegrator","mfem.bilinearForms.addCurlCurlIntegrator(blf, coeff?)","Add a curl-curl integrator (∇×u · ∇×v) to the bilinear form.\r","Add a curl-curl integrator (∇×u · ∇×v) to the bilinear form.\r\nUsed for H(curl) finite element spaces.\r\n\r\nComputes: ∫ c * (∇×u) · (∇×v) dx",[69,70],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":73,"_31":74,"_33":75,"_19":76,"_36":77,"_45":46,"_47":87},"mfem.bilinearForms.addDGDiffusionIntegrator","mfem.bilinearForms.addDGDiffusionIntegrator(blf, coeff, sigma, kappa)","Add DG diffusion integrator for interior penalty method.\r","Add DG diffusion integrator for interior penalty method.\r\nAdds integrators for both interior and boundary faces.",[78,79,81,84],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":80,"_41":6},"- Diffusion coefficient (optional)",{"_17":82,"_19":83,"_41":6},"sigma","- Symmetry parameter (-1 = SIPG, 0 = IIPG, 1 = NIPG)",{"_17":85,"_19":86,"_41":6},"kappa","- Penalty parameter (typically 10 * p^2 / h)",[],{"_17":89,"_31":90,"_33":91,"_19":92,"_36":93,"_45":46,"_47":105},"mfem.bilinearForms.addDGElasticityIntegrator","mfem.bilinearForms.addDGElasticityIntegrator(blf, lambda, mu, alpha?, kappa?)","Add a discontinuous Galerkin (DG) elasticity integrator.\r","Add a discontinuous Galerkin (DG) elasticity integrator.\r\n\r\nUsed for elasticity problems with discontinuous Galerkin methods\r\nwhere displacement jumps occur across element boundaries.\r\nThis adds interior face integrators for the DG formulation.",[94,95,98,101,103],{"_17":39,"_19":40,"_41":6},{"_17":96,"_19":97,"_41":6},"lambda","- Lamé first parameter",{"_17":99,"_19":100,"_41":6},"mu","- Shear modulus",{"_17":60,"_19":102,"_41":10},"- Symmetry parameter (default: -1.0 for symmetric form)",{"_17":85,"_19":104,"_41":10},"- Penalty parameter for stability",[],{"_17":107,"_31":108,"_33":109,"_19":110,"_36":111,"_45":46,"_47":120},"mfem.bilinearForms.addDGTraceIntegrator","mfem.bilinearForms.addDGTraceIntegrator(blf, coeff?, alpha?, beta?)","Add DG trace integrator for face terms.\r","Add DG trace integrator for face terms.\r\nUsed for upwinding in DG advection problems.",[112,113,115,117],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":114,"_41":10},"- Optional coefficient (VectorCoefficient)",{"_17":60,"_19":116,"_41":10},"- Upwinding parameter (default: 0)",{"_17":118,"_19":119,"_41":10},"beta","- Penalty parameter (default: 0)",[],{"_17":122,"_31":123,"_33":124,"_19":125,"_36":126,"_45":46,"_47":129},"mfem.bilinearForms.addDiffusionIntegrator","mfem.bilinearForms.addDiffusionIntegrator(blf, coeff?)","Add a diffusion integrator (∇u · ∇v) to the bilinear form.\r","Add a diffusion integrator (∇u · ∇v) to the bilinear form.\r\n\r\nComputes: ∫ c * ∇u · ∇v dx",[127,128],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":131,"_31":132,"_33":133,"_19":134,"_36":135,"_45":46,"_47":138},"mfem.bilinearForms.addDivDivIntegrator","mfem.bilinearForms.addDivDivIntegrator(blf, coeff?)","Add a div-div integrator (∇·u)(∇·v) to the bilinear form.\r","Add a div-div integrator (∇·u)(∇·v) to the bilinear form.\r\nUsed for H(div) finite element spaces.\r\n\r\nComputes: ∫ c * (∇·u)(∇·v) dx",[136,137],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":140,"_31":141,"_33":142,"_19":143,"_36":144,"_45":46,"_47":150},"mfem.bilinearForms.addElasticityIntegrator","mfem.bilinearForms.addElasticityIntegrator(blf, lambda, mu)","Add a linear elasticity integrator to the bilinear form.\r","Add a linear elasticity integrator to the bilinear form.\r\n\r\nImplements the bilinear form for linear elasticity:\r\na(u,v) = ∫ λ(∇·u)(∇·v) + 2μ ε(u):ε(v) dx\r\n\r\nwhere:\r\n- λ (lambda) is the first Lamé parameter\r\n- μ (mu) is the second Lamé parameter (shear modulus)\r\n- ε is the strain tensor: ε(u) = (∇u + (∇u)ᵀ)/2",[145,146,148],{"_17":39,"_19":40,"_41":6},{"_17":96,"_19":147,"_41":6},"- Lamé first parameter (scalar coefficient)",{"_17":99,"_19":149,"_41":6},"- Shear modulus / Lamé second parameter (scalar coefficient)",[],{"_17":152,"_31":153,"_33":154,"_19":154,"_36":155,"_45":46,"_47":157},"mfem.bilinearForms.addGradientIntegrator","mfem.bilinearForms.addGradientIntegrator(blf)","Add a gradient integrator to the bilinear form.",[156],{"_17":39,"_19":40,"_41":6},[],{"_17":159,"_31":160,"_33":161,"_19":162,"_36":163,"_45":46,"_47":166},"mfem.bilinearForms.addMassIntegrator","mfem.bilinearForms.addMassIntegrator(blf, coeff?)","Add a mass integrator (u, v) to the bilinear form.\r","Add a mass integrator (u, v) to the bilinear form.\r\n\r\nComputes: ∫ c * u * v dx",[164,165],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":168,"_31":169,"_33":170,"_19":171,"_36":172,"_45":46,"_47":175},"mfem.bilinearForms.addVectorDiffusionIntegrator","mfem.bilinearForms.addVectorDiffusionIntegrator(blf, coeff?)","Add a vector diffusion integrator to the bilinear form.\r","Add a vector diffusion integrator to the bilinear form.\r\nFor vector-valued finite element functions.",[173,174],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":177,"_31":178,"_33":179,"_19":180,"_36":181,"_45":46,"_47":184},"mfem.bilinearForms.addVectorMassIntegrator","mfem.bilinearForms.addVectorMassIntegrator(blf, coeff?)","Add a vector mass integrator (u · v) to the bilinear form.\r","Add a vector mass integrator (u · v) to the bilinear form.\r\nFor vector-valued finite element functions.\r\n\r\nComputes: ∫ c * u · v dx",[182,183],{"_17":39,"_19":40,"_41":6},{"_17":43,"_19":44,"_41":10},[],{"_17":186,"_31":187,"_33":188,"_19":188,"_36":189,"_45":46,"_47":194},"mfem.bilinearForms.assemble","mfem.bilinearForms.assemble(blf, skipZeros?)","Assemble bilinear form into sparse matrix.",[190,191],{"_17":39,"_19":40,"_41":6},{"_17":192,"_19":193,"_41":10},"skipZeros","- If true, skip storing zeros in the matrix (default: true)",[],{"_17":196,"_31":197,"_33":198,"_19":199,"_36":200,"_45":46,"_47":202},"mfem.bilinearForms.assemblePartial","mfem.bilinearForms.assemblePartial(blf)","Partial assembly for matrix-free operations.\r","Partial assembly for matrix-free operations.\r\nSets the assembly level to PARTIAL and then assembles.",[201],{"_17":39,"_19":40,"_41":6},[],{"_17":204,"_31":205,"_33":206,"_19":206,"_36":207,"_45":211,"_47":212},"mfem.bilinearForms.create","mfem.bilinearForms.create(fespace)","Create a bilinear form on a finite element space.",[208],{"_17":209,"_19":210,"_41":6},"fespace","- FiniteElementSpace instance","Promise",[],{"_17":214,"_31":215,"_33":216,"_19":217,"_36":218,"_45":46,"_47":229},"mfem.bilinearForms.eliminateEssentialBC","mfem.bilinearForms.eliminateEssentialBC(blf, essentialDofs, sol, rhs)","Eliminate essential BCs from system.\r","Eliminate essential BCs from system.\r\nModifies the RHS vector in place for non-homogeneous boundary conditions.",[219,220,223,226],{"_17":39,"_19":40,"_41":6},{"_17":221,"_19":222,"_41":6},"essentialDofs","- Essential DOF indices",{"_17":224,"_19":225,"_41":6},"sol","- Solution vector with boundary values",{"_17":227,"_19":228,"_41":6},"rhs","- Right-hand side vector (modified in place)",[],{"_17":231,"_31":232,"_33":233,"_19":234,"_36":235,"_45":239,"_47":240},"mfem.bilinearForms.formSystemMatrix","mfem.bilinearForms.formSystemMatrix(blf, essentialDofs)","Form system matrix with essential BC elimination.\r","Form system matrix with essential BC elimination.\r\nWorks with static condensation if enabled.",[236,238],{"_17":39,"_19":237,"_41":6},"- BilinearForm instance (must be assembled first)",{"_17":221,"_19":222,"_41":6},"SparseMatrix",[],{"_17":242,"_31":243,"_33":244,"_19":244,"_36":245,"_45":239,"_47":247},"mfem.bilinearForms.getMatrix","mfem.bilinearForms.getMatrix(blf)","Get assembled sparse matrix from a bilinear form.",[246],{"_17":39,"_19":237,"_41":6},[],{"_17":249,"_31":250,"_33":251,"_19":251,"_36":252,"_45":259,"_47":260},"mfem.bilinearForms.createMixed","mfem.bilinearForms.createMixed(trialFES, testFES)","Create a mixed bilinear form on trial and test spaces.",[253,256],{"_17":254,"_19":255,"_41":6},"trialFES","- Trial FiniteElementSpace",{"_17":257,"_19":258,"_41":6},"testFES","- Test FiniteElementSpace","Promise",[],{"_17":262,"_31":263,"_33":264,"_19":264,"_36":265,"_45":211,"_47":268},"mfem.bilinearForms.BilinearForm.create","mfem.bilinearForms.BilinearForm.create(fespace)","Creates a new bilinear form on the specified finite element space.",[266],{"_17":209,"_19":267,"_41":6},"- The finite element space",[],{"_17":270,"_31":271,"_33":272,"_19":272,"_36":273,"_45":259,"_47":280},"mfem.bilinearForms.MixedBilinearForm.create","mfem.bilinearForms.MixedBilinearForm.create(trialFespace, testFespace)","Creates a new mixed bilinear form.",[274,277],{"_17":275,"_19":276,"_41":6},"trialFespace","- The trial finite element space",{"_17":278,"_19":279,"_41":6},"testFespace","- The test finite element space",[],{"_17":282,"_31":283,"_33":284,"_19":284,"_36":285,"_45":289,"_47":290},"mfem.block.BlockMatrix.createSquare","mfem.block.BlockMatrix.createSquare(offsets)","Create a square BlockMatrix with the same offsets for rows and columns.",[286],{"_17":287,"_19":288,"_41":6},"offsets","- Block offsets array (used for both rows and columns)","Promise",[],{"_17":292,"_31":293,"_33":294,"_19":294,"_36":295,"_45":289,"_47":302},"mfem.block.BlockMatrix.create","mfem.block.BlockMatrix.create(rowOffsets, colOffsets)","Create a rectangular BlockMatrix with different row and column offsets.",[296,299],{"_17":297,"_19":298,"_41":6},"rowOffsets","- Row block offsets array",{"_17":300,"_19":301,"_41":6},"colOffsets","- Column block offsets array",[],{"_17":304,"_31":305,"_33":306,"_19":307,"_36":308,"_45":289,"_47":312},"mfem.block.BlockMatrix.fromPointer","mfem.block.BlockMatrix.fromPointer(ptr)","Creates a BlockMatrix from an existing WASM pointer.\r","Creates a BlockMatrix from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[309],{"_17":310,"_19":311,"_41":6},"ptr","- WASM pointer to an existing MFEM BlockMatrix",[],{"_17":314,"_31":315,"_33":316,"_19":316,"_36":317,"_45":319,"_47":320},"mfem.block.BlockOperator.createSquare","mfem.block.BlockOperator.createSquare(offsets)","Create a square BlockOperator with the same offsets for rows and columns.",[318],{"_17":287,"_19":288,"_41":6},"Promise",[],{"_17":322,"_31":323,"_33":324,"_19":324,"_36":325,"_45":319,"_47":328},"mfem.block.BlockOperator.create","mfem.block.BlockOperator.create(rowOffsets, colOffsets)","Create a rectangular BlockOperator with different row and column offsets.",[326,327],{"_17":297,"_19":298,"_41":6},{"_17":300,"_19":301,"_41":6},[],{"_17":330,"_31":331,"_33":332,"_19":333,"_36":334,"_45":319,"_47":337},"mfem.block.BlockOperator.fromPointer","mfem.block.BlockOperator.fromPointer(ptr)","Creates a BlockOperator from an existing WASM pointer.\r","Creates a BlockOperator from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[335],{"_17":310,"_19":336,"_41":6},"- WASM pointer to an existing MFEM BlockOperator",[],{"_17":339,"_31":340,"_33":341,"_19":341,"_36":342,"_45":345,"_47":346},"mfem.block.BlockVector.create","mfem.block.BlockVector.create(offsets)","Create a new BlockVector with the specified block offsets.",[343],{"_17":287,"_19":344,"_41":6},"- Array where offsets[i+1] - offsets[i] defines block i size","Promise",[],{"_17":348,"_31":349,"_33":350,"_19":351,"_36":352,"_45":345,"_47":357},"mfem.block.BlockVector.fromPointer","mfem.block.BlockVector.fromPointer(ptr, offsets)","Creates a BlockVector from an existing WASM pointer.\r","Creates a BlockVector from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[353,355],{"_17":310,"_19":354,"_41":6},"- WASM pointer to an existing MFEM BlockVector",{"_17":287,"_19":356,"_41":6},"- Block offsets array",[],{"_17":359,"_31":360,"_33":361,"_19":361,"_36":362,"_45":375,"_47":376},"mfem.boundaryConditions.addBoundaryRobinIntegrator","mfem.boundaryConditions.addBoundaryRobinIntegrator(blf, lf, alpha, g, bdrAttrs)","Add Robin boundary condition integrator (legacy name)",[363,365,368,370,372],{"_17":39,"_19":364,"_41":6},"BilinearForm",{"_17":366,"_19":367,"_41":6},"lf","LinearForm",{"_17":60,"_19":369,"_41":6},"number | CoefficientLike_15",{"_17":371,"_19":369,"_41":6},"g",{"_17":373,"_19":374,"_41":6},"bdrAttrs","number[]","Promise",[],{"_17":378,"_31":379,"_33":380,"_19":381,"_36":382,"_45":375,"_47":393},"mfem.boundaryConditions.addRobinBC","mfem.boundaryConditions.addRobinBC(bf, lf, alpha, g, bdrAttrs)","Add Robin boundary condition: alpha*u + du/dn = g\r","Add Robin boundary condition: alpha*u + du/dn = g\r\n\r\nThis function adds the necessary integrators to both the bilinear form\r\nand linear form to implement Robin boundary conditions on specified\r\nboundary attributes.",[383,385,387,389,391],{"_17":384,"_19":40,"_41":6},"bf",{"_17":366,"_19":386,"_41":6},"- LinearForm instance",{"_17":60,"_19":388,"_41":6},"- Coefficient for u term (scalar value or CoefficientLike)",{"_17":371,"_19":390,"_41":6},"- RHS coefficient g (scalar value or CoefficientLike)",{"_17":373,"_19":392,"_41":6},"- Array of boundary attributes where Robin BC applies",[],{"_17":395,"_31":396,"_33":397,"_19":398,"_36":399,"_45":46,"_47":410},"mfem.boundaryConditions.applyEssentialBC","mfem.boundaryConditions.applyEssentialBC(blf, essentialDofs, x, b)","Apply essential boundary conditions to a linear system.\r","Apply essential boundary conditions to a linear system.\r\nThis modifies the RHS vector to account for known Dirichlet values.",[400,402,404,407],{"_17":39,"_19":401,"_41":6},"- BilinearForm instance (system matrix)",{"_17":221,"_19":403,"_41":6},"- Array of essential DOF indices",{"_17":405,"_19":406,"_41":6},"x","- GridFunction with Dirichlet values set",{"_17":408,"_19":409,"_41":6},"b","- LinearForm (RHS) to modify",[],{"_17":412,"_31":413,"_33":414,"_19":415,"_36":416,"_45":422,"_47":423},"mfem.boundaryConditions.createBdrMarkerArray","mfem.boundaryConditions.createBdrMarkerArray(mesh, bdrAttrs)","Create a boundary marker array from a mesh and list of boundary attributes.\r","Create a boundary marker array from a mesh and list of boundary attributes.\r\n\r\nThis function creates an array where each element corresponds to a boundary\r\nattribute. The value is 1 if the attribute is in the given list, 0 otherwise.",[417,420],{"_17":418,"_19":419,"_41":6},"mesh","- Mesh instance",{"_17":373,"_19":421,"_41":6},"- Array of boundary attribute numbers to mark (1-based)","Int32Array",[],{"_17":425,"_31":426,"_33":427,"_19":428,"_36":429,"_45":46,"_47":435},"mfem.boundaryConditions.eliminateEssentialBC","mfem.boundaryConditions.eliminateEssentialBC(blf, essentialDofs, diagPolicy?)","Eliminate essential boundary conditions from a bilinear form.\r","Eliminate essential boundary conditions from a bilinear form.\r\nModifies the system matrix to enforce the essential BCs.",[430,431,432],{"_17":39,"_19":40,"_41":6},{"_17":221,"_19":403,"_41":6},{"_17":433,"_19":434,"_41":10},"diagPolicy","- Diagonal policy (default: DIAG_ONE)",[],{"_17":437,"_31":438,"_33":439,"_19":439,"_36":440,"_45":374,"_47":444},"mfem.boundaryConditions.getEssentialTrueDofs","mfem.boundaryConditions.getEssentialTrueDofs(fespace, bdrAttrs)","Get essential true DOF indices for given boundary attributes.",[441,442],{"_17":209,"_19":210,"_41":6},{"_17":373,"_19":443,"_41":6},"- Array of boundary attribute numbers",[],{"_17":446,"_31":447,"_33":448,"_19":449,"_36":450,"_45":456,"_47":457},"mfem.boundaryConditions.getPeriodicDofMapping","mfem.boundaryConditions.getPeriodicDofMapping(fespace, options)","Get periodic DOF correspondence for a finite element space.\r","Get periodic DOF correspondence for a finite element space.\r\n\r\nThis function computes which DOFs are identified as equivalent due to\r\nperiodicity, based on the provided translation vectors. DOFs whose\r\ncoordinates differ by a translation vector (within tolerance) are\r\nidentified as master/slave pairs.\r\n\r\n**Note:** In MFEM, periodic DOF identification is often handled internally\r\nthrough mesh vertex mapping when `Mesh::MakePeriodic` is called. This\r\nfunction provides explicit DOF mapping when needed for custom handling.",[451,453],{"_17":209,"_19":452,"_41":6},"- FiniteElementSpace (typically on a periodic mesh)",{"_17":454,"_19":455,"_41":6},"options","- Configuration including translation vectors and tolerance","Promise",[],{"_17":459,"_31":460,"_33":461,"_19":462,"_36":463,"_45":472,"_47":473},"mfem.boundaryConditions.createPeriodicMesh","mfem.boundaryConditions.createPeriodicMesh(mesh, translations, tol?)","Create a periodic mesh from translation vectors.\r","Create a periodic mesh from translation vectors.\r\n\r\nThis function identifies vertices that should be treated as equivalent\r\nunder the given translations and creates a new mesh with these vertices\r\nmerged. The result is a mesh suitable for periodic boundary conditions.",[464,466,469],{"_17":418,"_19":465,"_41":6},"- Original mesh",{"_17":467,"_19":468,"_41":6},"translations","- Array of translation vectors defining periodicity.\r\n For 2D: `[[Lx, 0], [0, Ly]]` for x and y periodicity\r\n For 3D: `[[Lx, 0, 0], [0, Ly, 0], [0, 0, Lz]]`",{"_17":470,"_19":471,"_41":10},"tol","- Tolerance for vertex matching (relative to mesh diameter).\r\n Default is 1e-8.","Promise",[],{"_17":475,"_31":476,"_33":477,"_19":477,"_36":478,"_45":481,"_47":484},"mfem.boundaryConditions.makePeriodic","mfem.boundaryConditions.makePeriodic(_fespace, _mesh)","Create periodic finite element space (legacy name).",[479,482],{"_17":480,"_19":481,"_41":6},"_fespace","unknown",{"_17":483,"_19":481,"_41":6},"_mesh",[],{"_17":486,"_31":487,"_33":488,"_19":489,"_36":490,"_45":496,"_47":497},"mfem.boundaryConditions.createPeriodicVertexMapping","mfem.boundaryConditions.createPeriodicVertexMapping(mesh, translations, tol?)","Create periodic vertex mapping from translation vectors.\r","Create periodic vertex mapping from translation vectors.\r\n\r\nThis function identifies which vertices should be treated as equivalent\r\nunder the given translations. The returned mapping array can be used\r\nwith `makePeriodic` for advanced use cases.\r\n\r\nFor most use cases, prefer `createPeriodicMesh` which handles both\r\nthe mapping and mesh creation in one step.",[491,493,495],{"_17":418,"_19":492,"_41":6},"- Mesh to analyze",{"_17":467,"_19":494,"_41":6},"- Array of translation vectors defining periodicity",{"_17":470,"_19":471,"_41":10},"Promise",[],{"_17":499,"_31":500,"_33":501,"_19":501,"_36":502,"_45":46,"_47":507},"mfem.boundaryConditions.makePeriodicVertices","mfem.boundaryConditions.makePeriodicVertices(_mesh, _v2v)","Set periodic vertex mapping on mesh (legacy name).",[503,504],{"_17":483,"_19":481,"_41":6},{"_17":505,"_19":506,"_41":6},"_v2v","number[][]",[],{"_17":509,"_31":510,"_33":511,"_19":511,"_36":512,"_45":516,"_47":517},"mfem.coefficients.constant","mfem.coefficients.constant(value)","Create a constant scalar coefficient.",[513],{"_17":514,"_19":515,"_41":6},"value","- Constant value","Promise",[],{"_17":519,"_31":520,"_33":521,"_19":521,"_36":522,"_45":529,"_47":530},"mfem.coefficients.crossProduct","mfem.coefficients.crossProduct(v1, v2)","Create a cross product coefficient from two vector coefficients.",[523,526],{"_17":524,"_19":525,"_41":6},"v1","- First vector coefficient (must be 3D)",{"_17":527,"_19":528,"_41":6},"v2","- Second vector coefficient (must be 3D)","Promise",[],{"_17":532,"_31":533,"_33":534,"_19":534,"_36":535,"_45":539,"_47":540},"mfem.coefficients.curl","mfem.coefficients.curl(gf)","Create a curl vector coefficient from a vector GridFunction.",[536],{"_17":537,"_19":538,"_41":6},"gf","- Vector GridFunction instance","Promise",[],{"_17":542,"_31":543,"_33":544,"_19":544,"_36":545,"_45":552,"_47":553},"mfem.coefficients.delta","mfem.coefficients.delta(center, weight?)","Create a Dirac delta coefficient (point source).",[546,549],{"_17":547,"_19":548,"_41":6},"center","- Center point of the delta function",{"_17":550,"_19":551,"_41":10},"weight","- Weight (scale) of the delta function (defaults to 1.0)","Promise",[],{"_17":555,"_31":556,"_33":557,"_19":557,"_36":558,"_45":562,"_47":563},"mfem.coefficients.diagonal","mfem.coefficients.diagonal(values)","Create a diagonal matrix coefficient from an array of values.",[559],{"_17":560,"_19":561,"_41":6},"values","- Array of diagonal values","Promise",[],{"_17":565,"_31":566,"_33":567,"_19":567,"_36":568,"_45":570,"_47":571},"mfem.coefficients.divergence","mfem.coefficients.divergence(gf)","Create a divergence scalar coefficient from a vector GridFunction.",[569],{"_17":537,"_19":538,"_41":6},"Promise",[],{"_17":573,"_31":574,"_33":575,"_19":575,"_36":576,"_45":580,"_47":581},"mfem.coefficients.functionCoefficient","mfem.coefficients.functionCoefficient(fn)","Create a coefficient from a JavaScript function.",[577],{"_17":578,"_19":579,"_41":6},"fn","- Function (x, y, z) => number","Promise",[],{"_17":583,"_31":584,"_33":585,"_19":585,"_36":586,"_45":589,"_47":590},"mfem.coefficients.gradient","mfem.coefficients.gradient(gf)","Create a gradient vector coefficient from a scalar GridFunction.",[587],{"_17":537,"_19":588,"_41":6},"- Scalar GridFunction instance","Promise",[],{"_17":592,"_31":593,"_33":594,"_19":594,"_36":595,"_45":601,"_47":602},"mfem.coefficients.gridFunctionCoefficient","mfem.coefficients.gridFunctionCoefficient(gf, component?)","Create a coefficient from a GridFunction.",[596,598],{"_17":537,"_19":597,"_41":6},"- GridFunction instance",{"_17":599,"_19":600,"_41":10},"component","- Component to use (1-based, for vector GridFunctions)","Promise",[],{"_17":604,"_31":605,"_33":606,"_19":606,"_36":607,"_45":611,"_47":612},"mfem.coefficients.identity","mfem.coefficients.identity(dim)","Create an identity matrix coefficient.",[608],{"_17":609,"_19":610,"_41":6},"dim","- Dimension of the identity matrix","Promise",[],{"_17":614,"_31":615,"_33":616,"_19":616,"_36":617,"_45":622,"_47":623},"mfem.coefficients.innerProduct","mfem.coefficients.innerProduct(v1, v2)","Create an inner product coefficient from two vector coefficients.",[618,620],{"_17":524,"_19":619,"_41":6},"- First vector coefficient",{"_17":527,"_19":621,"_41":6},"- Second vector coefficient","Promise",[],{"_17":625,"_31":626,"_33":627,"_19":627,"_36":628,"_45":632,"_47":633},"mfem.coefficients.inverse","mfem.coefficients.inverse(m)","Create an inverse of a matrix coefficient.",[629],{"_17":630,"_19":631,"_41":6},"m","- Matrix coefficient to invert","Promise",[],{"_17":635,"_31":636,"_33":637,"_19":637,"_36":638,"_45":641,"_47":642},"mfem.coefficients.matrixConstant","mfem.coefficients.matrixConstant(values)","Create a constant matrix coefficient.",[639],{"_17":560,"_19":640,"_41":6},"- 2D array of values (row-major)","Promise",[],{"_17":644,"_31":645,"_33":646,"_19":646,"_36":647,"_45":656,"_47":657},"mfem.coefficients.matrixFunction","mfem.coefficients.matrixFunction(fn, height, width?)","Create a matrix coefficient from a JavaScript function.",[648,650,653],{"_17":578,"_19":649,"_41":6},"- Function (x, y, z) => number[][]",{"_17":651,"_19":652,"_41":6},"height","- Number of rows",{"_17":654,"_19":655,"_41":10},"width","- Number of columns (defaults to height)","Promise",[],{"_17":659,"_31":660,"_33":661,"_19":661,"_36":662,"_45":668,"_47":669},"mfem.coefficients.matrixProduct","mfem.coefficients.matrixProduct(a, b)","Create a matrix product coefficient from two matrix coefficients.",[663,666],{"_17":664,"_19":665,"_41":6},"a","- First matrix coefficient",{"_17":408,"_19":667,"_41":6},"- Second matrix coefficient","Promise",[],{"_17":671,"_31":672,"_33":673,"_19":673,"_36":674,"_45":678,"_47":679},"mfem.coefficients.normalizedVector","mfem.coefficients.normalizedVector(v)","Create a normalized vector coefficient from a vector coefficient.",[675],{"_17":676,"_19":677,"_41":6},"v","- Vector coefficient to normalize","Promise",[],{"_17":681,"_31":682,"_33":683,"_19":683,"_36":684,"_45":687,"_47":688},"mfem.coefficients.outerProduct","mfem.coefficients.outerProduct(a, b)","Create an outer product coefficient from two vector coefficients.",[685,686],{"_17":664,"_19":619,"_41":6},{"_17":408,"_19":621,"_41":6},"Promise",[],{"_17":690,"_31":691,"_33":692,"_19":692,"_36":693,"_45":696,"_47":697},"mfem.coefficients.piecewiseConstant","mfem.coefficients.piecewiseConstant(values)","Create a piecewise constant coefficient by element attribute.",[694],{"_17":560,"_19":695,"_41":6},"- Map of attribute number (1-based) to value","Promise",[],{"_17":699,"_31":700,"_33":701,"_19":701,"_36":702,"_45":705,"_47":706},"mfem.coefficients.position","mfem.coefficients.position(dim?)","Create a position vector coefficient that returns the spatial position x.",[703],{"_17":609,"_19":704,"_41":10},"- Spatial dimension (1, 2, or 3). Defaults to 3.","Promise",[],{"_17":708,"_31":709,"_33":710,"_19":710,"_36":711,"_45":718,"_47":719},"mfem.coefficients.power","mfem.coefficients.power(c, exponent)","Create a power of a coefficient.",[712,715],{"_17":713,"_19":714,"_41":6},"c","- Base coefficient",{"_17":716,"_19":717,"_41":6},"exponent","- Exponent value","Promise",[],{"_17":721,"_31":722,"_33":723,"_19":723,"_36":724,"_45":731,"_47":732},"mfem.coefficients.product","mfem.coefficients.product(c1, c2)","Create a product of two coefficients.",[725,728],{"_17":726,"_19":727,"_41":6},"c1","- First coefficient",{"_17":729,"_19":730,"_41":6},"c2","- Second coefficient","Promise",[],{"_17":734,"_31":735,"_33":736,"_19":736,"_36":737,"_45":741,"_47":742},"mfem.coefficients.quadratureFunctionCoefficient","mfem.coefficients.quadratureFunctionCoefficient(qf)","Create a coefficient from a scalar quadrature function.",[738],{"_17":739,"_19":740,"_41":6},"qf","- The quadrature function (vdim=1)","Promise",[],{"_17":744,"_31":745,"_33":746,"_19":746,"_36":747,"_45":750,"_47":751},"mfem.coefficients.vectorQuadratureFunctionCoefficient","mfem.coefficients.vectorQuadratureFunctionCoefficient(qf)","Create a vector coefficient from a quadrature function.",[748],{"_17":739,"_19":749,"_41":6},"- The quadrature function","Promise",[],{"_17":753,"_31":754,"_33":755,"_19":755,"_36":756,"_45":763,"_47":764},"mfem.coefficients.restricted","mfem.coefficients.restricted(baseCoeff, attributes)","Create a restricted coefficient from a base coefficient.",[757,760],{"_17":758,"_19":759,"_41":6},"baseCoeff","- The base coefficient to restrict",{"_17":761,"_19":762,"_41":6},"attributes","- Array of mesh attributes where the coefficient is active (1-based)","Promise",[],{"_17":766,"_31":767,"_33":768,"_19":768,"_36":769,"_45":775,"_47":776},"mfem.coefficients.scalarVectorProduct","mfem.coefficients.scalarVectorProduct(s, v)","Create a scalar-vector product coefficient.",[770,773],{"_17":771,"_19":772,"_41":6},"s","- Scalar coefficient",{"_17":676,"_19":774,"_41":6},"- Vector coefficient","Promise",[],{"_17":778,"_31":779,"_33":780,"_19":780,"_36":781,"_45":788,"_47":789},"mfem.coefficients.sum","mfem.coefficients.sum(c1, c2, alpha?, beta?)","Create a sum of two coefficients.",[782,783,784,786],{"_17":726,"_19":727,"_41":6},{"_17":729,"_19":730,"_41":6},{"_17":60,"_19":785,"_41":10},"- Scale factor for c1 (default 1.0)",{"_17":118,"_19":787,"_41":10},"- Scale factor for c2 (default 1.0)","Promise",[],{"_17":791,"_31":792,"_33":793,"_19":793,"_36":794,"_45":799,"_47":800},"mfem.coefficients.symmetric","mfem.coefficients.symmetric(fn, dim)","Create a symmetric matrix coefficient from a JavaScript function.",[795,797],{"_17":578,"_19":796,"_41":6},"- Function (position: number[]) => number[][]",{"_17":609,"_19":798,"_41":6},"- Dimension of the symmetric matrix","Promise",[],{"_17":802,"_31":803,"_33":804,"_19":804,"_36":805,"_45":810,"_47":811},"mfem.coefficients.transformed","mfem.coefficients.transformed(coeff, fn)","Create a transformed coefficient that applies a function to another coefficient.",[806,808],{"_17":43,"_19":807,"_41":6},"- Source coefficient to transform",{"_17":578,"_19":809,"_41":6},"- Transformation function (value) => transformedValue","Promise",[],{"_17":813,"_31":814,"_33":815,"_19":815,"_36":816,"_45":819,"_47":820},"mfem.coefficients.transpose","mfem.coefficients.transpose(m)","Create a transpose of a matrix coefficient.",[817],{"_17":630,"_19":818,"_41":6},"- Matrix coefficient to transpose","Promise",[],{"_17":822,"_31":823,"_33":824,"_19":824,"_36":825,"_45":829,"_47":830},"mfem.coefficients.vectorArray","mfem.coefficients.vectorArray(coeffs)","Create a vector coefficient from an array of scalar coefficients.",[826],{"_17":827,"_19":828,"_41":6},"coeffs","- Array of scalar coefficients for each component","Promise",[],{"_17":832,"_31":833,"_33":834,"_19":834,"_36":835,"_45":838,"_47":839},"mfem.coefficients.vectorConstant","mfem.coefficients.vectorConstant(values)","Create a constant vector coefficient.",[836],{"_17":560,"_19":837,"_41":6},"- Array of constant values","Promise",[],{"_17":841,"_31":842,"_33":843,"_19":843,"_36":844,"_45":849,"_47":850},"mfem.coefficients.vectorDelta","mfem.coefficients.vectorDelta(center, direction)","Create a vector Dirac delta coefficient (directional point source).",[845,846],{"_17":547,"_19":548,"_41":6},{"_17":847,"_19":848,"_41":6},"direction","- Direction vector of the source","Promise",[],{"_17":852,"_31":853,"_33":854,"_19":854,"_36":855,"_45":860,"_47":861},"mfem.coefficients.vectorFunction","mfem.coefficients.vectorFunction(fn, dim?)","Create a vector coefficient from a JavaScript function.",[856,858],{"_17":578,"_19":857,"_41":6},"- Function (x, y, z) => number[]",{"_17":609,"_19":859,"_41":10},"- Output vector dimension (defaults to 3)","Promise",[],{"_17":863,"_31":864,"_33":865,"_19":865,"_36":866,"_45":869,"_47":870},"mfem.coefficients.vectorRotProduct","mfem.coefficients.vectorRotProduct(a, b)","Create a 2D cross product (rotation product) of two vector coefficients.",[867,868],{"_17":664,"_19":619,"_41":6},{"_17":408,"_19":621,"_41":6},"Promise",[],{"_17":872,"_31":873,"_33":874,"_19":874,"_36":875,"_45":516,"_47":878},"mfem.coefficients.ConstantCoefficient.create","mfem.coefficients.ConstantCoefficient.create(value)","Creates a new constant coefficient with the specified value.",[876],{"_17":514,"_19":877,"_41":6},"- The constant value",[],{"_17":880,"_31":881,"_33":882,"_19":882,"_36":883,"_45":539,"_47":886},"mfem.coefficients.CurlCoefficient.create","mfem.coefficients.CurlCoefficient.create(gf)","Creates a new curl coefficient from a vector GridFunction.",[884],{"_17":537,"_19":885,"_41":6},"- The vector GridFunction whose curl to compute",[],{"_17":888,"_31":889,"_33":890,"_19":890,"_36":891,"_45":552,"_47":895},"mfem.coefficients.DeltaCoefficient.create","mfem.coefficients.DeltaCoefficient.create(center, weight?)","Creates a new delta coefficient (point source).",[892,894],{"_17":547,"_19":893,"_41":6},"- Center point of the delta function [x] or [x, y] or [x, y, z]",{"_17":550,"_19":551,"_41":10},[],{"_17":897,"_31":898,"_33":899,"_19":899,"_36":900,"_45":562,"_47":903},"mfem.coefficients.DiagonalMatrixCoefficient.create","mfem.coefficients.DiagonalMatrixCoefficient.create(values)","Creates a new diagonal matrix coefficient.",[901],{"_17":560,"_19":902,"_41":6},"- Array of diagonal values. The length determines the matrix dimension.",[],{"_17":905,"_31":906,"_33":907,"_19":907,"_36":908,"_45":570,"_47":911},"mfem.coefficients.DivergenceCoefficient.create","mfem.coefficients.DivergenceCoefficient.create(gf)","Creates a new divergence coefficient from a vector GridFunction.",[909],{"_17":537,"_19":910,"_41":6},"- The vector GridFunction whose divergence to compute",[],{"_17":913,"_31":914,"_33":915,"_19":915,"_36":916,"_45":580,"_47":919},"mfem.coefficients.FunctionCoefficient.create","mfem.coefficients.FunctionCoefficient.create(fn)","Creates a new function coefficient with the specified evaluation function.",[917],{"_17":578,"_19":918,"_41":6},"- Function that takes (x, y, z) coordinates and returns a scalar value",[],{"_17":921,"_31":922,"_33":923,"_19":923,"_36":924,"_45":589,"_47":927},"mfem.coefficients.GradientCoefficient.create","mfem.coefficients.GradientCoefficient.create(gf)","Creates a new gradient coefficient from a scalar GridFunction.",[925],{"_17":537,"_19":926,"_41":6},"- The scalar GridFunction whose gradient to compute",[],{"_17":929,"_31":930,"_33":931,"_19":931,"_36":932,"_45":601,"_47":937},"mfem.coefficients.GridFunctionCoefficient.create","mfem.coefficients.GridFunctionCoefficient.create(gf, component?)","Creates a new GridFunction coefficient.",[933,935],{"_17":537,"_19":934,"_41":6},"- The GridFunction to evaluate",{"_17":599,"_19":936,"_41":10},"- Component to use for vector GridFunctions (1-based, default 1)",[],{"_17":939,"_31":940,"_33":941,"_19":941,"_36":942,"_45":641,"_47":949},"mfem.coefficients.MatrixConstantCoefficient.create","mfem.coefficients.MatrixConstantCoefficient.create(values, height?, width?)","Creates a new constant matrix coefficient with the specified values.",[943,945,947],{"_17":560,"_19":944,"_41":6},"- 2D array of values (row-major) or 1D array with explicit dimensions",{"_17":651,"_19":946,"_41":10},"- Number of rows (required if values is 1D array)",{"_17":654,"_19":948,"_41":10},"- Number of columns (required if values is 1D array)",[],{"_17":951,"_31":952,"_33":953,"_19":953,"_36":954,"_45":656,"_47":960},"mfem.coefficients.MatrixFunctionCoefficient.create","mfem.coefficients.MatrixFunctionCoefficient.create(fn, height, width?)","Creates a new matrix function coefficient.",[955,957,958],{"_17":578,"_19":956,"_41":6},"- Function that takes (x, y, z) and returns a 2D array",{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":959,"_41":10},"- Number of columns (defaults to height for square matrices)",[],{"_17":962,"_31":963,"_33":964,"_19":964,"_36":965,"_45":668,"_47":968},"mfem.coefficients.MatrixProductCoefficient.create","mfem.coefficients.MatrixProductCoefficient.create(a, b)","Creates a new matrix product coefficient: A * B",[966,967],{"_17":664,"_19":665,"_41":6},{"_17":408,"_19":667,"_41":6},[],{"_17":970,"_31":971,"_33":972,"_19":972,"_36":973,"_45":678,"_47":975},"mfem.coefficients.NormalizedVectorCoefficient.create","mfem.coefficients.NormalizedVectorCoefficient.create(v)","Creates a new normalized vector coefficient: v / ||v||",[974],{"_17":676,"_19":677,"_41":6},[],{"_17":977,"_31":978,"_33":979,"_19":979,"_36":980,"_45":696,"_47":983},"mfem.coefficients.PWConstCoefficient.create","mfem.coefficients.PWConstCoefficient.create(values)","Creates a new piecewise constant coefficient.",[981],{"_17":560,"_19":982,"_41":6},"- Array of values for each attribute (index i corresponds to attribute i+1)",[],{"_17":985,"_31":986,"_33":987,"_19":987,"_36":988,"_45":696,"_47":992},"mfem.coefficients.PWConstCoefficient.createFromMap","mfem.coefficients.PWConstCoefficient.createFromMap(attrValues)","Creates a new piecewise constant coefficient from a Map.",[989],{"_17":990,"_19":991,"_41":6},"attrValues","- Map of attribute numbers (1-based) to values",[],{"_17":994,"_31":995,"_33":996,"_19":996,"_36":997,"_45":705,"_47":999},"mfem.coefficients.PositionVectorCoefficient.create","mfem.coefficients.PositionVectorCoefficient.create(dim?)","Creates a new position vector coefficient.",[998],{"_17":609,"_19":704,"_41":10},[],{"_17":1001,"_31":1002,"_33":1003,"_19":1003,"_36":1004,"_45":718,"_47":1008},"mfem.coefficients.PowerCoefficient.create","mfem.coefficients.PowerCoefficient.create(c, exponent)","Creates a new power coefficient: c^p",[1005,1006],{"_17":713,"_19":714,"_41":6},{"_17":716,"_19":1007,"_41":6},"- Power exponent",[],{"_17":1010,"_31":1011,"_33":1012,"_19":1012,"_36":1013,"_45":731,"_47":1016},"mfem.coefficients.ProductCoefficient.create","mfem.coefficients.ProductCoefficient.create(c1, c2)","Creates a new product coefficient: c1 * c2",[1014,1015],{"_17":726,"_19":727,"_41":6},{"_17":729,"_19":730,"_41":6},[],{"_17":1018,"_31":1019,"_33":1020,"_19":1020,"_36":1021,"_45":741,"_47":1024},"mfem.coefficients.QuadratureFunctionCoefficient.create","mfem.coefficients.QuadratureFunctionCoefficient.create(qf)","Creates a new coefficient from a scalar quadrature function.",[1022],{"_17":739,"_19":1023,"_41":6},"- The quadrature function (must have vdim=1)",[],{"_17":1026,"_31":1027,"_33":1028,"_19":1028,"_36":1029,"_45":750,"_47":1031},"mfem.coefficients.VectorQuadratureFunctionCoefficient.create","mfem.coefficients.VectorQuadratureFunctionCoefficient.create(qf)","Creates a new vector coefficient from a quadrature function.",[1030],{"_17":739,"_19":749,"_41":6},[],{"_17":1033,"_31":1034,"_33":1035,"_19":1035,"_36":1036,"_45":763,"_47":1039},"mfem.coefficients.RestrictedCoefficient.create","mfem.coefficients.RestrictedCoefficient.create(baseCoeff, attributes)","Creates a new restricted coefficient.",[1037,1038],{"_17":758,"_19":759,"_41":6},{"_17":761,"_19":762,"_41":6},[],{"_17":1041,"_31":1042,"_33":1043,"_19":1043,"_36":1044,"_45":775,"_47":1047},"mfem.coefficients.ScalarVectorProductCoefficient.create","mfem.coefficients.ScalarVectorProductCoefficient.create(s, v)","Creates a new scalar-vector product coefficient: s * v",[1045,1046],{"_17":771,"_19":772,"_41":6},{"_17":676,"_19":774,"_41":6},[],{"_17":1049,"_31":1050,"_33":1051,"_19":1051,"_36":1052,"_45":788,"_47":1057},"mfem.coefficients.SumCoefficient.create","mfem.coefficients.SumCoefficient.create(c1, c2, alpha?, beta?)","Creates a new sum coefficient: alpha * c1 + beta * c2",[1053,1054,1055,1056],{"_17":726,"_19":727,"_41":6},{"_17":729,"_19":730,"_41":6},{"_17":60,"_19":785,"_41":10},{"_17":118,"_19":787,"_41":10},[],{"_17":1059,"_31":1060,"_33":1061,"_19":1061,"_36":1062,"_45":799,"_47":1066},"mfem.coefficients.SymmetricMatrixCoefficient.create","mfem.coefficients.SymmetricMatrixCoefficient.create(fn, dim)","Creates a new symmetric matrix function coefficient.",[1063,1065],{"_17":578,"_19":1064,"_41":6},"- Function that takes position [x, y, z] and returns a symmetric 2D array",{"_17":609,"_19":798,"_41":6},[],{"_17":1068,"_31":1069,"_33":1070,"_19":1070,"_36":1071,"_45":810,"_47":1074},"mfem.coefficients.TransformedCoefficient.create","mfem.coefficients.TransformedCoefficient.create(coeff, fn)","Creates a new transformed coefficient: F(Q)",[1072,1073],{"_17":43,"_19":807,"_41":6},{"_17":578,"_19":809,"_41":6},[],{"_17":1076,"_31":1077,"_33":1078,"_19":1078,"_36":1079,"_45":829,"_47":1082},"mfem.coefficients.VectorArrayCoefficient.create","mfem.coefficients.VectorArrayCoefficient.create(dim)","Creates a new vector array coefficient of the specified dimension.",[1080],{"_17":609,"_19":1081,"_41":6},"- Vector dimension",[],{"_17":1084,"_31":1085,"_33":1086,"_19":1086,"_36":1087,"_45":838,"_47":1090},"mfem.coefficients.VectorConstantCoefficient.create","mfem.coefficients.VectorConstantCoefficient.create(values)","Creates a new constant vector coefficient with the specified values.",[1088],{"_17":560,"_19":1089,"_41":6},"- Array of constant values for each component",[],{"_17":1092,"_31":1093,"_33":1094,"_19":1094,"_36":1095,"_45":849,"_47":1099},"mfem.coefficients.VectorDeltaCoefficient.create","mfem.coefficients.VectorDeltaCoefficient.create(center, direction)","Creates a new vector delta coefficient (directional point source).",[1096,1097],{"_17":547,"_19":893,"_41":6},{"_17":847,"_19":1098,"_41":6},"- Direction vector of the source (must match spatial dimension)",[],{"_17":1101,"_31":1102,"_33":1103,"_19":1103,"_36":1104,"_45":860,"_47":1109},"mfem.coefficients.VectorFunctionCoefficient.create","mfem.coefficients.VectorFunctionCoefficient.create(fn, dim)","Creates a new vector function coefficient.",[1105,1107],{"_17":578,"_19":1106,"_41":6},"- Function that takes (x, y, z) and returns a vector",{"_17":609,"_19":1108,"_41":6},"- Output vector dimension",[],{"_17":1111,"_31":1112,"_33":1113,"_19":1113,"_36":1114,"_45":869,"_47":1117},"mfem.coefficients.VectorRotProductCoefficient.create","mfem.coefficients.VectorRotProductCoefficient.create(a, b)","Creates a new VectorRotProductCoefficient: A_x * B_y - A_y * B_x",[1115,1116],{"_17":664,"_19":619,"_41":6},{"_17":408,"_19":621,"_41":6},[],{"_17":1119,"_31":1120,"_33":1121,"_19":1122,"_36":1123,"_45":1130,"_47":1131},"mfem.eigenvalue.getEigenvalues","mfem.eigenvalue.getEigenvalues(solver, numEigs?)","Get computed eigenvalues after solve.\r","Get computed eigenvalues after solve.\r\n\r\nCall this after solve() to retrieve the computed eigenvalues.\r\nIf numEigs is not specified, returns all converged eigenvalues.",[1124,1127],{"_17":1125,"_19":1126,"_41":6},"solver","- LOBPCG solver instance with solved eigenvalues",{"_17":1128,"_19":1129,"_41":10},"numEigs","- Number of eigenvalues to retrieve (defaults to number of converged)","Float64Array",[],{"_17":1133,"_31":1134,"_33":1135,"_19":1136,"_36":1137,"_45":1141,"_47":1142},"mfem.eigenvalue.getEigenvectors","mfem.eigenvalue.getEigenvectors(eigenvectorMatrix)","getEigenvectors","",[1138],{"_17":1139,"_19":1140,"_41":6},"eigenvectorMatrix","DenseMatrix","Float64Array[]",[],{"_17":1144,"_31":1145,"_33":1146,"_19":1147,"_36":1148,"_45":46,"_47":1154},"mfem.eigenvalue.setNumModes","mfem.eigenvalue.setNumModes(solver, numModes)","Set the number of eigenvalues/eigenvectors to compute.\r","Set the number of eigenvalues/eigenvectors to compute.\r\n\r\nThis should match the number of columns in the eigenvector DenseMatrix\r\npassed to solve().",[1149,1151],{"_17":1125,"_19":1150,"_41":6},"- LOBPCG solver instance",{"_17":1152,"_19":1153,"_41":6},"numModes","- Number of eigenpairs to compute",[],{"_17":1156,"_31":1157,"_33":1158,"_19":1159,"_36":1160,"_45":46,"_47":1168},"mfem.eigenvalue.setOperators","mfem.eigenvalue.setOperators(solver, A, B?)","Set A and B operators for generalized eigenvalue problem Ax = λBx.\r","Set A and B operators for generalized eigenvalue problem Ax = λBx.\r\n\r\nFor standard eigenvalue problems (Ax = λx), only pass A.\r\nFor generalized problems (Ax = λBx), pass both A and B.",[1161,1162,1165],{"_17":1125,"_19":1150,"_41":6},{"_17":1163,"_19":1164,"_41":6},"A","- Stiffness matrix/operator A (e.g., SparseMatrix, BilinearForm)",{"_17":1166,"_19":1167,"_41":10},"B","- Mass matrix/operator B for generalized problem (optional)",[],{"_17":1170,"_31":1171,"_33":1172,"_19":1173,"_36":1174,"_45":46,"_47":1180},"mfem.eigenvalue.solve","mfem.eigenvalue.solve(solver, eigenvectors)","Solve the eigenvalue problem using LOBPCG.\r","Solve the eigenvalue problem using LOBPCG.\r\n\r\nSolves: Ax = λBx (generalized) or Ax = λx (standard if B is not set)\r\n\r\nThe eigenvectors will be stored as columns in the provided DenseMatrix.\r\nThe matrix should be pre-allocated with dimensions [nDofs × numModes].",[1175,1177],{"_17":1125,"_19":1176,"_41":6},"- LOBPCG solver instance (must have operators set)",{"_17":1178,"_19":1179,"_41":6},"eigenvectors","- DenseMatrix to store computed eigenvectors (columns are eigenvectors)",[],{"_17":1182,"_31":1183,"_33":1184,"_19":1185,"_36":1186,"_45":1190,"_47":1191},"mfem.eigenvalue.DenseMatrix.create","mfem.eigenvalue.DenseMatrix.create(height, width)","Creates a new dense matrix of specified dimensions.\r","Creates a new dense matrix of specified dimensions.\r\nElements are uninitialized.",[1187,1188],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},"- Number of columns","Promise",[],{"_17":1193,"_31":1194,"_33":1195,"_19":1195,"_36":1196,"_45":1190,"_47":1199},"mfem.eigenvalue.DenseMatrix.zeros","mfem.eigenvalue.DenseMatrix.zeros(height, width)","Creates a zero matrix of specified dimensions.",[1197,1198],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":1201,"_31":1202,"_33":1203,"_19":1203,"_36":1204,"_45":1190,"_47":1208},"mfem.eigenvalue.DenseMatrix.identity","mfem.eigenvalue.DenseMatrix.identity(n)","Creates an identity matrix of size n x n.",[1205],{"_17":1206,"_19":1207,"_41":6},"n","- Matrix dimension",[],{"_17":1210,"_31":1211,"_33":1212,"_19":1212,"_36":1213,"_45":1190,"_47":1217},"mfem.eigenvalue.DenseMatrix.fromArray","mfem.eigenvalue.DenseMatrix.fromArray(data)","Creates a DenseMatrix from a 2D array.",[1214],{"_17":1215,"_19":1216,"_41":6},"data","- 2D array in row-major order (data[row][col])",[],{"_17":1219,"_31":1220,"_33":1221,"_19":1222,"_36":1223,"_45":1190,"_47":1229},"mfem.eigenvalue.DenseMatrix.fromPointer","mfem.eigenvalue.DenseMatrix.fromPointer(ptr, ownsMemory?)","Creates a DenseMatrix from an existing WASM pointer.\r","Creates a DenseMatrix from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[1224,1226],{"_17":310,"_19":1225,"_41":6},"- WASM pointer to an existing MFEM DenseMatrix",{"_17":1227,"_19":1228,"_41":10},"ownsMemory","- Whether this wrapper owns the memory (default: false)",[],{"_17":1231,"_31":1232,"_33":1233,"_19":1233,"_36":1234,"_45":1235,"_47":1236},"mfem.eigenvalue.LOBPCGSolver.create","mfem.eigenvalue.LOBPCGSolver.create()","Creates a new LOBPCG solver.",[],"Promise",[],{"_17":1238,"_31":1239,"_33":1240,"_19":1241,"_36":1242,"_45":1251,"_47":1252},"mfem.fespace.createDG","mfem.fespace.createDG(mesh, order, vdim?)","Creates a Discontinuous Galerkin (DG) finite element space.\r","Creates a Discontinuous Galerkin (DG) finite element space.\r\n\r\nThis is an alias for . DG spaces are L2 spaces used in\r\nDiscontinuous Galerkin methods, where numerical fluxes connect elements.\r\n\r\nDG methods are popular for:\r\n- Hyperbolic conservation laws\r\n- Advection-dominated transport\r\n- Problems with sharp gradients or shocks\r\n- hp-adaptivity",[1243,1245,1248],{"_17":418,"_19":1244,"_41":6},"- The mesh on which to define the space",{"_17":1246,"_19":1247,"_41":6},"order","- Polynomial order (0 = piecewise constant, 1 = linear, etc.)",{"_17":1249,"_19":1250,"_41":10},"vdim","- Vector dimension (default 1 for scalar fields)","Promise",[],{"_17":1254,"_31":1255,"_33":1256,"_19":1257,"_36":1258,"_45":1251,"_47":1263},"mfem.fespace.createH1","mfem.fespace.createH1(mesh, order, vdim?)","Creates an H1 (continuous Lagrange) finite element space.\r","Creates an H1 (continuous Lagrange) finite element space.\r\n\r\nH1 spaces use continuous piecewise polynomial functions that are globally\r\nconforming in H1 (functions with square-integrable first derivatives).\r\nThey are the most common choice for:\r\n- Scalar problems (heat transfer, Poisson equation)\r\n- Vector problems (elasticity, Stokes flow)",[1259,1260,1262],{"_17":418,"_19":1244,"_41":6},{"_17":1246,"_19":1261,"_41":6},"- Polynomial order (1 = linear, 2 = quadratic, 3 = cubic, etc.)",{"_17":1249,"_19":1250,"_41":10},[],{"_17":1265,"_31":1266,"_33":1267,"_19":1268,"_36":1269,"_45":1251,"_47":1274},"mfem.fespace.createH1Positive","mfem.fespace.createH1Positive(mesh, order, vdim?)","Creates an H1 finite element space with positive (Bernstein) basis.\r","Creates an H1 finite element space with positive (Bernstein) basis.\r\n\r\nBernstein basis functions are non-negative and form a partition of unity,\r\nmaking them ideal for applications requiring positivity preservation:\r\n- Concentration fields that must remain positive\r\n- Probability distributions\r\n- NURBS-like representations\r\n\r\nThe space has the same approximation properties as standard H1 but with\r\ndifferent basis function properties.",[1270,1271,1273],{"_17":418,"_19":1244,"_41":6},{"_17":1246,"_19":1272,"_41":6},"- Polynomial order (1 = linear, 2 = quadratic, etc.)",{"_17":1249,"_19":1250,"_41":10},[],{"_17":1276,"_31":1277,"_33":1278,"_19":1279,"_36":1280,"_45":1251,"_47":1285},"mfem.fespace.createHcurl","mfem.fespace.createHcurl(mesh, order)","Creates an H(curl) (Nedelec) finite element space.\r","Creates an H(curl) (Nedelec) finite element space.\r\n\r\nH(curl) spaces are designed for vector fields where the curl is well-defined\r\nand square-integrable. They are essential for:\r\n- Electromagnetics (electric field, magnetic vector potential)\r\n- Maxwell's equations\r\n- Edge element discretizations\r\n\r\nThe tangential component is continuous across element faces while the\r\nnormal component may be discontinuous.",[1281,1283],{"_17":418,"_19":1282,"_41":6},"- The mesh on which to define the space (must be 2D or 3D)",{"_17":1246,"_19":1284,"_41":6},"- Polynomial order (1 = lowest order Nedelec, etc.)",[],{"_17":1287,"_31":1288,"_33":1289,"_19":1290,"_36":1291,"_45":1251,"_47":1295},"mfem.fespace.createHdiv","mfem.fespace.createHdiv(mesh, order)","Creates an H(div) (Raviart-Thomas) finite element space.\r","Creates an H(div) (Raviart-Thomas) finite element space.\r\n\r\nH(div) spaces are designed for vector fields where the divergence is\r\nwell-defined and square-integrable. They are essential for:\r\n- Fluid flow (velocity fields)\r\n- Mixed finite element methods\r\n- Darcy flow and porous media\r\n- Magnetic flux density in electromagnetics\r\n\r\nThe normal component is continuous across element faces while the\r\ntangential component may be discontinuous.",[1292,1293],{"_17":418,"_19":1282,"_41":6},{"_17":1246,"_19":1294,"_41":6},"- Polynomial order (0 = lowest order RT, etc.)",[],{"_17":1297,"_31":1298,"_33":1299,"_19":1300,"_36":1301,"_45":1251,"_47":1305},"mfem.fespace.createL2","mfem.fespace.createL2(mesh, order, vdim?)","Creates an L2 (discontinuous) finite element space.\r","Creates an L2 (discontinuous) finite element space.\r\n\r\nL2 spaces use piecewise polynomial functions with no continuity constraints\r\nacross element boundaries. This allows for:\r\n- Discontinuous Galerkin (DG) methods\r\n- Higher accuracy for advection-dominated problems\r\n- Local conservation properties\r\n- Representation of discontinuous fields\r\n\r\nL2 spaces have more DOFs than H1 spaces for the same mesh and order,\r\nas each element has its own independent polynomial representation.",[1302,1303,1304],{"_17":418,"_19":1244,"_41":6},{"_17":1246,"_19":1247,"_41":6},{"_17":1249,"_19":1250,"_41":10},[],{"_17":1307,"_31":1308,"_33":1309,"_19":1310,"_36":1311,"_45":1251,"_47":1315},"mfem.fespace.createND","mfem.fespace.createND(mesh, order)","Creates a Nedelec (ND) finite element space.\r","Creates a Nedelec (ND) finite element space.\r\n\r\nThis is an alias for . Nedelec elements are edge elements\r\nthat conform to H(curl), named after Jean-Claude Nédélec who introduced them.\r\n\r\nCommon applications:\r\n- Electric field in electromagnetics\r\n- Magnetic vector potential\r\n- Any vector field where curl is the primary differential operator",[1312,1313],{"_17":418,"_19":1282,"_41":6},{"_17":1246,"_19":1314,"_41":6},"- Polynomial order (1 = lowest order, etc.)",[],{"_17":1317,"_31":1318,"_33":1319,"_19":1320,"_36":1321,"_45":1327,"_47":1328},"mfem.fespace.createNURBS","mfem.fespace.createNURBS(mesh, order?, vdim?)","Creates a NURBS finite element space.\r","Creates a NURBS finite element space.\r\n\r\nNURBS (Non-Uniform Rational B-Splines) spaces are used for isogeometric\r\nanalysis (IGA), where the same basis functions used for CAD geometry\r\nrepresentation are used for the finite element analysis. This provides\r\nexact geometry representation and higher continuity across elements.\r\n\r\nThe mesh must be a NURBS mesh (created from NURBS patch data). Standard\r\nmeshes created with `makeCartesian2D` or similar functions cannot be used.",[1322,1324,1326],{"_17":418,"_19":1323,"_41":6},"- A NURBS mesh instance (must have NURBS extension)",{"_17":1246,"_19":1325,"_41":10},"- Polynomial order. Use -1 or 0 for variable order (uses\r\n the mesh's native NURBS order from each patch)",{"_17":1249,"_19":1250,"_41":10},"FiniteElementSpace",[],{"_17":1330,"_31":1331,"_33":1332,"_19":1333,"_36":1334,"_45":1251,"_47":1338},"mfem.fespace.createRT","mfem.fespace.createRT(mesh, order)","Creates a Raviart-Thomas (RT) finite element space.\r","Creates a Raviart-Thomas (RT) finite element space.\r\n\r\nThis is an alias for . Raviart-Thomas elements are face\r\nelements that conform to H(div), named after Pierre-Arnaud Raviart and\r\nJean-Marie Thomas who introduced them.\r\n\r\nCommon applications:\r\n- Velocity in mixed formulations\r\n- Flux variables in conservation laws\r\n- Magnetic flux density",[1335,1336],{"_17":418,"_19":1282,"_41":6},{"_17":1246,"_19":1337,"_41":6},"- Polynomial order (0 = lowest order, etc.)",[],{"_17":1340,"_31":1341,"_33":1342,"_19":1343,"_36":1344,"_45":1346,"_47":1347},"mfem.fespace.getAllDofCoordinates","mfem.fespace.getAllDofCoordinates(fespace)","Gets the physical coordinates for all degrees of freedom in a finite element space.\r","Gets the physical coordinates for all degrees of freedom in a finite element space.\r\n\r\nThis function iterates over all elements in the mesh and collects the physical\r\ncoordinates of each DOF. For DOFs shared between elements, the coordinates from\r\nthe first encountered element are used.\r\n\r\n**Performance note:** This function allocates temporary WASM memory and iterates\r\nover all elements. For large meshes, consider caching the result.",[1345],{"_17":209,"_19":267,"_41":6},"Promise>",[],{"_17":1349,"_31":1350,"_33":1351,"_19":1352,"_36":1353,"_45":374,"_47":1358},"mfem.fespace.getBoundaryDofs","mfem.fespace.getBoundaryDofs(fespace, bdrAttr)","Gets the DOF indices on a boundary with a specific attribute.\r","Gets the DOF indices on a boundary with a specific attribute.\r\n\r\nReturns the true (global) DOF indices that lie on boundary elements\r\nwith the specified attribute. This is useful for applying Dirichlet\r\nboundary conditions on specific parts of the domain boundary.",[1354,1355],{"_17":209,"_19":267,"_41":6},{"_17":1356,"_19":1357,"_41":6},"bdrAttr","- The boundary attribute (1-based, as defined in the mesh)",[],{"_17":1360,"_31":1361,"_33":1362,"_19":1363,"_36":1364,"_45":422,"_47":1369},"mfem.fespace.getDofMap","mfem.fespace.getDofMap(fespace, elemIndex)","Gets the DOF indices for a specific element.\r","Gets the DOF indices for a specific element.\r\n\r\nReturns the global DOF indices associated with the specified element.\r\nThis is useful for assembling local element contributions into global\r\nmatrices and vectors.",[1365,1366],{"_17":209,"_19":267,"_41":6},{"_17":1367,"_19":1368,"_41":6},"elemIndex","- The element index (0-based)",[],{"_17":1371,"_31":1372,"_33":1373,"_19":1374,"_36":1375,"_45":374,"_47":1379},"mfem.fespace.getEssentialDofs","mfem.fespace.getEssentialDofs(fespace, bdrAttrs)","Gets the essential (Dirichlet) DOF indices for specified boundary attributes.\r","Gets the essential (Dirichlet) DOF indices for specified boundary attributes.\r\n\r\nReturns the true (global) DOF indices that should be constrained for\r\nDirichlet boundary conditions on the specified boundary attributes.\r\nMultiple boundary attributes can be specified to get DOFs from several\r\nboundary regions at once.",[1376,1377],{"_17":209,"_19":267,"_41":6},{"_17":373,"_19":1378,"_41":6},"- Array of boundary attributes (1-based, as defined in the mesh)",[],{"_17":1381,"_31":1382,"_33":1383,"_19":1384,"_36":1385,"_45":1387,"_47":1388},"mfem.fespace.order","mfem.fespace.order(fespace)","Gets the maximum polynomial order of the finite element space.\r","Gets the maximum polynomial order of the finite element space.\r\n\r\nFor spaces with variable order (hp-adaptivity), this returns the\r\nmaximum order across all elements.",[1386],{"_17":209,"_19":267,"_41":6},"number",[],{"_17":1390,"_31":1391,"_33":1256,"_19":1392,"_36":1393,"_45":1251,"_47":1398},"mfem.fespace.FiniteElementSpace.createH1","mfem.fespace.FiniteElementSpace.createH1(mesh, order, vdim?)","Creates an H1 (continuous Lagrange) finite element space.\r\n\r\nH1 spaces use continuous piecewise polynomial functions. They are the most\r\ncommon choice for scalar problems like heat transfer, and for vector problems\r\nlike elasticity.\r\n\r\n**Basis functions:**\r\n- Order 1: Linear (nodal values at vertices)\r\n- Order 2: Quadratic (nodal values at vertices and edge midpoints)\r\n- Order p: Polynomial of degree p",[1394,1395,1396],{"_17":418,"_19":1244,"_41":6},{"_17":1246,"_19":1272,"_41":6},{"_17":1249,"_19":1397,"_41":10},"- Vector dimension (default 1 for scalar fields, 2 or 3 for vector fields)",[],{"_17":1400,"_31":1401,"_33":1402,"_19":1403,"_36":1404,"_45":1387,"_47":1410},"mfem.gridfunction.computeError","mfem.gridfunction.computeError(gf, exactValue)","Computes the L2 error between a grid function and a constant exact solution.\r","Computes the L2 error between a grid function and a constant exact solution.\r\n\r\nThe L2 error is defined as:\r\n```\r\n||u - u_exact||_L2 = sqrt( ∫_Ω |u(x) - u_exact|² dx )\r\n```\r\n\r\nThis is useful for verifying solutions against known manufactured solutions\r\nor for convergence studies.",[1405,1407],{"_17":537,"_19":1406,"_41":6},"- GridFunction (numerical solution)",{"_17":1408,"_19":1409,"_41":6},"exactValue","- The constant exact solution value",[],{"_17":1412,"_31":1413,"_33":1414,"_19":1415,"_36":1416,"_45":1387,"_47":1425},"mfem.gridfunction.computeH1Error","mfem.gridfunction.computeH1Error(gf, coeffPtr?, dcoeffPtr?)","Computes the H1 error between a grid function and an exact solution.\r","Computes the H1 error between a grid function and an exact solution.\r\n\r\nThe H1 error combines the L2 error of the function and its gradient:\r\n||u - u_exact||_H1 = sqrt(||u - u_exact||²_L2 + ||∇u - ∇u_exact||²_L2)\r\n\r\nYou can provide either or both of:\r\n- The exact solution coefficient (for the L2 part)\r\n- The gradient of the exact solution (for the gradient part)",[1417,1419,1422],{"_17":537,"_19":1418,"_41":6},"- The grid function (numerical solution)",{"_17":1420,"_19":1421,"_41":10},"coeffPtr","- Pointer to Coefficient for exact solution (or 0 to skip L2 part)",{"_17":1423,"_19":1424,"_41":10},"dcoeffPtr","- Pointer to VectorCoefficient for exact gradient (or 0 to skip gradient part)",[],{"_17":1427,"_31":1428,"_33":1429,"_19":1430,"_36":1431,"_45":1387,"_47":1435},"mfem.gridfunction.computeL2ErrorCoeff","mfem.gridfunction.computeL2ErrorCoeff(gf, coeffPtr)","Computes the L2 error between a grid function and an exact solution\r","Computes the L2 error between a grid function and an exact solution\r\nrepresented as a scalar coefficient.\r\n\r\nThe L2 error is defined as:\r\n||u - u_exact||_L2 = sqrt(∫ |u(x) - u_exact(x)|² dx)",[1432,1433],{"_17":537,"_19":1418,"_41":6},{"_17":1420,"_19":1434,"_41":6},"- Pointer to a Coefficient representing the exact solution",[],{"_17":1437,"_31":1438,"_33":1439,"_19":1440,"_36":1441,"_45":1387,"_47":1447},"mfem.gridfunction.computeL2ErrorVCoeff","mfem.gridfunction.computeL2ErrorVCoeff(gf, vcoeffPtr)","Computes the L2 error between a vector grid function and an exact solution\r","Computes the L2 error between a vector grid function and an exact solution\r\nrepresented as a vector coefficient.\r\n\r\nThe L2 error is defined as:\r\n||u - u_exact||_L2 = sqrt(∫ |u(x) - u_exact(x)|² dx)\r\n\r\nwhere |·| is the Euclidean norm of the vector difference.",[1442,1444],{"_17":537,"_19":1443,"_41":6},"- The vector grid function (numerical solution)",{"_17":1445,"_19":1446,"_41":6},"vcoeffPtr","- Pointer to a VectorCoefficient representing the exact solution",[],{"_17":1449,"_31":1450,"_33":1451,"_19":1452,"_36":1453,"_45":1387,"_47":1456},"mfem.gridfunction.computeMaxError","mfem.gridfunction.computeMaxError(gf, coeffPtr)","Computes the maximum (L-infinity) error between a grid function and\r","Computes the maximum (L-infinity) error between a grid function and\r\nan exact solution represented as a coefficient.\r\n\r\nThe max error is defined as:\r\n||u - u_exact||_L∞ = max_x |u(x) - u_exact(x)|\r\n\r\nThis is useful for checking pointwise accuracy of a solution.",[1454,1455],{"_17":537,"_19":1418,"_41":6},{"_17":1420,"_19":1434,"_41":6},[],{"_17":1458,"_31":1459,"_33":1460,"_19":1461,"_36":1462,"_45":1387,"_47":1471},"mfem.gridfunction.computeW11Error","mfem.gridfunction.computeW11Error(gf, coeffPtr?, dcoeffPtr?, normType?)","Computes the W^{1,1} error between a grid function and an exact solution.\r","Computes the W^{1,1} error between a grid function and an exact solution.\r\n\r\nThe W^{1,1} norm uses L1 integrals instead of L2:\r\n||u - u_exact||_{W^{1,1}} = ∫ |u - u_exact| dx + ∫ |∇u - ∇u_exact| dx\r\n\r\nThis error measure is more robust to outliers than L2-based errors.",[1463,1464,1466,1468],{"_17":537,"_19":1418,"_41":6},{"_17":1420,"_19":1465,"_41":10},"- Pointer to Coefficient for exact solution (or 0 to skip)",{"_17":1423,"_19":1467,"_41":10},"- Pointer to VectorCoefficient for exact gradient (or 0 to skip)",{"_17":1469,"_19":1470,"_41":10},"normType","- Which components to include (default: BOTH)",[],{"_17":1473,"_31":1474,"_33":1475,"_19":1476,"_36":1477,"_45":1482,"_47":1483},"mfem.gridfunction.fromBinary","mfem.gridfunction.fromBinary(fespace, data)","Loads a grid function from a base64-encoded binary string with an existing FE space.\r","Loads a grid function from a base64-encoded binary string with an existing FE space.\r\n\r\nThis is the inverse of . The base64 string is decoded\r\nand parsed as an MFEM format grid function. You must provide the\r\nFiniteElementSpace that matches the saved data.",[1478,1480],{"_17":209,"_19":1479,"_41":6},"- The finite element space for the grid function",{"_17":1215,"_19":1481,"_41":6},"- Base64-encoded string containing grid function data","Promise",[],{"_17":1485,"_31":1486,"_33":1487,"_19":1488,"_36":1489,"_45":1482,"_47":1493},"mfem.gridfunction.fromBinaryWithMesh","mfem.gridfunction.fromBinaryWithMesh(mesh, data)","Loads a grid function from a base64-encoded binary string with auto-detected FE space.\r","Loads a grid function from a base64-encoded binary string with auto-detected FE space.\r\n\r\nThis is the inverse of . The base64 string is decoded\r\nand parsed as an MFEM format grid function. The FE space is automatically\r\nreconstructed from the saved header information.\r\n\r\nThe returned GridFunction owns its FESpace.",[1490,1492],{"_17":418,"_19":1491,"_41":6},"- The mesh for the grid function",{"_17":1215,"_19":1481,"_41":6},[],{"_17":1495,"_31":1496,"_33":1497,"_19":1498,"_36":1499,"_45":1482,"_47":1504},"mfem.gridfunction.fromCoefficient","mfem.gridfunction.fromCoefficient(fespace, value)","Creates a new grid function initialized with a constant value.\r","Creates a new grid function initialized with a constant value.\r\n\r\nThis is a convenience function that creates a grid function and projects\r\na constant coefficient onto it. For more complex coefficients, create a\r\ngrid function manually and use projection functions.",[1500,1502],{"_17":209,"_19":1501,"_41":6},"- The finite element space on which to define the function",{"_17":514,"_19":1503,"_41":6},"- The constant value to project",[],{"_17":1506,"_31":1507,"_33":1508,"_19":1509,"_36":1510,"_45":1482,"_47":1514},"mfem.gridfunction.fromFunction","mfem.gridfunction.fromFunction(fespace, fn)","Creates a new grid function initialized by evaluating a function at DOF locations.\r","Creates a new grid function initialized by evaluating a function at DOF locations.\r\n\r\nThe function is evaluated at the physical coordinates of each degree of freedom\r\n(node) in the finite element space. For Lagrange elements, these are the nodal\r\ninterpolation points.\r\n\r\n**Note:** This performs nodal interpolation, not L2 projection. For smoother\r\nresults with non-smooth functions, consider using L2 projection methods.",[1511,1512],{"_17":209,"_19":1501,"_41":6},{"_17":578,"_19":1513,"_41":6},"- Function that takes coordinates [x, y?, z?] and returns a scalar value",[],{"_17":1516,"_31":1517,"_33":1518,"_19":1519,"_36":1520,"_45":1482,"_47":1524},"mfem.gridfunction.fromMFEM","mfem.gridfunction.fromMFEM(fespace, data)","Loads a grid function from an MFEM format string into an existing GridFunction.\r","Loads a grid function from an MFEM format string into an existing GridFunction.\r\n\r\nThe GridFunction must already have an associated FiniteElementSpace that\r\nmatches the data being loaded. Use this when you already know the FE type\r\nand have created the space.",[1521,1522],{"_17":209,"_19":1479,"_41":6},{"_17":1215,"_19":1523,"_41":6},"- MFEM format grid function string",[],{"_17":1526,"_31":1527,"_33":1528,"_19":1529,"_36":1530,"_45":1482,"_47":1533},"mfem.gridfunction.fromMFEMWithMesh","mfem.gridfunction.fromMFEMWithMesh(mesh, data)","Creates a grid function from an MFEM format string with auto-detected FE space.\r","Creates a grid function from an MFEM format string with auto-detected FE space.\r\n\r\nThis function parses the FE collection information from the saved data header\r\nand automatically creates the appropriate FiniteElementSpace. Use this when\r\nloading a solution where you don't know the FE type in advance.\r\n\r\nThe returned GridFunction owns its FESpace, which will be destroyed when\r\nthe GridFunction is destroyed.",[1531,1532],{"_17":418,"_19":1491,"_41":6},{"_17":1215,"_19":1523,"_41":6},[],{"_17":1535,"_31":1536,"_33":1537,"_19":1538,"_36":1539,"_45":1130,"_47":1544},"mfem.gridfunction.getAllNodalValues","mfem.gridfunction.getAllNodalValues(gf, vdim?)","Gets the values of a grid function at all vertices of the mesh.\r","Gets the values of a grid function at all vertices of the mesh.\r\n\r\nThis returns one value per vertex for the entire mesh, which is useful\r\nfor visualization or post-processing. For vector-valued grid functions,\r\nyou can specify which component to extract.",[1540,1542],{"_17":537,"_19":1541,"_41":6},"- The grid function to evaluate",{"_17":1249,"_19":1543,"_41":10},"- Vector component to extract (1-based, default 1 for scalar)",[],{"_17":1546,"_31":1547,"_33":1548,"_19":1549,"_36":1550,"_45":374,"_47":1559},"mfem.gridfunction.getCurl","mfem.gridfunction.getCurl(gf, elemIdx, ip)","Computes the curl of a vector grid function at a point within an element.\r","Computes the curl of a vector grid function at a point within an element.\r\n\r\nThe curl is computed in physical coordinates:\r\n- In 3D: curl = [∂Fz/∂y - ∂Fy/∂z, ∂Fx/∂z - ∂Fz/∂x, ∂Fy/∂x - ∂Fx/∂y]\r\n- In 2D: curl is a scalar (z-component of the 3D curl)\r\n\r\nThis is typically used with H(curl) finite element spaces (Nedelec elements).",[1551,1553,1556],{"_17":537,"_19":1552,"_41":6},"- Vector GridFunction (e.g., from H(curl) space)",{"_17":1554,"_19":1555,"_41":6},"elemIdx","- Index of the element containing the point (0-based)",{"_17":1557,"_19":1558,"_41":6},"ip","- Integration point in reference coordinates",[],{"_17":1561,"_31":1562,"_33":1563,"_19":1564,"_36":1565,"_45":46,"_47":1577},"mfem.gridfunction.getDerivative","mfem.gridfunction.getDerivative(gf, comp, derComp, destGf)","Computes the derivative of a grid function component in a specified direction\r","Computes the derivative of a grid function component in a specified direction\r\nand projects it onto another grid function.\r\n\r\nThis computes ∂u_comp/∂x_derComp where comp is the component of a\r\nvector-valued function and derComp is the spatial direction.",[1566,1568,1571,1574],{"_17":537,"_19":1567,"_41":6},"- The source grid function",{"_17":1569,"_19":1570,"_41":6},"comp","- Component to differentiate (1-based: 1, 2, or 3)",{"_17":1572,"_19":1573,"_41":6},"derComp","- Direction of differentiation (1=x, 2=y, 3=z)",{"_17":1575,"_19":1576,"_41":6},"destGf","- Destination grid function (must be pre-created on same mesh)",[],{"_17":1579,"_31":1580,"_33":1581,"_19":1582,"_36":1583,"_45":1387,"_47":1588},"mfem.gridfunction.getDivergence","mfem.gridfunction.getDivergence(gf, elemIdx, ip)","Computes the divergence of a vector grid function at a point within an element.\r","Computes the divergence of a vector grid function at a point within an element.\r\n\r\nThe divergence is computed in physical coordinates:\r\ndiv(F) = ∂Fx/∂x + ∂Fy/∂y + ∂Fz/∂z\r\n\r\nThis is typically used with H(div) finite element spaces (Raviart-Thomas elements).",[1584,1586,1587],{"_17":537,"_19":1585,"_41":6},"- Vector GridFunction (e.g., from H(div) space)",{"_17":1554,"_19":1555,"_41":6},{"_17":1557,"_19":1558,"_41":6},[],{"_17":1590,"_31":1591,"_33":1592,"_19":1593,"_36":1594,"_45":374,"_47":1599},"mfem.gridfunction.getGradient","mfem.gridfunction.getGradient(gf, elemIdx, ip)","Computes the gradient of a scalar grid function at a point within an element.\r","Computes the gradient of a scalar grid function at a point within an element.\r\n\r\nThe gradient is computed in physical (not reference) coordinates. The result\r\nis a vector with components [∂f/∂x, ∂f/∂y, ∂f/∂z] (depending on dimension).",[1595,1597,1598],{"_17":537,"_19":1596,"_41":6},"- Scalar GridFunction to differentiate",{"_17":1554,"_19":1555,"_41":6},{"_17":1557,"_19":1558,"_41":6},[],{"_17":1601,"_31":1602,"_33":1603,"_19":1604,"_36":1605,"_45":1612,"_47":1613},"mfem.gridfunction.getGradients","mfem.gridfunction.getGradients(gf, elemIdx, points)","Computes gradients of a grid function at multiple integration points\r","Computes gradients of a grid function at multiple integration points\r\nwithin an element.\r\n\r\nThis is more efficient than calling multiple times\r\nwhen you need gradients at many points in the same element.",[1606,1607,1609],{"_17":537,"_19":1541,"_41":6},{"_17":1554,"_19":1608,"_41":6},"- Element index (0-based)",{"_17":1610,"_19":1611,"_41":6},"points","- Array of integration points in reference element coordinates","GradientsResult",[],{"_17":1615,"_31":1616,"_33":1617,"_19":1618,"_36":1619,"_45":1624,"_47":1625},"mfem.gridfunction.getHessian","mfem.gridfunction.getHessian(gf, elemIdx, ip)","Computes the Hessian matrix of a grid function at a point within an element.\r","Computes the Hessian matrix of a grid function at a point within an element.\r\n\r\nThe Hessian is the matrix of second partial derivatives:\r\n```\r\nH = | ∂²u/∂x² ∂²u/∂x∂y ∂²u/∂x∂z |\r\n | ∂²u/∂y∂x ∂²u/∂y² ∂²u/∂y∂z |\r\n | ∂²u/∂z∂x ∂²u/∂z∂y ∂²u/∂z² |\r\n```",[1620,1621,1622],{"_17":537,"_19":1541,"_41":6},{"_17":1554,"_19":1608,"_41":6},{"_17":1557,"_19":1623,"_41":6},"- Integration point in reference element coordinates","HessianResult",[],{"_17":1627,"_31":1628,"_33":1629,"_19":1630,"_36":1631,"_45":1387,"_47":1637},"mfem.gridfunction.getLaplacian","mfem.gridfunction.getLaplacian(gf, elemIdx, ip, vdim?)","Computes the Laplacian of a grid function at a point within an element.\r","Computes the Laplacian of a grid function at a point within an element.\r\n\r\nThe Laplacian is the sum of second partial derivatives:\r\nΔu = ∂²u/∂x² + ∂²u/∂y² + ∂²u/∂z²",[1632,1633,1634,1635],{"_17":537,"_19":1541,"_41":6},{"_17":1554,"_19":1608,"_41":6},{"_17":1557,"_19":1623,"_41":6},{"_17":1249,"_19":1636,"_41":10},"- Vector component (1-based, default 1 for scalar)",[],{"_17":1639,"_31":1640,"_33":1641,"_19":1642,"_36":1643,"_45":374,"_47":1647},"mfem.gridfunction.getNodalValues","mfem.gridfunction.getNodalValues(gf, elemIdx, vdim?)","Gets the values of a grid function at the vertices of a specific element.\r","Gets the values of a grid function at the vertices of a specific element.\r\n\r\nThis is simpler than using for extracting vertex values,\r\nas it directly returns all nodal values for an element without requiring\r\nintegration point coordinates.",[1644,1645,1646],{"_17":537,"_19":1541,"_41":6},{"_17":1554,"_19":1608,"_41":6},{"_17":1249,"_19":1543,"_41":10},[],{"_17":1649,"_31":1650,"_33":1651,"_19":1652,"_36":1653,"_45":1387,"_47":1658},"mfem.gridfunction.getValue","mfem.gridfunction.getValue(gf, elemIdx, ip)","Evaluates a grid function at a point within a specific element.\r","Evaluates a grid function at a point within a specific element.\r\n\r\nThe point is specified in reference (local) coordinates of the element.\r\nFor most elements, these coordinates range from 0 to 1.",[1654,1656,1657],{"_17":537,"_19":1655,"_41":6},"- GridFunction to evaluate",{"_17":1554,"_19":1555,"_41":6},{"_17":1557,"_19":1558,"_41":6},[],{"_17":1660,"_31":1661,"_33":1662,"_19":1663,"_36":1664,"_45":1130,"_47":1669},"mfem.gridfunction.getVectorFieldNodalValues","mfem.gridfunction.getVectorFieldNodalValues(gf, component)","Gets the values of a specific component of a vector-valued grid function\r","Gets the values of a specific component of a vector-valued grid function\r\nat all vertices of the mesh.\r\n\r\nThis is useful for extracting individual components (e.g., x-velocity,\r\ny-velocity) from a vector field for visualization or analysis.",[1665,1667],{"_17":537,"_19":1666,"_41":6},"- The vector GridFunction to evaluate",{"_17":599,"_19":1668,"_41":6},"- Component index (1-based: 1=x, 2=y, 3=z)",[],{"_17":1671,"_31":1672,"_33":1673,"_19":1674,"_36":1675,"_45":374,"_47":1679},"mfem.gridfunction.getVectorValue","mfem.gridfunction.getVectorValue(gf, elemIdx, ip)","Evaluates a vector-valued grid function at a point within an element.\r","Evaluates a vector-valued grid function at a point within an element.\r\n\r\nThis is the vector analog of . It returns all components\r\nof the vector field at the specified point.",[1676,1677,1678],{"_17":537,"_19":1666,"_41":6},{"_17":1554,"_19":1608,"_41":6},{"_17":1557,"_19":1623,"_41":6},[],{"_17":1681,"_31":1682,"_33":1683,"_19":1684,"_36":1685,"_45":1689,"_47":1690},"mfem.gridfunction.getVectorValues","mfem.gridfunction.getVectorValues(gf, elemIdx, points)","Evaluates a vector-valued grid function at multiple integration points within an element.\r","Evaluates a vector-valued grid function at multiple integration points within an element.\r\n\r\nThis is more efficient than calling multiple times\r\nwhen you need values at many points in the same element.",[1686,1687,1688],{"_17":537,"_19":1666,"_41":6},{"_17":1554,"_19":1608,"_41":6},{"_17":1610,"_19":1611,"_41":6},"VectorValuesResult",[],{"_17":1692,"_31":1693,"_33":1694,"_19":1695,"_36":1696,"_45":1387,"_47":1699},"mfem.gridfunction.normH1","mfem.gridfunction.normH1(gf)","Computes the H1 norm of a grid function.\r","Computes the H1 norm of a grid function.\r\n\r\nThe H1 norm is defined as:\r\n```\r\n||u||_H1 = sqrt( ||u||²_L2 + ||∇u||²_L2 )\r\n = sqrt( ∫_Ω |u(x)|² dx + ∫_Ω |∇u(x)|² dx )\r\n```\r\n\r\nThis norm measures both the function values and their derivatives,\r\nmaking it suitable for error analysis in elliptic PDEs.\r\n\r\n**Note:** This function returns the H1 seminorm (gradient norm only).\r\nTo get the full H1 norm, combine with the L2 norm:\r\n`sqrt(normL2(gf)**2 + normH1(gf)**2)`",[1697],{"_17":537,"_19":1698,"_41":6},"- GridFunction to compute norm of",[],{"_17":1701,"_31":1702,"_33":1703,"_19":1704,"_36":1705,"_45":1387,"_47":1707},"mfem.gridfunction.normL2","mfem.gridfunction.normL2(gf)","Computes the L2 norm of a grid function.\r","Computes the L2 norm of a grid function.\r\n\r\nThe L2 norm is defined as:\r\n```\r\n||u||_L2 = sqrt( ∫_Ω |u(x)|² dx )\r\n```\r\n\r\nThis is computed using numerical quadrature over all elements in the mesh.",[1706],{"_17":537,"_19":1698,"_41":6},[],{"_17":1709,"_31":1710,"_33":1711,"_19":1712,"_36":1713,"_45":1387,"_47":1715},"mfem.gridfunction.normLinf","mfem.gridfunction.normLinf(gf)","Computes the L-infinity (maximum) norm of a grid function.\r","Computes the L-infinity (maximum) norm of a grid function.\r\n\r\nThe L-infinity norm is defined as:\r\n```\r\n||u||_∞ = max |u(x)| over all x in Ω\r\n```\r\n\r\nIn practice, this is computed as the maximum absolute value of the DOF coefficients.",[1714],{"_17":537,"_19":1698,"_41":6},[],{"_17":1717,"_31":1718,"_33":1719,"_19":1720,"_36":1721,"_45":46,"_47":1728},"mfem.gridfunction.projectBdrCoefficient","mfem.gridfunction.projectBdrCoefficient(gf, value, bdrAttrs)","Projects a constant value onto boundary DOFs for specified boundary attributes.\r","Projects a constant value onto boundary DOFs for specified boundary attributes.\r\n\r\nThis sets the DOF values on the specified boundaries to the given constant value.\r\nIt is useful for applying Dirichlet boundary conditions where the boundary\r\nvalue is known.\r\n\r\nOnly DOFs that lie on boundary elements with the specified attributes are modified.\r\nInterior DOFs remain unchanged.",[1722,1724,1726],{"_17":537,"_19":1723,"_41":6},"- GridFunction to modify",{"_17":514,"_19":1725,"_41":6},"- The constant value to project on boundary",{"_17":373,"_19":1727,"_41":6},"- Array of boundary attributes (1-based) to apply the value to",[],{"_17":1730,"_31":1731,"_33":1732,"_19":1733,"_36":1734,"_45":46,"_47":1741},"mfem.gridfunction.projectBdrVectorCoefficient","mfem.gridfunction.projectBdrVectorCoefficient(gf, vcoeffPtr, bdrAttrs)","Projects a vector coefficient onto boundary DOFs of a grid function.\r","Projects a vector coefficient onto boundary DOFs of a grid function.\r\n\r\nThis sets the values of the grid function at boundary DOFs to match\r\nthe given vector coefficient. Interior DOFs are not modified.",[1735,1737,1739],{"_17":537,"_19":1736,"_41":6},"- The grid function to modify",{"_17":1445,"_19":1738,"_41":6},"- Pointer to a VectorCoefficient in WASM memory",{"_17":373,"_19":1740,"_41":6},"- Array of boundary attribute markers (1 = apply, 0 = skip)",[],{"_17":1743,"_31":1744,"_33":1745,"_19":1746,"_36":1747,"_45":46,"_47":1750},"mfem.gridfunction.projectCoefficient","mfem.gridfunction.projectCoefficient(gf, value)","Projects a constant coefficient onto a grid function.\r","Projects a constant coefficient onto a grid function.\r\n\r\nThis sets all DOF values such that the grid function represents\r\nthe constant function f(x) = value everywhere in the domain.\r\nThis is equivalent to calling `gf.projectConstant(value)`.",[1748,1749],{"_17":537,"_19":1723,"_41":6},{"_17":514,"_19":1503,"_41":6},[],{"_17":1752,"_31":1753,"_33":1754,"_19":1755,"_36":1756,"_45":46,"_47":1763},"mfem.gridfunction.projectDiscCoefficient","mfem.gridfunction.projectDiscCoefficient(gf, coeffPtr, avgType?)","Projects a discontinuous coefficient onto a grid function with averaging.\r","Projects a discontinuous coefficient onto a grid function with averaging.\r\n\r\nWhen a coefficient has different values on different sides of an element\r\ninterface, this function uses the specified averaging type to determine\r\nthe value at shared DOFs.",[1757,1758,1760],{"_17":537,"_19":1736,"_41":6},{"_17":1420,"_19":1759,"_41":6},"- Pointer to a Coefficient in WASM memory",{"_17":1761,"_19":1762,"_41":10},"avgType","- Averaging type for interface values (default: ARITHMETIC)",[],{"_17":1765,"_31":1766,"_33":1767,"_19":1768,"_36":1769,"_45":375,"_47":1772},"mfem.gridfunction.projectFunction","mfem.gridfunction.projectFunction(gf, fn)","Projects a JavaScript function onto a grid function using nodal interpolation.\r","Projects a JavaScript function onto a grid function using nodal interpolation.\r\n\r\nThe function is evaluated at the physical coordinates of each degree of freedom\r\nto determine the DOF values. For standard Lagrange elements, this corresponds\r\nto interpolation at the nodal points.\r\n\r\n**Note:** This function is async because it needs to compute DOF coordinates.",[1770,1771],{"_17":537,"_19":1723,"_41":6},{"_17":578,"_19":1513,"_41":6},[],{"_17":1774,"_31":1775,"_33":1776,"_19":1777,"_36":1778,"_45":46,"_47":1784},"mfem.gridfunction.projectGridFunction","mfem.gridfunction.projectGridFunction(destGf, srcGf)","Projects a source grid function onto a destination grid function.\r","Projects a source grid function onto a destination grid function.\r\n\r\nThis is useful for transferring solutions between different finite element\r\nspaces on the same mesh, or for initializing a grid function from an\r\nexisting solution.",[1779,1781],{"_17":1575,"_19":1780,"_41":6},"- The destination grid function to modify",{"_17":1782,"_19":1783,"_41":6},"srcGf","- The source grid function to project from",[],{"_17":1786,"_31":1787,"_33":1788,"_19":1789,"_36":1790,"_45":1793,"_47":1794},"mfem.gridfunction.save","mfem.gridfunction.save(gf)","Exports a grid function to MFEM format string.\r","Exports a grid function to MFEM format string.\r\n\r\nThe returned string can be saved to a file and later loaded back using\r\nMFEM's GridFunction constructor that takes a mesh and input stream.\r\n\r\nThe format includes the finite element collection type, ordering,\r\nand all DOF values.",[1791],{"_17":537,"_19":1792,"_41":6},"- GridFunction to export","string",[],{"_17":1796,"_31":1797,"_33":1798,"_19":1799,"_36":1800,"_45":1793,"_47":1803},"mfem.gridfunction.toBinary","mfem.gridfunction.toBinary(gf)","Exports a grid function to a base64-encoded binary string.\r","Exports a grid function to a base64-encoded binary string.\r\n\r\nThis provides a compact representation of the grid function suitable for\r\nstorage in JSON, localStorage, or transmission. The grid function is first\r\nserialized to MFEM format (including FE space info) and then base64-encoded.",[1801],{"_17":537,"_19":1802,"_41":6},"- The grid function to export",[],{"_17":1805,"_31":1806,"_33":1807,"_19":1808,"_36":1809,"_45":1793,"_47":1813},"mfem.gridfunction.toVTK","mfem.gridfunction.toVTK(gf, options?)","Exports a grid function to VTK format string for visualization.\r","Exports a grid function to VTK format string for visualization.\r\n\r\nThe returned string contains VTK data for the grid function values.\r\n**Note:** This exports only the field data. For complete VTK output,\r\nyou also need to export the mesh using `mesh.toVTK()`.\r\n\r\nFor visualization in ParaView or similar tools, combine the mesh\r\nand field data into a complete VTK file.",[1810,1811],{"_17":537,"_19":1792,"_41":6},{"_17":454,"_19":1812,"_41":10},"- Export options",[],{"_17":1815,"_31":1816,"_33":1817,"_19":1818,"_36":1819,"_45":1130,"_47":1822},"mfem.gridfunction.getTrueDofs","mfem.gridfunction.getTrueDofs(gf)","Gets the true DOF values from a grid function.\r","Gets the true DOF values from a grid function.\r\n\r\nFor conforming meshes, this returns the same as `getData()`.\r\nFor non-conforming meshes, this returns only the independent DOF values,\r\nwhich may be fewer than the total number of DOFs.",[1820],{"_17":537,"_19":1821,"_41":6},"- The grid function to query",[],{"_17":1824,"_31":1825,"_33":1826,"_19":1827,"_36":1828,"_45":1387,"_47":1830},"mfem.gridfunction.getTrueVectorSize","mfem.gridfunction.getTrueVectorSize(gf)","Gets the size of the true DOF vector.\r","Gets the size of the true DOF vector.\r\n\r\nFor conforming meshes, this equals the total number of DOFs.\r\nFor non-conforming meshes, this may be smaller.",[1829],{"_17":537,"_19":1821,"_41":6},[],{"_17":1832,"_31":1833,"_33":1834,"_19":1835,"_36":1836,"_45":46,"_47":1842},"mfem.gridfunction.setFromTrueDofs","mfem.gridfunction.setFromTrueDofs(gf, trueDofs)","Sets grid function values from true DOF values.\r","Sets grid function values from true DOF values.\r\n\r\nThis applies the prolongation operator to populate all DOFs from\r\nthe independent true DOFs. For conforming meshes, this is equivalent\r\nto `setData()`. For non-conforming meshes, this properly distributes\r\nvalues to hanging nodes.",[1837,1839],{"_17":537,"_19":1838,"_41":6},"- The grid function to update",{"_17":1840,"_19":1841,"_41":6},"trueDofs","- Array of true DOF values",[],{"_17":1844,"_31":1845,"_33":1846,"_19":1847,"_36":1848,"_45":46,"_47":1850},"mfem.gridfunction.setTrueVector","mfem.gridfunction.setTrueVector(gf)","Extracts true DOFs from the grid function to internal storage.\r","Extracts true DOFs from the grid function to internal storage.\r\n\r\nFor conforming meshes, this is a no-op. For non-conforming meshes\r\n(with hanging nodes), this extracts the independent DOF values.\r\nCall this before solving to prepare the true DOF vector.",[1849],{"_17":537,"_19":1838,"_41":6},[],{"_17":1852,"_31":1853,"_33":1854,"_19":1855,"_36":1856,"_45":1482,"_47":1858},"mfem.gridfunction.GridFunction.create","mfem.gridfunction.GridFunction.create(fespace)","Creates a new grid function on the specified finite element space.\r","Creates a new grid function on the specified finite element space.\r\n\r\nThe grid function is initialized with unspecified values. Use\r\n| projectConstant() or\r\n| setData() to initialize the values.",[1857],{"_17":209,"_19":1501,"_41":6},[],{"_17":1860,"_31":1861,"_33":1862,"_19":1862,"_36":1863,"_45":1130,"_47":1867},"mfem.linalg.createDoubleArray","mfem.linalg.createDoubleArray(size)","Create a zero-initialized Float64Array.",[1864],{"_17":1865,"_19":1866,"_41":6},"size","- Array size",[],{"_17":1869,"_31":1870,"_33":1871,"_19":1872,"_36":1873,"_45":422,"_47":1875},"mfem.linalg.createIntArray","mfem.linalg.createIntArray(size)","Array utility functions for creating typed arrays.\r","Array utility functions for creating typed arrays.\r\n\r\nThese are pure JavaScript utilities that don't require WASM.",[1874],{"_17":1865,"_19":1866,"_41":6},[],{"_17":1877,"_31":1878,"_33":1879,"_19":1880,"_36":1881,"_45":422,"_47":1886},"mfem.linalg.createMarkerArray","mfem.linalg.createMarkerArray(size, markedIndices)","Create a marker array (0/1 values) with specified indices marked as 1.\r","Create a marker array (0/1 values) with specified indices marked as 1.\r\n\r\nThis is useful for creating boundary marker arrays or element selection arrays.",[1882,1883],{"_17":1865,"_19":1866,"_41":6},{"_17":1884,"_19":1885,"_41":6},"markedIndices","- Indices to mark as 1",[],{"_17":1888,"_31":1889,"_33":284,"_19":284,"_36":1890,"_45":289,"_47":1892},"mfem.linalg.BlockMatrix.createSquare","mfem.linalg.BlockMatrix.createSquare(offsets)",[1891],{"_17":287,"_19":288,"_41":6},[],{"_17":1894,"_31":1895,"_33":294,"_19":294,"_36":1896,"_45":289,"_47":1899},"mfem.linalg.BlockMatrix.create","mfem.linalg.BlockMatrix.create(rowOffsets, colOffsets)",[1897,1898],{"_17":297,"_19":298,"_41":6},{"_17":300,"_19":301,"_41":6},[],{"_17":1901,"_31":1902,"_33":306,"_19":307,"_36":1903,"_45":289,"_47":1905},"mfem.linalg.BlockMatrix.fromPointer","mfem.linalg.BlockMatrix.fromPointer(ptr)",[1904],{"_17":310,"_19":311,"_41":6},[],{"_17":1907,"_31":1908,"_33":316,"_19":316,"_36":1909,"_45":319,"_47":1911},"mfem.linalg.BlockOperator.createSquare","mfem.linalg.BlockOperator.createSquare(offsets)",[1910],{"_17":287,"_19":288,"_41":6},[],{"_17":1913,"_31":1914,"_33":324,"_19":324,"_36":1915,"_45":319,"_47":1918},"mfem.linalg.BlockOperator.create","mfem.linalg.BlockOperator.create(rowOffsets, colOffsets)",[1916,1917],{"_17":297,"_19":298,"_41":6},{"_17":300,"_19":301,"_41":6},[],{"_17":1920,"_31":1921,"_33":332,"_19":333,"_36":1922,"_45":319,"_47":1924},"mfem.linalg.BlockOperator.fromPointer","mfem.linalg.BlockOperator.fromPointer(ptr)",[1923],{"_17":310,"_19":336,"_41":6},[],{"_17":1926,"_31":1927,"_33":341,"_19":341,"_36":1928,"_45":345,"_47":1930},"mfem.linalg.BlockVector.create","mfem.linalg.BlockVector.create(offsets)",[1929],{"_17":287,"_19":344,"_41":6},[],{"_17":1932,"_31":1933,"_33":350,"_19":351,"_36":1934,"_45":345,"_47":1937},"mfem.linalg.BlockVector.fromPointer","mfem.linalg.BlockVector.fromPointer(ptr, offsets)",[1935,1936],{"_17":310,"_19":354,"_41":6},{"_17":287,"_19":356,"_41":6},[],{"_17":1939,"_31":1940,"_33":1184,"_19":1185,"_36":1941,"_45":1190,"_47":1944},"mfem.linalg.DenseMatrix.create","mfem.linalg.DenseMatrix.create(height, width)",[1942,1943],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":1946,"_31":1947,"_33":1195,"_19":1195,"_36":1948,"_45":1190,"_47":1951},"mfem.linalg.DenseMatrix.zeros","mfem.linalg.DenseMatrix.zeros(height, width)",[1949,1950],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":1953,"_31":1954,"_33":1203,"_19":1203,"_36":1955,"_45":1190,"_47":1957},"mfem.linalg.DenseMatrix.identity","mfem.linalg.DenseMatrix.identity(n)",[1956],{"_17":1206,"_19":1207,"_41":6},[],{"_17":1959,"_31":1960,"_33":1212,"_19":1212,"_36":1961,"_45":1190,"_47":1963},"mfem.linalg.DenseMatrix.fromArray","mfem.linalg.DenseMatrix.fromArray(data)",[1962],{"_17":1215,"_19":1216,"_41":6},[],{"_17":1965,"_31":1966,"_33":1221,"_19":1222,"_36":1967,"_45":1190,"_47":1970},"mfem.linalg.DenseMatrix.fromPointer","mfem.linalg.DenseMatrix.fromPointer(ptr, ownsMemory?)",[1968,1969],{"_17":310,"_19":1225,"_41":6},{"_17":1227,"_19":1228,"_41":10},[],{"_17":1972,"_31":1973,"_33":1974,"_19":1974,"_36":1975,"_45":1978,"_47":1979},"mfem.linalg.SparseMatrix.create","mfem.linalg.SparseMatrix.create(height, width)","Creates a new empty sparse matrix of the specified dimensions.",[1976,1977],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},"Promise",[],{"_17":1981,"_31":1982,"_33":1983,"_19":1984,"_36":1985,"_45":1978,"_47":1990},"mfem.linalg.SparseMatrix.fromPointer","mfem.linalg.SparseMatrix.fromPointer(ptr, ownsMemory?)","Creates a SparseMatrix from an existing WASM pointer.\r","Creates a SparseMatrix from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[1986,1988],{"_17":310,"_19":1987,"_41":6},"- WASM pointer to an existing MFEM SparseMatrix",{"_17":1227,"_19":1989,"_41":10},"- If true, destroy() will free the memory; if false, it won't",[],{"_17":1992,"_31":1993,"_33":1994,"_19":1994,"_36":1995,"_45":1998,"_47":1999},"mfem.linalg.Vector.create","mfem.linalg.Vector.create(size)","Creates a new vector of the specified size.",[1996],{"_17":1865,"_19":1997,"_41":6},"- The number of elements in the vector","Promise",[],{"_17":2001,"_31":2002,"_33":2003,"_19":2004,"_36":2005,"_45":1998,"_47":2008},"mfem.linalg.Vector.fromPointer","mfem.linalg.Vector.fromPointer(ptr)","Creates a Vector from an existing WASM pointer.\r","Creates a Vector from an existing WASM pointer.\r\nUse with caution - the caller is responsible for pointer validity.",[2006],{"_17":310,"_19":2007,"_41":6},"- WASM pointer to an existing MFEM Vector",[],{"_17":2010,"_31":2011,"_33":2012,"_19":2012,"_36":2013,"_45":1387,"_47":2016},"mfem.linear.getFinalNorm","mfem.linear.getFinalNorm(solver)","Get the final residual norm from the last solve.",[2014],{"_17":1125,"_19":2015,"_41":6},"- Iterative solver instance",[],{"_17":2018,"_31":2019,"_33":2020,"_19":2020,"_36":2021,"_45":1387,"_47":2023},"mfem.linear.getNumIterations","mfem.linear.getNumIterations(solver)","Get the number of iterations from the last solve.",[2022],{"_17":1125,"_19":2015,"_41":6},[],{"_17":2025,"_31":2026,"_33":2027,"_19":2027,"_36":2028,"_45":46,"_47":2034},"mfem.linear.mult","mfem.linear.mult(solver, b, x)","Solve the linear system Ax = b.",[2029,2030,2032],{"_17":1125,"_19":2015,"_41":6},{"_17":408,"_19":2031,"_41":6},"- Right-hand side vector",{"_17":405,"_19":2033,"_41":6},"- Solution vector (modified in place)",[],{"_17":2036,"_31":2037,"_33":2038,"_19":2038,"_36":2039,"_45":46,"_47":2044},"mfem.linear.setMaxIterations","mfem.linear.setMaxIterations(solver, max)","Set maximum number of iterations for an iterative solver.",[2040,2041],{"_17":1125,"_19":2015,"_41":6},{"_17":2042,"_19":2043,"_41":6},"max","- Maximum iterations",[],{"_17":2046,"_31":2047,"_33":2048,"_19":2048,"_36":2049,"_45":46,"_47":2054},"mfem.linear.setPreconditioner","mfem.linear.setPreconditioner(solver, prec)","Set preconditioner for an iterative solver.",[2050,2051],{"_17":1125,"_19":2015,"_41":6},{"_17":2052,"_19":2053,"_41":6},"prec","- Preconditioner (Solver)",[],{"_17":2056,"_31":2057,"_33":2058,"_19":2058,"_36":2059,"_45":46,"_47":2064},"mfem.linear.setPrintLevel","mfem.linear.setPrintLevel(solver, level)","Set verbosity level for an iterative solver.",[2060,2061],{"_17":1125,"_19":2015,"_41":6},{"_17":2062,"_19":2063,"_41":6},"level","- Print level (0=silent, 1=summary, 2=iteration details)",[],{"_17":2066,"_31":2067,"_33":2068,"_19":2068,"_36":2069,"_45":46,"_47":2077},"mfem.linear.setTolerance","mfem.linear.setTolerance(solver, rtol, atol?)","Set convergence tolerances for an iterative solver.",[2070,2071,2074],{"_17":1125,"_19":2015,"_41":6},{"_17":2072,"_19":2073,"_41":6},"rtol","- Relative tolerance",{"_17":2075,"_19":2076,"_41":10},"atol","- Absolute tolerance (optional)",[],{"_17":2079,"_31":2080,"_33":2081,"_19":2081,"_36":2082,"_45":2083,"_47":2084},"mfem.linear.BiCGSTABSolver.create","mfem.linear.BiCGSTABSolver.create()","Creates a new BiCGSTAB solver.",[],"Promise",[],{"_17":2086,"_31":2087,"_33":2088,"_19":2088,"_36":2089,"_45":2098,"_47":2099},"mfem.linear.BlockILU.create","mfem.linear.BlockILU.create(matrixPtr, blockSize?, options?)","Creates a new BlockILU preconditioner.",[2090,2093,2096],{"_17":2091,"_19":2092,"_41":6},"matrixPtr","- Pointer to SparseMatrix or Operator",{"_17":2094,"_19":2095,"_41":10},"blockSize","- Block size for ILU factorization. Default: 1",{"_17":454,"_19":2097,"_41":10},"- Optional configuration options","Promise",[],{"_17":2101,"_31":2102,"_33":2103,"_19":2103,"_36":2104,"_45":2105,"_47":2106},"mfem.linear.CGSolver.create","mfem.linear.CGSolver.create()","Creates a new CG solver.",[],"Promise",[],{"_17":2108,"_31":2109,"_33":2110,"_19":2110,"_36":2111,"_45":2114,"_47":2115},"mfem.linear.ChebyshevSmoother.create","mfem.linear.ChebyshevSmoother.create(options)","Creates a new Chebyshev smoother with explicit maximum eigenvalue.",[2112],{"_17":454,"_19":2113,"_41":6},"- Smoother configuration options","Promise",[],{"_17":2117,"_31":2118,"_33":2119,"_19":2120,"_36":2121,"_45":2114,"_47":2123},"mfem.linear.ChebyshevSmoother.createAuto","mfem.linear.ChebyshevSmoother.createAuto(options)","Creates a new Chebyshev smoother with automatic eigenvalue estimation.\r","Creates a new Chebyshev smoother with automatic eigenvalue estimation.\r\nUses power iteration to estimate the maximum eigenvalue.",[2122],{"_17":454,"_19":2113,"_41":6},[],{"_17":2125,"_31":2126,"_33":2127,"_19":2127,"_36":2128,"_45":2135,"_47":2136},"mfem.linear.DirectSubBlockSolver.create","mfem.linear.DirectSubBlockSolver.create(APtr, blockDofPtr)","Creates a new DirectSubBlockSolver.",[2129,2132],{"_17":2130,"_19":2131,"_41":6},"APtr","- Pointer to the system SparseMatrix",{"_17":2133,"_19":2134,"_41":6},"blockDofPtr","- Pointer to SparseMatrix defining block-DOF membership","Promise",[],{"_17":2138,"_31":2139,"_33":2140,"_19":2140,"_36":2141,"_45":2145,"_47":2146},"mfem.linear.DSmoother.create","mfem.linear.DSmoother.create(matrixPtr, options?)","Creates a new DSmoother.",[2142,2144],{"_17":2091,"_19":2143,"_41":6},"- Pointer to SparseMatrix",{"_17":454,"_19":2097,"_41":10},"Promise",[],{"_17":2148,"_31":2149,"_33":2150,"_19":2150,"_36":2151,"_45":2155,"_47":2156},"mfem.linear.FGMRESSolver.create","mfem.linear.FGMRESSolver.create(kdim?)","Creates a new Flexible GMRES solver.",[2152],{"_17":2153,"_19":2154,"_41":10},"kdim","- Krylov space dimension (restart parameter, default 50)","Promise",[],{"_17":2158,"_31":2159,"_33":2160,"_19":2160,"_36":2161,"_45":2163,"_47":2164},"mfem.linear.GMRESSolver.create","mfem.linear.GMRESSolver.create(kdim?)","Creates a new GMRES solver.",[2162],{"_17":2153,"_19":2154,"_41":10},"Promise",[],{"_17":2166,"_31":2167,"_33":2168,"_19":2168,"_36":2169,"_45":2177,"_47":2178},"mfem.linear.GSSmoother.create","mfem.linear.GSSmoother.create(matrixPtr, type?, iterations?)","Creates a new Gauss-Seidel smoother.",[2170,2171,2174],{"_17":2091,"_19":2143,"_41":6},{"_17":2172,"_19":2173,"_41":10},"type","- Type of GS iteration (default: SYMMETRIC)",{"_17":2175,"_19":2176,"_41":10},"iterations","- Number of iterations (default: 1)","Promise",[],{"_17":2180,"_31":2181,"_33":2182,"_19":2182,"_36":2183,"_45":2187,"_47":2188},"mfem.linear.JacobiSmoother.create","mfem.linear.JacobiSmoother.create(matrixPtr, essentialDofs?)","Creates a new Jacobi smoother.",[2184,2185],{"_17":2091,"_19":2143,"_41":6},{"_17":221,"_19":2186,"_41":10},"- Optional array of essential DOF indices to exclude","Promise",[],{"_17":2190,"_31":2191,"_33":2192,"_19":2192,"_36":2193,"_45":2194,"_47":2195},"mfem.linear.KLUSolver.isAvailable","mfem.linear.KLUSolver.isAvailable()","Checks if KLU (SuiteSparse) is available.",[],"Promise",[],{"_17":2197,"_31":2198,"_33":2199,"_19":2199,"_36":2200,"_45":2201,"_47":2202},"mfem.linear.KLUSolver.create","mfem.linear.KLUSolver.create()","Creates a new KLU solver.",[],"Promise",[],{"_17":2204,"_31":2205,"_33":2206,"_19":2206,"_36":2207,"_45":2208,"_47":2209},"mfem.linear.MINRESSolver.create","mfem.linear.MINRESSolver.create()","Creates a new MINRES solver.",[],"Promise",[],{"_17":2211,"_31":2212,"_33":2213,"_19":2213,"_36":2214,"_45":2215,"_47":2216},"mfem.linear.OrthoSolver.create","mfem.linear.OrthoSolver.create()","Creates a new orthogonalizing solver wrapper.",[],"Promise",[],{"_17":2218,"_31":2219,"_33":2220,"_19":2220,"_36":2221,"_45":2230,"_47":2231},"mfem.linear.ProductSolver.create","mfem.linear.ProductSolver.create(s0Ptr, s1Ptr, options?)","Creates a new product solver: S = S1 * S0.",[2222,2225,2228],{"_17":2223,"_19":2224,"_41":6},"s0Ptr","- Pointer to first solver (applied first)",{"_17":2226,"_19":2227,"_41":6},"s1Ptr","- Pointer to second solver (applied second)",{"_17":454,"_19":2229,"_41":10},"- Ownership options","Promise",[],{"_17":2218,"_31":2233,"_33":2220,"_19":2220,"_36":2234,"_45":2230,"_47":2242},"mfem.linear.ProductSolver.create(s0, s1, options?)",[2235,2238,2241],{"_17":2236,"_19":2237,"_41":6},"s0","- First solver (applied first)",{"_17":2239,"_19":2240,"_41":6},"s1","- Second solver (applied second)",{"_17":454,"_19":2229,"_41":10},[],{"_17":2244,"_31":2245,"_33":2246,"_19":2246,"_36":2247,"_45":2248,"_47":2249},"mfem.linear.SLISolver.create","mfem.linear.SLISolver.create()","Creates a new SLI solver.",[],"Promise",[],{"_17":2251,"_31":2252,"_33":2253,"_19":2253,"_36":2254,"_45":2194,"_47":2255},"mfem.linear.UMFPackSolver.isAvailable","mfem.linear.UMFPackSolver.isAvailable()","Checks if UMFPack (SuiteSparse) is available.",[],[],{"_17":2257,"_31":2258,"_33":2259,"_19":2259,"_36":2260,"_45":2261,"_47":2262},"mfem.linear.UMFPackSolver.create","mfem.linear.UMFPackSolver.create()","Creates a new UMFPack solver.",[],"Promise",[],{"_17":2264,"_31":2265,"_33":2266,"_19":2267,"_36":2268,"_45":46,"_47":2274},"mfem.linearForms.addBoundaryFluxIntegrator","mfem.linearForms.addBoundaryFluxIntegrator(lf, coeff, bdrAttrs?)","Add a VectorFE boundary flux integrator for H(div) spaces.\r","Add a VectorFE boundary flux integrator for H(div) spaces.\r\n\r\nComputes: ∫_∂Ω f * (v · n) ds",[2269,2270,2272],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":2271,"_41":6},"- Scalar flux coefficient",{"_17":373,"_19":2273,"_41":10},"- Optional boundary attributes to restrict to",[],{"_17":2276,"_31":2277,"_33":2278,"_19":2279,"_36":2280,"_45":46,"_47":2285},"mfem.linearForms.addBoundaryIntegrator","mfem.linearForms.addBoundaryIntegrator(lf, coeff, bdrAttrs?)","Add a boundary integrator (g, v) to the linear form.\r","Add a boundary integrator (g, v) to the linear form.\r\n\r\nComputes: ∫_∂Ω g * v ds",[2281,2282,2284],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":2283,"_41":6},"- Boundary source coefficient",{"_17":373,"_19":2273,"_41":10},[],{"_17":2287,"_31":2288,"_33":2289,"_19":2290,"_36":2291,"_45":46,"_47":2295},"mfem.linearForms.addBoundaryNormalIntegrator","mfem.linearForms.addBoundaryNormalIntegrator(lf, coeff, bdrAttrs?)","Add a boundary normal integrator (F · n, v) to the linear form.\r","Add a boundary normal integrator (F · n, v) to the linear form.\r\n\r\nComputes: ∫_∂Ω (F · n) * v ds",[2292,2293,2294],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":774,"_41":6},{"_17":373,"_19":2273,"_41":10},[],{"_17":2297,"_31":2298,"_33":2299,"_19":2300,"_36":2301,"_45":46,"_47":2305},"mfem.linearForms.addBoundaryTangentialIntegrator","mfem.linearForms.addBoundaryTangentialIntegrator(lf, coeff, bdrAttrs?)","Add a boundary tangential integrator (F × n, v) to the linear form.\r","Add a boundary tangential integrator (F × n, v) to the linear form.\r\nFor 2D: takes the tangential component of the vector field.\r\n\r\nComputes: ∫_∂Ω (F · t) * v ds",[2302,2303,2304],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":774,"_41":6},{"_17":373,"_19":2273,"_41":10},[],{"_17":2307,"_31":2308,"_33":2309,"_19":2310,"_36":2311,"_45":46,"_47":2319},"mfem.linearForms.addDGDirichletIntegrator","mfem.linearForms.addDGDirichletIntegrator(lf, coeff, sigma, kappa)","Add a DG Dirichlet boundary integrator for discontinuous Galerkin methods.\r","Add a DG Dirichlet boundary integrator for discontinuous Galerkin methods.\r\n\r\nNote: This integrator is not yet implemented in the WASM bindings.\r\nIt requires additional C++ support for DG-specific integrators.",[2312,2313,2315,2317],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":2314,"_41":6},"- Dirichlet value coefficient",{"_17":82,"_19":2316,"_41":6},"- Symmetry parameter (-1 for SIPG, 0 for IIPG, 1 for NIPG)",{"_17":85,"_19":2318,"_41":6},"- Penalty parameter",[],{"_17":2321,"_31":2322,"_33":2323,"_19":2324,"_36":2325,"_45":46,"_47":2328},"mfem.linearForms.addDomainGradientIntegrator","mfem.linearForms.addDomainGradientIntegrator(lf, coeff)","Add a domain gradient integrator (F, ∇v) to the linear form.\r","Add a domain gradient integrator (F, ∇v) to the linear form.\r\n\r\nComputes: ∫ F · ∇v dx",[2326,2327],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":774,"_41":6},[],{"_17":2330,"_31":2331,"_33":2332,"_19":2333,"_36":2334,"_45":46,"_47":2338},"mfem.linearForms.addDomainIntegrator","mfem.linearForms.addDomainIntegrator(lf, coeff)","Add a domain integrator (f, v) to the linear form.\r","Add a domain integrator (f, v) to the linear form.\r\n\r\nComputes: ∫ f * v dx",[2335,2336],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":2337,"_41":6},"- Source coefficient",[],{"_17":2340,"_31":2341,"_33":2342,"_19":2343,"_36":2344,"_45":46,"_47":2347},"mfem.linearForms.addVectorDomainIntegrator","mfem.linearForms.addVectorDomainIntegrator(lf, coeff)","Add a vector domain integrator (F, v) to the linear form.\r","Add a vector domain integrator (F, v) to the linear form.\r\nFor vector-valued test functions.\r\n\r\nComputes: ∫ F · v dx",[2345,2346],{"_17":366,"_19":386,"_41":6},{"_17":43,"_19":774,"_41":6},[],{"_17":2349,"_31":2350,"_33":2351,"_19":2351,"_36":2352,"_45":46,"_47":2354},"mfem.linearForms.assemble","mfem.linearForms.assemble(lf)","Assemble the linear form into a vector.",[2353],{"_17":366,"_19":386,"_41":6},[],{"_17":2356,"_31":2357,"_33":2358,"_19":2358,"_36":2359,"_45":1130,"_47":2361},"mfem.linearForms.getVector","mfem.linearForms.getVector(lf)","Get the assembled vector data from the linear form.",[2360],{"_17":366,"_19":386,"_41":6},[],{"_17":2363,"_31":2364,"_33":2365,"_19":2365,"_36":2366,"_45":2368,"_47":2369},"mfem.linearForms.create","mfem.linearForms.create(fespace)","Create a linear form on a finite element space.",[2367],{"_17":209,"_19":210,"_41":6},"Promise",[],{"_17":2371,"_31":2372,"_33":2373,"_19":2373,"_36":2374,"_45":2368,"_47":2376},"mfem.linearForms.LinearForm.create","mfem.linearForms.LinearForm.create(fespace)","Creates a new linear form on the specified finite element space.",[2375],{"_17":209,"_19":267,"_41":6},[],{"_17":2378,"_31":2379,"_33":2380,"_19":1136,"_36":2381,"_45":46,"_47":2387},"mfem.matrix.add","mfem.matrix.add(dm, alpha, other)","add",[2382,2384,2385],{"_17":2383,"_19":1140,"_41":6},"dm",{"_17":60,"_19":1387,"_41":6},{"_17":2386,"_19":1140,"_41":6},"other",[],{"_17":2389,"_31":2390,"_33":2391,"_19":1136,"_36":2392,"_45":1387,"_47":2394},"mfem.matrix.cols","mfem.matrix.cols(dm)","cols",[2393],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2396,"_31":2397,"_33":2398,"_19":1136,"_36":2399,"_45":1190,"_47":2403},"mfem.matrix.create","mfem.matrix.create(rows, cols)","create_2",[2400,2402],{"_17":2401,"_19":1387,"_41":6},"rows",{"_17":2391,"_19":1387,"_41":6},[],{"_17":2405,"_31":2406,"_33":2407,"_19":1136,"_36":2408,"_45":1387,"_47":2410},"mfem.matrix.determinant","mfem.matrix.determinant(dm)","determinant",[2409],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2412,"_31":2413,"_33":2414,"_19":1136,"_36":2415,"_45":2417,"_47":2418},"mfem.matrix.eigenvalues","mfem.matrix.eigenvalues(dm)","eigenvalues",[2416],{"_17":2383,"_19":1140,"_41":6},"Promise",[],{"_17":2420,"_31":2421,"_33":2422,"_19":1136,"_36":2423,"_45":1190,"_47":2425},"mfem.matrix.fromArray","mfem.matrix.fromArray(data)","fromArray",[2424],{"_17":1215,"_19":506,"_41":6},[],{"_17":2427,"_31":2428,"_33":2429,"_19":1136,"_36":2430,"_45":1387,"_47":2436},"mfem.matrix.get","mfem.matrix.get(dm, i, j)","get_2",[2431,2432,2434],{"_17":2383,"_19":1140,"_41":6},{"_17":2433,"_19":1387,"_41":6},"i",{"_17":2435,"_19":1387,"_41":6},"j",[],{"_17":2438,"_31":2439,"_33":2440,"_19":1136,"_36":2441,"_45":1130,"_47":2443},"mfem.matrix.getData","mfem.matrix.getData(dm)","getData",[2442],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2445,"_31":2446,"_33":2447,"_19":1136,"_36":2448,"_45":1190,"_47":2450},"mfem.matrix.identity","mfem.matrix.identity(n)","identity_2",[2449],{"_17":1206,"_19":1387,"_41":6},[],{"_17":2452,"_31":2453,"_33":2454,"_19":1136,"_36":2455,"_45":46,"_47":2457},"mfem.matrix.invert","mfem.matrix.invert(dm)","invert",[2456],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2459,"_31":2460,"_33":2461,"_19":1136,"_36":2462,"_45":46,"_47":2468},"mfem.matrix.mult","mfem.matrix.mult(dm, x, y)","mult",[2463,2464,2466],{"_17":2383,"_19":1140,"_41":6},{"_17":405,"_19":2465,"_41":6},"Vector",{"_17":2467,"_19":2465,"_41":6},"y",[],{"_17":2470,"_31":2471,"_33":2472,"_19":1136,"_36":2473,"_45":46,"_47":2477},"mfem.matrix.multTranspose","mfem.matrix.multTranspose(dm, x, y)","multTranspose",[2474,2475,2476],{"_17":2383,"_19":1140,"_41":6},{"_17":405,"_19":2465,"_41":6},{"_17":2467,"_19":2465,"_41":6},[],{"_17":2479,"_31":2480,"_33":2401,"_19":1136,"_36":2481,"_45":1387,"_47":2483},"mfem.matrix.rows","mfem.matrix.rows(dm)",[2482],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2485,"_31":2486,"_33":2487,"_19":1136,"_36":2488,"_45":46,"_47":2493},"mfem.matrix.set","mfem.matrix.set(dm, i, j, value)","set_2",[2489,2490,2491,2492],{"_17":2383,"_19":1140,"_41":6},{"_17":2433,"_19":1387,"_41":6},{"_17":2435,"_19":1387,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":2495,"_31":2496,"_33":2497,"_19":1136,"_36":2498,"_45":1998,"_47":2501},"mfem.matrix.solve","mfem.matrix.solve(dm, b)","solve",[2499,2500],{"_17":2383,"_19":1140,"_41":6},{"_17":408,"_19":2465,"_41":6},[],{"_17":2503,"_31":2504,"_33":2505,"_19":1136,"_36":2506,"_45":2417,"_47":2508},"mfem.matrix.svd","mfem.matrix.svd(dm)","svd",[2507],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2510,"_31":2511,"_33":2512,"_19":1136,"_36":2513,"_45":1387,"_47":2515},"mfem.matrix.trace","mfem.matrix.trace(dm)","trace",[2514],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2517,"_31":2518,"_33":2519,"_19":1136,"_36":2520,"_45":1190,"_47":2522},"mfem.matrix.transpose","mfem.matrix.transpose(dm)","transpose_2",[2521],{"_17":2383,"_19":1140,"_41":6},[],{"_17":2524,"_31":2525,"_33":2526,"_19":1136,"_36":2527,"_45":1190,"_47":2530},"mfem.matrix.zeros","mfem.matrix.zeros(rows, cols)","zeros",[2528,2529],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":2532,"_31":2533,"_33":1184,"_19":1185,"_36":2534,"_45":1190,"_47":2537},"mfem.matrix.DenseMatrix.create","mfem.matrix.DenseMatrix.create(height, width)",[2535,2536],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":2539,"_31":2540,"_33":1195,"_19":1195,"_36":2541,"_45":1190,"_47":2544},"mfem.matrix.DenseMatrix.zeros","mfem.matrix.DenseMatrix.zeros(height, width)",[2542,2543],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":2546,"_31":2547,"_33":1203,"_19":1203,"_36":2548,"_45":1190,"_47":2550},"mfem.matrix.DenseMatrix.identity","mfem.matrix.DenseMatrix.identity(n)",[2549],{"_17":1206,"_19":1207,"_41":6},[],{"_17":2552,"_31":2553,"_33":1212,"_19":1212,"_36":2554,"_45":1190,"_47":2556},"mfem.matrix.DenseMatrix.fromArray","mfem.matrix.DenseMatrix.fromArray(data)",[2555],{"_17":1215,"_19":1216,"_41":6},[],{"_17":2558,"_31":2559,"_33":1221,"_19":1222,"_36":2560,"_45":1190,"_47":2563},"mfem.matrix.DenseMatrix.fromPointer","mfem.matrix.DenseMatrix.fromPointer(ptr, ownsMemory?)",[2561,2562],{"_17":310,"_19":1225,"_41":6},{"_17":1227,"_19":1228,"_41":10},[],{"_17":2565,"_31":2566,"_33":2567,"_19":2568,"_36":2569,"_45":46,"_47":2575},"mfem.mesh.derefine","mfem.mesh.derefine(mesh, derefinements)","Derefines (coarsens) specified elements in a non-conforming mesh.\r","Derefines (coarsens) specified elements in a non-conforming mesh.\r\n\r\nDerefinement is the reverse of refinement - it merges previously refined\r\nelements back into their parent elements. This is useful for adaptive\r\nmesh refinement (AMR) where elements may need to be coarsened after\r\nsolution features have moved or diminished.\r\n\r\n**Requirements:**\r\n- The mesh must have NCMesh (non-conforming mesh) support enabled\r\n- The elements must have been previously refined\r\n- The derefinement indices refer to rows in the NCMesh derefinement table\r\n\r\nTo enable NCMesh support before refinement, use .",[2570,2572],{"_17":418,"_19":2571,"_41":6},"- Mesh instance with NCMesh support",{"_17":2573,"_19":2574,"_41":6},"derefinements","- Array of derefinement table row indices",[],{"_17":2577,"_31":2578,"_33":2579,"_19":2580,"_36":2581,"_45":46,"_47":2583},"mfem.mesh.enableNCMesh","mfem.mesh.enableNCMesh(mesh)","Enables non-conforming mesh (NCMesh) support.\r","Enables non-conforming mesh (NCMesh) support.\r\n\r\nNCMesh support is required for local refinement with hanging nodes\r\nand for derefinement (coarsening). This function must be called\r\nbefore any local refinement operations if derefinement is desired later.",[2582],{"_17":418,"_19":419,"_41":6},[],{"_17":2585,"_31":2586,"_33":2587,"_19":2588,"_36":2589,"_45":1387,"_47":2591},"mfem.mesh.getDerefTableSize","mfem.mesh.getDerefTableSize(mesh)","Gets the size of the derefinement table.\r","Gets the size of the derefinement table.\r\n\r\nThe derefinement table contains information about which element groups\r\ncan be coarsened. Each row in the table represents one possible\r\nderefinement operation.",[2590],{"_17":418,"_19":2571,"_41":6},[],{"_17":2593,"_31":2594,"_33":2595,"_19":2595,"_36":2596,"_45":2598,"_47":2599},"mfem.mesh.isNCMesh","mfem.mesh.isNCMesh(mesh)","Checks if a mesh has NCMesh (non-conforming mesh) support.",[2597],{"_17":418,"_19":419,"_41":6},"boolean",[],{"_17":2601,"_31":2602,"_33":2603,"_19":2604,"_36":2605,"_45":46,"_47":2611},"mfem.mesh.elevateNURBSDegree","mfem.mesh.elevateNURBSDegree(mesh, relDegree)","Elevates the polynomial degree of a NURBS mesh.\r","Elevates the polynomial degree of a NURBS mesh.\r\n\r\nThis modifies the mesh in place by increasing the polynomial order of\r\nall NURBS patches. The geometry is preserved exactly while adding\r\nadditional control points.",[2606,2608],{"_17":418,"_19":2607,"_41":6},"- NURBS mesh to elevate",{"_17":2609,"_19":2610,"_41":6},"relDegree","- Relative degree increase (e.g., 1 to go from order 2 to 3)",[],{"_17":2613,"_31":2614,"_33":2615,"_19":2616,"_36":2617,"_45":46,"_47":2622},"mfem.mesh.setNURBSOrder","mfem.mesh.setNURBSOrder(mesh, order)","Sets the NURBS order uniformly.\r","Sets the NURBS order uniformly.\r\n\r\nThis sets the curvature order of the mesh, which affects the underlying\r\nNURBS representation. Note that this may perform degree elevation or\r\nreduction depending on the current order.",[2618,2620],{"_17":418,"_19":2619,"_41":6},"- NURBS mesh",{"_17":1246,"_19":2621,"_41":6},"- New polynomial order",[],{"_17":2624,"_31":2625,"_33":2626,"_19":2627,"_36":2628,"_45":472,"_47":2631},"mfem.mesh.fromBinary","mfem.mesh.fromBinary(data)","Loads a mesh from a base64-encoded binary string.\r","Loads a mesh from a base64-encoded binary string.\r\n\r\nThis is the inverse of . The base64 string is decoded\r\nand parsed as an MFEM format mesh.",[2629],{"_17":1215,"_19":2630,"_41":6},"- Base64-encoded string containing mesh data",[],{"_17":2633,"_31":2634,"_33":2635,"_19":2636,"_36":2637,"_45":472,"_47":2640},"mfem.mesh.fromGmsh","mfem.mesh.fromGmsh(data)","Loads a mesh from a Gmsh format string.\r","Loads a mesh from a Gmsh format string.\r\n\r\nParses mesh data in Gmsh MSH format (versions 2.x and 4.x are supported).\r\nThis is useful for importing meshes created with the Gmsh mesh generator\r\nor exported from other tools in Gmsh format.",[2638],{"_17":1215,"_19":2639,"_41":6},"- Gmsh mesh format string (MSH file contents)",[],{"_17":2642,"_31":2643,"_33":2644,"_19":2645,"_36":2646,"_45":472,"_47":2649},"mfem.mesh.fromMFEM","mfem.mesh.fromMFEM(data)","Loads a mesh from an MFEM native format string.\r","Loads a mesh from an MFEM native format string.\r\n\r\nThis is an alias for provided for API consistency.\r\nMFEM's native mesh format is automatically detected by the parser.",[2647],{"_17":1215,"_19":2648,"_41":6},"- MFEM native format mesh string (.mesh file contents)",[],{"_17":2651,"_31":2652,"_33":2653,"_19":2654,"_36":2655,"_45":472,"_47":2658},"mfem.mesh.fromNetgen","mfem.mesh.fromNetgen(data)","Loads a mesh from a Netgen format string.\r","Loads a mesh from a Netgen format string.\r\n\r\nParses mesh data in Netgen neutral format. MFEM automatically detects\r\nthe format based on file headers:\r\n- 2D meshes typically start with \"areasmesh2\" or \"curved_areamesh2\"\r\n- 3D meshes typically start with \"NETGEN\" or \"NETGEN_Neutral_Format\"",[2656],{"_17":1215,"_19":2657,"_41":6},"- Netgen format mesh string",[],{"_17":2660,"_31":2661,"_33":2662,"_19":2663,"_36":2664,"_45":472,"_47":2667},"mfem.mesh.fromTrueGrid","mfem.mesh.fromTrueGrid(data)","Loads a mesh from a TrueGrid format string.\r","Loads a mesh from a TrueGrid format string.\r\n\r\nParses mesh data in TrueGrid format. MFEM automatically detects\r\nthe format based on file headers. TrueGrid files typically start\r\nwith \"TrueGrid\".",[2665],{"_17":1215,"_19":2666,"_41":6},"- TrueGrid format mesh string",[],{"_17":2669,"_31":2670,"_33":2671,"_19":2672,"_36":2673,"_45":472,"_47":2676},"mfem.mesh.fromVTK","mfem.mesh.fromVTK(data)","Loads a mesh from a VTK format string.\r","Loads a mesh from a VTK format string.\r\n\r\nParses mesh data in VTK legacy format (.vtk). This is useful for importing\r\nmeshes from visualization tools like ParaView or VTK-based applications.",[2674],{"_17":1215,"_19":2675,"_41":6},"- VTK legacy format string (.vtk file contents)",[],{"_17":2678,"_31":2679,"_33":2680,"_19":2681,"_36":2682,"_45":506,"_47":2685},"mfem.mesh.getElementCentroids","mfem.mesh.getElementCentroids(mesh)","Computes the centroid (geometric center) of each element in the mesh.\r","Computes the centroid (geometric center) of each element in the mesh.\r\n\r\nThe centroid is the average of the element's vertex coordinates and\r\nrepresents the center of mass assuming uniform density.",[2683],{"_17":418,"_19":2684,"_41":6},"- The mesh to compute element centroids for",[],{"_17":2687,"_31":2688,"_33":2689,"_19":2690,"_36":2691,"_45":1130,"_47":2694},"mfem.mesh.getElementVolumes","mfem.mesh.getElementVolumes(mesh)","Computes the volume (or area/length) of each element in the mesh.\r","Computes the volume (or area/length) of each element in the mesh.\r\n\r\nReturns the measure of each element according to the mesh dimension:\r\n- 1D: element lengths\r\n- 2D: element areas\r\n- 3D: element volumes\r\n\r\nThis is useful for computing integrals, checking mesh quality,\r\nor applying element-based operations.",[2692],{"_17":418,"_19":2693,"_41":6},"- The mesh to compute element volumes for",[],{"_17":2696,"_31":2697,"_33":2698,"_19":2698,"_36":2699,"_45":1130,"_47":2707},"mfem.mesh.getNURBSKnotVector","mfem.mesh.getNURBSKnotVector(mesh, patchIdx, dir)","Gets the knot vector for a NURBS patch in a specific direction.",[2700,2701,2704],{"_17":418,"_19":2619,"_41":6},{"_17":2702,"_19":2703,"_41":6},"patchIdx","- Patch index",{"_17":2705,"_19":2706,"_41":6},"dir","- Direction (0, 1, or 2 for x, y, z)",[],{"_17":2709,"_31":2710,"_33":2711,"_19":2711,"_36":2712,"_45":2715,"_47":2716},"mfem.mesh.getNURBSPatch","mfem.mesh.getNURBSPatch(mesh, patchIdx)","Gets full NURBS patch data including knot vectors.",[2713,2714],{"_17":418,"_19":2619,"_41":6},{"_17":2702,"_19":2703,"_41":6},"NURBSPatch",[],{"_17":2718,"_31":2719,"_33":2720,"_19":2720,"_36":2721,"_45":2724,"_47":2725},"mfem.mesh.getNURBSPatchInfo","mfem.mesh.getNURBSPatchInfo(mesh, patchIdx)","Gets information about a NURBS patch.",[2722,2723],{"_17":418,"_19":2619,"_41":6},{"_17":2702,"_19":2703,"_41":6},"NURBSPatchInfo",[],{"_17":2727,"_31":2728,"_33":2729,"_19":2729,"_36":2730,"_45":1387,"_47":2732},"mfem.mesh.getNumNURBSPatches","mfem.mesh.getNumNURBSPatches(mesh)","Gets the number of NURBS patches in the mesh.",[2731],{"_17":418,"_19":2619,"_41":6},[],{"_17":2734,"_31":2735,"_33":2736,"_19":2736,"_36":2737,"_45":46,"_47":2744},"mfem.mesh.insertNURBSKnot","mfem.mesh.insertNURBSKnot(mesh, direction, knot)","Inserts a single knot into a NURBS mesh.",[2738,2739,2741],{"_17":418,"_19":2619,"_41":6},{"_17":847,"_19":2740,"_41":6},"- Parametric direction (0=x, 1=y, 2=z)",{"_17":2742,"_19":2743,"_41":6},"knot","- Knot value to insert (must be within the parametric domain)",[],{"_17":2746,"_31":2747,"_33":2748,"_19":2748,"_36":2749,"_45":46,"_47":2755},"mfem.mesh.insertNURBSKnots","mfem.mesh.insertNURBSKnots(mesh, direction, knots)","Inserts multiple knots into a NURBS mesh in a specific direction.",[2750,2751,2752],{"_17":418,"_19":2619,"_41":6},{"_17":847,"_19":2740,"_41":6},{"_17":2753,"_19":2754,"_41":6},"knots","- Array of knot values to insert",[],{"_17":2757,"_31":2758,"_33":2759,"_19":2760,"_36":2761,"_45":46,"_47":2767},"mfem.mesh.uniformNURBSRefinement","mfem.mesh.uniformNURBSRefinement(mesh, refFactor?)","Performs uniform refinement on a NURBS mesh.\r","Performs uniform refinement on a NURBS mesh.\r\n\r\nThis inserts new knots uniformly within each existing span, refining\r\nthe NURBS mesh while preserving the geometry exactly.",[2762,2764],{"_17":418,"_19":2763,"_41":6},"- NURBS mesh to refine",{"_17":2765,"_19":2766,"_41":10},"refFactor","- Refinement factor (1 = 1 new knot per span, etc.)",[],{"_17":2769,"_31":2770,"_33":2771,"_19":2772,"_36":2773,"_45":472,"_47":2779},"mfem.mesh.makeCartesian1D","mfem.mesh.makeCartesian1D(n, sx?)","Creates a 1D Cartesian (line segment) mesh.\r","Creates a 1D Cartesian (line segment) mesh.\r\n\r\nGenerates a uniform mesh on the interval [0, sx] with `n` line segment elements.\r\nThis is useful for 1D finite element problems like ODEs, 1D heat transfer,\r\nor testing numerical methods.",[2774,2776],{"_17":1206,"_19":2775,"_41":6},"- Number of elements (must be ≥ 1)",{"_17":2777,"_19":2778,"_41":10},"sx","- Domain size / length of the interval (default 1.0)",[],{"_17":2781,"_31":2782,"_33":2783,"_19":2784,"_36":2785,"_45":472,"_47":2799},"mfem.mesh.makeCartesian2D","mfem.mesh.makeCartesian2D(nx, ny, type?, sx?, sy?)","Creates a 2D Cartesian (rectangular) mesh.\r","Creates a 2D Cartesian (rectangular) mesh.\r\n\r\nGenerates a structured mesh on the rectangular domain [0, sx] × [0, sy]\r\nwith the specified number of elements in each direction.",[2786,2789,2792,2794,2796],{"_17":2787,"_19":2788,"_41":6},"nx","- Number of elements in the x-direction (must be ≥ 1)",{"_17":2790,"_19":2791,"_41":6},"ny","- Number of elements in the y-direction (must be ≥ 1)",{"_17":2172,"_19":2793,"_41":10},"- Element type: `'quad'` for quadrilaterals (default), `'tri'` for triangles",{"_17":2777,"_19":2795,"_41":10},"- Domain size in x-direction (default 1.0)",{"_17":2797,"_19":2798,"_41":10},"sy","- Domain size in y-direction (default 1.0)",[],{"_17":2801,"_31":2802,"_33":2803,"_19":2804,"_36":2805,"_45":472,"_47":2818},"mfem.mesh.makeCartesian3D","mfem.mesh.makeCartesian3D(nx, ny, nz, type?, sx?, sy?, sz?)","Creates a 3D Cartesian (box) mesh.\r","Creates a 3D Cartesian (box) mesh.\r\n\r\nGenerates a structured mesh on the box domain [0, sx] × [0, sy] × [0, sz]\r\nwith the specified number of elements in each direction.",[2806,2807,2808,2811,2813,2814,2815],{"_17":2787,"_19":2788,"_41":6},{"_17":2790,"_19":2791,"_41":6},{"_17":2809,"_19":2810,"_41":6},"nz","- Number of elements in the z-direction (must be ≥ 1)",{"_17":2172,"_19":2812,"_41":10},"- Element type: `'hex'` for hexahedra (default), `'tet'` for tetrahedra, `'wedge'` for wedges",{"_17":2777,"_19":2795,"_41":10},{"_17":2797,"_19":2798,"_41":10},{"_17":2816,"_19":2817,"_41":10},"sz","- Domain size in z-direction (default 1.0)",[],{"_17":2820,"_31":2821,"_33":2822,"_19":2823,"_36":2824,"_45":472,"_47":2831},"mfem.mesh.makeCircle","mfem.mesh.makeCircle(npts, radius?)","Creates a 2D circular disk mesh.\r","Creates a 2D circular disk mesh.\r\n\r\nGenerates a triangulated mesh approximating a circular disk by creating a\r\nsquare mesh and applying an elliptic conformal mapping. This mapping\r\npreserves mesh quality while smoothly transforming the square to a circle.\r\n\r\nThe mesh is centered at the origin with the specified radius.",[2825,2828],{"_17":2826,"_19":2827,"_41":6},"npts","- Controls mesh density. Higher values create finer meshes (minimum 3)",{"_17":2829,"_19":2830,"_41":10},"radius","- Radius of the circular disk (default 1.0)",[],{"_17":2833,"_31":2834,"_33":2835,"_19":2836,"_36":2837,"_45":472,"_47":2845},"mfem.mesh.makeCylinder","mfem.mesh.makeCylinder(npts, length?, radius?)","Creates a 3D solid cylinder mesh.\r","Creates a 3D solid cylinder mesh.\r\n\r\nGenerates a hexahedral mesh of a solid cylinder by creating a box mesh\r\nand applying an elliptic conformal mapping to the x-y cross-section while\r\npreserving the z-coordinate. The cylinder is centered on the z-axis with\r\nz ∈ [0, length].",[2838,2840,2843],{"_17":2826,"_19":2839,"_41":6},"- Controls mesh density via ∛npts elements per side (minimum 4)",{"_17":2841,"_19":2842,"_41":10},"length","- Length of the cylinder in the z-direction (default 1.0)",{"_17":2829,"_19":2844,"_41":10},"- Radius of the cylinder in the x-y plane (default 1.0)",[],{"_17":2847,"_31":2848,"_33":2849,"_19":2850,"_36":2851,"_45":472,"_47":2856},"mfem.mesh.makeDisk","mfem.mesh.makeDisk(npts, radius?)","Creates a 2D disk mesh using elliptic mapping.\r","Creates a 2D disk mesh using elliptic mapping.\r\n\r\nGenerates a triangulated mesh of a circular disk by mapping a square mesh\r\nto a disk using the elliptic conformal mapping:\r\n```\r\nx = u × √(1 - v²/2) × radius\r\ny = v × √(1 - u²/2) × radius\r\n```\r\n\r\nThis mapping produces high-quality elements with smooth variation across\r\nthe domain, making it suitable for finite element analysis.",[2852,2854],{"_17":2826,"_19":2853,"_41":6},"- Controls mesh density via √npts elements per side (minimum 3)",{"_17":2829,"_19":2855,"_41":10},"- Radius of the disk (default 1.0)",[],{"_17":2858,"_31":2859,"_33":2860,"_19":2861,"_36":2862,"_45":472,"_47":2866},"mfem.mesh.makeSphere","mfem.mesh.makeSphere(npts, radius?)","Creates a 3D solid sphere (ball) mesh.\r","Creates a 3D solid sphere (ball) mesh.\r\n\r\nGenerates a tetrahedral mesh of a solid ball by creating a cube mesh\r\nand applying a radial projection transformation. Interior points are\r\nmapped proportionally while boundary points are projected to the sphere surface.\r\n\r\nThe mesh is centered at the origin with the specified radius.",[2863,2864],{"_17":2826,"_19":2839,"_41":6},{"_17":2829,"_19":2865,"_41":10},"- Radius of the sphere (default 1.0)",[],{"_17":2868,"_31":2869,"_33":2870,"_19":2871,"_36":2872,"_45":46,"_47":2878},"mfem.mesh.refineLocal","mfem.mesh.refineLocal(mesh, elements)","Locally refines specified elements in the mesh.\r","Locally refines specified elements in the mesh.\r\n\r\nPerforms adaptive refinement by subdividing only the specified elements,\r\nleaving other elements unchanged. This is useful for adaptive mesh refinement\r\n(AMR) strategies where refinement is focused on regions with high error.\r\n\r\nThe mesh maintains conformity by adding necessary transition elements between\r\nrefined and unrefined regions.",[2873,2875],{"_17":418,"_19":2874,"_41":6},"- The mesh to refine (modified in place)",{"_17":2876,"_19":2877,"_41":6},"elements","- Array of element indices to refine (0-based)",[],{"_17":2880,"_31":2881,"_33":2882,"_19":2883,"_36":2884,"_45":46,"_47":2887},"mfem.mesh.refineNonconforming","mfem.mesh.refineNonconforming(mesh, elements)","Performs non-conforming refinement of specified elements.\r","Performs non-conforming refinement of specified elements.\r\n\r\nNon-conforming refinement allows hanging nodes (vertices that lie on\r\nedges/faces of neighboring elements) which enables more flexible local\r\nrefinement without requiring transition elements.\r\n\r\n**Note:** The current implementation uses the same mechanism as\r\n. True non-conforming refinement with hanging node\r\nsupport requires full NCMesh integration which is not yet available.",[2885,2886],{"_17":418,"_19":2874,"_41":6},{"_17":2876,"_19":2877,"_41":6},[],{"_17":2889,"_31":2890,"_33":2891,"_19":2892,"_36":2893,"_45":46,"_47":2898},"mfem.mesh.refineUniform","mfem.mesh.refineUniform(mesh, times?)","Uniformly refines a mesh one or more times.\r","Uniformly refines a mesh one or more times.\r\n\r\nEach refinement level subdivides every element into smaller elements:\r\n- 2D triangles → 4 triangles\r\n- 2D quadrilaterals → 4 quadrilaterals\r\n- 3D tetrahedra → 8 tetrahedra\r\n- 3D hexahedra → 8 hexahedra\r\n\r\nThe number of elements grows exponentially: after `times` refinements,\r\na 2D mesh will have 4^times × original elements.",[2894,2895],{"_17":418,"_19":2874,"_41":6},{"_17":2896,"_19":2897,"_41":10},"times","- Number of refinement levels to apply (default 1)",[],{"_17":2900,"_31":2901,"_33":2902,"_19":2903,"_36":2904,"_45":46,"_47":2913},"mfem.mesh.rotate","mfem.mesh.rotate(mesh, angle, axis?)","Rotates a mesh around an axis.\r","Rotates a mesh around an axis.\r\n\r\nFor 2D meshes, rotates around the origin (z-axis).\r\nFor 3D meshes, rotates around the specified coordinate axis passing\r\nthrough the origin.\r\n\r\nRotation follows the right-hand rule: positive angles rotate\r\ncounterclockwise when looking along the axis toward the origin.",[2905,2907,2910],{"_17":418,"_19":2906,"_41":6},"- The mesh to rotate (modified in place)",{"_17":2908,"_19":2909,"_41":6},"angle","- Rotation angle in radians (positive = counterclockwise)",{"_17":2911,"_19":2912,"_41":10},"axis","- Rotation axis for 3D: 0=x, 1=y, 2=z (default). Ignored for 2D.",[],{"_17":2915,"_31":2916,"_33":2917,"_19":2918,"_36":2919,"_45":46,"_47":2925},"mfem.mesh.scale","mfem.mesh.scale(mesh, factor)","Scales a mesh uniformly or along each axis.\r","Scales a mesh uniformly or along each axis.\r\n\r\nMultiplies all vertex coordinates by the scale factor(s), effectively\r\nresizing the mesh. Scaling is performed relative to the origin.",[2920,2922],{"_17":418,"_19":2921,"_41":6},"- The mesh to scale (modified in place)",{"_17":2923,"_19":2924,"_41":6},"factor","- Either a single uniform scale factor, or an array of\r\n per-axis factors [sx, sy] (2D) or [sx, sy, sz] (3D)",[],{"_17":2927,"_31":2928,"_33":2929,"_19":2930,"_36":2931,"_45":46,"_47":2936},"mfem.mesh.setCurvature","mfem.mesh.setCurvature(mesh, order)","Sets the curvature order for high-order geometry representation.\r","Sets the curvature order for high-order geometry representation.\r\n\r\nConverts the mesh to use high-order polynomial nodes for representing\r\ncurved element boundaries. This is essential for accurately representing\r\ncurved domains (circles, spheres, etc.) and achieving optimal convergence\r\nrates with high-order finite elements.\r\n\r\nHigher orders provide better approximation of curved boundaries but\r\nincrease the number of geometry nodes per element.",[2932,2934],{"_17":418,"_19":2933,"_41":6},"- The mesh to set curvature on (modified in place)",{"_17":1246,"_19":2935,"_41":6},"- Polynomial order for geometry representation (≥ 1)",[],{"_17":2938,"_31":2939,"_33":2940,"_19":2941,"_36":2942,"_45":2948,"_47":2949},"mfem.mesh.getBoundaryNormals","mfem.mesh.getBoundaryNormals(mesh, bdrAttribute?)","Computes unit normal vectors for all boundary elements (or a subset).\r","Computes unit normal vectors for all boundary elements (or a subset).\r\n\r\nThis is a convenience function that calls for each\r\nboundary element and collects the results. The normals are computed at the\r\ncentroid of each boundary element.",[2943,2945],{"_17":418,"_19":2944,"_41":6},"- The mesh to compute boundary normals for",{"_17":2946,"_19":2947,"_41":10},"bdrAttribute","- Optional: If provided, only compute normals for boundary\r\n elements with this attribute. If undefined, compute for all.","Map",[],{"_17":2951,"_31":2952,"_33":2953,"_19":2954,"_36":2955,"_45":1130,"_47":2957},"mfem.mesh.getBoundaryNormalsFlat","mfem.mesh.getBoundaryNormalsFlat(mesh)","Computes unit normal vectors for all boundary elements as a flat array.\r","Computes unit normal vectors for all boundary elements as a flat array.\r\n\r\nThis is more efficient than when you need normals\r\nfor all boundary elements in a contiguous array format.",[2956],{"_17":418,"_19":2944,"_41":6},[],{"_17":2959,"_31":2960,"_33":2961,"_19":2962,"_36":2963,"_45":374,"_47":2972},"mfem.mesh.getSurfaceNormal","mfem.mesh.getSurfaceNormal(mesh, bdrIndex, refPoint?)","Computes the unit outward normal vector at a point on a boundary element.\r","Computes the unit outward normal vector at a point on a boundary element.\r\n\r\nFor a 2D mesh (spaceDim=2, dim=1 on boundary):\r\n- The tangent is the Jacobian column\r\n- The normal is perpendicular (rotated 90 degrees)\r\n\r\nFor a 3D surface (spaceDim=3, dim=2 on boundary):\r\n- The two tangent vectors are the Jacobian columns\r\n- The normal is their cross product\r\n\r\nNote: The \"outward\" direction depends on the mesh orientation. MFEM typically\r\norients boundary elements so that the computed normal points outward.",[2964,2966,2969],{"_17":418,"_19":2965,"_41":6},"- The mesh containing the boundary element",{"_17":2967,"_19":2968,"_41":6},"bdrIndex","- Zero-based boundary element index",{"_17":2970,"_19":2971,"_41":10},"refPoint","- Optional reference coordinates on the boundary element.\r\n If not provided, uses the element centroid.",[],{"_17":2974,"_31":2975,"_33":2976,"_19":2977,"_36":2978,"_45":506,"_47":2985},"mfem.mesh.getSurfaceTangents","mfem.mesh.getSurfaceTangents(mesh, bdrIndex, refPoint?, normalize?)","Gets the tangent vectors at a point on a boundary element.\r","Gets the tangent vectors at a point on a boundary element.\r\n\r\nThe tangent vectors are extracted directly from the Jacobian matrix columns.\r\nFor a 1D boundary element (edge), returns 1 tangent vector.\r\nFor a 2D boundary element (face), returns 2 tangent vectors.\r\n\r\nThe tangent vectors are NOT normalized - they represent the actual\r\ndifferential change in physical coordinates per unit change in reference\r\ncoordinates. Use this for computing surface metrics, arc lengths, or areas.",[2979,2980,2981,2982],{"_17":418,"_19":2965,"_41":6},{"_17":2967,"_19":2968,"_41":6},{"_17":2970,"_19":2971,"_41":10},{"_17":2983,"_19":2984,"_41":10},"normalize","- If true, normalize the tangent vectors to unit length.\r\n Default is false.",[],{"_17":2987,"_31":2988,"_33":2989,"_19":2990,"_36":2991,"_45":1793,"_47":2994},"mfem.mesh.toBinary","mfem.mesh.toBinary(mesh)","Exports a mesh to a base64-encoded binary string.\r","Exports a mesh to a base64-encoded binary string.\r\n\r\nThis provides a compact representation of the mesh suitable for\r\nstorage in JSON, localStorage, or transmission. The mesh is first\r\nserialized to MFEM format and then base64-encoded.",[2992],{"_17":418,"_19":2993,"_41":6},"- The mesh to export",[],{"_17":2996,"_31":2997,"_33":2998,"_19":2999,"_36":3000,"_45":1793,"_47":3002},"mfem.mesh.toGmsh","mfem.mesh.toGmsh(mesh)","Exports a mesh to Gmsh MSH 2.2 format string.\r","Exports a mesh to Gmsh MSH 2.2 format string.\r\n\r\nGenerates a string representation of the mesh in Gmsh MSH format,\r\nwhich can be used with Gmsh or other tools that support this format.\r\n\r\n**Note:** This is a simplified implementation that exports node coordinates\r\nand basic element information. Full element connectivity is not yet supported.\r\nFor complete mesh export, prefer or .",[3001],{"_17":418,"_19":2993,"_41":6},[],{"_17":3004,"_31":3005,"_33":3006,"_19":3007,"_36":3008,"_45":1793,"_47":3010},"mfem.mesh.toMFEM","mfem.mesh.toMFEM(mesh)","Exports a mesh to MFEM native format string.\r","Exports a mesh to MFEM native format string.\r\n\r\nGenerates a string representation of the mesh in MFEM's native format,\r\nwhich can be saved to a file or used with other MFEM tools. This format\r\npreserves all mesh information including high-order geometry nodes.",[3009],{"_17":418,"_19":2993,"_41":6},[],{"_17":3012,"_31":3013,"_33":3014,"_19":3015,"_36":3016,"_45":1793,"_47":3018},"mfem.mesh.toNetgen","mfem.mesh.toNetgen(mesh)","Exports a mesh to Netgen/TrueGrid format string.\r","Exports a mesh to Netgen/TrueGrid format string.\r\n\r\nUses MFEM's PrintXG() method which outputs a Netgen-compatible format.\r\nThis format can be imported by Netgen and related tools.",[3017],{"_17":418,"_19":2993,"_41":6},[],{"_17":3020,"_31":3021,"_33":3022,"_19":3023,"_36":3024,"_45":1793,"_47":3027},"mfem.mesh.toParaView","mfem.mesh.toParaView(mesh, options?)","Exports a mesh to ParaView VTU (VTK XML Unstructured Grid) format string.\r","Exports a mesh to ParaView VTU (VTK XML Unstructured Grid) format string.\r\n\r\nVTU is an XML-based format that can be directly loaded by ParaView\r\nand other VTK-compatible visualization tools. It supports high-order\r\nelement visualization through refinement.",[3025,3026],{"_17":418,"_19":2993,"_41":6},{"_17":454,"_19":1812,"_41":10},[],{"_17":3029,"_31":3030,"_33":3031,"_19":3032,"_36":3033,"_45":1793,"_47":3035},"mfem.mesh.toVTK","mfem.mesh.toVTK(mesh)","Exports a mesh to VTK legacy format string.\r","Exports a mesh to VTK legacy format string.\r\n\r\nGenerates a string representation of the mesh in VTK legacy format (.vtk),\r\nwhich can be visualized in ParaView, VisIt, or other VTK-compatible tools.",[3034],{"_17":418,"_19":2993,"_41":6},[],{"_17":3037,"_31":3038,"_33":3039,"_19":3040,"_36":3041,"_45":46,"_47":3046},"mfem.mesh.transform","mfem.mesh.transform(mesh, fn)","Transforms all mesh vertex coordinates using a custom function.\r","Transforms all mesh vertex coordinates using a custom function.\r\n\r\nThis function applies an arbitrary coordinate transformation to every vertex\r\nin the mesh. It's useful for creating curved domains, deforming meshes, or\r\napplying custom mappings.\r\n\r\nThe transformation function receives the current coordinates as an array\r\nand must return an array of the same length with the new coordinates.",[3042,3044],{"_17":418,"_19":3043,"_41":6},"- The mesh to transform (modified in place)",{"_17":578,"_19":3045,"_41":6},"- Transformation function that maps old coordinates to new coordinates",[],{"_17":3048,"_31":3049,"_33":3050,"_19":3051,"_36":3052,"_45":46,"_47":3058},"mfem.mesh.translate","mfem.mesh.translate(mesh, offset)","Translates a mesh by an offset vector.\r","Translates a mesh by an offset vector.\r\n\r\nAdds the offset to all vertex coordinates, effectively moving the entire\r\nmesh in space without changing its shape or size.",[3053,3055],{"_17":418,"_19":3054,"_41":6},"- The mesh to translate (modified in place)",{"_17":3056,"_19":3057,"_41":6},"offset","- Translation vector [dx, dy] for 2D or [dx, dy, dz] for 3D",[],{"_17":3060,"_31":3061,"_33":3062,"_19":3063,"_36":3064,"_45":3065,"_47":3066},"mfem.mesh.IsoparametricTransformation.create","mfem.mesh.IsoparametricTransformation.create()","Creates a new IsoparametricTransformation.\r","Creates a new IsoparametricTransformation.\r\n\r\nThe transformation is initially unconfigured. You must call\r\n and before using it.",[],"Promise",[],{"_17":3068,"_31":3069,"_33":3070,"_19":3071,"_36":3072,"_45":472,"_47":3073},"mfem.mesh.Mesh.create","mfem.mesh.Mesh.create()","Creates an empty mesh.\r","Creates an empty mesh.\r\n\r\nThe returned mesh has no elements, vertices, or boundaries. Use\r\n| loadFromString() to populate it with mesh data.",[],[],{"_17":3075,"_31":3076,"_33":3077,"_19":3078,"_36":3079,"_45":472,"_47":3083},"mfem.mesh.Mesh.fromString","mfem.mesh.Mesh.fromString(meshData)","Loads a mesh from a string containing mesh data in MFEM format.\r","Loads a mesh from a string containing mesh data in MFEM format.\r\n\r\nSupports the MFEM mesh format (versions 1.0 and 1.1). The mesh format\r\nincludes sections for dimension, elements, boundary elements, and vertices.",[3080],{"_17":3081,"_19":3082,"_41":6},"meshData","- String containing the mesh data in MFEM format",[],{"_17":3085,"_31":3086,"_33":3087,"_19":3087,"_36":3088,"_45":46,"_47":3094},"mfem.nonlinear.mult","mfem.nonlinear.mult(solver, b, x)","Solve nonlinear system F(x) = b.",[3089,3091,3092],{"_17":1125,"_19":3090,"_41":6},"- Nonlinear solver instance (NewtonSolver or LBFGSSolver)",{"_17":408,"_19":2031,"_41":6},{"_17":405,"_19":3093,"_41":6},"- Solution vector (modified in place, initial guess on input)",[],{"_17":3096,"_31":3097,"_33":3098,"_19":3099,"_36":3100,"_45":46,"_47":3105},"mfem.nonlinear.setHistorySize","mfem.nonlinear.setHistorySize(solver, m)","Set history size for L-BFGS solver.\r","Set history size for L-BFGS solver.\r\n\r\nThe history size determines how many gradient vectors are stored for\r\napproximating the inverse Hessian.",[3101,3103],{"_17":1125,"_19":3102,"_41":6},"- LBFGSSolver instance",{"_17":630,"_19":3104,"_41":6},"- History size (number of vectors to store)",[],{"_17":3107,"_31":3108,"_33":3109,"_19":3110,"_36":3111,"_45":46,"_47":3117},"mfem.nonlinear.setLinearSolver","mfem.nonlinear.setLinearSolver(solver, linearSolver)","Set linear solver for Newton iterations.\r","Set linear solver for Newton iterations.\r\n\r\nThe linear solver is used to solve the Jacobian system at each Newton step.",[3112,3114],{"_17":1125,"_19":3113,"_41":6},"- Newton solver instance",{"_17":3115,"_19":3116,"_41":6},"linearSolver","- Linear solver for Jacobian systems (e.g., CGSolver, GMRESSolver)",[],{"_17":3119,"_31":3120,"_33":3121,"_19":3121,"_36":3122,"_45":46,"_47":3125},"mfem.nonlinear.setMaxIterations","mfem.nonlinear.setMaxIterations(solver, max)","Set maximum iterations for nonlinear solver.",[3123,3124],{"_17":1125,"_19":3090,"_41":6},{"_17":2042,"_19":2043,"_41":6},[],{"_17":3127,"_31":3128,"_33":3129,"_19":3129,"_36":3130,"_45":46,"_47":3135},"mfem.nonlinear.setOperator","mfem.nonlinear.setOperator(solver, oper)","Set nonlinear operator for the solver.",[3131,3132],{"_17":1125,"_19":3090,"_41":6},{"_17":3133,"_19":3134,"_41":6},"oper","- Nonlinear operator (e.g., NonlinearForm)",[],{"_17":3137,"_31":3138,"_33":3139,"_19":3139,"_36":3140,"_45":46,"_47":3144},"mfem.nonlinear.setTolerance","mfem.nonlinear.setTolerance(solver, rtol, atol?)","Set convergence tolerances for nonlinear solver.",[3141,3142,3143],{"_17":1125,"_19":3090,"_41":6},{"_17":2072,"_19":2073,"_41":6},{"_17":2075,"_19":2076,"_41":10},[],{"_17":3146,"_31":3147,"_33":3148,"_19":3149,"_36":3150,"_45":3154,"_47":3155},"mfem.nonlinear.HyperelasticIntegrator.create","mfem.nonlinear.HyperelasticIntegrator.create(modelPtr)","Creates a new hyperelastic integrator.\r","Creates a new hyperelastic integrator.\r\nNote: The integrator does NOT take ownership of the model.",[3151],{"_17":3152,"_19":3153,"_41":6},"modelPtr","Pointer to HyperelasticModel (e.g., NeoHookeanModel)","Promise",[],{"_17":3157,"_31":3158,"_33":3159,"_19":3159,"_36":3160,"_45":3164,"_47":3165},"mfem.nonlinear.LBFGSSolver.create","mfem.nonlinear.LBFGSSolver.create(historySize?)","Creates a new L-BFGS solver.",[3161],{"_17":3162,"_19":3163,"_41":10},"historySize","Number of vectors to store for history (default 10)","Promise",[],{"_17":3167,"_31":3168,"_33":3169,"_19":3169,"_36":3170,"_45":3176,"_47":3177},"mfem.nonlinear.NeoHookeanModel.create","mfem.nonlinear.NeoHookeanModel.create(mu, K)","Creates a new NeoHookean material model.",[3171,3173],{"_17":99,"_19":3172,"_41":6},"Shear modulus (Lamé's second parameter)",{"_17":3174,"_19":3175,"_41":6},"K","Bulk modulus","Promise",[],{"_17":3179,"_31":3180,"_33":3181,"_19":3181,"_36":3182,"_45":3183,"_47":3184},"mfem.nonlinear.NewtonSolver.create","mfem.nonlinear.NewtonSolver.create()","Creates a new Newton solver.",[],"Promise",[],{"_17":3186,"_31":3187,"_33":3188,"_19":3188,"_36":3189,"_45":3193,"_47":3194},"mfem.nonlinear.NonlinearForm.create","mfem.nonlinear.NonlinearForm.create(fespacePtr)","Creates a new NonlinearForm on the given finite element space.",[3190],{"_17":3191,"_19":3192,"_41":6},"fespacePtr","Pointer to FiniteElementSpace","Promise",[],{"_17":3196,"_31":3197,"_33":3198,"_19":3198,"_36":3199,"_45":3202,"_47":3203},"mfem.nonlinear.VectorConvectionIntegrator.create","mfem.nonlinear.VectorConvectionIntegrator.create(coeff?)","Creates a new vector convection integrator.",[3200],{"_17":43,"_19":3201,"_41":10},"Optional scalar coefficient to scale the convection term","Promise",[],{"_17":3205,"_31":3206,"_33":3207,"_19":3207,"_36":3208,"_45":3209,"_47":3210},"mfem.ode.AB1Solver.create","mfem.ode.AB1Solver.create()","Creates a new AB1 solver.",[],"Promise",[],{"_17":3212,"_31":3213,"_33":3214,"_19":3214,"_36":3215,"_45":3216,"_47":3217},"mfem.ode.AB2Solver.create","mfem.ode.AB2Solver.create()","Creates a new AB2 solver.",[],"Promise",[],{"_17":3219,"_31":3220,"_33":3221,"_19":3221,"_36":3222,"_45":3223,"_47":3224},"mfem.ode.AB3Solver.create","mfem.ode.AB3Solver.create()","Creates a new AB3 solver.",[],"Promise",[],{"_17":3226,"_31":3227,"_33":3228,"_19":3228,"_36":3229,"_45":3230,"_47":3231},"mfem.ode.AB4Solver.create","mfem.ode.AB4Solver.create()","Creates a new AB4 solver.",[],"Promise",[],{"_17":3233,"_31":3234,"_33":3235,"_19":3235,"_36":3236,"_45":3237,"_47":3238},"mfem.ode.AB5Solver.create","mfem.ode.AB5Solver.create()","Creates a new AB5 solver.",[],"Promise",[],{"_17":3240,"_31":3241,"_33":3242,"_19":3242,"_36":3243,"_45":3244,"_47":3245},"mfem.ode.AM1Solver.create","mfem.ode.AM1Solver.create()","Creates a new AM1 solver.",[],"Promise",[],{"_17":3247,"_31":3248,"_33":3249,"_19":3249,"_36":3250,"_45":3251,"_47":3252},"mfem.ode.AM2Solver.create","mfem.ode.AM2Solver.create()","Creates a new AM2 solver.",[],"Promise",[],{"_17":3254,"_31":3255,"_33":3256,"_19":3256,"_36":3257,"_45":3258,"_47":3259},"mfem.ode.AM3Solver.create","mfem.ode.AM3Solver.create()","Creates a new AM3 solver.",[],"Promise",[],{"_17":3261,"_31":3262,"_33":3263,"_19":3263,"_36":3264,"_45":3265,"_47":3266},"mfem.ode.AM4Solver.create","mfem.ode.AM4Solver.create()","Creates a new AM4 solver.",[],"Promise",[],{"_17":3268,"_31":3269,"_33":3270,"_19":3270,"_36":3271,"_45":3272,"_47":3273},"mfem.ode.BackwardEulerSolver.create","mfem.ode.BackwardEulerSolver.create()","Creates a new Backward Euler solver.",[],"Promise",[],{"_17":3275,"_31":3276,"_33":3277,"_19":3277,"_36":3278,"_45":3279,"_47":3280},"mfem.ode.ESDIRK32Solver.create","mfem.ode.ESDIRK32Solver.create()","Creates a new ESDIRK32 solver.",[],"Promise",[],{"_17":3282,"_31":3283,"_33":3284,"_19":3284,"_36":3285,"_45":3286,"_47":3287},"mfem.ode.ESDIRK33Solver.create","mfem.ode.ESDIRK33Solver.create()","Creates a new ESDIRK33 solver.",[],"Promise",[],{"_17":3289,"_31":3290,"_33":3291,"_19":3291,"_36":3292,"_45":3293,"_47":3294},"mfem.ode.ForwardEulerSolver.create","mfem.ode.ForwardEulerSolver.create()","Creates a new Forward Euler solver.",[],"Promise",[],{"_17":3296,"_31":3297,"_33":3298,"_19":3298,"_36":3299,"_45":3303,"_47":3304},"mfem.ode.GeneralizedAlphaSolver.create","mfem.ode.GeneralizedAlphaSolver.create(rhoInf?)","Creates a new Generalized-α solver.",[3300],{"_17":3301,"_19":3302,"_41":10},"rhoInf","Spectral radius at infinity (0 to 1, default: 1.0)","Promise",[],{"_17":3306,"_31":3307,"_33":3308,"_19":3308,"_36":3309,"_45":3310,"_47":3311},"mfem.ode.IMEXEulerSolver.create","mfem.ode.IMEXEulerSolver.create()","Creates a new IMEX Euler solver.",[],"Promise",[],{"_17":3313,"_31":3314,"_33":3315,"_19":3315,"_36":3316,"_45":3317,"_47":3318},"mfem.ode.IMEXRK2Solver.create","mfem.ode.IMEXRK2Solver.create()","Creates a new IMEX RK2 solver.",[],"Promise",[],{"_17":3320,"_31":3321,"_33":3322,"_19":3322,"_36":3323,"_45":3324,"_47":3325},"mfem.ode.ImplicitMidpointSolver.create","mfem.ode.ImplicitMidpointSolver.create()","Creates a new Implicit Midpoint solver.",[],"Promise",[],{"_17":3327,"_31":3328,"_33":3329,"_19":3329,"_36":3330,"_45":3333,"_47":3334},"mfem.ode.RK2Solver.create","mfem.ode.RK2Solver.create(alpha?)","Creates a new RK2 solver.",[3331],{"_17":60,"_19":3332,"_41":10},"Parameter controlling the method (0.5 = midpoint, 1.0 = Heun)","Promise",[],{"_17":3336,"_31":3337,"_33":3338,"_19":3338,"_36":3339,"_45":3340,"_47":3341},"mfem.ode.RK3SSPSolver.create","mfem.ode.RK3SSPSolver.create()","Creates a new RK3 SSP solver.",[],"Promise",[],{"_17":3343,"_31":3344,"_33":3345,"_19":3345,"_36":3346,"_45":3347,"_47":3348},"mfem.ode.RK4Solver.create","mfem.ode.RK4Solver.create()","Creates a new RK4 solver.",[],"Promise",[],{"_17":3350,"_31":3351,"_33":3352,"_19":3352,"_36":3353,"_45":3354,"_47":3355},"mfem.ode.RK6Solver.create","mfem.ode.RK6Solver.create()","Creates a new RK6 solver.",[],"Promise",[],{"_17":3357,"_31":3358,"_33":3359,"_19":3359,"_36":3360,"_45":3361,"_47":3362},"mfem.ode.RK8Solver.create","mfem.ode.RK8Solver.create()","Creates a new RK8 solver.",[],"Promise",[],{"_17":3364,"_31":3365,"_33":3366,"_19":3366,"_36":3367,"_45":3368,"_47":3369},"mfem.ode.SDIRK23Solver.create","mfem.ode.SDIRK23Solver.create()","Creates a new SDIRK23 solver.",[],"Promise",[],{"_17":3371,"_31":3372,"_33":3373,"_19":3373,"_36":3374,"_45":3375,"_47":3376},"mfem.ode.SDIRK33Solver.create","mfem.ode.SDIRK33Solver.create()","Creates a new SDIRK33 solver.",[],"Promise",[],{"_17":3378,"_31":3379,"_33":3380,"_19":3380,"_36":3381,"_45":3382,"_47":3383},"mfem.ode.SDIRK34Solver.create","mfem.ode.SDIRK34Solver.create()","Creates a new SDIRK34 solver.",[],"Promise",[],{"_17":3385,"_31":3386,"_33":3387,"_19":3387,"_36":3388,"_45":3389,"_47":3390},"mfem.ode.TrapezoidalRuleSolver.create","mfem.ode.TrapezoidalRuleSolver.create()","Creates a new Trapezoidal Rule solver.",[],"Promise",[],{"_17":3392,"_31":3393,"_33":3394,"_19":3394,"_36":3395,"_45":3396,"_47":3397},"mfem.ode.AverageAccelerationSolver.create","mfem.ode.AverageAccelerationSolver.create()","Creates a new Average Acceleration solver.",[],"Promise",[],{"_17":3399,"_31":3400,"_33":3401,"_19":3401,"_36":3402,"_45":3403,"_47":3404},"mfem.ode.CentralDifferenceSolver.create","mfem.ode.CentralDifferenceSolver.create()","Creates a new Central Difference solver.",[],"Promise",[],{"_17":3406,"_31":3407,"_33":3408,"_19":3408,"_36":3409,"_45":3410,"_47":3411},"mfem.ode.FoxGoodwinSolver.create","mfem.ode.FoxGoodwinSolver.create()","Creates a new Fox-Goodwin solver.",[],"Promise",[],{"_17":3413,"_31":3414,"_33":3415,"_19":3415,"_36":3416,"_45":3418,"_47":3419},"mfem.ode.GeneralizedAlpha2Solver.create","mfem.ode.GeneralizedAlpha2Solver.create(rhoInf?)","Creates a new Generalized-Alpha 2 solver.",[3417],{"_17":3301,"_19":3302,"_41":10},"Promise",[],{"_17":3421,"_31":3422,"_33":3423,"_19":3423,"_36":3424,"_45":3427,"_47":3428},"mfem.ode.HHTAlphaSolver.create","mfem.ode.HHTAlphaSolver.create(alpha?)","Creates a new HHT-alpha solver.",[3425],{"_17":60,"_19":3426,"_41":10},"Alpha parameter (2/3 to 1, default: 1.0)","Promise",[],{"_17":3430,"_31":3431,"_33":3432,"_19":3432,"_36":3433,"_45":3434,"_47":3435},"mfem.ode.LinearAccelerationSolver.create","mfem.ode.LinearAccelerationSolver.create()","Creates a new Linear Acceleration solver.",[],"Promise",[],{"_17":3437,"_31":3438,"_33":3439,"_19":3439,"_36":3440,"_45":3446,"_47":3447},"mfem.ode.NewmarkSolver.create","mfem.ode.NewmarkSolver.create(beta?, gamma?)","Creates a new Newmark solver.",[3441,3443],{"_17":118,"_19":3442,"_41":10},"Newmark beta parameter (default: 0.25 for average acceleration)",{"_17":3444,"_19":3445,"_41":10},"gamma","Newmark gamma parameter (default: 0.5)","Promise",[],{"_17":3449,"_31":3450,"_33":3451,"_19":3451,"_36":3452,"_45":3454,"_47":3455},"mfem.ode.WBZAlphaSolver.create","mfem.ode.WBZAlphaSolver.create(rhoInf?)","Creates a new WBZ-alpha solver.",[3453],{"_17":3301,"_19":3302,"_41":10},"Promise",[],{"_17":3457,"_31":3458,"_33":3459,"_19":1136,"_36":3460,"_45":46,"_47":3466},"mfem.sparse.add","mfem.sparse.add(sm, i, j, value)","add_2",[3461,3463,3464,3465],{"_17":3462,"_19":239,"_41":6},"sm",{"_17":2433,"_19":1387,"_41":6},{"_17":2435,"_19":1387,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":3468,"_31":3469,"_33":3470,"_19":1136,"_36":3471,"_45":1978,"_47":3474},"mfem.sparse.create","mfem.sparse.create(rows, cols)","create_3",[3472,3473],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":3476,"_31":3477,"_33":3478,"_19":1136,"_36":3479,"_45":1978,"_47":3484},"mfem.sparse.fromCOO","mfem.sparse.fromCOO(rows, cols, data)","fromCOO",[3480,3481,3482],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},{"_17":1215,"_19":3483,"_41":6},"{\r\n row: number[];\r\n col: number[];\r\n val: number[];\r\n}",[],{"_17":3486,"_31":3487,"_33":3488,"_19":3489,"_36":3490,"_45":239,"_47":3494},"mfem.sparse.fromPointer","mfem.sparse.fromPointer(ptr, ownsMemory?)","Creates a SparseMatrix wrapper from an existing WASM pointer.\r","Creates a SparseMatrix wrapper from an existing WASM pointer.\r\n\r\nThis is a synchronous operation that wraps an existing pointer.\r\nThe MFEM module must already be loaded (via any async MFEM operation).",[3491,3492],{"_17":310,"_19":1987,"_41":6},{"_17":1227,"_19":3493,"_41":10},"- If true, destroy() will free the memory; if false, it won't (default: false)",[],{"_17":3496,"_31":3497,"_33":3498,"_19":1136,"_36":3499,"_45":422,"_47":3501},"mfem.sparse.getColIndices","mfem.sparse.getColIndices(sm)","getColIndices",[3500],{"_17":3462,"_19":239,"_41":6},[],{"_17":3503,"_31":3504,"_33":3505,"_19":1136,"_36":3506,"_45":1130,"_47":3508},"mfem.sparse.getData","mfem.sparse.getData(sm)","getData_2",[3507],{"_17":3462,"_19":239,"_41":6},[],{"_17":3510,"_31":3511,"_33":3512,"_19":1136,"_36":3513,"_45":422,"_47":3515},"mfem.sparse.getRowOffsets","mfem.sparse.getRowOffsets(sm)","getRowOffsets",[3514],{"_17":3462,"_19":239,"_41":6},[],{"_17":3517,"_31":3518,"_33":3519,"_19":1136,"_36":3520,"_45":46,"_47":3524},"mfem.sparse.mult","mfem.sparse.mult(sm, x, y)","mult_2",[3521,3522,3523],{"_17":3462,"_19":239,"_41":6},{"_17":405,"_19":2465,"_41":6},{"_17":2467,"_19":2465,"_41":6},[],{"_17":3526,"_31":3527,"_33":3528,"_19":1136,"_36":3529,"_45":1387,"_47":3531},"mfem.sparse.numNonZeros","mfem.sparse.numNonZeros(sm)","numNonZeros",[3530],{"_17":3462,"_19":239,"_41":6},[],{"_17":3533,"_31":3534,"_33":3535,"_19":1136,"_36":3536,"_45":1141,"_47":3538},"mfem.sparse.toDense","mfem.sparse.toDense(sm)","toDense",[3537],{"_17":3462,"_19":239,"_41":6},[],{"_17":3540,"_31":3541,"_33":3542,"_19":1136,"_36":3543,"_45":1978,"_47":3545},"mfem.sparse.transpose","mfem.sparse.transpose(sm)","transpose_3",[3544],{"_17":3462,"_19":239,"_41":6},[],{"_17":3547,"_31":3548,"_33":1974,"_19":1974,"_36":3549,"_45":1978,"_47":3552},"mfem.sparse.SparseMatrix.create","mfem.sparse.SparseMatrix.create(height, width)",[3550,3551],{"_17":651,"_19":652,"_41":6},{"_17":654,"_19":1189,"_41":6},[],{"_17":3554,"_31":3555,"_33":1983,"_19":1984,"_36":3556,"_45":1978,"_47":3559},"mfem.sparse.SparseMatrix.fromPointer","mfem.sparse.SparseMatrix.fromPointer(ptr, ownsMemory?)",[3557,3558],{"_17":310,"_19":1987,"_41":6},{"_17":1227,"_19":1989,"_41":10},[],{"_17":3561,"_31":3562,"_33":3563,"_19":1136,"_36":3564,"_45":46,"_47":3568},"mfem.vector.add","mfem.vector.add(v, alpha, other)","add_3",[3565,3566,3567],{"_17":676,"_19":2465,"_41":6},{"_17":60,"_19":1387,"_41":6},{"_17":2386,"_19":2465,"_41":6},[],{"_17":3570,"_31":3571,"_33":3572,"_19":1136,"_36":3573,"_45":1998,"_47":3576},"mfem.vector.copy","mfem.vector.copy(vec)","copy",[3574],{"_17":3575,"_19":2465,"_41":6},"vec",[],{"_17":3578,"_31":3579,"_33":3580,"_19":1136,"_36":3581,"_45":1998,"_47":3583},"mfem.vector.create","mfem.vector.create(size)","create_4",[3582],{"_17":1865,"_19":1387,"_41":6},[],{"_17":3585,"_31":3586,"_33":3587,"_19":1136,"_36":3588,"_45":1387,"_47":3591},"mfem.vector.dot","mfem.vector.dot(v1, v2)","dot",[3589,3590],{"_17":524,"_19":2465,"_41":6},{"_17":527,"_19":2465,"_41":6},[],{"_17":3593,"_31":3594,"_33":3595,"_19":1136,"_36":3596,"_45":1998,"_47":3599},"mfem.vector.fromArray","mfem.vector.fromArray(data)","fromArray_2",[3597],{"_17":1215,"_19":3598,"_41":6},"number[] | Float64Array",[],{"_17":3601,"_31":3602,"_33":3603,"_19":3604,"_36":3605,"_45":2465,"_47":3607},"mfem.vector.fromPointer","mfem.vector.fromPointer(ptr)","Creates a Vector wrapper from an existing WASM pointer.\r","Creates a Vector wrapper from an existing WASM pointer.\r\n\r\nThis is a synchronous operation that wraps an existing pointer.\r\nThe MFEM module must already be loaded (via any async MFEM operation).",[3606],{"_17":310,"_19":2007,"_41":6},[],{"_17":3609,"_31":3610,"_33":3611,"_19":1136,"_36":3612,"_45":1387,"_47":3615},"mfem.vector.get","mfem.vector.get(vec, i)","get_3",[3613,3614],{"_17":3575,"_19":2465,"_41":6},{"_17":2433,"_19":1387,"_41":6},[],{"_17":3617,"_31":3618,"_33":3619,"_19":1136,"_36":3620,"_45":1130,"_47":3622},"mfem.vector.getData","mfem.vector.getData(vec)","getData_3",[3621],{"_17":3575,"_19":2465,"_41":6},[],{"_17":3624,"_31":3625,"_33":3626,"_19":1136,"_36":3627,"_45":46,"_47":3629},"mfem.vector.neg","mfem.vector.neg(vec)","neg",[3628],{"_17":3575,"_19":2465,"_41":6},[],{"_17":3631,"_31":3632,"_33":3633,"_19":1136,"_36":3634,"_45":1387,"_47":3636},"mfem.vector.norm","mfem.vector.norm(vec)","norm",[3635],{"_17":3575,"_19":2465,"_41":6},[],{"_17":3638,"_31":3639,"_33":3640,"_19":1136,"_36":3641,"_45":1387,"_47":3643},"mfem.vector.normInf","mfem.vector.normInf(vec)","normInf",[3642],{"_17":3575,"_19":2465,"_41":6},[],{"_17":3645,"_31":3646,"_33":3647,"_19":1136,"_36":3648,"_45":1998,"_47":3650},"mfem.vector.ones","mfem.vector.ones(size)","ones",[3649],{"_17":1865,"_19":1387,"_41":6},[],{"_17":3652,"_31":3653,"_33":3654,"_19":1136,"_36":3655,"_45":1998,"_47":3657},"mfem.vector.rand","mfem.vector.rand(size)","rand",[3656],{"_17":1865,"_19":1387,"_41":6},[],{"_17":3659,"_31":3660,"_33":3661,"_19":1136,"_36":3662,"_45":46,"_47":3665},"mfem.vector.scale","mfem.vector.scale(vec, alpha)","scale",[3663,3664],{"_17":3575,"_19":2465,"_41":6},{"_17":60,"_19":1387,"_41":6},[],{"_17":3667,"_31":3668,"_33":3669,"_19":1136,"_36":3670,"_45":46,"_47":3674},"mfem.vector.set","mfem.vector.set(vec, i, value)","set_3",[3671,3672,3673],{"_17":3575,"_19":2465,"_41":6},{"_17":2433,"_19":1387,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":3676,"_31":3677,"_33":3678,"_19":1136,"_36":3679,"_45":46,"_47":3682},"mfem.vector.setAll","mfem.vector.setAll(vec, value)","setAll",[3680,3681],{"_17":3575,"_19":2465,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":3684,"_31":3685,"_33":3686,"_19":1136,"_36":3687,"_45":46,"_47":3691},"mfem.vector.setData","mfem.vector.setData(vec, data)","setData",[3688,3689],{"_17":3575,"_19":2465,"_41":6},{"_17":1215,"_19":3690,"_41":6},"Float64Array | number[]",[],{"_17":3693,"_31":3694,"_33":1865,"_19":1136,"_36":3695,"_45":1387,"_47":3697},"mfem.vector.size","mfem.vector.size(vec)",[3696],{"_17":3575,"_19":2465,"_41":6},[],{"_17":3699,"_31":3700,"_33":3701,"_19":1136,"_36":3702,"_45":1998,"_47":3704},"mfem.vector.zeros","mfem.vector.zeros(size)","zeros_2",[3703],{"_17":1865,"_19":1387,"_41":6},[],{"_17":3706,"_31":3707,"_33":1994,"_19":1994,"_36":3708,"_45":1998,"_47":3710},"mfem.vector.Vector.create","mfem.vector.Vector.create(size)",[3709],{"_17":1865,"_19":1997,"_41":6},[],{"_17":3712,"_31":3713,"_33":2003,"_19":2004,"_36":3714,"_45":1998,"_47":3716},"mfem.vector.Vector.fromPointer","mfem.vector.Vector.fromPointer(ptr)",[3715],{"_17":310,"_19":2007,"_41":6},[],{"_17":3718,"_31":3719,"_33":3720,"_19":3721,"_36":3722,"_45":3726,"_47":3727},"mfem.checkBoundaryDofs","mfem.checkBoundaryDofs(fespace, bdrAttrs)","Check boundary DOF extraction for specified boundary attributes.\r","Check boundary DOF extraction for specified boundary attributes.\r\n\r\nVerifies that DOFs can be correctly extracted for the given boundary attributes\r\nand validates the resulting DOF indices.",[3723,3724],{"_17":209,"_19":267,"_41":6},{"_17":373,"_19":3725,"_41":6},"- Array of boundary attributes to check","Promise",[],{"_17":3729,"_31":3730,"_33":3731,"_19":3732,"_36":3733,"_45":3734,"_47":3735},"mfem.checkForLeaks","mfem.checkForLeaks()","Check for memory leaks.\r","Check for memory leaks.\r\n\r\nAnalyzes object tracking data to find undestroyed objects.",[],"LeakReport",[],{"_17":3737,"_31":3738,"_33":3739,"_19":3740,"_36":3741,"_45":3745,"_47":3746},"mfem.checkPositiveDefinite","mfem.checkPositiveDefinite(mat)","Check if a sparse matrix is positive definite.\r","Check if a sparse matrix is positive definite.\r\n\r\nPerforms diagonal check (necessary condition) and attempts to estimate\r\nthe smallest eigenvalue using power iteration.",[3742],{"_17":3743,"_19":3744,"_41":6},"mat","- The sparse matrix to check","Promise",[],{"_17":3748,"_31":3749,"_33":3750,"_19":3751,"_36":3752,"_45":3761,"_47":3762},"mfem.checkResidual","mfem.checkResidual(A, x, b, tol)","Check if a solution satisfies the residual tolerance.\r","Check if a solution satisfies the residual tolerance.\r\n\r\nComputes the relative residual ||b - Ax|| / ||b|| and checks if it's\r\nbelow the specified tolerance.",[3753,3755,3757,3759],{"_17":1163,"_19":3754,"_41":6},"- The operator (SparseMatrix or BilinearForm)",{"_17":405,"_19":3756,"_41":6},"- The solution vector",{"_17":408,"_19":3758,"_41":6},"- The right-hand side vector",{"_17":470,"_19":3760,"_41":6},"- Tolerance for the relative residual","Promise",[],{"_17":3764,"_31":3765,"_33":3766,"_19":3766,"_36":3767,"_45":3771,"_47":3772},"mfem.checkSymmetry","mfem.checkSymmetry(mat, tol?)","Check if a sparse matrix is symmetric within a given tolerance.",[3768,3769],{"_17":3743,"_19":3744,"_41":6},{"_17":470,"_19":3770,"_41":10},"- Tolerance for symmetry check (default: 1e-12)","Promise",[],{"_17":3774,"_31":3775,"_33":3776,"_19":3777,"_36":3778,"_45":3784,"_47":3785},"mfem.computeConditionNumber","mfem.computeConditionNumber(mat, maxIter?)","Estimate the condition number of a sparse matrix.\r","Estimate the condition number of a sparse matrix.\r\n\r\nUses power iteration to estimate the largest and smallest eigenvalues,\r\nthen computes their ratio.",[3779,3781],{"_17":3743,"_19":3780,"_41":6},"- The sparse matrix",{"_17":3782,"_19":3783,"_41":10},"maxIter","- Maximum iterations for power iteration (default: 100)","Promise",[],{"_17":3787,"_31":3788,"_33":3789,"_19":3789,"_36":3790,"_45":375,"_47":3797},"mfem.computeResidual","mfem.computeResidual(A, x, b, r)","Compute the residual vector r = b - A*x.",[3791,3792,3793,3794],{"_17":1163,"_19":3754,"_41":6},{"_17":405,"_19":3756,"_41":6},{"_17":408,"_19":3758,"_41":6},{"_17":3795,"_19":3796,"_41":6},"r","- The output residual vector (must be pre-allocated with same size as b)",[],{"_17":3799,"_31":3800,"_33":3801,"_19":3802,"_36":3803,"_45":46,"_47":3807},"mfem.configureMFEM","mfem.configureMFEM(config)","Configure the MFEM WASM loader before initialization.\r","Configure the MFEM WASM loader before initialization.\r\nMust be called before loadMFEMModule().",[3804],{"_17":3805,"_19":3806,"_41":6},"config","Configuration options",[],{"_17":3809,"_31":3810,"_33":3811,"_19":3811,"_36":3812,"_45":46,"_47":3813},"mfem.disableTiming","mfem.disableTiming()","Disable timing collection.",[],[],{"_17":3815,"_31":3816,"_33":3817,"_19":3818,"_36":3819,"_45":46,"_47":3820},"mfem.enableTiming","mfem.enableTiming()","Enable timing collection for MFEMWASM operations.\r","Enable timing collection for MFEMWASM operations.\r\n\r\nWhen enabled, operations can be timed using the `withTiming` helper\r\nor by manually calling `startTimer` and `stopTimer`.",[],[],{"_17":3822,"_31":3823,"_33":3824,"_19":3824,"_36":3825,"_45":3826,"_47":3827},"mfem.getMemoryUsage","mfem.getMemoryUsage()","Get current WASM memory usage.",[],"Promise",[],{"_17":3829,"_31":3830,"_33":3831,"_19":3831,"_36":3832,"_45":3833,"_47":3834},"mfem.getMFEMModule","mfem.getMFEMModule()","Get the loaded MFEM module synchronously.",[],"MFEMModule",[],{"_17":3836,"_31":3837,"_33":3838,"_19":3838,"_36":3839,"_45":3840,"_47":3841},"mfem.getObjectCount","mfem.getObjectCount()","Get the current object counts by type.",[],"ObjectCounts",[],{"_17":3843,"_31":3844,"_33":3845,"_19":3845,"_36":3846,"_45":3847,"_47":3848},"mfem.getTimingReport","mfem.getTimingReport()","Get the current timing report.",[],"TimingReport",[],{"_17":3850,"_31":3851,"_33":3852,"_19":3852,"_36":3853,"_45":2598,"_47":3854},"mfem.isMFEMLoaded","mfem.isMFEMLoaded()","Check if the MFEM module has been loaded.",[],[],{"_17":3856,"_31":3857,"_33":3858,"_19":3859,"_36":3860,"_45":3861,"_47":3862},"mfem.loadMFEMModule","mfem.loadMFEMModule()","Load and initialize the MFEM WASM module.\r","Load and initialize the MFEM WASM module.\r\n\r\nThis function is idempotent - calling it multiple times returns the same\r\nmodule instance. The module is loaded lazily on first call.",[],"Promise",[],{"_17":3864,"_31":3865,"_33":3866,"_19":3867,"_36":3868,"_45":3871,"_47":3872},"mfem.loadSolution","mfem.loadSolution(data)","Loads a mesh and grid function pair from a JSON bundle string.\r","Loads a mesh and grid function pair from a JSON bundle string.\r\n\r\nThe bundle should contain both mesh and grid function in MFEM format,\r\nas created by . The grid function's FE space is\r\nautomatically reconstructed from the saved header information.",[3869],{"_17":1215,"_19":3870,"_41":6},"- JSON string containing the solution bundle","Promise",[],{"_17":3874,"_31":3875,"_33":3876,"_19":3876,"_36":3877,"_45":3880,"_47":3881},"mfem.printDofInfo","mfem.printDofInfo(fespace)","Get comprehensive DOF information for a finite element space.",[3878],{"_17":209,"_19":3879,"_41":6},"- The finite element space to inspect","Promise",[],{"_17":3883,"_31":3884,"_33":3885,"_19":3886,"_36":3887,"_45":46,"_47":3888},"mfem.resetMFEMModule","mfem.resetMFEMModule()","Reset the module state for testing purposes.\r","Reset the module state for testing purposes.\r\nAfter calling this, loadMFEMModule() will load a fresh instance.",[],[],{"_17":3890,"_31":3891,"_33":3892,"_19":3893,"_36":3894,"_45":46,"_47":3895},"mfem.resetTimers","mfem.resetTimers()","Reset all timing data.\r","Reset all timing data.\r\n\r\nClears all accumulated timing information.",[],[],{"_17":3897,"_31":3898,"_33":3899,"_19":3900,"_36":3901,"_45":1793,"_47":3908},"mfem.saveSolution","mfem.saveSolution(mesh, gf, options?)","Saves a mesh and grid function pair to a JSON bundle string.\r","Saves a mesh and grid function pair to a JSON bundle string.\r\n\r\nThe bundle contains both the mesh and grid function in MFEM format,\r\nalong with optional metadata. The grid function's FE space information\r\n(collection type, vdim, ordering) is preserved in the MFEM format header.",[3902,3904,3906],{"_17":418,"_19":3903,"_41":6},"- The mesh to save",{"_17":537,"_19":3905,"_41":6},"- The grid function to save",{"_17":454,"_19":3907,"_41":10},"- Optional save options",[],{"_17":3910,"_31":3911,"_33":3912,"_19":3913,"_36":3914,"_45":3917,"_47":3918},"mfem.verifyAssembly","mfem.verifyAssembly(bf)","Verify that a bilinear form has been correctly assembled.\r","Verify that a bilinear form has been correctly assembled.\r\n\r\nChecks assembly status, matrix properties, and scans for NaN/Inf values.",[3915],{"_17":384,"_19":3916,"_41":6},"- The bilinear form to verify","Promise",[],{"_17":3920,"_31":3921,"_33":3922,"_19":3922,"_36":3923,"_45":3927,"_47":3928},"mfem.visualizeDofs","mfem.visualizeDofs(fespace, elemIdx)","Get DOF locations for visualization/debugging of a specific element.",[3924,3925],{"_17":209,"_19":267,"_41":6},{"_17":1554,"_19":3926,"_41":6},"- Element index","Promise",[],"allPackages",[3931,5032,5387,5583,6190,7342,7540,7839,14,8219,8970,14885,15101,16534,18637,18899,19945,21019,22264],{"_15":3932,"_17":3933,"_19":3934,"_21":22,"_23":3935,"_27":3936},"core","Core Functions","Essential functions for array creation, mathematics, aggregation, and manipulation. Always available.","🔧",[3937,3959,3972,3987,4008,4027,4046,4059,4071,4095,4116,4150,4168,4180,4192,4205,4215,4228,4242,4257,4268,4279,4297,4310,4322,4334,4348,4362,4374,4385,4395,4416,4432,4445,4457,4469,4481,4502,4518,4544,4562,4573,4585,4596,4612,4626,4640,4657,4668,4679,4694,4710,4722,4734,4753,4765,4785,4804,4817,4831,4845,4858,4880,4898,4919,4932,4946,4964,4979,4992,5003,5014],{"_17":2526,"_31":3938,"_33":3939,"_19":3940,"_36":3941,"_45":3946,"_47":3947,"_3956":3957},"Z = zeros(n)\nZ = zeros(m, n)","Create array of all zeros","Creates an array of zeros with the specified dimensions. A single argument `n` creates an n×n matrix.",[3942,3944],{"_17":630,"_19":3943},"Number of rows",{"_17":1206,"_19":3945,"_41":10},"Number of columns","NDArray of zeros with the given shape",[3948,3953],{"_3949":3950,"_3951":3952},"code","zeros(3)","output","0 0 0\n0 0 0\n0 0 0",{"_3949":3954,"_3951":3955},"zeros(2, 4)","0 0 0 0\n0 0 0 0","seeAlso",[3647,3958,3654],"eye",{"_17":3647,"_31":3960,"_33":3961,"_19":3962,"_36":3963,"_45":3966,"_47":3967,"_3956":3971},"X = ones(n)\nX = ones(m, n)","Create array of all ones","Creates an array of ones with the specified dimensions. A single argument `n` creates an n×n matrix.",[3964,3965],{"_17":630,"_19":3943},{"_17":1206,"_19":3945,"_41":10},"NDArray of ones with the given shape",[3968],{"_3949":3969,"_3951":3970},"ones(2, 3)","1 1 1\n1 1 1",[2526,3958],{"_17":3958,"_31":3973,"_33":3974,"_19":3975,"_36":3976,"_45":3979,"_47":3980,"_3956":3984},"I = eye(n)","Identity matrix","Creates an n×n identity matrix with ones on the diagonal and zeros elsewhere.",[3977],{"_17":1206,"_19":3978},"Size of the square matrix","n×n identity NDArray",[3981],{"_3949":3982,"_3951":3983},"eye(3)","1 0 0\n0 1 0\n0 0 1",[2526,3647,3985,3986],"diag","magic",{"_17":3986,"_31":3988,"_33":3989,"_19":3990,"_36":3991,"_45":3994,"_47":3995,"_3956":4005},"M = magic(n)","Magic square","Creates an n×n magic square matrix where the sum of each row, column, and both main diagonals equals the same magic constant: n(n²+1)/2. For n=1 returns [1], for n=2 there is no magic square so returns [1 3; 4 2] (not a true magic square). Works for all n ≥ 1.",[3992],{"_17":1206,"_19":3993},"Size of the magic square (n ≥ 1)","n×n magic square NDArray",[3996,3999,4002],{"_3949":3997,"_3951":3998},"magic(3)","8 1 6\n3 5 7\n4 9 2",{"_3949":4000,"_3951":4001},"magic(4)","16 2 3 13\n 5 11 10 8\n 9 7 6 12\n 4 14 15 1",{"_3949":4003,"_3951":4004},"sum(magic(5))","65 65 65 65 65",[3958,3647,2526,4006,4007],"pascal","hilb",{"_17":4009,"_31":4010,"_33":4011,"_19":4012,"_36":4013,"_45":4020,"_47":4021,"_3956":4025},"linspace","v = linspace(a, b, n)","Generate linearly spaced vector","Returns a row vector of `n` evenly spaced points between `a` and `b` (inclusive).",[4014,4016,4018],{"_17":664,"_19":4015},"Start value",{"_17":408,"_19":4017},"End value",{"_17":1206,"_19":4019},"Number of points","1×n NDArray",[4022],{"_3949":4023,"_3951":4024},"linspace(0, 1, 5)","0 0.25 0.5 0.75 1",[4026,2526,3647],"logspace",{"_17":4026,"_31":4028,"_33":4029,"_19":4030,"_36":4031,"_45":4020,"_47":4038,"_3956":4045},"v = logspace(a, b)\nv = logspace(a, b, n)","Generate logarithmically spaced vector","Returns a row vector of `n` logarithmically spaced points between 10^a and 10^b. Default is 50 points.",[4032,4034,4036],{"_17":664,"_19":4033},"Exponent of start value (10^a)",{"_17":408,"_19":4035},"Exponent of end value (10^b)",{"_17":1206,"_19":4037,"_41":10},"Number of points (default: 50)",[4039,4042],{"_3949":4040,"_3951":4041},"logspace(0, 2, 5)","1 3.1623 10 31.623 100",{"_3949":4043,"_3951":4044},"logspace(-2, 0, 3)","0.01 0.1 1",[4009,2526,3647],{"_17":3654,"_31":4047,"_33":4048,"_19":4049,"_36":4050,"_45":4053,"_47":4054,"_3956":4057},"R = rand(n)\nR = rand(m, n)","Uniformly distributed random numbers","Creates an array of uniformly distributed random numbers in the interval (0, 1).",[4051,4052],{"_17":630,"_19":3943},{"_17":1206,"_19":3945,"_41":10},"NDArray of random values in (0, 1)",[4055],{"_3949":4056},"rand(2, 3)",[4058,2526],"randn",{"_17":4058,"_31":4060,"_33":4061,"_19":4062,"_36":4063,"_45":4066,"_47":4067,"_3956":4070},"R = randn(n)\nR = randn(m, n)","Normally distributed random numbers","Creates an array of random numbers drawn from the standard normal distribution (mean 0, variance 1).",[4064,4065],{"_17":630,"_19":3943},{"_17":1206,"_19":3945,"_41":10},"NDArray of normally distributed random values",[4068],{"_3949":4069},"randn(2, 3)",[3654],{"_17":4072,"_31":4073,"_33":4074,"_19":4075,"_36":4076,"_45":4084,"_47":4085,"_3956":4093},"meshgrid","[X, Y] = meshgrid(x, y)\n[X, Y] = meshgrid(v)\n[X, Y] = meshgrid(x, y, 'ij')","Create 2D coordinate matrices","Returns coordinate matrices from coordinate vectors. For vectors x and y, meshgrid returns 2D matrices X and Y where X has x values repeated across rows and Y has y values repeated down columns (MATLAB 'xy' indexing). With a single argument v, uses v for both x and y. An optional 'ij' argument switches to NumPy-style matrix indexing where X varies along the first dimension.",[4077,4079,4081],{"_17":405,"_19":4078},"X-coordinate vector",{"_17":2467,"_19":4080,"_41":10},"Y-coordinate vector (defaults to x if omitted)",{"_17":4082,"_19":4083,"_41":10},"indexing","Indexing mode: 'xy' (default, MATLAB style) or 'ij' (NumPy matrix style)","Two NDArrays [X, Y] of coordinate matrices",[4086,4088,4090],{"_3949":4087},"[X, Y] = meshgrid(1:3, 1:2)",{"_3949":4089},"[X, Y] = meshgrid(-2:0.5:2)",{"_3949":4091,"_3951":4092},"[X, Y] = meshgrid(1:3, 1:5, 'ij')","% X is 3x5, Y is 3x5 (NumPy style)",[4094,418,4009],"surf",{"_17":4096,"_31":4097,"_33":4098,"_19":4099,"_36":4100,"_45":4103,"_47":4104,"_3956":4114},"peaks","Z = peaks()\nZ = peaks(n)\n[X, Y, Z] = peaks(...)","Peaks function (test surface)","Generates a test surface with multiple peaks and valleys, commonly used for 3D visualization demos. The function is defined as: Z = 3*(1-X)^2*exp(-X^2-(Y+1)^2) - 10*(X/5-X^3-Y^5)*exp(-X^2-Y^2) - (1/3)*exp(-(X+1)^2-Y^2) evaluated over the range [-3, 3] for both X and Y.",[4101],{"_17":1206,"_19":4102,"_41":10},"Grid size (default: 49). Returns an n×n matrix.","n×n NDArray of Z values, or [X, Y, Z] coordinate matrices",[4105,4108,4111],{"_3949":4106,"_3951":4107},"surf(peaks())","% 49×49 surface plot",{"_3949":4109,"_3951":4110},"Z = peaks(30)","% 30×30 matrix",{"_3949":4112,"_3951":4113},"[X, Y, Z] = peaks(25)","% Returns all coordinate matrices",[4094,418,4072,4115],"gallery",{"_17":4115,"_31":4117,"_33":4118,"_19":4119,"_36":4120,"_45":4129,"_47":4130,"_3956":4146},"A = gallery(matname)\nA = gallery(matname, n)\nA = gallery(matname, n, ...)","Test matrices by name","Generates test matrices useful for testing numerical algorithms. The first argument is a string specifying the matrix type. Available types include: 'hilb' (Hilbert), 'invhilb' (inverse Hilbert), 'pascal', 'magic', 'lehmer', 'minij', 'moler', 'pei', 'kms', 'cauchy', 'circul', 'fiedler', 'tridiag', 'frank', 'grcar', 'hanowa', 'jordbloc', 'clement', 'triw', 'parter'.",[4121,4124,4126],{"_17":4122,"_19":4123},"matname","Name of the test matrix type (string)",{"_17":1206,"_19":4125,"_41":10},"Size or first parameter (depends on matrix type)",{"_17":4127,"_19":4128,"_41":10},"...","Additional parameters (depends on matrix type)","Test matrix of the specified type",[4131,4134,4137,4140,4143],{"_3949":4132,"_3951":4133},"gallery('hilb', 4)","4×4 Hilbert matrix",{"_3949":4135,"_3951":4136},"gallery('pascal', 5)","5×5 Pascal matrix",{"_3949":4138,"_3951":4139},"gallery('lehmer', 3)","1.0000 0.5000 0.3333\n0.5000 1.0000 0.6667\n0.3333 0.6667 1.0000",{"_3949":4141,"_3951":4142},"gallery('pei', 3, 2)","3×3 Pei matrix with alpha=2",{"_3949":4144,"_3951":4145},"gallery('kms', 4, 0.5)","4×4 KMS Toeplitz matrix with rho=0.5",[4007,4147,4006,3986,4148,4149],"invhilb","toeplitz","hankel",{"_17":4151,"_31":4152,"_33":4153,"_19":4154,"_36":4155,"_45":4159,"_47":4160,"_3956":4164},"sin","Y = sin(X)","Sine of argument in radians","Computes the sine of each element. Operates element-wise on arrays.",[4156],{"_17":4157,"_19":4158},"X","Input angle in radians (scalar or NDArray)","Sine values (same shape as input)",[4161],{"_3949":4162,"_3951":4163},"sin(pi/2)","1",[4165,4166,4167],"cos","tan","asin",{"_17":4165,"_31":4169,"_33":4170,"_19":4171,"_36":4172,"_45":4174,"_47":4175,"_3956":4178},"Y = cos(X)","Cosine of argument in radians","Computes the cosine of each element. Operates element-wise on arrays.",[4173],{"_17":4157,"_19":4158},"Cosine values (same shape as input)",[4176],{"_3949":4177,"_3951":4163},"cos(0)",[4151,4166,4179],"acos",{"_17":4166,"_31":4181,"_33":4182,"_19":4183,"_36":4184,"_45":4186,"_47":4187,"_3956":4190},"Y = tan(X)","Tangent of argument in radians","Computes the tangent of each element. Operates element-wise on arrays.",[4185],{"_17":4157,"_19":4158},"Tangent values (same shape as input)",[4188],{"_3949":4189,"_3951":4163},"tan(pi/4)",[4151,4165,4191],"atan",{"_17":4167,"_31":4193,"_33":4194,"_19":4195,"_36":4196,"_45":4199,"_47":4200,"_3956":4204},"Y = asin(X)","Inverse sine (arcsine)","Computes the inverse sine of each element. Result is in radians in the range [-pi/2, pi/2].",[4197],{"_17":4157,"_19":4198},"Input values in [-1, 1] (scalar or NDArray)","Angle in radians",[4201],{"_3949":4202,"_3951":4203},"asin(1)","1.5708",[4151,4179,4191],{"_17":4179,"_31":4206,"_33":4207,"_19":4208,"_36":4209,"_45":4199,"_47":4211,"_3956":4214},"Y = acos(X)","Inverse cosine (arccosine)","Computes the inverse cosine of each element. Result is in radians in the range [0, pi].",[4210],{"_17":4157,"_19":4198},[4212],{"_3949":4213,"_3951":4203},"acos(0)",[4165,4167,4191],{"_17":4191,"_31":4216,"_33":4217,"_19":4218,"_36":4219,"_45":4199,"_47":4222,"_3956":4226},"Y = atan(X)","Inverse tangent (arctangent)","Computes the inverse tangent of each element. Result is in radians in the range (-pi/2, pi/2).",[4220],{"_17":4157,"_19":4221},"Input value (scalar or NDArray)",[4223],{"_3949":4224,"_3951":4225},"atan(1)","0.7854",[4166,4227,4167],"atan2",{"_17":4227,"_31":4229,"_33":4230,"_19":4231,"_36":4232,"_45":4237,"_47":4238,"_3956":4241},"Y = atan2(B, A)","Four-quadrant inverse tangent","Computes the four-quadrant inverse tangent of B/A, using the signs of both arguments to determine the quadrant.",[4233,4235],{"_17":1166,"_19":4234},"Y-coordinates (scalar or NDArray)",{"_17":1163,"_19":4236},"X-coordinates (scalar or NDArray)","Angle in radians in (-pi, pi]",[4239],{"_3949":4240,"_3951":4225},"atan2(1, 1)",[4191,4151,4165],{"_17":4243,"_31":4244,"_33":4245,"_19":4246,"_36":4247,"_45":4249,"_47":4250,"_3956":4254},"sinh","Y = sinh(X)","Hyperbolic sine","Computes the hyperbolic sine of each element.",[4248],{"_17":4157,"_19":4221},"Hyperbolic sine values",[4251],{"_3949":4252,"_3951":4253},"sinh(0)","0",[4255,4256,4151],"cosh","tanh",{"_17":4255,"_31":4258,"_33":4259,"_19":4260,"_36":4261,"_45":4263,"_47":4264,"_3956":4267},"Y = cosh(X)","Hyperbolic cosine","Computes the hyperbolic cosine of each element.",[4262],{"_17":4157,"_19":4221},"Hyperbolic cosine values",[4265],{"_3949":4266,"_3951":4163},"cosh(0)",[4243,4256,4165],{"_17":4256,"_31":4269,"_33":4270,"_19":4271,"_36":4272,"_45":4274,"_47":4275,"_3956":4278},"Y = tanh(X)","Hyperbolic tangent","Computes the hyperbolic tangent of each element.",[4273],{"_17":4157,"_19":4221},"Hyperbolic tangent values",[4276],{"_3949":4277,"_3951":4253},"tanh(0)",[4243,4255,4166],{"_17":4280,"_31":4281,"_33":4282,"_19":4283,"_36":4284,"_45":4287,"_47":4288,"_3956":4294},"exp","Y = exp(X)","Exponential (e^x)","Computes e raised to the power of each element.",[4285],{"_17":4157,"_19":4286},"Exponent values (scalar or NDArray)","Exponential values",[4289,4291],{"_3949":4290,"_3951":4163},"exp(0)",{"_3949":4292,"_3951":4293},"exp(1)","2.7183",[4295,4296],"log","log10",{"_17":4295,"_31":4298,"_33":4299,"_19":4300,"_36":4301,"_45":4304,"_47":4305,"_3956":4308},"Y = log(X)","Natural logarithm","Computes the natural logarithm (base e) of each element.",[4302],{"_17":4157,"_19":4303},"Input values > 0 (scalar or NDArray)","Natural log values",[4306],{"_3949":4307,"_3951":4163},"log(exp(1))",[4280,4296,4309],"log2",{"_17":4296,"_31":4311,"_33":4312,"_19":4313,"_36":4314,"_45":4316,"_47":4317,"_3956":4321},"Y = log10(X)","Common logarithm (base 10)","Computes the base-10 logarithm of each element.",[4315],{"_17":4157,"_19":4303},"Base-10 log values",[4318],{"_3949":4319,"_3951":4320},"log10(100)","2",[4295,4309,4280],{"_17":4309,"_31":4323,"_33":4324,"_19":4325,"_36":4326,"_45":4328,"_47":4329,"_3956":4333},"Y = log2(X)","Base-2 logarithm","Computes the base-2 logarithm of each element.",[4327],{"_17":4157,"_19":4303},"Base-2 log values",[4330],{"_3949":4331,"_3951":4332},"log2(8)","3",[4295,4296,4280],{"_17":4335,"_31":4336,"_33":4337,"_19":4338,"_36":4339,"_45":4342,"_47":4343,"_3956":4346},"sqrt","Y = sqrt(X)","Square root","Computes the square root of each element.",[4340],{"_17":4157,"_19":4341},"Input values >= 0 (scalar or NDArray)","Square root values",[4344],{"_3949":4345,"_3951":4332},"sqrt(9)",[4347,4280],"abs",{"_17":4347,"_31":4349,"_33":4350,"_19":4351,"_36":4352,"_45":4354,"_47":4355,"_3956":4359},"Y = abs(X)","Absolute value","Computes the absolute value of each element.",[4353],{"_17":4157,"_19":4221},"Absolute values",[4356],{"_3949":4357,"_3951":4358},"abs(-5)","5",[4335,4360,4361],"floor","ceil",{"_17":4360,"_31":4363,"_33":4364,"_19":4365,"_36":4366,"_45":4368,"_47":4369,"_3956":4372},"Y = floor(X)","Round toward negative infinity","Rounds each element to the nearest integer toward negative infinity.",[4367],{"_17":4157,"_19":4221},"Rounded values",[4370],{"_3949":4371,"_3951":4332},"floor(3.7)",[4361,4373,4347],"round",{"_17":4361,"_31":4375,"_33":4376,"_19":4377,"_36":4378,"_45":4368,"_47":4380,"_3956":4384},"Y = ceil(X)","Round toward positive infinity","Rounds each element to the nearest integer toward positive infinity.",[4379],{"_17":4157,"_19":4221},[4381],{"_3949":4382,"_3951":4383},"ceil(3.2)","4",[4360,4373,4347],{"_17":4373,"_31":4386,"_33":4387,"_19":4388,"_36":4389,"_45":4368,"_47":4391,"_3956":4394},"Y = round(X)","Round to nearest integer","Rounds each element to the nearest integer.",[4390],{"_17":4157,"_19":4221},[4392],{"_3949":4393,"_3951":4383},"round(3.5)",[4360,4361],{"_17":4396,"_31":4397,"_33":4398,"_19":4399,"_36":4400,"_45":4405,"_47":4406,"_3956":4413},"sum","S = sum(A)\nS = sum(A, dim)","Sum of array elements","Returns the sum of the elements. With a dimension argument, sums along that dimension (1-indexed).",[4401,4403],{"_17":1163,"_19":4402},"Input array (scalar or NDArray)",{"_17":609,"_19":4404,"_41":10},"Dimension to sum along (1-indexed)","Sum value (scalar or NDArray)",[4407,4410],{"_3949":4408,"_3951":4409},"sum([1 2 3])","6",{"_3949":4411,"_3951":4412},"A = [1 2; 3 4]; sum(A, 1)","4 6",[4414,4415,2042],"mean","min",{"_17":4414,"_31":4417,"_33":4418,"_19":4419,"_36":4420,"_45":4424,"_47":4425,"_3956":4429},"M = mean(A)\nM = mean(A, dim)","Average of array elements","Returns the arithmetic mean. With a dimension argument, computes the mean along that dimension.",[4421,4422],{"_17":1163,"_19":4402},{"_17":609,"_19":4423,"_41":10},"Dimension to average along (1-indexed)","Mean value (scalar or NDArray)",[4426],{"_3949":4427,"_3951":4428},"mean([1 2 3 4])","2.5",[4396,4430,4431],"std","var",{"_17":4430,"_31":4433,"_33":4434,"_19":4435,"_36":4436,"_45":4440,"_47":4441,"_3956":4444},"S = std(A)\nS = std(A, dim)","Standard deviation","Returns the standard deviation of the elements. With a dimension argument, computes along that dimension.",[4437,4438],{"_17":1163,"_19":4402},{"_17":609,"_19":4439,"_41":10},"Dimension (1-indexed)","Standard deviation (scalar or NDArray)",[4442],{"_3949":4443,"_3951":4320},"std([2 4 4 4 5 5 7 9])",[4431,4414],{"_17":4431,"_31":4446,"_33":4447,"_19":4448,"_36":4449,"_45":4452,"_47":4453,"_3956":4456},"V = var(A)\nV = var(A, dim)","Variance","Returns the variance of the elements. With a dimension argument, computes along that dimension.",[4450,4451],{"_17":1163,"_19":4402},{"_17":609,"_19":4439,"_41":10},"Variance (scalar or NDArray)",[4454],{"_3949":4455,"_3951":4383},"var([2 4 4 4 5 5 7 9])",[4430,4414],{"_17":4415,"_31":4458,"_33":4459,"_19":4460,"_36":4461,"_45":4464,"_47":4465,"_3956":4468},"M = min(A)\nM = min(A, dim)","Minimum value","Returns the smallest element. With a dimension argument, returns the minimum along that dimension.",[4462,4463],{"_17":1163,"_19":4402},{"_17":609,"_19":4439,"_41":10},"Minimum value (scalar or NDArray)",[4466],{"_3949":4467,"_3951":4163},"min([3 1 4 1 5])",[2042,4396],{"_17":2042,"_31":4470,"_33":4471,"_19":4472,"_36":4473,"_45":4476,"_47":4477,"_3956":4480},"M = max(A)\nM = max(A, dim)","Maximum value","Returns the largest element. With a dimension argument, returns the maximum along that dimension.",[4474,4475],{"_17":1163,"_19":4402},{"_17":609,"_19":4439,"_41":10},"Maximum value (scalar or NDArray)",[4478],{"_3949":4479,"_3951":4358},"max([3 1 4 1 5])",[4415,4396],{"_17":4482,"_31":4483,"_33":4484,"_19":4485,"_36":4486,"_45":4490,"_47":4491,"_3956":4499},"any","B = any(A)\nB = any(A, dim)","Test if any elements are nonzero","Returns 1 if any element of A is nonzero, 0 otherwise. With a dimension argument, operates along that dimension.",[4487,4488],{"_17":1163,"_19":4402},{"_17":609,"_19":4489,"_41":10},"Dimension to operate along (1-indexed)","1 if any element is nonzero, 0 otherwise",[4492,4494,4496],{"_3949":4493,"_3951":4163},"any([0 0 1 0])",{"_3949":4495,"_3951":4253},"any([0 0 0])",{"_3949":4497,"_3951":4498},"A = [1 0; 0 0]; any(A, 1)","1 0",[4500,4501],"all","find",{"_17":4500,"_31":4503,"_33":4504,"_19":4505,"_36":4506,"_45":4509,"_47":4510,"_3956":4517},"B = all(A)\nB = all(A, dim)","Test if all elements are nonzero","Returns 1 if all elements of A are nonzero, 0 otherwise. With a dimension argument, operates along that dimension.",[4507,4508],{"_17":1163,"_19":4402},{"_17":609,"_19":4489,"_41":10},"1 if all elements are nonzero, 0 otherwise",[4511,4513,4515],{"_3949":4512,"_3951":4163},"all([1 2 3])",{"_3949":4514,"_3951":4253},"all([1 0 3])",{"_3949":4516,"_3951":4498},"A = [1 1; 1 0]; all(A, 1)",[4482,4501],{"_17":4501,"_31":4519,"_33":4520,"_19":4521,"_36":4522,"_45":4529,"_47":4530,"_3956":4543},"k = find(X)\nk = find(X, n)\nk = find(X, n, direction)","Find indices of nonzero elements","Returns the linear indices of nonzero elements in X. Optionally returns only the first or last n indices.",[4523,4525,4527],{"_17":4157,"_19":4524},"Input array",{"_17":1206,"_19":4526,"_41":10},"Number of indices to return",{"_17":847,"_19":4528,"_41":10},"'first' (default) or 'last' - which indices to return","Vector of indices (1-based)",[4531,4534,4537,4540],{"_3949":4532,"_3951":4533},"find([1 0 3 0 5])","1 3 5",{"_3949":4535,"_3951":4536},"find([1 0 3 0 5], 2)","1 3",{"_3949":4538,"_3951":4539},"find([1 0 3 0 5], 2, 'last')","3 5",{"_3949":4541,"_3951":4542},"A = [1 2 3 4 5]; find(A > 3)","4 5",[4482,4500],{"_17":1865,"_31":4545,"_33":4546,"_19":4547,"_36":4548,"_45":4552,"_47":4553,"_3956":4559},"s = size(A)\ns = size(A, dim)","Array dimensions","Returns the size of an array. With a dimension argument, returns the length of that dimension.",[4549,4550],{"_17":1163,"_19":4524},{"_17":609,"_19":4551,"_41":10},"Dimension to query (1-indexed)","Size as NDArray or scalar",[4554,4557],{"_3949":4555,"_3951":4556},"A = zeros(3, 4); size(A)","3 4",{"_3949":4558,"_3951":4383},"size(A, 2)",[2841,4560,4561],"numel","ndims",{"_17":2841,"_31":4563,"_33":4564,"_19":4565,"_36":4566,"_45":4568,"_47":4569,"_3956":4572},"n = length(A)","Length of largest array dimension","Returns the length of the largest dimension of the array.",[4567],{"_17":1163,"_19":4524},"Scalar length",[4570],{"_3949":4571,"_3951":4358},"length([1 2 3 4 5])",[1865,4560],{"_17":4560,"_31":4574,"_33":4575,"_19":4576,"_36":4577,"_45":4579,"_47":4580,"_3956":4584},"n = numel(A)","Number of array elements","Returns the total number of elements in the array.",[4578],{"_17":1163,"_19":4524},"Scalar count",[4581],{"_3949":4582,"_3951":4583},"A = zeros(3, 4); numel(A)","12",[1865,2841],{"_17":4561,"_31":4586,"_33":4587,"_19":4588,"_36":4589,"_45":4591,"_47":4592,"_3956":4595},"n = ndims(A)","Number of array dimensions","Returns the number of dimensions of the array.",[4590],{"_17":1163,"_19":4524},"Scalar dimension count",[4593],{"_3949":4594,"_3951":4320},"A = zeros(3, 4); ndims(A)",[1865,2841],{"_17":4597,"_31":4598,"_33":4599,"_19":4600,"_36":4601,"_45":4605,"_47":4606,"_3956":4610},"reshape","B = reshape(A, m, n)","Reshape array","Reshapes array A into an m-by-n matrix. The number of elements must not change.",[4602,4603,4604],{"_17":1163,"_19":4524},{"_17":630,"_19":3943},{"_17":1206,"_19":3945},"Reshaped NDArray",[4607],{"_3949":4608,"_3951":4609},"reshape([1 2 3 4 5 6], 2, 3)","1 3 5\n2 4 6",[1865,4611],"transpose",{"_17":4611,"_31":4613,"_33":4614,"_19":4615,"_36":4616,"_45":4619,"_47":4620,"_3956":4624},"B = transpose(A)\nB = A'","Transpose matrix","Transposes a matrix (swaps rows and columns).",[4617],{"_17":1163,"_19":4618},"Input matrix","Transposed NDArray",[4621],{"_3949":4622,"_3951":4623},"A = [1 2; 3 4]; A'","1 3\n2 4",[4597,4625],"flip",{"_17":3985,"_31":4627,"_33":4628,"_19":4629,"_36":4630,"_45":4634,"_47":4635,"_3956":4639},"D = diag(v)\nd = diag(A)","Create diagonal matrix or extract diagonal","If the input is a vector, creates a diagonal matrix. If the input is a matrix, extracts the diagonal.",[4631],{"_17":4632,"_19":4633},"v/A","Input vector or matrix","Diagonal matrix or diagonal vector",[4636],{"_3949":4637,"_3951":4638},"diag([1 2 3])","1 0 0\n0 2 0\n0 0 3",[3958,2526],{"_17":4625,"_31":4641,"_33":4642,"_19":4643,"_36":4644,"_45":4648,"_47":4649,"_3956":4653},"B = flip(A)\nB = flip(A, dim)","Flip order of elements","Reverses the order of elements along the specified dimension (default: first non-singleton dimension).",[4645,4646],{"_17":1163,"_19":4524},{"_17":609,"_19":4647,"_41":10},"Dimension to flip along","Flipped NDArray",[4650],{"_3949":4651,"_3951":4652},"flip([1 2 3])","3 2 1",[4654,4655,4656],"fliplr","flipud","rot90",{"_17":4654,"_31":4658,"_33":4659,"_19":4660,"_36":4661,"_45":4648,"_47":4663,"_3956":4667},"B = fliplr(A)","Flip array left to right","Flips a matrix left to right (reverses columns).",[4662],{"_17":1163,"_19":4618},[4664],{"_3949":4665,"_3951":4666},"fliplr([1 2 3; 4 5 6])","3 2 1\n6 5 4",[4655,4625,4656],{"_17":4655,"_31":4669,"_33":4670,"_19":4671,"_36":4672,"_45":4648,"_47":4674,"_3956":4678},"B = flipud(A)","Flip array up to down","Flips a matrix up to down (reverses rows).",[4673],{"_17":1163,"_19":4618},[4675],{"_3949":4676,"_3951":4677},"flipud([1 2; 3 4])","3 4\n1 2",[4654,4625,4656],{"_17":4656,"_31":4680,"_33":4681,"_19":4682,"_36":4683,"_45":4688,"_47":4689,"_3956":4693},"B = rot90(A)\nB = rot90(A, k)","Rotate array 90 degrees","Rotates the matrix 90 degrees counterclockwise. Optional argument k specifies the number of 90-degree rotations.",[4684,4685],{"_17":1163,"_19":4618},{"_17":4686,"_19":4687,"_41":10},"k","Number of 90° rotations (default: 1)","Rotated NDArray",[4690],{"_3949":4691,"_3951":4692},"rot90([1 2; 3 4])","2 4\n1 3",[4625,4611],{"_17":4695,"_31":4696,"_33":4697,"_19":4698,"_36":4699,"_45":4703,"_47":4704,"_3956":4708},"lower","s = lower(str)","Convert string to lowercase","Converts all uppercase characters in the string to lowercase.",[4700],{"_17":4701,"_19":4702},"str","Input string","Lowercase string",[4705],{"_3949":4706,"_3951":4707},"lower(\"Hello World\")","'hello world'",[4709],"upper",{"_17":4709,"_31":4711,"_33":4712,"_19":4713,"_36":4714,"_45":4716,"_47":4717,"_3956":4721},"s = upper(str)","Convert string to uppercase","Converts all lowercase characters in the string to uppercase.",[4715],{"_17":4701,"_19":4702},"Uppercase string",[4718],{"_3949":4719,"_3951":4720},"upper(\"Hello World\")","'HELLO WORLD'",[4695],{"_17":4723,"_31":4724,"_33":4725,"_19":4726,"_36":4727,"_45":4729,"_47":4730,"_3956":4733},"strlength","n = strlength(str)","Length of string","Returns the number of characters in the string.",[4728],{"_17":4701,"_19":4702},"Number of characters",[4731],{"_3949":4732,"_3951":4358},"strlength(\"hello\")",[2841],{"_17":4735,"_31":4736,"_33":4737,"_19":4738,"_36":4739,"_45":4745,"_47":4746,"_3956":4751},"strcmp","tf = strcmp(s1, s2)","Compare strings","Returns 1 if the strings are identical, 0 otherwise.",[4740,4742],{"_17":2239,"_19":4741},"First string",{"_17":4743,"_19":4744},"s2","Second string","1 if equal, 0 otherwise",[4747,4749],{"_3949":4748,"_3951":4163},"strcmp(\"abc\", \"abc\")",{"_3949":4750,"_3951":4253},"strcmp(\"abc\", \"def\")",[4752],"strcmpi",{"_17":4752,"_31":4754,"_33":4755,"_19":4756,"_36":4757,"_45":4760,"_47":4761,"_3956":4764},"tf = strcmpi(s1, s2)","Compare strings (case-insensitive)","Returns 1 if the strings are identical ignoring case, 0 otherwise.",[4758,4759],{"_17":2239,"_19":4741},{"_17":4743,"_19":4744},"1 if equal (ignoring case), 0 otherwise",[4762],{"_3949":4763,"_3951":4163},"strcmpi(\"Hello\", \"hello\")",[4735],{"_17":4766,"_31":4767,"_33":4768,"_19":4769,"_36":4770,"_45":4776,"_47":4777,"_3956":4781},"strfind","k = strfind(str, pattern)","Find pattern in string","Returns the starting index of each occurrence of pattern in str. Returns empty array if not found.",[4771,4773],{"_17":4701,"_19":4772},"String to search in",{"_17":4774,"_19":4775},"pattern","Pattern to find","Array of starting indices",[4778],{"_3949":4779,"_3951":4780},"strfind(\"abcabc\", \"bc\")","[2, 5]",[4782,4783,4784],"contains","startsWith","endsWith",{"_17":4786,"_31":4787,"_33":4788,"_19":4789,"_36":4790,"_45":4798,"_47":4799,"_3956":4803},"strrep","s = strrep(str, old, new)","Replace substring","Replaces all occurrences of old with new in str.",[4791,4792,4795],{"_17":4701,"_19":4702},{"_17":4793,"_19":4794},"old","Substring to replace",{"_17":4796,"_19":4797},"new","Replacement string","String with replacements made",[4800],{"_3949":4801,"_3951":4802},"strrep(\"hello world\", \"world\", \"there\")","'hello there'",[4766],{"_17":4805,"_31":4806,"_33":4807,"_19":4808,"_36":4809,"_45":4811,"_47":4812,"_3956":4816},"strip","s = strip(str)","Remove leading and trailing whitespace","Removes leading and trailing whitespace characters from the string.",[4810],{"_17":4701,"_19":4702},"Trimmed string",[4813],{"_3949":4814,"_3951":4815},"strip(\" hello \")","'hello'",[],{"_17":4783,"_31":4818,"_33":4819,"_19":4820,"_36":4821,"_45":4826,"_47":4827,"_3956":4830},"tf = startsWith(str, prefix)","Check if string starts with prefix","Returns 1 if str starts with prefix, 0 otherwise.",[4822,4823],{"_17":4701,"_19":4702},{"_17":4824,"_19":4825},"prefix","Prefix to check","1 if starts with prefix, 0 otherwise",[4828],{"_3949":4829,"_3951":4163},"startsWith(\"hello\", \"hel\")",[4784,4782],{"_17":4784,"_31":4832,"_33":4833,"_19":4834,"_36":4835,"_45":4840,"_47":4841,"_3956":4844},"tf = endsWith(str, suffix)","Check if string ends with suffix","Returns 1 if str ends with suffix, 0 otherwise.",[4836,4837],{"_17":4701,"_19":4702},{"_17":4838,"_19":4839},"suffix","Suffix to check","1 if ends with suffix, 0 otherwise",[4842],{"_3949":4843,"_3951":4163},"endsWith(\"hello\", \"lo\")",[4783,4782],{"_17":4782,"_31":4846,"_33":4847,"_19":4848,"_36":4849,"_45":4853,"_47":4854,"_3956":4857},"tf = contains(str, pattern)","Check if string contains pattern","Returns 1 if str contains pattern, 0 otherwise.",[4850,4851],{"_17":4701,"_19":4702},{"_17":4774,"_19":4852},"Pattern to search for","1 if contains pattern, 0 otherwise",[4855],{"_3949":4856,"_3951":4163},"contains(\"hello world\", \"wor\")",[4783,4784,4766],{"_17":4859,"_31":4860,"_33":4861,"_19":4862,"_36":4863,"_45":4870,"_47":4871,"_3956":4878},"sprintf","s = sprintf(format, A1, A2, ...)","Format data into string","Formats data according to format string. Supports %d (integer), %f (float), %s (string), %e (exponential).",[4864,4867],{"_17":4865,"_19":4866},"format","Format string with conversion specifiers",{"_17":4868,"_19":4869},"A1, A2, ...","Values to format","Formatted string",[4872,4875],{"_3949":4873,"_3951":4874},"sprintf(\"x = %d\", 42)","'x = 42'",{"_3949":4876,"_3951":4877},"sprintf(\"pi = %.4f\", pi)","'pi = 3.1416'",[4879],"disp",{"_17":4881,"_31":4882,"_33":4883,"_19":4884,"_36":4885,"_45":4888,"_47":4889,"_3956":4896},"char","c = char(n)","Convert to character","Converts numeric code to character, or ensures input is a character array.",[4886],{"_17":1206,"_19":4887},"Numeric ASCII/Unicode code or string","Character string",[4890,4893],{"_3949":4891,"_3951":4892},"char(65)","'A'",{"_3949":4894,"_3951":4895},"char([72 101 108 108 111])","'Hello'",[4897],"double",{"_17":4899,"_31":4900,"_33":4901,"_19":4902,"_36":4903,"_45":4909,"_47":4910,"_3956":4917},"num2str","s = num2str(A)\ns = num2str(A, precision)","Convert number to string","Converts numeric array to string representation.",[4904,4906],{"_17":1163,"_19":4905},"Numeric value or array",{"_17":4907,"_19":4908,"_41":10},"precision","Number of significant digits","String representation of number",[4911,4914],{"_3949":4912,"_3951":4913},"num2str(3.14159)","'3.1416'",{"_3949":4915,"_3951":4916},"num2str(pi, 10)","'3.141592654'",[4918,4859],"str2num",{"_17":4918,"_31":4920,"_33":4921,"_19":4922,"_36":4923,"_45":4926,"_47":4927,"_3956":4931},"n = str2num(str)","Convert string to number","Converts string representation of number to numeric value.",[4924],{"_17":4701,"_19":4925},"String containing numeric value","Numeric value",[4928],{"_3949":4929,"_3951":4930},"str2num(\"3.14\")","3.14",[4899],{"_17":4933,"_31":4934,"_33":4935,"_19":4936,"_36":4937,"_45":4941,"_47":4942,"_3956":4945},"strcat","s = strcat(s1, s2, ...)","Concatenate strings","Concatenates strings horizontally.",[4938],{"_17":4939,"_19":4940},"s1, s2, ...","Strings to concatenate","Concatenated string",[4943],{"_3949":4944,"_3951":4707},"strcat(\"hello\", \" \", \"world\")",[],{"_17":4947,"_31":4948,"_33":4949,"_19":4950,"_36":4951,"_45":4958,"_47":4959,"_3956":4963},"strjoin","s = strjoin(strs, delimiter)","Join strings with delimiter","Joins an array of strings with the specified delimiter.",[4952,4955],{"_17":4953,"_19":4954},"strs","Cell array or string array",{"_17":4956,"_19":4957,"_41":10},"delimiter","Delimiter string (default: space)","Joined string",[4960],{"_3949":4961,"_3951":4962},"strjoin([\"a\", \"b\", \"c\"], \"-\")","'a-b-c'",[4933],{"_17":4965,"_31":4966,"_33":4967,"_19":4968,"_36":4969,"_45":4973,"_47":4974,"_3956":4978},"strsplit","parts = strsplit(str, delimiter)","Split string at delimiter","Splits a string at each occurrence of delimiter.",[4970,4971],{"_17":4701,"_19":4702},{"_17":4956,"_19":4972,"_41":10},"Delimiter string (default: whitespace)","Array of substrings",[4975],{"_3949":4976,"_3951":4977},"strsplit(\"a-b-c\", \"-\")","['a', 'b', 'c']",[4947],{"_17":4879,"_31":4980,"_33":4981,"_19":4982,"_36":4983,"_45":4986,"_47":4987,"_3956":4991},"disp(X)","Display value","Displays the value of a variable or expression without the variable name.",[4984],{"_17":4157,"_19":4985},"Value to display","The input value (also displayed as output)",[4988],{"_3949":4989,"_3951":4990},"disp('hello')","hello",[],{"_17":4993,"_31":4993,"_33":4994,"_19":4995,"_36":4996,"_45":46,"_47":4997,"_3956":5001},"tic","Start stopwatch timer","Starts a stopwatch timer to measure elapsed time. Use with toc to measure execution time of code blocks. Multiple tic calls reset the timer.",[],[4998],{"_3949":4999,"_3951":5000},"tic\nA = rand(100);\ntoc","Elapsed time is 0.012345 seconds.",[5002],"toc",{"_17":5002,"_31":5004,"_33":5005,"_19":5006,"_36":5007,"_45":5008,"_47":5009,"_3956":5013},"t = toc","Read elapsed time from stopwatch","Reads the elapsed time in seconds since the most recent tic call. Prints the elapsed time and returns it as a number. Throws an error if called without a preceding tic.",[],"Elapsed time in seconds (scalar)",[5010],{"_3949":5011,"_3951":5012},"tic\nfor i = 1:100\n rand(10);\nend\nt = toc","Elapsed time is 0.005123 seconds.\nt = 0.005123",[4993],{"_17":5015,"_31":5016,"_33":5017,"_19":5018,"_36":5019,"_45":5023,"_47":5024,"_3956":5031},"eval","eval(expression)\n[output1,...,outputN] = eval(expression)","Evaluate M-Code expression","Evaluates the M-Code contained in the string expression. Variables created or modified in the evaluated code affect the current workspace.",[5020],{"_17":5021,"_19":5022},"expression","String containing M-Code to evaluate","Result of the evaluated expression",[5025,5028],{"_3949":5026,"_3951":5027},"eval('x = 5')","x = 5",{"_3949":5029,"_3951":5030},"Z = eval('magic(3)')","Z = [8 1 6; 3 5 7; 4 9 2]",[],{"_15":5033,"_17":5034,"_19":5035,"_21":22,"_23":5036,"_27":5037},"linalg","Linear Algebra","Matrix decompositions, solvers, products, norms, and other linear algebra operations.","📐",[5038,5056,5072,5083,5099,5114,5129,5141,5155,5169,5180,5194,5205,5224,5235,5253,5267,5279,5296,5312,5327,5341,5357,5374],{"_17":5039,"_31":5040,"_33":5041,"_19":5042,"_36":5043,"_45":5046,"_47":5047,"_3956":5053},"eig","D = eig(A)\n[V,D] = eig(A)","Eigenvalues and eigenvectors","With one output, returns a vector of eigenvalues. With two outputs, V contains eigenvectors as columns and D is a diagonal matrix of eigenvalues.",[5044],{"_17":1163,"_19":5045},"Square matrix (n×n)","Eigenvalue vector, or [V, D] decomposition",[5048,5051],{"_3949":5049,"_3951":5050},"eig([2 1; 1 2])","3\n1",{"_3949":5052},"[V,D] = eig([2 1; 1 2])",[2505,5054,5055],"det","inv",{"_17":5057,"_31":5058,"_33":5059,"_19":5060,"_36":5061,"_45":5046,"_47":5064,"_3956":5070},"eigh","D = eigh(A)\n[V, D] = eigh(A)","Eigenvalues and eigenvectors of symmetric matrix","Computes eigenvalues and eigenvectors of a symmetric or Hermitian matrix. Eigenvalues are always real and returned in ascending order. More efficient than eig() for symmetric matrices.",[5062],{"_17":1163,"_19":5063},"Symmetric/Hermitian matrix (n×n)",[5065,5068],{"_3949":5066,"_3951":5067},"A = [2 1; 1 2];\nD = eigh(A)","1\n3",{"_3949":5069},"[V, D] = eigh([2 1; 1 2])",[5039,5071,2505],"eigvalsh",{"_17":5071,"_31":5073,"_33":5074,"_19":5075,"_36":5076,"_45":5078,"_47":5079,"_3956":5082},"D = eigvalsh(A)","Eigenvalues of symmetric matrix","Computes only the eigenvalues of a symmetric or Hermitian matrix. More efficient than eigh() when eigenvectors are not needed. Eigenvalues are returned in ascending order.",[5077],{"_17":1163,"_19":5063},"Vector of eigenvalues in ascending order",[5080],{"_3949":5081,"_3951":5067},"eigvalsh([2 1; 1 2])",[5057,5039],{"_17":2505,"_31":5084,"_33":5085,"_19":5086,"_36":5087,"_45":5090,"_47":5091,"_3956":5097},"S = svd(A)\n[U,S,V] = svd(A)","Singular value decomposition","With one output, returns singular values as a vector. With three outputs, returns the full U*S*V' decomposition where S is a diagonal matrix.",[5088],{"_17":1163,"_19":5089},"Input matrix (m×n)","Singular value vector, or [U, S, V] decomposition",[5092,5095],{"_3949":5093,"_3951":5094},"svd([1 0; 0 2])","2\n1",{"_3949":5096},"[U,S,V] = svd([1 0; 0 2])",[5039,5098,3633],"rank",{"_17":5100,"_31":5101,"_33":5102,"_19":5103,"_36":5104,"_45":5106,"_47":5107,"_3956":5112},"qr","R = qr(A)\n[Q,R] = qr(A)","QR decomposition","With one output, returns the upper-triangular R factor. With two outputs, returns Q (orthonormal) and R (upper-triangular).",[5105],{"_17":1163,"_19":5089},"R matrix, or [Q, R] decomposition",[5108,5110],{"_3949":5109,"_3951":3983},"qr(eye(3))",{"_3949":5111},"[Q,R] = qr([1 2; 3 4])",[2505,5113,5039],"chol",{"_17":5115,"_31":5116,"_33":5117,"_19":5118,"_36":5119,"_45":5121,"_47":5122,"_3956":5127},"lu","L = lu(A)\n[L,U,P] = lu(A)","LU decomposition with partial pivoting","Factorizes matrix A into lower triangular L (unit diagonal), upper triangular U, and permutation matrix P such that P*A = L*U. With one output, returns the lower triangular factor only.",[5120],{"_17":1163,"_19":5089},"Lower triangular factor L, or [L, U, P] decomposition",[5123,5125],{"_3949":5124},"[L,U,P] = lu([2 1; 4 3])",{"_3949":5126},"L = lu([1 2; 3 4])",[5100,2505,5113,5128],"linsolve",{"_17":5113,"_31":5130,"_33":5131,"_19":5132,"_36":5133,"_45":5136,"_47":5137,"_3956":5140},"R = chol(A)","Cholesky factorization","Computes the upper-triangular Cholesky factor R such that R'*R = A. The input must be a symmetric positive-definite matrix.",[5134],{"_17":1163,"_19":5135},"Symmetric positive-definite matrix (n×n)","Upper-triangular Cholesky factor R",[5138],{"_3949":5139},"chol([4 2; 2 3])",[5100,2505,5055],{"_17":5054,"_31":5142,"_33":5143,"_19":5144,"_36":5145,"_45":5147,"_47":5148,"_3956":5154},"d = det(A)","Matrix determinant","Computes the determinant of a square matrix.",[5146],{"_17":1163,"_19":5045},"Scalar determinant value",[5149,5152],{"_3949":5150,"_3951":5151},"det([1 2; 3 4])","-2",{"_3949":5153,"_3951":4163},"det(eye(3))",[5055,5098,2512],{"_17":5055,"_31":5156,"_33":5157,"_19":5158,"_36":5159,"_45":5162,"_47":5163,"_3956":5167},"B = inv(A)","Matrix inverse","Computes the multiplicative inverse of a square matrix so that A*B = eye(n). The matrix must be non-singular.",[5160],{"_17":1163,"_19":5161},"Non-singular square matrix (n×n)","Inverse matrix (n×n)",[5164],{"_3949":5165,"_3951":5166},"inv([1 2; 3 4])","-2.0000 1.0000\n1.5000 -0.5000",[5054,5168,5128],"pinv",{"_17":5168,"_31":5170,"_33":5171,"_19":5172,"_36":5173,"_45":5175,"_47":5176,"_3956":5179},"B = pinv(A)","Moore-Penrose pseudo-inverse","Computes the pseudo-inverse of a matrix. Works for non-square and singular matrices.",[5174],{"_17":1163,"_19":5089},"Pseudo-inverse matrix (n×m)",[5177],{"_3949":5178},"pinv([1 0; 0 0])",[5055,5128,5098],{"_17":5098,"_31":5181,"_33":5182,"_19":5183,"_36":5184,"_45":5186,"_47":5187,"_3956":5192},"r = rank(A)","Matrix rank","Estimates the rank of a matrix using singular value decomposition. The rank is the number of singular values above a tolerance threshold.",[5185],{"_17":1163,"_19":4618},"Scalar rank",[5188,5190],{"_3949":5189,"_3951":4332},"rank(eye(3))",{"_3949":5191,"_3951":4163},"rank([1 2; 2 4])",[2505,5054,5193],"cond",{"_17":2512,"_31":5195,"_33":5196,"_19":5197,"_36":5198,"_45":5200,"_47":5201,"_3956":5204},"t = trace(A)","Sum of diagonal elements","Returns the sum of the elements on the main diagonal of a matrix.",[5199],{"_17":1163,"_19":4618},"Scalar trace value",[5202],{"_3949":5203,"_3951":4383},"trace(eye(4))",[3985,5054,5039],{"_17":3633,"_31":5206,"_33":5207,"_19":5208,"_36":5209,"_45":5214,"_47":5215,"_3956":5223},"n = norm(A)\nn = norm(A, p)\nn = norm(A, 'fro')","Matrix or vector norm","Computes the norm of a vector or matrix. For vectors, the default is the 2-norm (Euclidean). For matrices, the default is the Frobenius norm. An optional second argument specifies the norm order (1, 2, etc.) or type ('fro' for Frobenius, 'nuc' for nuclear).",[5210,5211],{"_17":1163,"_19":4633},{"_17":5212,"_19":5213,"_41":10},"p","Norm order or type: number (1, 2, Inf), or string ('fro', 'nuc')","Scalar norm value",[5216,5218,5221],{"_3949":5217,"_3951":4358},"norm([3 4])",{"_3949":5219,"_3951":5220},"norm([3 4], 1)","7",{"_3949":5222},"norm([1 2; 3 4], 'fro')",[5193,5098,5054],{"_17":5193,"_31":5225,"_33":5226,"_19":5227,"_36":5228,"_45":5230,"_47":5231,"_3956":5234},"c = cond(A)","Condition number","Computes the condition number of a matrix using the ratio of the largest to smallest singular value. A large condition number indicates a nearly singular matrix.",[5229],{"_17":1163,"_19":4618},"Scalar condition number",[5232],{"_3949":5233,"_3951":4163},"cond(eye(3))",[3633,5098,5054],{"_17":5236,"_31":5237,"_33":5238,"_19":5239,"_36":5240,"_45":5245,"_47":5246,"_3956":5251},"lstsq","x = lstsq(A, b)\n[x, residuals, rank, s] = lstsq(A, b)","Least-squares solution to linear equation","Computes the least-squares solution to the equation A*x = b. Returns the solution that minimizes ||A*x - b||. With one output, returns the solution vector x. With four outputs, also returns residuals, rank, and singular values.",[5241,5243],{"_17":1163,"_19":5242},"Coefficient matrix (m×n)",{"_17":408,"_19":5244},"Ordinate values (m×1) or (m×k)","Solution vector x, or [x, residuals, rank, s]",[5247,5249],{"_3949":5248},"A = [1 0; 1 1; 1 2]; b = [1; 2; 3];\nx = lstsq(A, b)",{"_3949":5250},"[x, res, rnk, s] = lstsq(A, b)",[5252,5168,5100],"mldivide",{"_17":5128,"_31":5254,"_33":5255,"_19":5256,"_36":5257,"_45":5262,"_47":5263,"_3956":5266},"x = linsolve(A, b)","Solve linear system Ax = b","Solves the linear system A*x = b for x, where A is a square matrix and b is a column vector or matrix.",[5258,5260],{"_17":1163,"_19":5259},"Coefficient matrix (n×n)",{"_17":408,"_19":5261},"Right-hand side vector or matrix","Solution vector or matrix x",[5264],{"_3949":5265},"A = [1 2; 3 4]; b = [5; 6]; linsolve(A, b)",[5252,5055,5054],{"_17":5252,"_31":5268,"_33":5269,"_19":5270,"_36":5271,"_45":5262,"_47":5275,"_3956":5278},"x = mldivide(A, b)","Matrix left division (A\\b)","Solves the linear system A*x = b. Equivalent to the backslash operator `A\\b`. For square A, this uses direct solving. Prefer this over `inv(A)*b` for numerical stability.",[5272,5274],{"_17":1163,"_19":5273},"Coefficient matrix",{"_17":408,"_19":5261},[5276],{"_3949":5277},"A = [1 2; 3 4]; b = [5; 6]; mldivide(A, b)",[5128,5055],{"_17":5280,"_31":5281,"_33":5282,"_19":5283,"_36":5284,"_45":5289,"_47":5290,"_3956":5293},"matmul","C = matmul(A, B)","Matrix multiplication","Matrix multiplication of two arrays. For 2-D arrays, performs standard matrix multiplication. For N-D arrays, broadcasts over batch dimensions and multiplies the last two dimensions.",[5285,5287],{"_17":1163,"_19":5286},"First array (..., M, K)",{"_17":1166,"_19":5288},"Second array (..., K, N)","Matrix product (..., M, N)",[5291],{"_3949":5292},"matmul([1 2; 3 4], [5 6; 7 8])",[3587,5294,5295],"kron","mpower",{"_17":3587,"_31":5297,"_33":5298,"_19":5299,"_36":5300,"_45":5305,"_47":5306,"_3956":5310},"c = dot(a, b)","Dot product","Computes the dot product of two arrays. For 1-D arrays, returns the inner product. For 2-D arrays, performs matrix multiplication.",[5301,5303],{"_17":664,"_19":5302},"First input array",{"_17":408,"_19":5304},"Second input array","Dot product result",[5307],{"_3949":5308,"_3951":5309},"dot([1 2 3], [4 5 6])","32",[5311,5294],"cross",{"_17":5311,"_31":5313,"_33":5314,"_19":5315,"_36":5316,"_45":5321,"_47":5322,"_3956":5326},"c = cross(a, b)","Cross product","Computes the cross product of two 3-element vectors.",[5317,5319],{"_17":664,"_19":5318},"First 3-element vector",{"_17":408,"_19":5320},"Second 3-element vector","3-element cross product vector",[5323],{"_3949":5324,"_3951":5325},"cross([1 0 0], [0 1 0])","0 0 1",[3587,5294],{"_17":5294,"_31":5328,"_33":5329,"_19":5330,"_36":5331,"_45":5336,"_47":5337,"_3956":5340},"K = kron(A, B)","Kronecker tensor product","Computes the Kronecker product of two matrices. Each element of A is multiplied by the entire matrix B.",[5332,5334],{"_17":1163,"_19":5333},"First input matrix",{"_17":1166,"_19":5335},"Second input matrix","Kronecker product matrix",[5338],{"_3949":5339},"kron([1 0; 0 1], [1 2; 3 4])",[3587,5311],{"_17":5342,"_31":5343,"_33":5344,"_19":5345,"_36":5346,"_45":5351,"_47":5352,"_3956":5356},"outer","C = outer(a, b)","Outer product","Computes the outer product of two vectors, resulting in a matrix where C(i,j) = a(i)*b(j).",[5347,5349],{"_17":664,"_19":5348},"First vector (m-element)",{"_17":408,"_19":5350},"Second vector (n-element)","Outer product matrix (m x n)",[5353],{"_3949":5354,"_3951":5355},"outer([1 2 3], [4 5])","4 5\n8 10\n12 15",[3587,5311,5294],{"_17":5358,"_31":5359,"_33":5360,"_19":5361,"_36":5362,"_45":5369,"_47":5370,"_3956":5373},"einsum","C = einsum(subscripts, A, B, ...)","Einstein summation convention","Evaluates the Einstein summation convention on the operands. The subscripts string specifies index contractions (e.g., \"ij,jk->ik\" for matrix multiplication).",[5363,5366],{"_17":5364,"_19":5365},"subscripts","Subscript string (e.g., \"ij,jk->ik\")",{"_17":5367,"_19":5368},"A,B,...","Input arrays","Result array according to subscripts",[5371],{"_3949":5372},"einsum('ij,jk->ik', A, B)",[3587,5280],{"_17":5295,"_31":5375,"_33":5376,"_19":5377,"_36":5378,"_45":5382,"_47":5383,"_3956":5386},"B = mpower(A, n)","Matrix power","Raises a square matrix to an integer power. Negative exponents compute the inverse raised to the absolute power.",[5379,5380],{"_17":1163,"_19":5045},{"_17":1206,"_19":5381},"Integer exponent","Matrix raised to power n",[5384],{"_3949":5385,"_3951":3983},"mpower(eye(3), 2)",[5055,5054],{"_15":5388,"_17":5389,"_19":5390,"_21":22,"_23":5391,"_27":5392},"fft","Fourier Analysis","Fast Fourier Transform, inverse transforms, frequency utilities, and window functions for spectral analysis.","〰️",[5393,5413,5430,5443,5455,5467,5479,5492,5504,5519,5537,5548,5559,5570],{"_17":5388,"_31":5394,"_33":5395,"_19":5396,"_36":5397,"_45":5402,"_47":5403,"_3956":5408},"Y = fft(X)\nY = fft(X, n)","Fast Fourier Transform","Computes the one-dimensional discrete Fourier Transform using the FFT algorithm. If `n` is specified, the input is either truncated or zero-padded to length `n` before transforming.",[5398,5400],{"_17":4157,"_19":5399},"Input signal (vector or array)",{"_17":1206,"_19":5401,"_41":10},"Transform length (zero-pads or truncates)","Complex-valued frequency-domain representation",[5404,5406],{"_3949":5405},"fft([1 2 3 4])",{"_3949":5407},"fft([1 0 1 0], 8)",[5409,5410,5411,5412],"ifft","fft2","fftshift","fftfreq",{"_17":5409,"_31":5414,"_33":5415,"_19":5416,"_36":5417,"_45":5423,"_47":5424,"_3956":5427},"x = ifft(Y)\nx = ifft(Y, n)","Inverse Fast Fourier Transform","Computes the one-dimensional inverse discrete Fourier Transform. Recovers the original time-domain signal from its frequency-domain representation.",[5418,5421],{"_17":5419,"_19":5420},"Y","Frequency-domain input",{"_17":1206,"_19":5422,"_41":10},"Transform length","Time-domain signal",[5425],{"_3949":5426},"ifft(fft([1 2 3 4]))",[5388,5428,5429],"ifft2","ifftn",{"_17":5410,"_31":5431,"_33":5432,"_19":5433,"_36":5434,"_45":5437,"_47":5438,"_3956":5441},"Y = fft2(X)","2-D Fast Fourier Transform","Computes the two-dimensional discrete Fourier Transform. Useful for image processing and 2-D signal analysis.",[5435],{"_17":4157,"_19":5436},"Input 2-D array","2-D frequency-domain representation",[5439],{"_3949":5440},"fft2(eye(4))",[5428,5388,5442],"fftn",{"_17":5428,"_31":5444,"_33":5445,"_19":5446,"_36":5447,"_45":5450,"_47":5451,"_3956":5454},"x = ifft2(Y)","2-D inverse FFT","Computes the two-dimensional inverse discrete Fourier Transform.",[5448],{"_17":5419,"_19":5449},"Frequency-domain 2-D input","Spatial-domain 2-D signal",[5452],{"_3949":5453},"ifft2(fft2(eye(4)))",[5410,5409,5429],{"_17":5442,"_31":5456,"_33":5457,"_19":5458,"_36":5459,"_45":5462,"_47":5463,"_3956":5466},"Y = fftn(X)","N-dimensional FFT","Computes the N-dimensional discrete Fourier Transform over all axes of the input array.",[5460],{"_17":4157,"_19":5461},"Input N-D array","N-D frequency-domain representation",[5464],{"_3949":5465},"fftn(ones(4, 4))",[5429,5388,5410],{"_17":5429,"_31":5468,"_33":5469,"_19":5470,"_36":5471,"_45":5474,"_47":5475,"_3956":5478},"x = ifftn(Y)","N-dimensional inverse FFT","Computes the N-dimensional inverse discrete Fourier Transform.",[5472],{"_17":5419,"_19":5473},"Frequency-domain N-D input","Spatial-domain N-D signal",[5476],{"_3949":5477},"ifftn(fftn(ones(4, 4)))",[5442,5409,5428],{"_17":5411,"_31":5480,"_33":5481,"_19":5482,"_36":5483,"_45":5486,"_47":5487,"_3956":5490},"Y = fftshift(X)","Shift zero-frequency component to center","Rearranges the output of `fft` by shifting the zero-frequency component to the center of the array. Useful for visualizing the Fourier transform with the DC component in the middle.",[5484],{"_17":4157,"_19":5485},"Input array (typically output of fft)","Shifted array",[5488],{"_3949":5489},"fftshift(fft([1 2 3 4 5 6 7 8]))",[5491,5388,5412],"ifftshift",{"_17":5491,"_31":5493,"_33":5494,"_19":5495,"_36":5496,"_45":5499,"_47":5500,"_3956":5503},"Y = ifftshift(X)","Inverse of fftshift","Undoes the effect of `fftshift`. Shifts the zero-frequency component back to the beginning of the array.",[5497],{"_17":4157,"_19":5498},"Shifted input array","Unshifted array",[5501],{"_3949":5502},"ifftshift(fftshift([1 2 3 4]))",[5411,5388],{"_17":5412,"_31":5505,"_33":5506,"_19":5507,"_36":5508,"_45":5514,"_47":5515,"_3956":5518},"f = fftfreq(n)\nf = fftfreq(n, d)","DFT sample frequencies","Returns the discrete Fourier Transform sample frequencies. For a signal of length `n` with sample spacing `d`, the frequencies are `[0, 1, ..., n/2-1, -n/2, ..., -1] / (d*n)` for even `n`.",[5509,5511],{"_17":1206,"_19":5510},"Window length (number of samples)",{"_17":5512,"_19":5513,"_41":10},"d","Sample spacing (default: 1.0)","Array of sample frequencies",[5516],{"_3949":5517},"fftfreq(8, 0.1)",[5388,5411],{"_17":5520,"_31":5521,"_33":5522,"_19":5523,"_36":5524,"_45":5528,"_47":5529,"_3956":5532},"bartlett","w = bartlett(M)","Bartlett (triangular) window","Returns an M-point Bartlett window. Similar to a triangular window but with zero-valued endpoints. Useful for spectral analysis with reduced spectral leakage.",[5525],{"_17":5526,"_19":5527},"M","Number of points in the window","M-point Bartlett window vector",[5530],{"_3949":5531},"bartlett(8)",[5533,5534,5535,5536],"hamming","hanning","blackman","kaiser",{"_17":5535,"_31":5538,"_33":5539,"_19":5540,"_36":5541,"_45":5543,"_47":5544,"_3956":5547},"w = blackman(M)","Blackman window","Returns an M-point Blackman window. Designed to have close to minimal spectral leakage. Has wider main lobe but lower side lobes than Hamming or Hanning.",[5542],{"_17":5526,"_19":5527},"M-point Blackman window vector",[5545],{"_3949":5546},"blackman(8)",[5533,5534,5520,5536],{"_17":5533,"_31":5549,"_33":5550,"_19":5551,"_36":5552,"_45":5554,"_47":5555,"_3956":5558},"w = hamming(M)","Hamming window","Returns an M-point Hamming window. A raised-cosine window with coefficients optimized to minimize the nearest side lobe. Formula: w(n) = 0.54 - 0.46*cos(2*pi*n/(M-1)).",[5553],{"_17":5526,"_19":5527},"M-point Hamming window vector",[5556],{"_3949":5557},"hamming(8)",[5534,5535,5520,5536],{"_17":5534,"_31":5560,"_33":5561,"_19":5562,"_36":5563,"_45":5565,"_47":5566,"_3956":5569},"w = hanning(M)","Hanning (Hann) window","Returns an M-point Hanning window (also known as Hann window). A raised-cosine window. Formula: w(n) = 0.5*(1 - cos(2*pi*n/(M-1))).",[5564],{"_17":5526,"_19":5527},"M-point Hanning window vector",[5567],{"_3949":5568},"hanning(8)",[5533,5535,5520,5536],{"_17":5536,"_31":5571,"_33":5572,"_19":5573,"_36":5574,"_45":5578,"_47":5579,"_3956":5582},"w = kaiser(M, beta)","Kaiser window","Returns an M-point Kaiser window with shape parameter beta. The Kaiser window approximates the DPSS window and provides a flexible trade-off between main-lobe width and side-lobe level. Common beta values: 0 (rectangular), 5 (similar to Hamming), 6 (similar to Hanning), 8.6 (similar to Blackman).",[5575,5576],{"_17":5526,"_19":5527},{"_17":118,"_19":5577},"Shape parameter controlling the trade-off","M-point Kaiser window vector",[5580],{"_3949":5581},"kaiser(8, 5)",[5533,5534,5535,5520],{"_15":5584,"_17":5585,"_19":5586,"_21":22,"_23":5587,"_27":5588},"plotting","Data Visualization","M-Code-style plotting functions for inline Chart.js visualizations.","📊",[5589,5609,5623,5634,5645,5660,5674,5698,5723,5761,5775,5786,5802,5813,5823,5835,5849,5864,5877,5890,5900,5913,5923,5936,5948,5959,5969,5978,5987,5999,6015,6028,6045,6065,6078,6088,6109,6134,6154,6175],{"_17":5590,"_31":5591,"_33":5592,"_19":5593,"_36":5594,"_45":5599,"_47":5600,"_3956":5603},"plot","plot(y)\nplot(x, y)","2-D line plot","Creates a line chart. Successive plot() calls add datasets to the same chart; call figure to start a new chart. If one argument is given, it is treated as y-values with x = 1:n. With two arguments, x and y are paired.",[5595,5597],{"_17":405,"_19":5596,"_41":10},"X-axis data (NDArray or scalar)",{"_17":2467,"_19":5598},"Y-axis data (NDArray or scalar)","null (renders chart inline)",[5601],{"_3949":5602},"x = linspace(0, 2*pi, 50);\nplot(x, sin(x))",[5604,5605,5606,5607,5608],"scatter","bar","loglog","semilogx","semilogy",{"_17":5606,"_31":5610,"_33":5611,"_19":5612,"_36":5613,"_45":5616,"_47":5617,"_3956":5622},"loglog(y)\nloglog(x, y)","Log-log scale plot","Creates a 2-D line plot with logarithmic scales on both the x-axis and y-axis. Useful for visualizing power-law relationships and data spanning multiple orders of magnitude.",[5614,5615],{"_17":405,"_19":5596,"_41":10},{"_17":2467,"_19":5598},"Line handle",[5618,5620],{"_3949":5619},"x = 1:100;\ny = x.^2;\nloglog(x, y)",{"_3949":5621},"x = logspace(0, 3, 50);\nloglog(x, x.^(-1.5))",[5590,5607,5608],{"_17":5607,"_31":5624,"_33":5625,"_19":5626,"_36":5627,"_45":5616,"_47":5630,"_3956":5633},"semilogx(y)\nsemilogx(x, y)","Semi-logarithmic plot (log x-axis)","Creates a 2-D line plot with a logarithmic scale on the x-axis and a linear scale on the y-axis.",[5628,5629],{"_17":405,"_19":5596,"_41":10},{"_17":2467,"_19":5598},[5631],{"_3949":5632},"x = logspace(0, 3, 50);\nsemilogx(x, log10(x))",[5590,5606,5608],{"_17":5608,"_31":5635,"_33":5636,"_19":5637,"_36":5638,"_45":5616,"_47":5641,"_3956":5644},"semilogy(y)\nsemilogy(x, y)","Semi-logarithmic plot (log y-axis)","Creates a 2-D line plot with a linear scale on the x-axis and a logarithmic scale on the y-axis. Useful for exponential data.",[5639,5640],{"_17":405,"_19":5596,"_41":10},{"_17":2467,"_19":5598},[5642],{"_3949":5643},"x = 1:10;\ny = 10.^x;\nsemilogy(x, y)",[5590,5606,5607],{"_17":5605,"_31":5646,"_33":5647,"_19":5648,"_36":5649,"_45":5599,"_47":5654,"_3956":5657},"bar(y)\nbar(x, y)","Bar chart","Creates a vertical bar chart.",[5650,5652],{"_17":405,"_19":5651,"_41":10},"Category positions or labels (NDArray)",{"_17":2467,"_19":5653},"Bar heights (NDArray)",[5655],{"_3949":5656},"bar([3 7 2 5])",[5590,5658,5659],"histogram","pie",{"_17":5604,"_31":5661,"_33":5662,"_19":5663,"_36":5664,"_45":5599,"_47":5669,"_3956":5672},"scatter(x, y)","Scatter plot","Creates a scatter plot of y versus x.",[5665,5667],{"_17":405,"_19":5666},"X-coordinates (NDArray)",{"_17":2467,"_19":5668},"Y-coordinates (NDArray)",[5670],{"_3949":5671},"scatter(rand(20, 1), rand(20, 1))",[5590,5605,5673],"spy",{"_17":5673,"_31":5675,"_33":5676,"_19":5677,"_36":5678,"_45":5599,"_47":5688,"_3956":5695},"spy(S)\nspy(S, linespec)\nspy(S, markersize)","Visualize sparsity pattern","Generates a graphical representation of the sparsity pattern of a matrix S. Nonzero values are displayed as markers at their (column, row) positions. The x-axis label shows \"nz = N\" where N is the number of nonzero elements.",[5679,5682,5685],{"_17":5680,"_19":5681},"S","Input matrix (sparse or full)",{"_17":5683,"_19":5684,"_41":10},"linespec","Line specification for marker style (e.g., 'ro' for red circles)",{"_17":5686,"_19":5687,"_41":10},"markersize","Marker size in points (default: auto-scaled based on matrix size)",[5689,5691,5693],{"_3949":5690},"A = eye(10);\nspy(A)",{"_3949":5692},"B = rand(20, 20) > 0.8;\nspy(B)",{"_3949":5694},"spy(magic(10) > 50, 'ro', 8)",[5604,5696,4501,5697],"imagesc","nnz",{"_17":5699,"_31":5700,"_33":5701,"_19":5702,"_36":5703,"_45":5716,"_47":5717,"_3956":5722},"quiver","quiver(U, V)\nquiver(X, Y, U, V)\nquiver(..., scale)","2-D quiver (velocity) plot","Plots arrows to visualize vector fields. Each arrow starts at position (X, Y) and points in direction (U, V). When only U and V are provided, arrows are placed on an auto-generated grid. The optional scale factor controls arrow length (default: 1, set to 0 to disable auto-scaling).",[5704,5706,5708,5711,5714],{"_17":4157,"_19":5705,"_41":10},"Arrow base X-coordinates (matrix or vector)",{"_17":5419,"_19":5707,"_41":10},"Arrow base Y-coordinates (matrix or vector)",{"_17":5709,"_19":5710},"U","Arrow X-direction components (matrix or vector)",{"_17":5712,"_19":5713},"V","Arrow Y-direction components (matrix or vector)",{"_17":3661,"_19":5715,"_41":10},"Arrow scaling factor (default: 1, 0 disables auto-scaling)","Graphics handle",[5718,5720],{"_3949":5719},"[X, Y] = meshgrid(1:5, 1:5);\nquiver(X, Y, ones(5), ones(5))",{"_3949":5721},"U = cos(linspace(0, 2*pi, 25));\nV = sin(linspace(0, 2*pi, 25));\nquiver(U, V)",[5590,5604,4072],{"_17":5724,"_31":5725,"_33":5726,"_19":5727,"_36":5728,"_45":5716,"_47":5751,"_3956":5758},"fill","fill(X, Y)\nfill(X, Y, C)\nfill(..., Name, Value)","Filled 2-D polygon","Creates a filled polygon with vertices at the coordinates (X, Y). The polygon is automatically closed by connecting the last vertex to the first. Color can be specified as a short name ('r'), long name ('red'), or RGB triplet [r g b] with values in range [0,1].",[5729,5731,5733,5736,5739,5742,5745,5748],{"_17":4157,"_19":5730},"X-coordinates of polygon vertices (vector)",{"_17":5419,"_19":5732},"Y-coordinates of polygon vertices (vector)",{"_17":5734,"_19":5735,"_41":10},"C","Color specification: short name, long name, or RGB triplet",{"_17":5737,"_19":5738,"_41":10},"FaceColor","Fill color (Name-Value pair)",{"_17":5740,"_19":5741,"_41":10},"FaceAlpha","Fill transparency 0-1 (Name-Value pair)",{"_17":5743,"_19":5744,"_41":10},"EdgeColor","Edge color or 'none' (Name-Value pair)",{"_17":5746,"_19":5747,"_41":10},"LineWidth","Edge line width (Name-Value pair)",{"_17":5749,"_19":5750,"_41":10},"LineStyle","Edge line style: '-', '--', ':', '-.', 'none' (Name-Value pair)",[5752,5754,5756],{"_3949":5753},"fill([0 1 0.5], [0 0 1], 'r')",{"_3949":5755},"x = cos(linspace(0, 2*pi, 6));\ny = sin(linspace(0, 2*pi, 6));\nfill(x, y, 'b', 'FaceAlpha', 0.5)",{"_3949":5757},"fill([0 1 1 0], [0 0 1 1], [0.2 0.6 0.8], 'EdgeColor', 'none')",[5590,5759,5760],"patch","area",{"_17":5658,"_31":5762,"_33":5763,"_19":5764,"_36":5765,"_45":5599,"_47":5771,"_3956":5774},"histogram(data)\nhistogram(data, numBins)","Histogram","Creates a histogram of the data, auto-binned into the specified number of bins (default 10).",[5766,5768],{"_17":1215,"_19":5767},"Input data (NDArray)",{"_17":5769,"_19":5770,"_41":10},"numBins","Number of bins (default: 10)",[5772],{"_3949":5773},"histogram(randn(100, 1))",[5605,5590],{"_17":5659,"_31":5776,"_33":5777,"_19":5778,"_36":5779,"_45":5599,"_47":5782,"_3956":5785},"pie(data)","Pie chart","Creates a pie chart from the data values.",[5780],{"_17":1215,"_19":5781},"Slice values (NDArray)",[5783],{"_3949":5784},"pie([30 20 50])",[5605,5658],{"_17":5787,"_31":5788,"_33":5789,"_19":5790,"_36":5791,"_45":5794,"_47":5795,"_3956":5798},"title","title(str)","Add title to current chart","Sets the title of the most recently created chart.",[5792],{"_17":4701,"_19":5793},"Title string","null",[5796],{"_3949":5797},"plot([1 4 9 16]);\ntitle('Squares')",[5799,5800,5801],"xlabel","ylabel","legend",{"_17":5799,"_31":5803,"_33":5804,"_19":5805,"_36":5806,"_45":5794,"_47":5809,"_3956":5812},"xlabel(str)","Label x-axis","Sets the x-axis label of the most recently created chart.",[5807],{"_17":4701,"_19":5808},"Label string",[5810],{"_3949":5811},"xlabel('Time (s)')",[5800,5787],{"_17":5800,"_31":5814,"_33":5815,"_19":5816,"_36":5817,"_45":5794,"_47":5819,"_3956":5822},"ylabel(str)","Label y-axis","Sets the y-axis label of the most recently created chart.",[5818],{"_17":4701,"_19":5808},[5820],{"_3949":5821},"ylabel('Amplitude')",[5799,5787],{"_17":5801,"_31":5824,"_33":5825,"_19":5826,"_36":5827,"_45":5794,"_47":5831,"_3956":5834},"legend('label1', 'label2', ...)","Add legend to current chart","Adds a legend to the most recently created chart with the given labels.",[5828],{"_17":5829,"_19":5830},"labels","One or more string labels",[5832],{"_3949":5833},"legend('sin', 'cos')",[5787,5799,5800],{"_17":5836,"_31":5837,"_33":5838,"_19":5839,"_36":5840,"_45":5794,"_47":5843,"_3956":5846},"figure","figure\nfigure(n)","Create a new figure","Starts a new figure so the next plotting command creates a fresh chart. Without arguments, creates a new figure with auto-incremented ID. With argument n, switches to figure n.",[5841],{"_17":1206,"_19":5842,"_41":10},"Figure number",[5844],{"_3949":5845},"plot([1 2 3]);\nfigure();\nplot([4 5 6])",[5590,5605,5604,5847,5848],"gcf","clf",{"_17":5850,"_31":5851,"_33":5852,"_19":5853,"_36":5854,"_45":5794,"_47":5859,"_3956":5862},"xlim","xlim([min max])","Set x-axis limits","Sets the minimum and maximum values for the x-axis of the current chart.",[5855,5857],{"_17":4415,"_19":5856},"Minimum x value",{"_17":2042,"_19":5858},"Maximum x value",[5860],{"_3949":5861},"plot([1 2 3 4]);\nxlim([0 5])",[5863,2911],"ylim",{"_17":5863,"_31":5865,"_33":5866,"_19":5867,"_36":5868,"_45":5794,"_47":5873,"_3956":5876},"ylim([min max])","Set y-axis limits","Sets the minimum and maximum values for the y-axis of the current chart.",[5869,5871],{"_17":4415,"_19":5870},"Minimum y value",{"_17":2042,"_19":5872},"Maximum y value",[5874],{"_3949":5875},"plot([1 2 3 4]);\nylim([0 5])",[5850,2911],{"_17":5878,"_31":5879,"_33":5880,"_19":5881,"_36":5882,"_45":5794,"_47":5885,"_3956":5888},"xticks","xticks(values)","Set x-axis tick values","Sets custom tick mark positions on the x-axis.",[5883],{"_17":560,"_19":5884},"Vector of tick positions",[5886],{"_3949":5887},"plot([1 2 3 4]);\nxticks([1 2 3 4])",[5889,5850],"yticks",{"_17":5889,"_31":5891,"_33":5892,"_19":5893,"_36":5894,"_45":5794,"_47":5896,"_3956":5899},"yticks(values)","Set y-axis tick values","Sets custom tick mark positions on the y-axis.",[5895],{"_17":560,"_19":5884},[5897],{"_3949":5898},"bar([10 20 30]);\nyticks([0 10 20 30])",[5878,5863],{"_17":5901,"_31":5902,"_33":5903,"_19":5904,"_36":5905,"_45":5794,"_47":5908,"_3956":5911},"xtickangle","xtickangle(angle)","Rotate x-axis tick labels","Sets the rotation angle (in degrees) for x-axis tick labels.",[5906],{"_17":2908,"_19":5907},"Rotation angle in degrees",[5909],{"_3949":5910},"bar([1 2 3]);\nxtickangle(45)",[5912,5878],"ytickangle",{"_17":5912,"_31":5914,"_33":5915,"_19":5916,"_36":5917,"_45":5794,"_47":5919,"_3956":5922},"ytickangle(angle)","Rotate y-axis tick labels","Sets the rotation angle (in degrees) for y-axis tick labels.",[5918],{"_17":2908,"_19":5907},[5920],{"_3949":5921},"bar([1 2 3]);\nytickangle(90)",[5901,5889],{"_17":5924,"_31":5925,"_33":5926,"_19":5927,"_36":5928,"_45":5794,"_47":5932,"_3956":5935},"grid","grid\ngrid('on')\ngrid('off')","Toggle grid lines","Controls the visibility of grid lines on the current chart.",[5929],{"_17":5930,"_19":5931,"_41":10},"state","'on' or 'off' (default: toggle)",[5933],{"_3949":5934},"plot([1 2 3]);\ngrid('on')",[2911,5850,5863],{"_17":2911,"_31":5937,"_33":5938,"_19":5939,"_36":5940,"_45":5794,"_47":5944,"_3956":5947},"axis([xmin xmax ymin ymax])","Set axis limits and scaling","Sets the limits for both x and y axes simultaneously.",[5941],{"_17":5942,"_19":5943},"limits","4-element vector [xmin xmax ymin ymax]",[5945],{"_3949":5946},"plot([1 2 3]);\naxis([0 4 0 4])",[5850,5863,5924],{"_17":5949,"_31":5950,"_33":5951,"_19":5952,"_36":5953,"_45":5794,"_47":5955,"_3956":5958},"hold","hold\nhold('on')\nhold('off')","Hold current plot","Controls whether new plot commands add to or replace the current chart. When hold is on, successive plot commands add datasets to the same chart.",[5954],{"_17":5930,"_19":5931,"_41":10},[5956],{"_3949":5957},"plot([1 2 3]);\nhold('on');\nbar([2 3 4])",[5836,5590],{"_17":5847,"_31":5960,"_33":5961,"_19":5962,"_36":5963,"_45":5964,"_47":5965,"_3956":5967},"f = gcf","Get current figure","Returns the handle (ID) of the current figure.",[],"Figure ID number",[5966],{"_3949":5960},[5836,5968,5848],"gca",{"_17":5968,"_31":5970,"_33":5971,"_19":5972,"_36":5973,"_45":5974,"_47":5975,"_3956":5977},"ax = gca","Get current axes","Returns the handle (ID) of the current axes (same as gcf in this implementation).",[],"Axes ID number",[5976],{"_3949":5970},[5847,5836],{"_17":5848,"_31":5848,"_33":5979,"_19":5980,"_36":5981,"_45":5794,"_47":5982,"_3956":5985},"Clear current figure","Clears all charts from the current figure, resetting its state.",[],[5983],{"_3949":5984},"plot([1 2 3]);\nclf()",[5986,5836],"close",{"_17":5986,"_31":5988,"_33":5989,"_19":5990,"_36":5991,"_45":5794,"_47":5995,"_3956":5998},"close\nclose(fig)","Close figure","Closes the current figure or the specified figure by ID.",[5992],{"_17":5993,"_19":5994,"_41":10},"fig","Figure ID to close",[5996],{"_3949":5997},"close()",[5848,5836],{"_17":6000,"_31":6001,"_33":6002,"_19":6003,"_36":6004,"_45":5794,"_47":6011,"_3956":6014},"text","text(x, y, str)","Add text annotation","Adds a text annotation at the specified (x, y) coordinates in data units.",[6005,6007,6009],{"_17":405,"_19":6006},"X-coordinate",{"_17":2467,"_19":6008},"Y-coordinate",{"_17":4701,"_19":6010},"Text string",[6012],{"_3949":6013},"plot([1 2 3]);\ntext(2, 2.5, 'Peak')",[5787,5799,5800],{"_17":6016,"_31":6017,"_33":6018,"_19":6019,"_36":6020,"_45":5794,"_47":6024,"_3956":6027},"yyaxis","yyaxis('left')\nyyaxis('right')","Control dual y-axes","Activates either the left or right y-axis for subsequent plotting commands, enabling dual y-axis charts.",[6021],{"_17":6022,"_19":6023},"side","'left' or 'right'",[6025],{"_3949":6026},"plot([1 2 3]);\nyyaxis('right');\nplot([10 20 30])",[5800,5863],{"_17":6029,"_31":6030,"_33":6031,"_19":6032,"_36":6033,"_45":5794,"_47":6041,"_3956":6044},"subplot","subplot(rows, cols, index)","Create subplot grid","Creates a grid of charts with the specified number of rows and columns, and activates the subplot at the given index (1-based).",[6034,6036,6038],{"_17":2401,"_19":6035},"Number of rows in grid",{"_17":2391,"_19":6037},"Number of columns in grid",{"_17":6039,"_19":6040},"index","1-based position in grid (row-major order)",[6042],{"_3949":6043},"subplot(2, 2, 1);\nplot([1 2 3]);\nsubplot(2, 2, 2);\nbar([4 5 6])",[5836,5590],{"_17":418,"_31":6046,"_33":6047,"_19":6048,"_36":6049,"_45":6059,"_47":6060,"_3956":6063},"mesh(Z)\nmesh(X, Y, Z)\nmesh(X, Y, Z, C)","3-D wireframe mesh surface","Creates a 3D wireframe mesh surface plot. With one argument, Z provides the heights with X and Y auto-generated as indices. With three arguments, X, Y, and Z define the surface coordinates. The optional C argument provides a color matrix.",[6050,6052,6054,6057],{"_17":4157,"_19":6051,"_41":10},"X-coordinate matrix (auto-generated if omitted)",{"_17":5419,"_19":6053,"_41":10},"Y-coordinate matrix (auto-generated if omitted)",{"_17":6055,"_19":6056},"Z","Height matrix (required)",{"_17":5734,"_19":6058,"_41":10},"Color data matrix (defaults to Z)","null (renders 3D chart inline)",[6061],{"_3949":6062},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X .* exp(-X.^2 - Y.^2);\nmesh(X, Y, Z)",[4094,4072,6064],"zlabel",{"_17":4094,"_31":6066,"_33":6067,"_19":6068,"_36":6069,"_45":6059,"_47":6074,"_3956":6077},"surf(Z)\nsurf(X, Y, Z)\nsurf(X, Y, Z, C)","3-D shaded surface plot","Creates a 3D surface plot with filled faces. With one argument, Z provides the heights with X and Y auto-generated as indices. With three arguments, X, Y, and Z define the surface coordinates. The optional C argument provides a color matrix.",[6070,6071,6072,6073],{"_17":4157,"_19":6051,"_41":10},{"_17":5419,"_19":6053,"_41":10},{"_17":6055,"_19":6056},{"_17":5734,"_19":6058,"_41":10},[6075],{"_3949":6076},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X .* exp(-X.^2 - Y.^2);\nsurf(X, Y, Z)",[418,4072,6064],{"_17":6064,"_31":6079,"_33":6080,"_19":6081,"_36":6082,"_45":5794,"_47":6084,"_3956":6087},"zlabel(str)","Label z-axis","Sets the z-axis label of the most recently created 3D chart.",[6083],{"_17":4701,"_19":5808},[6085],{"_3949":6086},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X .* exp(-X.^2 - Y.^2);\nsurf(X, Y, Z);\nzlabel('Height')",[5799,5800,5787,418,4094],{"_17":6089,"_31":6090,"_33":6091,"_19":6092,"_36":6093,"_45":6100,"_47":6101,"_3956":6108},"view","view(az, el)\nview([az el])\nview(2)\nview(3)\n[az, el] = view","Set 3D view angle","Sets the camera viewing angle for 3D plots (mesh, surf). Azimuth is the angle of rotation around the z-axis measured from the negative y-axis (counterclockwise positive). Elevation is the angle from the x-y plane (-90 to 90 degrees). view(2) sets a top-down 2D view (az=0, el=90). view(3) sets the default 3D view (az=-37.5, el=30).",[6094,6097],{"_17":6095,"_19":6096,"_41":10},"az","Azimuth angle in degrees",{"_17":6098,"_19":6099,"_41":10},"el","Elevation angle in degrees","With no arguments, returns [az, el] of current view",[6102,6104,6106],{"_3949":6103},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X .* exp(-X.^2 - Y.^2);\nsurf(X, Y, Z);\nview(45, 30)",{"_3949":6105},"[X, Y] = meshgrid(-2:0.2:2);\nZ = sin(X) .* cos(Y);\nsurf(X, Y, Z);\nview(2) % Top-down view",{"_3949":6107},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X.^2 - Y.^2;\nmesh(X, Y, Z);\nview(3) % Default 3D view",[418,4094,6064],{"_17":5696,"_31":6110,"_33":6111,"_19":6112,"_36":6113,"_45":6123,"_47":6124,"_3956":6131},"imagesc(C)\nimagesc(x, y, C)\nimagesc(..., clims)","Display matrix as scaled image","Displays a matrix C as an image with scaled colors. Each element of C maps to a color in the colormap, with the minimum value mapping to the first color and maximum to the last. Optional x and y vectors specify the coordinates of the columns and rows.",[6114,6116,6118,6120],{"_17":405,"_19":6115,"_41":10},"X-axis coordinates for columns (2-element vector or full vector)",{"_17":2467,"_19":6117,"_41":10},"Y-axis coordinates for rows (2-element vector or full vector)",{"_17":5734,"_19":6119},"Data matrix to display",{"_17":6121,"_19":6122,"_41":10},"clims","Color limits [cmin cmax]","null (renders heatmap inline)",[6125,6127,6129],{"_3949":6126},"A = magic(5);\nimagesc(A)",{"_3949":6128},"A = peaks(50);\nimagesc(A)\ncolorbar",{"_3949":6130},"imagesc([0 10], [0 5], rand(10, 20))\ntitle('Random data')",[6132,6133,418,4094],"colorbar","colormap",{"_17":6132,"_31":6135,"_33":6136,"_19":6137,"_36":6138,"_45":6142,"_47":6143,"_3956":6152},"colorbar\ncolorbar('off')\ncolorbar('location')\nc = colorbar","Add colorbar to current chart","Displays a colorbar showing the color scale for the current heatmap, mesh, or surf plot. Supports location options ('eastoutside', 'westoutside', 'northoutside', 'southoutside') and can return a handle for further property manipulation using set().",[6139],{"_17":6140,"_19":6141,"_41":10},"location","Location string: 'eastoutside' (default), 'westoutside', 'northoutside', 'southoutside', or 'off'","Colorbar handle (when assigned to variable)",[6144,6146,6148,6150],{"_3949":6145},"imagesc(peaks(30));\ncolorbar",{"_3949":6147},"surf(peaks(30));\ncolorbar('southoutside')",{"_3949":6149},"imagesc(rand(20));\nc = colorbar;\nset(c, 'Title', 'Values')",{"_3949":6151},"mesh(peaks);\ncolorbar('off')",[5696,6133,418,4094,6153],"set",{"_17":6133,"_31":6155,"_33":6156,"_19":6157,"_36":6158,"_45":6164,"_47":6165,"_3956":6174},"colormap(name)\ncolormap(map)\ncmap = colormap","Set or get colormap for current figure","Sets the colormap used for pseudocolor plots like imagesc, mesh, and surf. With no arguments, returns the current colormap as an Mx3 RGB matrix (default 256 rows). With a string argument, sets to a named colormap. With an Mx3 matrix argument, sets a custom colormap where each row is [R G B] with values in range [0,1].",[6159,6161],{"_17":17,"_19":6160,"_41":10},"Colormap name: viridis (default), jet, hot, cool, gray, grayscale, parula, turbo, coolwarm, rainbow, bone, copper, spring, summer, autumn, winter",{"_17":6162,"_19":6163,"_41":10},"map","Mx3 matrix of RGB values (each in [0,1])","Mx3 RGB matrix (query mode) or null (set mode)",[6166,6168,6170,6172],{"_3949":6167},"imagesc(peaks(30));\ncolormap('jet');\ncolorbar",{"_3949":6169},"surf(peaks(25));\ncolormap('hot')",{"_3949":6171},"cmap = colormap % returns 256x3 matrix",{"_3949":6173},"colormap([0 0 1; 1 1 1; 1 0 0]) % custom blue-white-red",[5696,6132,418,4094],{"_17":6176,"_31":6177,"_33":6178,"_19":6179,"_36":6180,"_45":5794,"_47":6184,"_3956":6189},"shading","shading faceted\nshading flat\nshading interp","Set surface shading mode","Controls the color shading of surface and mesh plots. 'faceted' uses flat coloring with black mesh lines overlaid (default). 'flat' uses flat coloring without mesh lines. 'interp' uses smooth interpolated colors across the surface.",[6181],{"_17":6182,"_19":6183},"mode","Shading mode: 'faceted' (default), 'flat', or 'interp'",[6185,6187],{"_3949":6186},"surf(peaks(30));\nshading interp",{"_3949":6188},"[X, Y] = meshgrid(-2:0.2:2);\nZ = X .* exp(-X.^2 - Y.^2);\nsurf(X, Y, Z);\nshading flat;\ncolorbar",[4094,418,6133,6132],{"_15":6191,"_17":6192,"_19":6193,"_21":22,"_23":6194,"_27":6195},"poly","Polynomial Functions","Polynomial operations across power, Chebyshev, Legendre, Hermite, HermiteE, and Laguerre bases with fitting, evaluation, calculus, arithmetic, and conversion utilities.","∑",[6196,6215,6233,6248,6263,6279,6298,6312,6325,6338,6353,6367,6377,6388,6404,6419,6433,6445,6462,6477,6493,6504,6515,6528,6543,6553,6564,6573,6585,6598,6608,6616,6628,6640,6654,6669,6681,6691,6704,6713,6722,6731,6741,6752,6760,6768,6778,6788,6799,6814,6824,6834,6846,6855,6865,6874,6884,6895,6903,6911,6921,6931,6942,6955,6965,6975,6987,6996,7006,7015,7025,7036,7044,7052,7062,7072,7083,7098,7108,7118,7130,7139,7149,7158,7168,7179,7187,7195,7205,7215,7226,7236,7244,7252,7260,7268,7284,7297,7313,7329],{"_17":6197,"_31":6198,"_33":6199,"_19":6200,"_36":6201,"_45":6206,"_47":6207,"_3956":6211},"polyval","y = polyval(x, c)","Evaluate power series polynomial","Evaluates a power series polynomial at point x using Horner's method. Coefficients are in ascending order: c(1) + c(2)*x + c(3)*x^2 + ...",[6202,6204],{"_17":405,"_19":6203},"Point at which to evaluate",{"_17":713,"_19":6205},"Coefficient array in ascending order [c0, c1, c2, ...]","Polynomial value at x",[6208],{"_3949":6209,"_3951":6210},"polyval(2, [1 2 3])","17",[6212,6213,6214],"polyfit","polyder","polyint",{"_17":6216,"_31":6217,"_33":6218,"_19":6219,"_36":6220,"_45":6227,"_47":6228,"_3956":6231},"polyval2d","z = polyval2d(x, y, c)","Evaluate 2-D power series polynomial","Evaluates a 2-D power series polynomial on x-y pairs.",[6221,6223,6225],{"_17":405,"_19":6222},"x coordinates",{"_17":2467,"_19":6224},"y coordinates",{"_17":713,"_19":6226},"2-D coefficient array","Polynomial values at (x, y) pairs",[6229],{"_3949":6230},"polyval2d([1 2], [1 2], [1 0; 0 1])",[6197,6232],"polyval3d",{"_17":6232,"_31":6234,"_33":6235,"_19":6236,"_36":6237,"_45":6245,"_47":6246,"_3956":6247},"w = polyval3d(x, y, z, c)","Evaluate 3-D power series polynomial","Evaluates a 3-D power series polynomial on x-y-z triples.",[6238,6239,6240,6243],{"_17":405,"_19":6222},{"_17":2467,"_19":6224},{"_17":6241,"_19":6242},"z","z coordinates",{"_17":713,"_19":6244},"3-D coefficient array","Polynomial values at (x, y, z) triples",[],[6197,6216],{"_17":6213,"_31":6249,"_33":6250,"_19":6251,"_36":6252,"_45":6257,"_47":6258,"_3956":6262},"dc = polyder(c)\ndc = polyder(c, m)","Power series derivative","Differentiates a power series polynomial m times. Default m = 1.",[6253,6255],{"_17":713,"_19":6254},"Coefficient array in ascending order",{"_17":630,"_19":6256,"_41":10},"Number of derivatives (default: 1)","Differentiated coefficient array",[6259],{"_3949":6260,"_3951":6261},"polyder([1 2 3])","[2 6]",[6214,6197],{"_17":6214,"_31":6264,"_33":6265,"_19":6266,"_36":6267,"_45":6273,"_47":6274,"_3956":6278},"ic = polyint(c)\nic = polyint(c, m)\nic = polyint(c, m, k)","Power series integral","Integrates a power series polynomial m times with integration constants k. Default m = 1, k = [0].",[6268,6269,6271],{"_17":713,"_19":6254},{"_17":630,"_19":6270,"_41":10},"Number of integrations (default: 1)",{"_17":4686,"_19":6272,"_41":10},"Integration constants (default: all zero)","Integrated coefficient array",[6275],{"_3949":6276,"_3951":6277},"polyint([2 6])","[0 2 3]",[6213,6197],{"_17":6280,"_31":6281,"_33":6282,"_19":6283,"_36":6284,"_45":6289,"_47":6290,"_3956":6294},"polymul","c = polymul(c1, c2)","Multiply two power series polynomials","Multiplies two power series coefficient arrays using convolution.",[6285,6287],{"_17":726,"_19":6286},"First coefficient array",{"_17":729,"_19":6288},"Second coefficient array","Product coefficient array",[6291],{"_3949":6292,"_3951":6293},"polymul([1 1], [1 1])","[1 2 1]",[6295,6296,6297],"polydiv","polyadd","polysub",{"_17":6295,"_31":6299,"_33":6300,"_19":6301,"_36":6302,"_45":6307,"_47":6308,"_3956":6311},"[q, r] = polydiv(c1, c2)","Divide two power series polynomials","Divides two power series coefficient arrays. Returns quotient and remainder.",[6303,6305],{"_17":726,"_19":6304},"Dividend coefficient array",{"_17":729,"_19":6306},"Divisor coefficient array","Quotient and remainder coefficient arrays",[6309],{"_3949":6310},"polydiv([1 2 1], [1 1])",[6280,6296,6297],{"_17":6296,"_31":6313,"_33":6314,"_19":6315,"_36":6316,"_45":6319,"_47":6320,"_3956":6324},"c = polyadd(c1, c2)","Add two power series polynomials","Adds two power series coefficient arrays.",[6317,6318],{"_17":726,"_19":6286},{"_17":729,"_19":6288},"Sum coefficient array",[6321],{"_3949":6322,"_3951":6323},"polyadd([1 2], [3 4])","[4 6]",[6297,6280,6295],{"_17":6297,"_31":6326,"_33":6327,"_19":6328,"_36":6329,"_45":6332,"_47":6333,"_3956":6337},"c = polysub(c1, c2)","Subtract two power series polynomials","Subtracts two power series coefficient arrays.",[6330,6331],{"_17":726,"_19":6286},{"_17":729,"_19":6288},"Difference coefficient array",[6334],{"_3949":6335,"_3951":6336},"polysub([3 4], [1 2])","[2 2]",[6296,6280,6295],{"_17":6339,"_31":6340,"_33":6341,"_19":6342,"_36":6343,"_45":6348,"_47":6349,"_3956":6352},"polypow","c = polypow(c, n)","Raise power series polynomial to a power","Raises a power series polynomial to a non-negative integer power.",[6344,6346],{"_17":713,"_19":6345},"Coefficient array",{"_17":1206,"_19":6347},"Non-negative integer power","Resulting coefficient array",[6350],{"_3949":6351,"_3951":6293},"polypow([1 1], 2)",[6280],{"_17":6354,"_31":6355,"_33":6356,"_19":6357,"_36":6358,"_45":6360,"_47":6361,"_3956":6364},"polyroots","r = polyroots(c)","Find power series polynomial roots","Finds roots of a power series polynomial using companion matrix eigenvalues.",[6359],{"_17":713,"_19":6254},"Array of roots",[6362],{"_3949":6363},"polyroots([-1 0 1])",[6365,6366],"polyfromroots","polycompanion",{"_17":6365,"_31":6368,"_33":6369,"_19":6370,"_36":6371,"_45":6254,"_47":6373,"_3956":6376},"c = polyfromroots(r)","Construct power series from roots","Constructs a power series polynomial from its roots.",[6372],{"_17":3795,"_19":6360},[6374],{"_3949":6375},"polyfromroots([1 -1])",[6354],{"_17":6366,"_31":6378,"_33":6379,"_19":6380,"_36":6381,"_45":6383,"_47":6384,"_3956":6387},"C = polycompanion(c)","Power series companion matrix","Generates the companion matrix for a power series polynomial.",[6382],{"_17":713,"_19":6345},"Companion matrix",[6385],{"_3949":6386},"polycompanion([-1 0 1])",[6354],{"_17":6389,"_31":6390,"_33":6391,"_19":6392,"_36":6393,"_45":6399,"_47":6400,"_3956":6403},"polyvander","V = polyvander(x, deg)","Power series Vandermonde matrix","Generates a Vandermonde matrix of the given degree for the given sample points.",[6394,6396],{"_17":405,"_19":6395},"Sample points",{"_17":6397,"_19":6398},"deg","Degree of polynomial","Vandermonde matrix",[6401],{"_3949":6402},"polyvander([1 2 3], 2)",[6212],{"_17":6212,"_31":6405,"_33":6406,"_19":6407,"_36":6408,"_45":6254,"_47":6415,"_3956":6418},"c = polyfit(x, y, deg)","Least-squares power series fit","Fits a power series polynomial of the given degree to data using least squares.",[6409,6411,6413],{"_17":405,"_19":6410},"x values",{"_17":2467,"_19":6412},"y values",{"_17":6397,"_19":6414},"Degree of fitting polynomial",[6416],{"_3949":6417},"polyfit([0 1 2 3], [0 1 4 9], 2)",[6197,6389],{"_17":6420,"_31":6421,"_33":6422,"_19":6423,"_36":6424,"_45":6427,"_47":6428,"_3956":6432},"roots","r = roots(p)","Polynomial roots (M-Code convention)","Finds roots of a polynomial specified by descending-order coefficients [a_n, ..., a_1, a_0].",[6425],{"_17":5212,"_19":6426},"Coefficient vector in descending order","Column vector of roots",[6429],{"_3949":6430,"_3951":6431},"roots([1 0 -1])","[1; -1]",[6191,6354],{"_17":6191,"_31":6434,"_33":6435,"_19":6436,"_36":6437,"_45":6426,"_47":6440,"_3956":6444},"p = poly(r)","Polynomial from roots (M-Code convention)","Constructs polynomial coefficients in descending order from a vector of roots.",[6438],{"_17":3795,"_19":6439},"Vector of roots",[6441],{"_3949":6442,"_3951":6443},"poly([1 -1])","[1 0 -1]",[6420,6365],{"_17":6446,"_31":6447,"_33":6448,"_19":6449,"_36":6450,"_45":6456,"_47":6457,"_3956":6460},"conv","w = conv(u, v)","Convolution / polynomial multiplication (M-Code convention)","Convolves two vectors, equivalent to polynomial multiplication with descending-order coefficients.",[6451,6454],{"_17":6452,"_19":6453},"u","First input vector (descending order)",{"_17":676,"_19":6455},"Second input vector (descending order)","Convolution result (descending order)",[6458],{"_3949":6459,"_3951":6293},"conv([1 1], [1 1])",[6461,6280],"deconv",{"_17":6461,"_31":6463,"_33":6464,"_19":6465,"_36":6466,"_45":6471,"_47":6472,"_3956":6476},"[q, r] = deconv(b, a)","Deconvolution / polynomial division (M-Code convention)","Deconvolves two vectors, equivalent to polynomial long division with descending-order coefficients.",[6467,6469],{"_17":408,"_19":6468},"Dividend vector (descending order)",{"_17":664,"_19":6470},"Divisor vector (descending order)","Quotient vector (descending order)",[6473],{"_3949":6474,"_3951":6475},"deconv([1 2 1], [1 1])","[1 1]",[6446,6295],{"_17":6478,"_31":6479,"_33":6480,"_19":6481,"_36":6482,"_45":6206,"_47":6486,"_3956":6489},"chebval","y = chebval(x, c)","Evaluate Chebyshev polynomial","Evaluates a Chebyshev polynomial at point x using Clenshaw's algorithm. Coefficients: c(1)*T_0 + c(2)*T_1 + c(3)*T_2 + ...",[6483,6484],{"_17":405,"_19":6203},{"_17":713,"_19":6485},"Chebyshev coefficient array",[6487],{"_3949":6488},"chebval(0.5, [1 2 3])",[6490,6491,6492],"chebfit","chebder","chebint",{"_17":6494,"_31":6495,"_33":6496,"_19":6497,"_36":6498,"_45":6227,"_47":6502,"_3956":6503},"chebval2d","z = chebval2d(x, y, c)","Evaluate 2-D Chebyshev polynomial","Evaluates a 2-D Chebyshev polynomial on x-y pairs.",[6499,6500,6501],{"_17":405,"_19":6222},{"_17":2467,"_19":6224},{"_17":713,"_19":6226},[],[6478],{"_17":6491,"_31":6505,"_33":6506,"_19":6507,"_36":6508,"_45":6257,"_47":6511,"_3956":6514},"dc = chebder(c)\ndc = chebder(c, m)","Chebyshev derivative","Differentiates a Chebyshev polynomial m times.",[6509,6510],{"_17":713,"_19":6485},{"_17":630,"_19":6256,"_41":10},[6512],{"_3949":6513},"chebder([1 2 3])",[6492,6478],{"_17":6492,"_31":6516,"_33":6517,"_19":6518,"_36":6519,"_45":6273,"_47":6524,"_3956":6527},"ic = chebint(c)\nic = chebint(c, m)\nic = chebint(c, m, k)","Chebyshev integral","Integrates a Chebyshev polynomial m times with integration constants k.",[6520,6521,6522],{"_17":713,"_19":6485},{"_17":630,"_19":6270,"_41":10},{"_17":4686,"_19":6523,"_41":10},"Integration constants",[6525],{"_3949":6526},"chebint([2 6])",[6491,6478],{"_17":6529,"_31":6530,"_33":6531,"_19":6532,"_36":6533,"_45":6289,"_47":6536,"_3956":6539},"chebmul","c = chebmul(c1, c2)","Multiply two Chebyshev polynomials","Multiplies two Chebyshev coefficient arrays.",[6534,6535],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[6537],{"_3949":6538},"chebmul([1 1], [1 1])",[6540,6541,6542],"chebdiv","chebadd","chebsub",{"_17":6540,"_31":6544,"_33":6545,"_19":6546,"_36":6547,"_45":6550,"_47":6551,"_3956":6552},"[q, r] = chebdiv(c1, c2)","Divide two Chebyshev polynomials","Divides two Chebyshev coefficient arrays. Returns quotient and remainder.",[6548,6549],{"_17":726,"_19":6304},{"_17":729,"_19":6306},"Quotient and remainder",[],[6529],{"_17":6541,"_31":6554,"_33":6555,"_19":6556,"_36":6557,"_45":6319,"_47":6560,"_3956":6563},"c = chebadd(c1, c2)","Add two Chebyshev polynomials","Adds two Chebyshev coefficient arrays.",[6558,6559],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[6561],{"_3949":6562},"chebadd([1 2], [3 4])",[6542,6529],{"_17":6542,"_31":6565,"_33":6566,"_19":6567,"_36":6568,"_45":6332,"_47":6571,"_3956":6572},"c = chebsub(c1, c2)","Subtract two Chebyshev polynomials","Subtracts two Chebyshev coefficient arrays.",[6569,6570],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6541,6529],{"_17":6574,"_31":6575,"_33":6576,"_19":6577,"_36":6578,"_45":6348,"_47":6581,"_3956":6584},"chebpow","c = chebpow(c, n)","Raise Chebyshev polynomial to a power","Raises a Chebyshev polynomial to a non-negative integer power.",[6579,6580],{"_17":713,"_19":6345},{"_17":1206,"_19":6347},[6582],{"_3949":6583},"chebpow([1 1], 2)",[6529],{"_17":6586,"_31":6587,"_33":6588,"_19":6589,"_36":6590,"_45":6360,"_47":6592,"_3956":6595},"chebroots","r = chebroots(c)","Find Chebyshev polynomial roots","Finds roots of a Chebyshev polynomial using companion matrix eigenvalues.",[6591],{"_17":713,"_19":6485},[6593],{"_3949":6594},"chebroots([1 0 -1])",[6596,6597],"chebfromroots","chebcompanion",{"_17":6596,"_31":6599,"_33":6600,"_19":6601,"_36":6602,"_45":6485,"_47":6604,"_3956":6607},"c = chebfromroots(r)","Construct Chebyshev polynomial from roots","Constructs Chebyshev coefficient array from roots.",[6603],{"_17":3795,"_19":6360},[6605],{"_3949":6606},"chebfromroots([1 -1])",[6586],{"_17":6597,"_31":6609,"_33":6610,"_19":6611,"_36":6612,"_45":6383,"_47":6614,"_3956":6615},"C = chebcompanion(c)","Chebyshev companion matrix","Generates the companion matrix for a Chebyshev polynomial.",[6613],{"_17":713,"_19":6485},[],[6586],{"_17":6617,"_31":6618,"_33":6619,"_19":6620,"_36":6621,"_45":6399,"_47":6624,"_3956":6627},"chebvander","V = chebvander(x, deg)","Chebyshev Vandermonde matrix","Generates a Chebyshev Vandermonde matrix for the given sample points and degree.",[6622,6623],{"_17":405,"_19":6395},{"_17":6397,"_19":6398},[6625],{"_3949":6626},"chebvander([0 0.5 1], 2)",[6490],{"_17":6490,"_31":6629,"_33":6630,"_19":6631,"_36":6632,"_45":6485,"_47":6636,"_3956":6639},"c = chebfit(x, y, deg)","Least-squares Chebyshev fit","Fits a Chebyshev polynomial of the given degree to data using least squares.",[6633,6634,6635],{"_17":405,"_19":6410},{"_17":2467,"_19":6412},{"_17":6397,"_19":6414},[6637],{"_3949":6638},"chebfit([0 0.5 1], [1 1.5 2], 1)",[6478,6617],{"_17":6641,"_31":6642,"_33":6643,"_19":6644,"_36":6645,"_45":6648,"_47":6649,"_3956":6652},"cheb2poly","p = cheb2poly(c)","Convert Chebyshev to power series","Converts Chebyshev coefficients to power series coefficients.",[6646],{"_17":713,"_19":6647},"Chebyshev coefficients","Power series coefficients",[6650],{"_3949":6651},"cheb2poly([1 0 1])",[6653],"poly2cheb",{"_17":6655,"_31":6656,"_33":6657,"_19":6658,"_36":6659,"_45":6206,"_47":6663,"_3956":6666},"legval","y = legval(x, c)","Evaluate Legendre polynomial","Evaluates a Legendre polynomial at point x.",[6660,6661],{"_17":405,"_19":6203},{"_17":713,"_19":6662},"Legendre coefficient array",[6664],{"_3949":6665},"legval(0.5, [1 2 3])",[6667,6668],"legfit","legder",{"_17":6668,"_31":6670,"_33":6671,"_19":6672,"_36":6673,"_45":6257,"_47":6676,"_3956":6679},"dc = legder(c)\ndc = legder(c, m)","Legendre derivative","Differentiates a Legendre polynomial m times.",[6674,6675],{"_17":713,"_19":6662},{"_17":630,"_19":6256,"_41":10},[6677],{"_3949":6678},"legder([1 2 3])",[6680,6655],"legint",{"_17":6680,"_31":6682,"_33":6683,"_19":6684,"_36":6685,"_45":6273,"_47":6689,"_3956":6690},"ic = legint(c)\nic = legint(c, m)\nic = legint(c, m, k)","Legendre integral","Integrates a Legendre polynomial m times.",[6686,6687,6688],{"_17":713,"_19":6662},{"_17":630,"_19":6270,"_41":10},{"_17":4686,"_19":6523,"_41":10},[],[6668,6655],{"_17":6692,"_31":6693,"_33":6694,"_19":6695,"_36":6696,"_45":6289,"_47":6699,"_3956":6700},"legmul","c = legmul(c1, c2)","Multiply two Legendre polynomials","Multiplies two Legendre coefficient arrays.",[6697,6698],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6701,6702,6703],"legdiv","legadd","legsub",{"_17":6701,"_31":6705,"_33":6706,"_19":6707,"_36":6708,"_45":6550,"_47":6711,"_3956":6712},"[q, r] = legdiv(c1, c2)","Divide two Legendre polynomials","Divides two Legendre coefficient arrays.",[6709,6710],{"_17":726,"_19":6304},{"_17":729,"_19":6306},[],[6692],{"_17":6702,"_31":6714,"_33":6715,"_19":6716,"_36":6717,"_45":6319,"_47":6720,"_3956":6721},"c = legadd(c1, c2)","Add two Legendre polynomials","Adds two Legendre coefficient arrays.",[6718,6719],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6703,6692],{"_17":6703,"_31":6723,"_33":6724,"_19":6725,"_36":6726,"_45":6332,"_47":6729,"_3956":6730},"c = legsub(c1, c2)","Subtract two Legendre polynomials","Subtracts two Legendre coefficient arrays.",[6727,6728],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6702,6692],{"_17":6732,"_31":6733,"_33":6734,"_19":6735,"_36":6736,"_45":6348,"_47":6739,"_3956":6740},"legpow","c = legpow(c, n)","Raise Legendre polynomial to a power","Raises a Legendre polynomial to a non-negative integer power.",[6737,6738],{"_17":713,"_19":6345},{"_17":1206,"_19":6347},[],[6692],{"_17":6742,"_31":6743,"_33":6744,"_19":6745,"_36":6746,"_45":6360,"_47":6748,"_3956":6749},"legroots","r = legroots(c)","Find Legendre polynomial roots","Finds roots of a Legendre polynomial.",[6747],{"_17":713,"_19":6662},[],[6750,6751],"legfromroots","legcompanion",{"_17":6750,"_31":6753,"_33":6754,"_19":6755,"_36":6756,"_45":6662,"_47":6758,"_3956":6759},"c = legfromroots(r)","Construct Legendre polynomial from roots","Constructs Legendre coefficient array from roots.",[6757],{"_17":3795,"_19":6360},[],[6742],{"_17":6751,"_31":6761,"_33":6762,"_19":6763,"_36":6764,"_45":6383,"_47":6766,"_3956":6767},"C = legcompanion(c)","Legendre companion matrix","Generates the companion matrix for a Legendre polynomial.",[6765],{"_17":713,"_19":6662},[],[6742],{"_17":6769,"_31":6770,"_33":6771,"_19":6772,"_36":6773,"_45":6399,"_47":6776,"_3956":6777},"legvander","V = legvander(x, deg)","Legendre Vandermonde matrix","Generates a Legendre Vandermonde matrix.",[6774,6775],{"_17":405,"_19":6395},{"_17":6397,"_19":6398},[],[6667],{"_17":6667,"_31":6779,"_33":6780,"_19":6781,"_36":6782,"_45":6662,"_47":6786,"_3956":6787},"c = legfit(x, y, deg)","Least-squares Legendre fit","Fits a Legendre polynomial of the given degree to data using least squares.",[6783,6784,6785],{"_17":405,"_19":6410},{"_17":2467,"_19":6412},{"_17":6397,"_19":6414},[],[6655,6769],{"_17":6789,"_31":6790,"_33":6791,"_19":6792,"_36":6793,"_45":6648,"_47":6796,"_3956":6797},"leg2poly","p = leg2poly(c)","Convert Legendre to power series","Converts Legendre coefficients to power series coefficients.",[6794],{"_17":713,"_19":6795},"Legendre coefficients",[],[6798],"poly2leg",{"_17":6800,"_31":6801,"_33":6802,"_19":6803,"_36":6804,"_45":6206,"_47":6808,"_3956":6811},"hermval","y = hermval(x, c)","Evaluate Hermite polynomial","Evaluates a physicist's Hermite polynomial at point x.",[6805,6806],{"_17":405,"_19":6203},{"_17":713,"_19":6807},"Hermite coefficient array",[6809],{"_3949":6810},"hermval(1, [1 2 3])",[6812,6813],"hermfit","hermder",{"_17":6813,"_31":6815,"_33":6816,"_19":6817,"_36":6818,"_45":6257,"_47":6821,"_3956":6822},"dc = hermder(c)\ndc = hermder(c, m)","Hermite derivative","Differentiates a Hermite polynomial m times.",[6819,6820],{"_17":713,"_19":6807},{"_17":630,"_19":6256,"_41":10},[],[6823,6800],"hermint",{"_17":6823,"_31":6825,"_33":6826,"_19":6827,"_36":6828,"_45":6273,"_47":6832,"_3956":6833},"ic = hermint(c)\nic = hermint(c, m)\nic = hermint(c, m, k)","Hermite integral","Integrates a Hermite polynomial m times.",[6829,6830,6831],{"_17":713,"_19":6807},{"_17":630,"_19":6270,"_41":10},{"_17":4686,"_19":6523,"_41":10},[],[6813,6800],{"_17":6835,"_31":6836,"_33":6837,"_19":6838,"_36":6839,"_45":6289,"_47":6842,"_3956":6843},"hermmul","c = hermmul(c1, c2)","Multiply two Hermite polynomials","Multiplies two Hermite coefficient arrays.",[6840,6841],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6844,6845],"hermdiv","hermadd",{"_17":6844,"_31":6847,"_33":6848,"_19":6849,"_36":6850,"_45":6550,"_47":6853,"_3956":6854},"[q, r] = hermdiv(c1, c2)","Divide two Hermite polynomials","Divides two Hermite coefficient arrays.",[6851,6852],{"_17":726,"_19":6304},{"_17":729,"_19":6306},[],[6835],{"_17":6845,"_31":6856,"_33":6857,"_19":6858,"_36":6859,"_45":6319,"_47":6862,"_3956":6863},"c = hermadd(c1, c2)","Add two Hermite polynomials","Adds two Hermite coefficient arrays.",[6860,6861],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6864,6835],"hermsub",{"_17":6864,"_31":6866,"_33":6867,"_19":6868,"_36":6869,"_45":6332,"_47":6872,"_3956":6873},"c = hermsub(c1, c2)","Subtract two Hermite polynomials","Subtracts two Hermite coefficient arrays.",[6870,6871],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6845,6835],{"_17":6875,"_31":6876,"_33":6877,"_19":6878,"_36":6879,"_45":6348,"_47":6882,"_3956":6883},"hermpow","c = hermpow(c, n)","Raise Hermite polynomial to a power","Raises a Hermite polynomial to a non-negative integer power.",[6880,6881],{"_17":713,"_19":6345},{"_17":1206,"_19":6347},[],[6835],{"_17":6885,"_31":6886,"_33":6887,"_19":6888,"_36":6889,"_45":6360,"_47":6891,"_3956":6892},"hermroots","r = hermroots(c)","Find Hermite polynomial roots","Finds roots of a Hermite polynomial.",[6890],{"_17":713,"_19":6807},[],[6893,6894],"hermfromroots","hermcompanion",{"_17":6893,"_31":6896,"_33":6897,"_19":6898,"_36":6899,"_45":6807,"_47":6901,"_3956":6902},"c = hermfromroots(r)","Construct Hermite polynomial from roots","Constructs Hermite coefficient array from roots.",[6900],{"_17":3795,"_19":6360},[],[6885],{"_17":6894,"_31":6904,"_33":6905,"_19":6906,"_36":6907,"_45":6383,"_47":6909,"_3956":6910},"C = hermcompanion(c)","Hermite companion matrix","Generates the companion matrix for a Hermite polynomial.",[6908],{"_17":713,"_19":6807},[],[6885],{"_17":6912,"_31":6913,"_33":6914,"_19":6915,"_36":6916,"_45":6399,"_47":6919,"_3956":6920},"hermvander","V = hermvander(x, deg)","Hermite Vandermonde matrix","Generates a Hermite Vandermonde matrix.",[6917,6918],{"_17":405,"_19":6395},{"_17":6397,"_19":6398},[],[6812],{"_17":6812,"_31":6922,"_33":6923,"_19":6924,"_36":6925,"_45":6807,"_47":6929,"_3956":6930},"c = hermfit(x, y, deg)","Least-squares Hermite fit","Fits a Hermite polynomial of the given degree to data using least squares.",[6926,6927,6928],{"_17":405,"_19":6410},{"_17":2467,"_19":6412},{"_17":6397,"_19":6414},[],[6800,6912],{"_17":6932,"_31":6933,"_33":6934,"_19":6935,"_36":6936,"_45":6648,"_47":6939,"_3956":6940},"herm2poly","p = herm2poly(c)","Convert Hermite to power series","Converts Hermite coefficients to power series coefficients.",[6937],{"_17":713,"_19":6938},"Hermite coefficients",[],[6941],"poly2herm",{"_17":6943,"_31":6944,"_33":6945,"_19":6946,"_36":6947,"_45":6206,"_47":6951,"_3956":6952},"hermeval","y = hermeval(x, c)","Evaluate probabilist's Hermite polynomial","Evaluates a probabilist's Hermite (HermiteE) polynomial at point x.",[6948,6949],{"_17":405,"_19":6203},{"_17":713,"_19":6950},"HermiteE coefficient array",[],[6953,6954],"hermefit","hermeder",{"_17":6954,"_31":6956,"_33":6957,"_19":6958,"_36":6959,"_45":6257,"_47":6962,"_3956":6963},"dc = hermeder(c)\ndc = hermeder(c, m)","HermiteE derivative","Differentiates a HermiteE polynomial m times.",[6960,6961],{"_17":713,"_19":6950},{"_17":630,"_19":6256,"_41":10},[],[6964,6943],"hermeint",{"_17":6964,"_31":6966,"_33":6967,"_19":6968,"_36":6969,"_45":6273,"_47":6973,"_3956":6974},"ic = hermeint(c)\nic = hermeint(c, m)\nic = hermeint(c, m, k)","HermiteE integral","Integrates a HermiteE polynomial m times.",[6970,6971,6972],{"_17":713,"_19":6950},{"_17":630,"_19":6270,"_41":10},{"_17":4686,"_19":6523,"_41":10},[],[6954,6943],{"_17":6976,"_31":6977,"_33":6978,"_19":6979,"_36":6980,"_45":6289,"_47":6983,"_3956":6984},"hermemul","c = hermemul(c1, c2)","Multiply two HermiteE polynomials","Multiplies two HermiteE coefficient arrays.",[6981,6982],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6985,6986],"hermediv","hermeadd",{"_17":6985,"_31":6988,"_33":6989,"_19":6990,"_36":6991,"_45":6550,"_47":6994,"_3956":6995},"[q, r] = hermediv(c1, c2)","Divide two HermiteE polynomials","Divides two HermiteE coefficient arrays.",[6992,6993],{"_17":726,"_19":6304},{"_17":729,"_19":6306},[],[6976],{"_17":6986,"_31":6997,"_33":6998,"_19":6999,"_36":7000,"_45":6319,"_47":7003,"_3956":7004},"c = hermeadd(c1, c2)","Add two HermiteE polynomials","Adds two HermiteE coefficient arrays.",[7001,7002],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[7005,6976],"hermesub",{"_17":7005,"_31":7007,"_33":7008,"_19":7009,"_36":7010,"_45":6332,"_47":7013,"_3956":7014},"c = hermesub(c1, c2)","Subtract two HermiteE polynomials","Subtracts two HermiteE coefficient arrays.",[7011,7012],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[6986,6976],{"_17":7016,"_31":7017,"_33":7018,"_19":7019,"_36":7020,"_45":6348,"_47":7023,"_3956":7024},"hermepow","c = hermepow(c, n)","Raise HermiteE polynomial to a power","Raises a HermiteE polynomial to a non-negative integer power.",[7021,7022],{"_17":713,"_19":6345},{"_17":1206,"_19":6347},[],[6976],{"_17":7026,"_31":7027,"_33":7028,"_19":7029,"_36":7030,"_45":6360,"_47":7032,"_3956":7033},"hermeroots","r = hermeroots(c)","Find HermiteE polynomial roots","Finds roots of a HermiteE polynomial.",[7031],{"_17":713,"_19":6950},[],[7034,7035],"hermefromroots","hermecompanion",{"_17":7034,"_31":7037,"_33":7038,"_19":7039,"_36":7040,"_45":6950,"_47":7042,"_3956":7043},"c = hermefromroots(r)","Construct HermiteE polynomial from roots","Constructs HermiteE coefficient array from roots.",[7041],{"_17":3795,"_19":6360},[],[7026],{"_17":7035,"_31":7045,"_33":7046,"_19":7047,"_36":7048,"_45":6383,"_47":7050,"_3956":7051},"C = hermecompanion(c)","HermiteE companion matrix","Generates the companion matrix for a HermiteE polynomial.",[7049],{"_17":713,"_19":6950},[],[7026],{"_17":7053,"_31":7054,"_33":7055,"_19":7056,"_36":7057,"_45":6399,"_47":7060,"_3956":7061},"hermevander","V = hermevander(x, deg)","HermiteE Vandermonde matrix","Generates a HermiteE Vandermonde matrix.",[7058,7059],{"_17":405,"_19":6395},{"_17":6397,"_19":6398},[],[6953],{"_17":6953,"_31":7063,"_33":7064,"_19":7065,"_36":7066,"_45":6950,"_47":7070,"_3956":7071},"c = hermefit(x, y, deg)","Least-squares HermiteE fit","Fits a HermiteE polynomial of the given degree to data using least squares.",[7067,7068,7069],{"_17":405,"_19":6410},{"_17":2467,"_19":6412},{"_17":6397,"_19":6414},[],[6943,7053],{"_17":7073,"_31":7074,"_33":7075,"_19":7076,"_36":7077,"_45":6648,"_47":7080,"_3956":7081},"herme2poly","p = herme2poly(c)","Convert HermiteE to power series","Converts HermiteE coefficients to power series coefficients.",[7078],{"_17":713,"_19":7079},"HermiteE coefficients",[],[7082],"poly2herme",{"_17":7084,"_31":7085,"_33":7086,"_19":7087,"_36":7088,"_45":6206,"_47":7092,"_3956":7095},"lagval","y = lagval(x, c)","Evaluate Laguerre polynomial","Evaluates a Laguerre polynomial at point x.",[7089,7090],{"_17":405,"_19":6203},{"_17":713,"_19":7091},"Laguerre coefficient array",[7093],{"_3949":7094},"lagval(1, [1 2 3])",[7096,7097],"lagfit","lagder",{"_17":7097,"_31":7099,"_33":7100,"_19":7101,"_36":7102,"_45":6257,"_47":7105,"_3956":7106},"dc = lagder(c)\ndc = lagder(c, m)","Laguerre derivative","Differentiates a Laguerre polynomial m times.",[7103,7104],{"_17":713,"_19":7091},{"_17":630,"_19":6256,"_41":10},[],[7107,7084],"lagint",{"_17":7107,"_31":7109,"_33":7110,"_19":7111,"_36":7112,"_45":6273,"_47":7116,"_3956":7117},"ic = lagint(c)\nic = lagint(c, m)\nic = lagint(c, m, k)","Laguerre integral","Integrates a Laguerre polynomial m times.",[7113,7114,7115],{"_17":713,"_19":7091},{"_17":630,"_19":6270,"_41":10},{"_17":4686,"_19":6523,"_41":10},[],[7097,7084],{"_17":7119,"_31":7120,"_33":7121,"_19":7122,"_36":7123,"_45":6289,"_47":7126,"_3956":7127},"lagmul","c = lagmul(c1, c2)","Multiply two Laguerre polynomials","Multiplies two Laguerre coefficient arrays.",[7124,7125],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[7128,7129],"lagdiv","lagadd",{"_17":7128,"_31":7131,"_33":7132,"_19":7133,"_36":7134,"_45":6550,"_47":7137,"_3956":7138},"[q, r] = lagdiv(c1, c2)","Divide two Laguerre polynomials","Divides two Laguerre coefficient arrays.",[7135,7136],{"_17":726,"_19":6304},{"_17":729,"_19":6306},[],[7119],{"_17":7129,"_31":7140,"_33":7141,"_19":7142,"_36":7143,"_45":6319,"_47":7146,"_3956":7147},"c = lagadd(c1, c2)","Add two Laguerre polynomials","Adds two Laguerre coefficient arrays.",[7144,7145],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[7148,7119],"lagsub",{"_17":7148,"_31":7150,"_33":7151,"_19":7152,"_36":7153,"_45":6332,"_47":7156,"_3956":7157},"c = lagsub(c1, c2)","Subtract two Laguerre polynomials","Subtracts two Laguerre coefficient arrays.",[7154,7155],{"_17":726,"_19":6286},{"_17":729,"_19":6288},[],[7129,7119],{"_17":7159,"_31":7160,"_33":7161,"_19":7162,"_36":7163,"_45":6348,"_47":7166,"_3956":7167},"lagpow","c = lagpow(c, n)","Raise Laguerre polynomial to a power","Raises a Laguerre polynomial to a non-negative integer power.",[7164,7165],{"_17":713,"_19":6345},{"_17":1206,"_19":6347},[],[7119],{"_17":7169,"_31":7170,"_33":7171,"_19":7172,"_36":7173,"_45":6360,"_47":7175,"_3956":7176},"lagroots","r = lagroots(c)","Find Laguerre polynomial roots","Finds roots of a Laguerre polynomial.",[7174],{"_17":713,"_19":7091},[],[7177,7178],"lagfromroots","lagcompanion",{"_17":7177,"_31":7180,"_33":7181,"_19":7182,"_36":7183,"_45":7091,"_47":7185,"_3956":7186},"c = lagfromroots(r)","Construct Laguerre polynomial from roots","Constructs Laguerre coefficient array from roots.",[7184],{"_17":3795,"_19":6360},[],[7169],{"_17":7178,"_31":7188,"_33":7189,"_19":7190,"_36":7191,"_45":6383,"_47":7193,"_3956":7194},"C = lagcompanion(c)","Laguerre companion matrix","Generates the companion matrix for a Laguerre polynomial.",[7192],{"_17":713,"_19":7091},[],[7169],{"_17":7196,"_31":7197,"_33":7198,"_19":7199,"_36":7200,"_45":6399,"_47":7203,"_3956":7204},"lagvander","V = lagvander(x, deg)","Laguerre Vandermonde matrix","Generates a Laguerre Vandermonde matrix.",[7201,7202],{"_17":405,"_19":6395},{"_17":6397,"_19":6398},[],[7096],{"_17":7096,"_31":7206,"_33":7207,"_19":7208,"_36":7209,"_45":7091,"_47":7213,"_3956":7214},"c = lagfit(x, y, deg)","Least-squares Laguerre fit","Fits a Laguerre polynomial of the given degree to data using least squares.",[7210,7211,7212],{"_17":405,"_19":6410},{"_17":2467,"_19":6412},{"_17":6397,"_19":6414},[],[7084,7196],{"_17":7216,"_31":7217,"_33":7218,"_19":7219,"_36":7220,"_45":6648,"_47":7223,"_3956":7224},"lag2poly","p = lag2poly(c)","Convert Laguerre to power series","Converts Laguerre coefficients to power series coefficients.",[7221],{"_17":713,"_19":7222},"Laguerre coefficients",[],[7225],"poly2lag",{"_17":6653,"_31":7227,"_33":7228,"_19":7229,"_36":7230,"_45":6647,"_47":7232,"_3956":7235},"cc = poly2cheb(c)","Convert power series to Chebyshev","Converts power series coefficients to Chebyshev coefficients.",[7231],{"_17":713,"_19":6648},[7233],{"_3949":7234},"poly2cheb([1 0 1])",[6641],{"_17":6798,"_31":7237,"_33":7238,"_19":7239,"_36":7240,"_45":6795,"_47":7242,"_3956":7243},"lc = poly2leg(c)","Convert power series to Legendre","Converts power series coefficients to Legendre coefficients.",[7241],{"_17":713,"_19":6648},[],[6789],{"_17":6941,"_31":7245,"_33":7246,"_19":7247,"_36":7248,"_45":6938,"_47":7250,"_3956":7251},"hc = poly2herm(c)","Convert power series to Hermite","Converts power series coefficients to Hermite coefficients.",[7249],{"_17":713,"_19":6648},[],[6932],{"_17":7082,"_31":7253,"_33":7254,"_19":7255,"_36":7256,"_45":7079,"_47":7258,"_3956":7259},"hc = poly2herme(c)","Convert power series to HermiteE","Converts power series coefficients to HermiteE coefficients.",[7257],{"_17":713,"_19":6648},[],[7073],{"_17":7225,"_31":7261,"_33":7262,"_19":7263,"_36":7264,"_45":7222,"_47":7266,"_3956":7267},"lc = poly2lag(c)","Convert power series to Laguerre","Converts power series coefficients to Laguerre coefficients.",[7265],{"_17":713,"_19":6648},[],[7216],{"_17":7269,"_31":7270,"_33":7271,"_19":7272,"_36":7273,"_45":7277,"_47":7278,"_3956":7282},"trimcoef","ct = trimcoef(c)\nct = trimcoef(c, tol)","Remove small trailing coefficients","Removes trailing elements with absolute value less than or equal to tol.",[7274,7275],{"_17":713,"_19":6345},{"_17":470,"_19":7276,"_41":10},"Tolerance (default: 0)","Trimmed coefficient array",[7279],{"_3949":7280,"_3951":7281},"trimcoef([1 2 3 0 0])","[1 2 3]",[7283],"trimseq",{"_17":7283,"_31":7285,"_33":7286,"_19":7287,"_36":7288,"_45":7291,"_47":7292,"_3956":7296},"ct = trimseq(c)","Remove trailing zeros","Removes trailing zeros from a coefficient sequence.",[7289],{"_17":713,"_19":7290},"Coefficient sequence","Trimmed sequence",[7293],{"_3949":7294,"_3951":7295},"trimseq([1 2 0 0])","[1 2]",[7269],{"_17":7298,"_31":7299,"_33":7300,"_19":7301,"_36":7302,"_45":7305,"_47":7306,"_3956":7310},"getdomain","d = getdomain(x)","Get domain from data points","Returns the minimum and maximum of the data as the domain [min, max].",[7303],{"_17":405,"_19":7304},"Data points","[min, max] domain",[7307],{"_3949":7308,"_3951":7309},"getdomain([1 2 3 4 5])","[1 5]",[7311,7312],"mapdomain","mapparms",{"_17":7311,"_31":7314,"_33":7315,"_19":7316,"_36":7317,"_45":7324,"_47":7325,"_3956":7328},"y = mapdomain(x, old, new)","Map values between domains","Maps x from the old domain to the new domain using a linear transformation.",[7318,7320,7322],{"_17":405,"_19":7319},"Values to map",{"_17":4793,"_19":7321},"Original domain [min, max]",{"_17":4796,"_19":7323},"Target domain [min, max]","Mapped values",[7326],{"_3949":7327,"_3951":4253},"mapdomain(0.5, [0 1], [-1 1])",[7312,7298],{"_17":7312,"_31":7330,"_33":7331,"_19":7332,"_36":7333,"_45":7336,"_47":7337,"_3956":7341},"[off, scl] = mapparms(old, new)","Get linear mapping parameters","Returns [offset, scale] such that new = offset + scale * old.",[7334,7335],{"_17":4793,"_19":7321},{"_17":4796,"_19":7323},"[offset, scale]",[7338],{"_3949":7339,"_3951":7340},"mapparms([0 1], [-1 1])","[-1 2]",[7311,7298],{"_15":7343,"_17":7344,"_19":7345,"_21":22,"_23":7346,"_27":7347},"symbolic","Symbolic Mathematics","MATLAB-compatible symbolic mathematics functions for creating symbolic variables, solving equations, expanding expressions, and more. Powered by SymEngine via symngwasm.","🔣",[7348,7371,7389,7408,7428,7444,7459,7485,7506,7527],{"_17":7349,"_31":7350,"_33":7351,"_19":7352,"_36":7353,"_45":7356,"_47":7357,"_3956":7368},"sym","x = sym(s)\nx = sym(n)","Create symbolic variable or expression","Creates a symbolic variable from a string name or converts a number to a symbolic number. Supports both function syntax sym('x') and command syntax sym x.\n\nWhen given a simple variable name, creates a symbolic variable. When given an expression string, parses it into a symbolic expression.",[7354],{"_17":771,"_19":7355},"Variable name (string) or numeric value to convert","Symbolic variable or expression",[7358,7360,7362,7365],{"_3949":7359,"_3951":405},"x = sym('x')",{"_3949":7361,"_3951":405},"sym x",{"_3949":7363,"_3951":7364},"f = sym('x^2 + 2*x + 1')","x^2 + 2*x + 1",{"_3949":7366,"_3951":7367},"half = sym(1/2)","1/2",[7369,2497,7370],"syms","expand",{"_17":7369,"_31":7372,"_33":7373,"_19":7374,"_36":7375,"_45":7379,"_47":7380,"_3956":7387},"syms x y z\nsyms('x', 'y', 'z')","Create multiple symbolic variables","Creates multiple symbolic variables and assigns them to the workspace. Supports both command syntax syms x y z and function syntax syms('x', 'y', 'z').\n\nEach variable name becomes a symbolic variable in the current workspace.",[7376],{"_17":7377,"_19":7378},"vars","Variable names (space-separated for command syntax, or multiple string arguments)","Creates variables in workspace (no return value)",[7381,7384],{"_3949":7382,"_3951":7383},"syms x y z","% Creates x, y, z as symbolic variables",{"_3949":7385,"_3951":7386},"syms('a', 'b')","% Creates a, b as symbolic variables",[7349,2497,7388],"subs",{"_17":2497,"_31":7390,"_33":7391,"_19":7392,"_36":7393,"_45":7399,"_47":7400,"_3956":7407},"S = solve(eqn, var)\nS = solve(eqn)","Solve symbolic equation","Solves a symbolic equation for the specified variable. The equation can be an expression (assumed equal to zero) or an equation created with ==.\n\nReturns an array of solutions. For polynomial equations, includes all roots (real and complex).",[7394,7397],{"_17":7395,"_19":7396},"eqn","Symbolic equation or expression (assumed = 0)",{"_17":4431,"_19":7398,"_41":10},"Variable to solve for","Array of symbolic solutions",[7401,7404],{"_3949":7402,"_3951":7403},"syms x; solve(x^2 - 1, x)","[-1, 1]",{"_3949":7405,"_3951":7406},"syms x; solve(x^2 + x - 6, x)","[-3, 2]",[7349,7369,7370,7388],{"_17":7388,"_31":7409,"_33":7410,"_19":7411,"_36":7412,"_45":7420,"_47":7421,"_3956":7427},"g = subs(f, old, new)\ng = subs(f, var, value)","Substitute in symbolic expression","Substitutes old with new in the symbolic expression f. Can substitute a variable with a value or an expression with another expression.\n\nUseful for evaluating symbolic expressions at specific values or simplifying by replacement.",[7413,7416,7418],{"_17":7414,"_19":7415},"f","Symbolic expression",{"_17":4793,"_19":7417},"Symbol or expression to replace",{"_17":4796,"_19":7419},"Replacement value or expression","Expression with substitution applied",[7422,7424],{"_3949":7423,"_3951":4358},"syms x; subs(x^2 + 1, x, 2)",{"_3949":7425,"_3951":7426},"syms x y; subs(x + y, x, y^2)","y^2 + y",[7349,2497,7370],{"_17":7370,"_31":7429,"_33":7430,"_19":7431,"_36":7432,"_45":7435,"_47":7436,"_3956":7442},"g = expand(f)","Expand symbolic expression","Expands products and powers in the symbolic expression. Distributes multiplication over addition and expands powers of sums.\n\nExample: expand((x+1)^2) returns x^2 + 2*x + 1",[7433],{"_17":7414,"_19":7434},"Symbolic expression to expand","Expanded expression",[7437,7439],{"_3949":7438,"_3951":7364},"syms x; expand((x + 1)^2)",{"_3949":7440,"_3951":7441},"syms x y; expand((x + y)*(x - y))","x^2 - y^2",[7349,7443,2923],"simplify",{"_17":7443,"_31":7445,"_33":7446,"_19":7447,"_36":7448,"_45":7451,"_47":7452,"_3956":7457},"g = simplify(f)","Simplify symbolic expression","Simplifies a symbolic expression using various algebraic rules. Combines like terms, cancels common factors, and applies trigonometric identities.",[7449],{"_17":7414,"_19":7450},"Symbolic expression to simplify","Simplified expression",[7453,7455],{"_3949":7454,"_3951":405},"syms x; simplify(x^2/x)",{"_3949":7456,"_3951":4163},"syms x; simplify(sin(x)^2 + cos(x)^2)",[7370,2923,7458],"collect",{"_17":7460,"_31":7461,"_33":7462,"_19":7463,"_36":7464,"_45":7471,"_47":7472,"_3956":7482},"diff","df = diff(f, x)\ndf = diff(f, x, n)","Symbolic differentiation","Computes the symbolic derivative of f with respect to x. If n is specified, computes the nth derivative.\n\nSupports all elementary functions including trigonometric, exponential, and logarithmic.",[7465,7467,7469],{"_17":7414,"_19":7466},"Symbolic expression to differentiate",{"_17":405,"_19":7468},"Variable to differentiate with respect to",{"_17":1206,"_19":7470,"_41":10},"Order of derivative (default: 1)","Derivative expression",[7473,7476,7479],{"_3949":7474,"_3951":7475},"syms x; diff(x^3, x)","3*x^2",{"_3949":7477,"_3951":7478},"syms x; diff(sin(x), x)","cos(x)",{"_3949":7480,"_3951":7481},"syms x; diff(x^3, x, 2)","6*x",[7483,7484,7349],"int","taylor",{"_17":7484,"_31":7486,"_33":7487,"_19":7488,"_36":7489,"_45":7497,"_47":7498,"_3956":7505},"T = taylor(f, x)\nT = taylor(f, x, a)\nT = taylor(f, x, a, n)","Taylor series expansion","Computes the Taylor series expansion of f around the point a (default 0). Returns a polynomial approximation with n terms (default 6).\n\nThe result is a symbolic polynomial representing the truncated Taylor series.",[7490,7491,7493,7495],{"_17":7414,"_19":7434},{"_17":405,"_19":7492},"Expansion variable",{"_17":664,"_19":7494,"_41":10},"Expansion point (default: 0)",{"_17":1206,"_19":7496,"_41":10},"Number of terms (default: 6)","Taylor polynomial",[7499,7502],{"_3949":7500,"_3951":7501},"syms x; taylor(exp(x), x, 0, 4)","1 + x + x^2/2 + x^3/6",{"_3949":7503,"_3951":7504},"syms x; taylor(sin(x), x)","x - x^3/6 + x^5/120",[7460,7370,7349],{"_17":7507,"_31":7508,"_33":7509,"_19":7510,"_36":7511,"_45":7517,"_47":7518,"_3956":7525},"assume","assume(x, prop)\nassume x prop","Set assumption on symbolic variable","Sets an assumption on a symbolic variable. Assumptions affect simplification and solving.\n\nCommon assumptions: positive, negative, real, integer, rational",[7512,7514],{"_17":405,"_19":7513},"Symbolic variable",{"_17":7515,"_19":7516},"prop","Property to assume (e.g., 'positive', 'real', 'integer')","Nothing (modifies variable in place)",[7519,7522],{"_3949":7520,"_3951":7521},"syms x; assume(x, 'positive')","% x is now assumed positive",{"_3949":7523,"_3951":7524},"assume x real","% x is now assumed real",[7526,7349,7369],"assumptions",{"_17":7526,"_31":7528,"_33":7529,"_19":7530,"_36":7531,"_45":7534,"_47":7535,"_3956":7539},"a = assumptions(x)","Get assumptions on symbolic variable","Returns the current assumptions on a symbolic variable as a string.",[7532],{"_17":405,"_19":7533},"Symbolic variable to query","String describing assumptions",[7536],{"_3949":7537,"_3951":7538},"syms x; assume(x, 'positive'); assumptions(x)","'positive'",[7507,7349,7369],{"_15":7541,"_17":7542,"_19":7543,"_21":22,"_23":7544,"_25":7541,"_27":7545},"vtk","3D Visualization (VTK)","Advanced 3D visualization functions powered by VTK.js for volumetric data, FEM meshes, and scientific visualization.","🧊",[7546,7568,7591,7612,7632,7654,7672,7695,7713,7729,7740,7752,7763,7772,7781,7794,7807,7822],{"_17":7547,"_31":7548,"_33":7549,"_19":7550,"_36":7551,"_45":7560,"_47":7561,"_3956":7564},"vtk.polydata","vtk.polydata(points, polys)\nvtk.polydata(points, polys, scalars)","Create PolyData geometry","Creates a VTK PolyData visualization from points and polygon connectivity. Points should be an Nx3 matrix of [x, y, z] coordinates. Polys defines polygon connectivity. Optional scalars provide per-point coloring.",[7552,7554,7557],{"_17":1610,"_19":7553},"Nx3 matrix of point coordinates",{"_17":7555,"_19":7556},"polys","Polygon connectivity array (VTK format: [npts, p1, p2, ...])",{"_17":7558,"_19":7559,"_41":10},"scalars","Per-point scalar values for coloring","null (renders VTK visualization inline)",[7562],{"_3949":7563},"% Create a simple triangle\npoints = [0 0 0; 1 0 0; 0.5 1 0];\npolys = [3 0 1 2]; % triangle with 3 vertices\nvtk.polydata(points, polys)",[7565,7566,7567],"vtk.volume","vtk.femgrid","vtk.sphere",{"_17":7565,"_31":7569,"_33":7570,"_19":7571,"_36":7572,"_45":7584,"_47":7585,"_3956":7588},"vtk.volume(data, dims)\nvtk.volume(data, dims, spacing)\nvtk.volume(data, dims, spacing, origin)","Create volumetric visualization","Creates a VTK volume rendering from 3D scalar data. The data array contains voxel values in row-major order. Dims specifies [nx, ny, nz] dimensions. Optional spacing and origin control physical coordinates.",[7573,7575,7578,7581],{"_17":1215,"_19":7574},"Flat array of scalar values (nx*ny*nz elements)",{"_17":7576,"_19":7577},"dims","3-element vector [nx, ny, nz] specifying grid dimensions",{"_17":7579,"_19":7580,"_41":10},"spacing","3-element vector [dx, dy, dz] for voxel spacing (default: [1,1,1])",{"_17":7582,"_19":7583,"_41":10},"origin","3-element vector [x0, y0, z0] for grid origin (default: [0,0,0])","null (renders VTK volume inline)",[7586],{"_3949":7587},"% Create a 3D Gaussian blob\n[X, Y, Z] = meshgrid(-2:0.1:2);\ndata = exp(-(X.^2 + Y.^2 + Z.^2));\nvtk.volume(data(:), size(data))",[7589,7590,7547],"vtk.isosurface","vtk.slice",{"_17":7589,"_31":7592,"_33":7593,"_19":7594,"_36":7595,"_45":7607,"_47":7608,"_3956":7611},"vtk.isosurface(data, dims, isovalue)\nvtk.isosurface(data, dims, spacing, origin, isovalue)","Extract and render isosurface","Extracts an isosurface from 3D volumetric data at the specified scalar value. Creates a surface representation of the contour where data equals the isovalue.",[7596,7598,7600,7602,7604],{"_17":1215,"_19":7597},"Flat array of scalar values",{"_17":7576,"_19":7599},"3-element vector [nx, ny, nz]",{"_17":7579,"_19":7601,"_41":10},"Voxel spacing (default: [1,1,1])",{"_17":7582,"_19":7603,"_41":10},"Grid origin (default: [0,0,0])",{"_17":7605,"_19":7606},"isovalue","Scalar value for the isosurface","null (renders isosurface inline)",[7609],{"_3949":7610},"% Extract isosurface from a sphere function\n[X, Y, Z] = meshgrid(-2:0.1:2);\ndata = X.^2 + Y.^2 + Z.^2;\nvtk.isosurface(data(:), size(data), 1.0) % sphere of radius 1",[7565,7547],{"_17":7566,"_31":7613,"_33":7614,"_19":7615,"_36":7616,"_45":7627,"_47":7628,"_3956":7631},"vtk.femgrid(nodes, elements, elementTypes)\nvtk.femgrid(nodes, elements, elementTypes, scalars)","Visualize FEM unstructured grid","Creates a VTK unstructured grid visualization for finite element meshes. Nodes is an Nx3 matrix of coordinates. Elements defines cell connectivity. ElementTypes specifies VTK cell types (10=tetra, 12=hex, 5=tri, 9=quad).",[7617,7620,7622,7625],{"_17":7618,"_19":7619},"nodes","Nx3 matrix of node coordinates",{"_17":2876,"_19":7621},"Cell connectivity in VTK format [npts, n1, n2, ...]",{"_17":7623,"_19":7624},"elementTypes","Array of VTK cell type codes for each element",{"_17":7558,"_19":7626,"_41":10},"Per-node or per-cell scalar field (e.g., stress, temperature)","null (renders FEM mesh inline)",[7629],{"_3949":7630},"% Create a simple tetrahedral mesh\nnodes = [0 0 0; 1 0 0; 0.5 1 0; 0.5 0.5 1];\nelements = [4 0 1 2 3]; % one tetrahedron\ntypes = [10]; % VTK_TETRA\nvtk.femgrid(nodes, elements, types)",[7547,7565],{"_17":7567,"_31":7633,"_33":7634,"_19":7635,"_36":7636,"_45":7644,"_47":7645,"_3956":7650},"vtk.sphere()\nvtk.sphere(radius)\nvtk.sphere(radius, center)\nvtk.sphere(radius, center, resolution)","Create sphere geometry","Creates a VTK sphere source with specified radius, center, and resolution. Useful for quick testing and demonstrations.",[7637,7639,7641],{"_17":2829,"_19":7638,"_41":10},"Sphere radius (default: 1)",{"_17":547,"_19":7640,"_41":10},"3-element vector [x, y, z] for center (default: [0,0,0])",{"_17":7642,"_19":7643,"_41":10},"resolution","Number of phi/theta divisions (default: 32)","null (renders sphere inline)",[7646,7648],{"_3949":7647},"vtk.sphere() % unit sphere at origin",{"_3949":7649},"vtk.sphere(2, [1 0 0], 64) % radius 2, centered at (1,0,0), high resolution",[7651,7652,7653],"vtk.cone","vtk.cube","vtk.cylinder",{"_17":7651,"_31":7655,"_33":7656,"_19":7657,"_36":7658,"_45":7665,"_47":7666,"_3956":7671},"vtk.cone()\nvtk.cone(height, radius)\nvtk.cone(height, radius, center)","Create cone geometry","Creates a VTK cone source with specified height, radius, and center.",[7659,7661,7663],{"_17":651,"_19":7660,"_41":10},"Cone height (default: 1)",{"_17":2829,"_19":7662,"_41":10},"Base radius (default: 0.5)",{"_17":547,"_19":7664,"_41":10},"3-element center position (default: [0,0,0])","null (renders cone inline)",[7667,7669],{"_3949":7668},"vtk.cone()",{"_3949":7670},"vtk.cone(2, 1, [0 0 1])",[7567,7652,7653],{"_17":7652,"_31":7673,"_33":7674,"_19":7675,"_36":7676,"_45":7688,"_47":7689,"_3956":7694},"vtk.cube()\nvtk.cube(size)\nvtk.cube(xLen, yLen, zLen)","Create cube/box geometry","Creates a VTK cube (box) source with specified dimensions.",[7677,7679,7682,7685],{"_17":1865,"_19":7678,"_41":10},"Uniform size for all dimensions (default: 1)",{"_17":7680,"_19":7681,"_41":10},"xLen","X dimension length",{"_17":7683,"_19":7684,"_41":10},"yLen","Y dimension length",{"_17":7686,"_19":7687,"_41":10},"zLen","Z dimension length","null (renders cube inline)",[7690,7692],{"_3949":7691},"vtk.cube()",{"_3949":7693},"vtk.cube(2, 1, 0.5) % rectangular box",[7567,7651,7653],{"_17":7653,"_31":7696,"_33":7697,"_19":7698,"_36":7699,"_45":7706,"_47":7707,"_3956":7712},"vtk.cylinder()\nvtk.cylinder(height, radius)\nvtk.cylinder(height, radius, resolution)","Create cylinder geometry","Creates a VTK cylinder source with specified height, radius, and resolution.",[7700,7702,7704],{"_17":651,"_19":7701,"_41":10},"Cylinder height (default: 1)",{"_17":2829,"_19":7703,"_41":10},"Cylinder radius (default: 0.5)",{"_17":7642,"_19":7705,"_41":10},"Number of facets around circumference (default: 32)","null (renders cylinder inline)",[7708,7710],{"_3949":7709},"vtk.cylinder()",{"_3949":7711},"vtk.cylinder(3, 0.5, 64)",[7567,7651,7652],{"_17":7714,"_31":7715,"_33":7716,"_19":7717,"_36":7718,"_45":5794,"_47":7721,"_3956":7726},"vtk.colormap","vtk.colormap('name')","Set VTK colormap","Sets the colormap for subsequent VTK visualizations. Available colormaps: 'viridis', 'rainbow', 'coolwarm', 'grayscale', 'jet', 'hot'.",[7719],{"_17":17,"_19":7720},"Colormap name",[7722,7724],{"_3949":7723},"vtk.colormap('coolwarm')",{"_3949":7725},"vtk.colormap('viridis'); vtk.volume(data, dims)",[7727,7728],"vtk.opacity","vtk.edges",{"_17":7727,"_31":7730,"_33":7731,"_19":7732,"_36":7733,"_45":5794,"_47":7736,"_3956":7739},"vtk.opacity(value)","Set VTK opacity","Sets the opacity (0-1) for subsequent VTK visualizations.",[7734],{"_17":514,"_19":7735},"Opacity value between 0 (transparent) and 1 (opaque)",[7737],{"_3949":7738},"vtk.opacity(0.7)",[7714,7728],{"_17":7728,"_31":7741,"_33":7742,"_19":7743,"_36":7744,"_45":5794,"_47":7747,"_3956":7750},"vtk.edges('on')\nvtk.edges('off')","Toggle edge visibility","Enables or disables edge rendering for surface meshes. Useful for FEM visualization.",[7745],{"_17":5930,"_19":7746},"'on' or 'off'",[7748],{"_3949":7749},"vtk.edges('on')",[7714,7751],"vtk.wireframe",{"_17":7751,"_31":7753,"_33":7754,"_19":7755,"_36":7756,"_45":5794,"_47":7757,"_3956":7760},"vtk.wireframe()","Set wireframe rendering","Sets the rendering mode to wireframe for subsequent VTK visualizations.",[],[7758],{"_3949":7759},"vtk.wireframe(); vtk.sphere()",[7761,7762,7728],"vtk.surface","vtk.points",{"_17":7761,"_31":7764,"_33":7765,"_19":7766,"_36":7767,"_45":5794,"_47":7768,"_3956":7771},"vtk.surface()","Set surface rendering","Sets the rendering mode to filled surface for subsequent VTK visualizations (default mode).",[],[7769],{"_3949":7770},"vtk.surface(); vtk.sphere()",[7751,7762],{"_17":7762,"_31":7773,"_33":7774,"_19":7775,"_36":7776,"_45":5794,"_47":7777,"_3956":7780},"vtk.points()","Set point rendering","Sets the rendering mode to points only for subsequent VTK visualizations.",[],[7778],{"_3949":7779},"vtk.points(); vtk.sphere()",[7751,7761],{"_17":7782,"_31":7783,"_33":7784,"_19":7785,"_36":7786,"_45":7560,"_47":7789,"_3956":7792},"vtk.mesh","vtk.mesh(mesh)","Visualize an MFEM mesh","Renders an MFEM mesh object directly. The mesh is exported to VTK format internally and displayed as an unstructured grid visualization. For solution visualization with scalar coloring, use vtk.gridfunction() instead.",[7787],{"_17":418,"_19":7788},"MFEM Mesh object (from mfem.mesh.makeCartesian2D, etc.)",[7790],{"_3949":7791},"mesh = mfem.mesh.makeCartesian2D(10, 10, 'TRIANGLE', true, 1.0, 1.0)\nvtk.edges('on')\nvtk.mesh(mesh)",[7793,7566,7714],"vtk.gridfunction",{"_17":7795,"_31":7796,"_33":7797,"_19":7798,"_36":7799,"_45":7802,"_47":7803,"_3956":7806},"vtk.meshCoordinates","coords = vtk.meshCoordinates(mesh)","Get mesh vertex coordinates","Extracts the x, y, and z coordinates of all mesh vertices. Returns a struct with x, y, z arrays and the number of vertices.",[7800],{"_17":418,"_19":7801},"MFEM Mesh object","Struct with fields: x, y, z (NDArrays) and numVertices (number)",[7804],{"_3949":7805},"mesh = mfem.mesh.makeCartesian2D(10, 10)\ncoords = vtk.meshCoordinates(mesh)\ndisp(coords.x) % x-coordinates of all vertices\ndisp(coords.y) % y-coordinates of all vertices",[7782,7793],{"_17":7793,"_31":7808,"_33":7809,"_19":7810,"_36":7811,"_45":7560,"_47":7816,"_3956":7821},"vtk.gridfunction(mesh, gf)","Visualize MFEM GridFunction with scalar coloring","Renders an MFEM GridFunction on its mesh, with vertices colored by the solution values. Use vtk.colormap() to set the color scheme before calling this function.",[7812,7814],{"_17":418,"_19":7813},"MFEM Mesh object (the mesh on which the GridFunction is defined)",{"_17":537,"_19":7815},"MFEM GridFunction object containing the finite element solution",[7817,7819],{"_3949":7818},"vtk.colormap('viridis')\nvtk.gridfunction(mesh, solution)",{"_3949":7820},"vtk.colormap('coolwarm')\nvtk.edges('on')\nvtk.gridfunction(mesh, x)",[7782,7714,7728],{"_17":7823,"_31":7824,"_33":7825,"_19":7826,"_36":7827,"_45":7834,"_47":7835,"_3956":7838},"vtk.displacement","vtk.displacement(mesh, u)\nvtk.displacement(mesh, u, scaleFactor)","Visualize displacement field on deformed mesh","Renders a vector displacement field by deforming the mesh and coloring by displacement magnitude. The scaleFactor amplifies the deformation for visualization of small displacements (default: 1).",[7828,7829,7831],{"_17":418,"_19":7801},{"_17":6452,"_19":7830},"Vector GridFunction containing displacement [ux, uy, uz] per node",{"_17":7832,"_19":7833,"_41":10},"scaleFactor","Deformation amplification factor (default: 1)","null (renders deformed mesh inline)",[7836],{"_3949":7837},"vtk.colormap('coolwarm')\nvtk.displacement(mesh, u, 100) % amplify by 100x",[7793,7782],{"_15":7840,"_17":7841,"_19":7842,"_21":22,"_23":7843,"_27":7844},"sparse","Sparse Matrices","Sparse matrix creation, manipulation, and iterative solvers for large-scale linear systems.","🔳",[7845,7873,7885,7902,7915,7927,7944,7959,7973,7987,8002,8013,8025,8036,8048,8063,8078,8103,8117,8131,8147,8163,8176,8193,8207],{"_17":7840,"_31":7846,"_33":7847,"_19":7848,"_36":7849,"_45":7860,"_47":7861,"_3956":7868},"S = sparse(A)\nS = sparse(m, n)\nS = sparse(i, j, v)\nS = sparse(i, j, v, m, n)","Create sparse matrix","Creates a sparse matrix. With one argument, converts a dense matrix to sparse CSR format. With two arguments (m,n), creates an empty m-by-n sparse matrix. With three arguments (i,j,v), creates a sparse matrix from row indices i, column indices j, and values v. With five arguments, additionally specifies the m-by-n dimensions.",[7850,7853,7856,7858,7859],{"_17":7851,"_19":7852},"A/i","Dense matrix, or row index vector (1-based)",{"_17":7854,"_19":7855,"_41":10},"j/n","Column index vector (1-based), or number of columns",{"_17":676,"_19":7857,"_41":10},"Values vector",{"_17":630,"_19":3943,"_41":10},{"_17":1206,"_19":3945,"_41":10},"Sparse matrix (CSR format)",[7862,7864,7866],{"_3949":7863},"S = sparse(eye(5))",{"_3949":7865},"S = sparse([1 2 3], [1 2 3], [10 20 30], 3, 3)",{"_3949":7867},"S = sparse(5, 5) % empty 5x5 sparse",[7869,7870,7871,7872],"speye","sprand","full","issparse",{"_17":7869,"_31":7874,"_33":7875,"_19":7876,"_36":7877,"_45":7875,"_47":7881,"_3956":7884},"S = speye(n)\nS = speye(m, n)","Sparse identity matrix","Creates a sparse identity matrix. speye(n) creates an n-by-n sparse identity. speye(m,n) creates an m-by-n sparse matrix with ones on the main diagonal.",[7878,7880],{"_17":630,"_19":7879},"Size (or number of rows)",{"_17":1206,"_19":3945,"_41":10},[7882],{"_3949":7883},"I = speye(100)",[7840,3958,7870],{"_17":7870,"_31":7886,"_33":7887,"_19":7888,"_36":7889,"_45":7895,"_47":7896,"_3956":7899},"S = sprand(m, n, density)","Sparse uniformly distributed random matrix","Generates an m-by-n sparse matrix with approximately density*m*n uniformly distributed nonzero entries on [0,1).",[7890,7891,7892],{"_17":630,"_19":3943},{"_17":1206,"_19":3945},{"_17":7893,"_19":7894},"density","Approximate density (0 to 1)","Sparse random matrix",[7897],{"_3949":7898},"S = sprand(100, 100, 0.05)",[7900,7901,7840],"sprandn","sprandsym",{"_17":7900,"_31":7903,"_33":7904,"_19":7905,"_36":7906,"_45":7910,"_47":7911,"_3956":7914},"S = sprandn(m, n, density)","Sparse normally distributed random matrix","Generates an m-by-n sparse matrix with approximately density*m*n normally distributed nonzero entries.",[7907,7908,7909],{"_17":630,"_19":3943},{"_17":1206,"_19":3945},{"_17":7893,"_19":7894},"Sparse random matrix with normal distribution",[7912],{"_3949":7913},"S = sprandn(100, 100, 0.05)",[7870,7901,7840],{"_17":7901,"_31":7916,"_33":7917,"_19":7918,"_36":7919,"_45":7917,"_47":7923,"_3956":7926},"S = sprandsym(n, density)","Sparse symmetric random matrix","Generates an n-by-n sparse symmetric random matrix with approximately density*n*n/2 nonzero entries.",[7920,7922],{"_17":1206,"_19":7921},"Matrix size",{"_17":7893,"_19":7894},[7924],{"_3949":7925},"S = sprandsym(50, 0.1)",[7870,7900],{"_17":7928,"_31":7929,"_33":7930,"_19":7931,"_36":7932,"_45":7939,"_47":7940,"_3956":7943},"spdiags","S = spdiags(B, d, m, n)","Sparse matrix formed from diagonals","Creates a sparse m-by-n matrix by placing the columns of B along the diagonals specified by d. Each column of B is placed along the corresponding diagonal in d.",[7933,7935,7937,7938],{"_17":1166,"_19":7934},"Matrix whose columns are the diagonals",{"_17":5512,"_19":7936},"Vector of diagonal positions (0 = main, positive = above, negative = below)",{"_17":630,"_19":3943},{"_17":1206,"_19":3945},"Sparse matrix with specified diagonals",[7941],{"_3949":7942},"e = ones(5,1);\nS = spdiags([-e 2*e -e], [-1 0 1], 5, 5)",[7840,7869,3985],{"_17":7945,"_31":7946,"_33":7947,"_19":7948,"_36":7949,"_45":7954,"_47":7955,"_3956":7958},"spalloc","S = spalloc(m, n, nz)","Allocate space for sparse matrix","Creates an m-by-n all-zero sparse matrix with space preallocated for nz nonzero elements. Returns an empty sparse matrix (JS sparse matrices auto-resize).",[7950,7951,7952],{"_17":630,"_19":3943},{"_17":1206,"_19":3945},{"_17":2809,"_19":7953},"Number of nonzero elements to allocate (hint)","Empty sparse matrix",[7956],{"_3949":7957},"S = spalloc(10, 10, 50)",[7840,7869],{"_17":7960,"_31":7961,"_33":7962,"_19":7963,"_36":7964,"_45":7968,"_47":7969,"_3956":7972},"spconvert","S = spconvert(D)","Import sparse matrix from triplet data","Converts a matrix D with rows [i j v] into a sparse matrix. Row indices are in column 1, column indices in column 2, values in column 3. The last row may specify the matrix dimensions as [m n 0].",[7965],{"_17":7966,"_19":7967},"D","Dense matrix with columns [i, j, v]","Sparse matrix",[7970],{"_3949":7971},"D = [1 1 10; 2 2 20; 3 3 30];\nS = spconvert(D)",[7840,4501],{"_17":7872,"_31":7974,"_33":7975,"_19":7976,"_36":7977,"_45":7980,"_47":7981,"_3956":7986},"tf = issparse(S)","Determine if matrix is sparse","Returns true (1) if S is a sparse matrix, false (0) otherwise.",[7978],{"_17":5680,"_19":7979},"Input value to test","Logical 1 or 0",[7982,7984],{"_3949":7983,"_3951":4163},"issparse(speye(5))",{"_3949":7985,"_3951":4253},"issparse(eye(5))",[7840,7871],{"_17":5697,"_31":7988,"_33":7989,"_19":7990,"_36":7991,"_45":7994,"_47":7995,"_3956":7999},"n = nnz(S)","Number of nonzero matrix elements","Returns the number of nonzero elements in sparse matrix S, or the number of nonzero elements in a full matrix.",[7992],{"_17":5680,"_19":7993},"Sparse or full matrix","Number of nonzeros",[7996],{"_3949":7997,"_3951":7998},"nnz(speye(100))","100",[8000,8001,7872],"nonzeros","nzmax",{"_17":8000,"_31":8003,"_33":8004,"_19":8005,"_36":8006,"_45":8008,"_47":8009,"_3956":8012},"v = nonzeros(S)","Nonzero matrix elements","Returns a column vector of the nonzero elements in sparse matrix S.",[8007],{"_17":5680,"_19":7968},"Column vector of nonzero values",[8010],{"_3949":8011},"nonzeros(sparse([1 0; 0 2]))",[5697,4501,8001],{"_17":8001,"_31":8014,"_33":8015,"_19":8016,"_36":8017,"_45":8019,"_47":8020,"_3956":8024},"n = nzmax(S)","Amount of storage allocated for nonzero elements","Returns the amount of storage allocated for nonzero matrix elements. Returns the same as nnz(S) since JS arrays auto-resize.",[8018],{"_17":5680,"_19":7968},"Allocated storage size",[8021],{"_3949":8022,"_3951":8023},"nzmax(speye(10))","10",[5697,8000],{"_17":7871,"_31":8026,"_33":8027,"_19":8028,"_36":8029,"_45":8031,"_47":8032,"_3956":8035},"A = full(S)","Convert sparse matrix to full storage","Converts a sparse matrix S to full (dense) matrix form. If S is already a full matrix, returns it unchanged.",[8030],{"_17":5680,"_19":7993},"Full (dense) matrix",[8033],{"_3949":8034},"full(speye(3))",[7840,7872,5673],{"_17":8037,"_31":8038,"_33":8039,"_19":8040,"_36":8041,"_45":8043,"_47":8044,"_3956":8047},"spones","R = spones(S)","Replace nonzero sparse matrix elements with ones","Returns a matrix with the same sparsity pattern as S but with all nonzero values replaced by 1.",[8042],{"_17":5680,"_19":7968},"Sparse matrix with ones at nonzero positions",[8045],{"_3949":8046},"full(spones(sparse([1 0; 0 5])))",[5697,8000,7840],{"_17":8049,"_31":8050,"_33":8051,"_19":8052,"_36":8053,"_45":8058,"_47":8059,"_3956":8062},"spfun","F = spfun(func, S)","Apply function to nonzero sparse matrix elements","Applies the function func to the nonzero elements of sparse matrix S. The sparsity pattern is preserved.",[8054,8057],{"_17":8055,"_19":8056},"func","Function handle to apply (e.g., @sqrt, @exp)",{"_17":5680,"_19":7968},"Sparse matrix with function applied to nonzeros",[8060],{"_3949":8061},"full(spfun(@sqrt, sparse([4 0; 0 9])))",[8037,8000],{"_17":8064,"_31":8065,"_33":8066,"_19":8067,"_36":8068,"_45":8074,"_47":8075,"_3956":8077},"spparms","spparms\nspparms(key)\nspparms(key, value)","Set parameters for sparse matrix routines","Gets or sets parameters for sparse matrix routines. This is a compatibility stub that accepts but ignores configuration.",[8069,8072],{"_17":8070,"_19":8071,"_41":10},"key","Parameter name",{"_17":514,"_19":8073,"_41":10},"Parameter value","Current parameter values, or null",[8076],{"_3949":8064},[7840],{"_17":8079,"_31":8080,"_33":8081,"_19":8082,"_36":8083,"_45":8096,"_47":8097,"_3956":8100},"gmres","x = gmres(A, b)\nx = gmres(A, b, restart, tol, maxit)\n[x, flag, relres, iter] = gmres(...)","Generalized minimum residual method","Solves the linear system Ax = b using the GMRES iterative method. Suitable for general (non-symmetric) sparse systems.",[8084,8086,8088,8091,8093],{"_17":1163,"_19":8085},"Sparse coefficient matrix (n x n)",{"_17":408,"_19":8087},"Right-hand side vector",{"_17":8089,"_19":8090,"_41":10},"restart","Restart parameter (default 20)",{"_17":470,"_19":8092,"_41":10},"Convergence tolerance (default 1e-6)",{"_17":8094,"_19":8095,"_41":10},"maxit","Maximum iterations","Solution vector x, or [x, flag, relres, iter]",[8098],{"_3949":8099},"A = speye(3); b = [1;2;3];\nx = gmres(A, b)",[8101,8102,7840],"bicgstab","pcg",{"_17":8101,"_31":8104,"_33":8105,"_19":8106,"_36":8107,"_45":8096,"_47":8113,"_3956":8116},"x = bicgstab(A, b)\n[x, flag, relres, iter] = bicgstab(A, b, tol, maxit)","BiConjugate Gradients Stabilized method","Solves the linear system Ax = b using the BiCGSTAB iterative method. Works for general (non-symmetric) sparse matrices.",[8108,8110,8111,8112],{"_17":1163,"_19":8109},"Sparse coefficient matrix",{"_17":408,"_19":8087},{"_17":470,"_19":8092,"_41":10},{"_17":8094,"_19":8095,"_41":10},[8114],{"_3949":8115},"x = bicgstab(A, b)",[8079,8102],{"_17":8102,"_31":8118,"_33":8119,"_19":8120,"_36":8121,"_45":8096,"_47":8127,"_3956":8130},"x = pcg(A, b)\n[x, flag, relres, iter] = pcg(A, b, tol, maxit)","Preconditioned conjugate gradients","Solves the symmetric positive definite linear system Ax = b using the Preconditioned Conjugate Gradient method.",[8122,8124,8125,8126],{"_17":1163,"_19":8123},"Symmetric positive definite sparse matrix",{"_17":408,"_19":8087},{"_17":470,"_19":8092,"_41":10},{"_17":8094,"_19":8095,"_41":10},[8128],{"_3949":8129},"x = pcg(A, b)",[8079,8101],{"_17":8132,"_31":8133,"_33":8134,"_19":8135,"_36":8136,"_45":8142,"_47":8143,"_3956":8146},"lsqr","x = lsqr(A, b)\n[x, flag] = lsqr(A, b, tol, maxit)","Least-squares solution via iterative method","Solves the least-squares problem min ||Ax - b||_2 using an iterative method. Delegates to conjugate gradients on the normal equations.",[8137,8139,8140,8141],{"_17":1163,"_19":8138},"Sparse matrix (possibly non-square)",{"_17":408,"_19":8087},{"_17":470,"_19":8092,"_41":10},{"_17":8094,"_19":8095,"_41":10},"Solution vector x, or [x, flag]",[8144],{"_3949":8145},"x = lsqr(A, b)",[8102,8079],{"_17":8148,"_31":8149,"_33":8150,"_19":8151,"_36":8152,"_45":8157,"_47":8158,"_3956":8161},"eigs","d = eigs(A, k)\n[V, D] = eigs(A, k)","Largest eigenvalues and eigenvectors of sparse matrix","Finds the k largest eigenvalues and optionally eigenvectors of a sparse matrix using ARPACK.",[8153,8155],{"_17":1163,"_19":8154},"Sparse matrix or LinearOperator",{"_17":4686,"_19":8156,"_41":10},"Number of eigenvalues (default 6)","Eigenvalues vector, or [V, D] decomposition",[8159],{"_3949":8160},"d = eigs(speye(10), 3)",[5039,8162],"svds",{"_17":8162,"_31":8164,"_33":8165,"_19":8166,"_36":8167,"_45":8171,"_47":8172,"_3956":8175},"s = svds(A, k)\n[U, S, V] = svds(A, k)","Largest singular values of sparse matrix","Computes the k largest singular values and optionally singular vectors of a sparse matrix.",[8168,8169],{"_17":1163,"_19":7968},{"_17":4686,"_19":8170,"_41":10},"Number of singular values (default 6)","Singular values vector, or [U, S, V] decomposition",[8173],{"_3949":8174},"s = svds(A, 3)",[2505,8148],{"_17":8177,"_31":8178,"_33":8179,"_19":8180,"_36":8181,"_45":8187,"_47":8188,"_3956":8191},"ilu","[L, U] = ilu(A)\n[L, U] = ilu(A, setup)","Incomplete LU factorization","Computes the incomplete LU factorization of sparse matrix A, suitable for use as a preconditioner in iterative solvers.",[8182,8184],{"_17":1163,"_19":8183},"Sparse square matrix",{"_17":8185,"_19":8186,"_41":10},"setup","Options struct with type and droptol","[L, U] incomplete factors",[8189],{"_3949":8190},"[L, U] = ilu(speye(5))",[8192,8102,8079],"ichol",{"_17":8192,"_31":8194,"_33":8195,"_19":8196,"_36":8197,"_45":8202,"_47":8203,"_3956":8206},"L = ichol(A)\nL = ichol(A, opts)","Incomplete Cholesky factorization","Computes the incomplete Cholesky factorization of a symmetric positive definite sparse matrix A. Useful as a preconditioner for pcg.",[8198,8199],{"_17":1163,"_19":8123},{"_17":8200,"_19":8201,"_41":10},"opts","Options struct","Lower triangular incomplete factor L",[8204],{"_3949":8205},"L = ichol(speye(5))",[8177,8102],{"_17":8208,"_31":8209,"_33":8210,"_19":8211,"_36":8212,"_45":8214,"_47":8215,"_3956":8218},"sprank","r = sprank(A)","Structural rank of sparse matrix","Returns the structural rank of sparse matrix A, which is an upper bound on the numerical rank. Uses a greedy maximum matching algorithm.",[8213],{"_17":1163,"_19":7968},"Structural rank (integer)",[8216],{"_3949":8217,"_3951":4358},"sprank(speye(5))",[5697,7840],{"_15":8220,"_17":8221,"_19":8222,"_21":22,"_23":8223,"_25":8224,"_27":8225},"sp-generated","Scientific Computing (SciPy)","SciPy-inspired scientific computing library with optimization, integration, linear algebra, and statistics.","🔬","sp",[8226,8242,8254,8265,8276,8288,8301,8312,8325,8337,8350,8359,8367,8378,8389,8400,8410,8425,8437,8448,8465,8477,8487,8496,8507,8519,8533,8545,8554,8562,8573,8583,8592,8602,8612,8621,8627,8635,8643,8651,8657,8664,8674,8682,8692,8700,8708,8717,8726,8733,8741,8748,8757,8768,8777,8791,8799,8807,8815,8823,8835,8844,8855,8863,8871,8879,8890,8901,8919,8931,8943,8951,8957,8964],{"_17":8227,"_31":8228,"_33":8229,"_19":8230,"_36":8231,"_45":8240,"_47":8241},"sp.integrate.quad","sp.integrate.quad(func, a, b, options?)","Compute a definite integral using adaptive quadrature.\r","Compute a definite integral using adaptive quadrature.\r\n\r\nIntegrates `func` from `a` to `b` (possibly infinite interval) using\r\nthe QUADPACK library compiled to WebAssembly.",[8232,8234,8236,8238],{"_17":8055,"_19":8233,"_41":6},"- The integrand function f(x, ...args).",{"_17":664,"_19":8235,"_41":6},"- Lower limit of integration. Use -Infinity for -∞.",{"_17":408,"_19":8237,"_41":6},"- Upper limit of integration. Use Infinity for +∞.",{"_17":454,"_19":8239,"_41":10},"- Integration options.","Promise",[],{"_17":8243,"_31":8244,"_33":8245,"_19":8246,"_36":8247,"_45":8252,"_47":8253},"sp.linalg.inv","sp.linalg.inv(A, options?)","Compute the inverse of a sparse matrix.\r","Compute the inverse of a sparse matrix.\r\n\r\nWarning: The inverse of a sparse matrix is typically dense!\r\nConsider using splu + solve for solving systems instead.",[8248,8250],{"_17":1163,"_19":8249,"_41":6},"- Sparse square matrix (n x n)",{"_17":454,"_19":8251,"_41":10},"- Options including output format","Promise",[],{"_17":8255,"_31":8256,"_33":8257,"_19":8258,"_36":8259,"_45":8263,"_47":8264},"sp.linalg.spilu","sp.linalg.spilu(A, options?)","Compute incomplete LU factorization for use as a preconditioner.\r","Compute incomplete LU factorization for use as a preconditioner.\r\n\r\nThe result implements LinearOperator and can be passed as the M\r\nparameter to iterative solvers (cg, gmres, bicgstab).",[8260,8261],{"_17":1163,"_19":8249,"_41":6},{"_17":454,"_19":8262,"_41":10},"- ILU options including drop tolerance","Promise",[],{"_17":8266,"_31":8267,"_33":8268,"_19":8269,"_36":8270,"_45":8274,"_47":8275},"sp.linalg.splu","sp.linalg.splu(A, options?)","Compute sparse LU decomposition of matrix A.\r","Compute sparse LU decomposition of matrix A.\r\n\r\nReturns a factorization object that can be reused for solving\r\nmultiple systems with the same matrix A.",[8271,8272],{"_17":1163,"_19":8249,"_41":6},{"_17":454,"_19":8273,"_41":10},"- Factorization options","Promise",[],{"_17":8277,"_31":8278,"_33":8279,"_19":8279,"_36":8280,"_45":8286,"_47":8287},"sp.linalg.spsolve","sp.linalg.spsolve(A, b, options?)","Solve the sparse linear system A @ x = b using SuperLU.",[8281,8282,8284],{"_17":1163,"_19":8249,"_41":6},{"_17":408,"_19":8283,"_41":6},"- Right-hand side vector (length n) or matrix (n x nrhs)",{"_17":454,"_19":8285,"_41":10},"- Solver options","Promise",[],{"_17":8289,"_31":8290,"_33":8291,"_19":8292,"_36":8293,"_45":8299,"_47":8300},"sp.linalg.eigs","sp.linalg.eigs(A, k?, options?)","Find k eigenvalues and eigenvectors of a square matrix A.\r","Find k eigenvalues and eigenvectors of a square matrix A.\r\n\r\nFor non-symmetric matrices, eigenvalues may be complex.\r\nUses ARPACK's Implicitly Restarted Arnoldi Method.",[8294,8296,8298],{"_17":1163,"_19":8295,"_41":6},"- Sparse matrix or LinearOperator",{"_17":4686,"_19":8297,"_41":10},"- Number of eigenvalues to compute (default: 6)",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":8302,"_31":8303,"_33":8304,"_19":8305,"_36":8306,"_45":8299,"_47":8311},"sp.linalg.eigsh","sp.linalg.eigsh(A, k?, options?)","Find k eigenvalues and eigenvectors of the real symmetric square matrix A.\r","Find k eigenvalues and eigenvectors of the real symmetric square matrix A.\r\n\r\nUses ARPACK's Implicitly Restarted Lanczos Method.",[8307,8309,8310],{"_17":1163,"_19":8308,"_41":6},"- Sparse matrix or LinearOperator (must be symmetric)",{"_17":4686,"_19":8297,"_41":10},{"_17":454,"_19":8285,"_41":10},[],{"_17":8313,"_31":8314,"_33":8315,"_19":8316,"_36":8317,"_45":8323,"_47":8324},"sp.linalg.svds","sp.linalg.svds(A, k?, options?)","Compute the truncated SVD of a sparse matrix.\r","Compute the truncated SVD of a sparse matrix.\r\n\r\nImplemented via eigenvalue decomposition of A'A or AA'.",[8318,8320,8322],{"_17":1163,"_19":8319,"_41":6},"- Sparse matrix",{"_17":4686,"_19":8321,"_41":10},"- Number of singular values to compute (default: 6)",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":8326,"_31":8327,"_33":8328,"_19":8329,"_36":8330,"_45":506,"_47":8336},"sp.linalg.expm","sp.linalg.expm(A, _options?)","Compute the matrix exponential of a sparse matrix.\r","Compute the matrix exponential of a sparse matrix.\r\n\r\nUses the Pade approximation with scaling and squaring method.\r\nNote: The result is always a dense 2D array since exp(A) is generally dense.",[8331,8333],{"_17":1163,"_19":8332,"_41":6},"- Sparse square matrix",{"_17":8334,"_19":8335,"_41":10},"_options","ExpmOptions",[],{"_17":8338,"_31":8339,"_33":8340,"_19":8341,"_36":8342,"_45":8348,"_47":8349},"sp.linalg.expm_multiply","sp.linalg.expm_multiply(A, v, options?)","Compute the action of the matrix exponential on a vector: exp(t*A) * v\r","Compute the action of the matrix exponential on a vector: exp(t*A) * v\r\n\r\nUses the Krylov subspace method, which is more efficient than computing\r\nthe full matrix exponential for large sparse matrices.",[8343,8344,8346],{"_17":1163,"_19":8295,"_41":6},{"_17":676,"_19":8345,"_41":6},"- Vector to multiply",{"_17":454,"_19":8347,"_41":10},"- Computation options","ExpmMultiplyResult",[],{"_17":8351,"_31":8352,"_33":8353,"_19":8353,"_36":8354,"_45":8357,"_47":8358},"sp.linalg.aslinearoperator","sp.linalg.aslinearoperator(A)","Convert various types to a LinearOperator",[8355],{"_17":1163,"_19":8356,"_41":6},"- Sparse matrix, dense array, or LinearOperator","LinearOperator_2",[],{"_17":8360,"_31":8361,"_33":8362,"_19":8362,"_36":8363,"_45":8365,"_47":8366},"sp.linalg.isLinearOperator","sp.linalg.isLinearOperator(x)","Check if a value is a LinearOperator",[8364],{"_17":405,"_19":481,"_41":6},"x is LinearOperator",[],{"_17":8368,"_31":8369,"_33":8370,"_19":8371,"_36":8372,"_45":8376,"_47":8377},"sp.linalg.bicgstab","sp.linalg.bicgstab(A, b, options?)","BiConjugate Gradient Stabilized method for solving Ax = b\r","BiConjugate Gradient Stabilized method for solving Ax = b\r\n\r\nSolves the linear system Ax = b for x, where A is a general\r\n(possibly non-symmetric) matrix.",[8373,8374,8375],{"_17":1163,"_19":8295,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},"IterativeSolverResult",[],{"_17":8379,"_31":8380,"_33":8381,"_19":8382,"_36":8383,"_45":8376,"_47":8388},"sp.linalg.cg","sp.linalg.cg(A, b, options?)","Conjugate Gradient method for solving Ax = b\r","Conjugate Gradient method for solving Ax = b\r\n\r\nSolves the linear system Ax = b for x, where A is a symmetric\r\npositive-definite matrix.",[8384,8386,8387],{"_17":1163,"_19":8385,"_41":6},"- Sparse matrix or LinearOperator (must be symmetric positive-definite)",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":8390,"_31":8391,"_33":8392,"_19":8393,"_36":8394,"_45":8376,"_47":8399},"sp.linalg.gmres","sp.linalg.gmres(A, b, options?)","GMRES (Generalized Minimal Residual) method for solving Ax = b\r","GMRES (Generalized Minimal Residual) method for solving Ax = b\r\n\r\nSolves the linear system Ax = b for x using the restarted GMRES algorithm.\r\nWorks for general (possibly non-symmetric) matrices.",[8395,8396,8397],{"_17":1163,"_19":8295,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8398,"_41":10},"- Solver options including restart parameter",[],{"_17":8401,"_31":8402,"_33":8403,"_19":8403,"_36":8404,"_45":1387,"_47":8409},"sp.linalg.norm","sp.linalg.norm(x, ord?)","Sparse matrix or vector norm",[8405,8406],{"_17":405,"_19":8319,"_41":6},{"_17":8407,"_19":8408,"_41":10},"ord","- Order of the norm:\r\n- 'fro' or undefined: Frobenius norm (default)\r\n- 1: max column sum\r\n- -1: min column sum\r\n- Infinity: max row sum\r\n- -Infinity: min row sum\r\n- 2: largest singular value (not yet implemented)\r\n- -2: smallest singular value (not yet implemented)",[],{"_17":8411,"_31":8412,"_33":8413,"_19":8413,"_36":8414,"_45":8423,"_47":8424},"sp.optimize.minimize","sp.optimize.minimize(fun, x0, options?)","Minimization of scalar function of one or more variables.",[8415,8418,8421],{"_17":8416,"_19":8417,"_41":6},"fun","- Objective function: (x: number[]) => number",{"_17":8419,"_19":8420,"_41":6},"x0","- Initial guess",{"_17":454,"_19":8422,"_41":10},"- Method, bounds, tolerances, etc.","Promise",[],{"_17":8426,"_31":8427,"_33":8428,"_19":8428,"_36":8429,"_45":8435,"_47":8436},"sp.sparse.bsr_matrix","sp.sparse.bsr_matrix(arg, options?)","Factory function to create a BSR matrix",[8430,8433],{"_17":8431,"_19":8432,"_41":6},"arg","BSRConstructorArrays | number[][]",{"_17":454,"_19":8434,"_41":10},"{\r\n shape?: [number, number];\r\n blocksize?: [number, number];\r\n}","BSRMatrix",[],{"_17":8438,"_31":8439,"_33":8440,"_19":8440,"_36":8441,"_45":239,"_47":8447},"sp.sparse.block_diag","sp.sparse.block_diag(mats, format?)","Build a block diagonal sparse matrix from provided matrices.",[8442,8445],{"_17":8443,"_19":8444,"_41":6},"mats","- Array of sparse matrices or dense 2D arrays",{"_17":4865,"_19":8446,"_41":10},"- Output format: 'coo', 'csr', or 'csc' (default 'csr')",[],{"_17":8449,"_31":8450,"_33":8451,"_19":8451,"_36":8452,"_45":8463,"_47":8464},"sp.sparse.diags","sp.sparse.diags(diagonals, offsets?, shape?, format?)","Construct a sparse matrix from diagonals.",[8453,8456,8458,8461],{"_17":8454,"_19":8455,"_41":6},"diagonals","- Array of diagonal values. Each element can be:\r\n- A number (scalar broadcast to fill the diagonal)\r\n- A number[] or Float64Array (explicit diagonal values)",{"_17":287,"_19":8457,"_41":10},"- Diagonal offsets (default [0]). Can be a single number or array.",{"_17":8459,"_19":8460,"_41":10},"shape","- Matrix shape [m, n]. If not given, the matrix is square with\r\nsize = len(diagonals[0]) + abs(offsets[0])",{"_17":4865,"_19":8462,"_41":10},"- Output format: 'csr' or 'csc' (default 'csr')","CompressedSparseMatrix",[],{"_17":8466,"_31":8467,"_33":8468,"_19":8468,"_36":8469,"_45":8463,"_47":8476},"sp.sparse.eye","sp.sparse.eye(m, n?, k?, format?)","Sparse identity matrix.",[8470,8471,8473,8475],{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":8472,"_41":10},"- Number of columns (defaults to m)",{"_17":4686,"_19":8474,"_41":10},"- Diagonal offset (default 0 = main diagonal, positive = above, negative = below)",{"_17":4865,"_19":8462,"_41":10},[],{"_17":8478,"_31":8479,"_33":8480,"_19":8480,"_36":8481,"_45":239,"_47":8486},"sp.sparse.hstack","sp.sparse.hstack(blocks, format?)","Stack sparse matrices horizontally (column-wise).",[8482,8485],{"_17":8483,"_19":8484,"_41":6},"blocks","- Array of sparse matrices to stack",{"_17":4865,"_19":8446,"_41":10},[],{"_17":8488,"_31":8489,"_33":8490,"_19":8490,"_36":8491,"_45":8494,"_47":8495},"sp.sparse.issparse","sp.sparse.issparse(x)","Check if x is a sparse matrix.",[8492],{"_17":405,"_19":8493,"_41":6},"- Object to check","x is SparseMatrix",[],{"_17":8497,"_31":8498,"_33":8499,"_19":8499,"_36":8500,"_45":239,"_47":8506},"sp.sparse.kron","sp.sparse.kron(A, B, format?)","Kronecker product of sparse matrices.",[8501,8503,8505],{"_17":1163,"_19":8502,"_41":6},"- First sparse matrix or dense 2D array",{"_17":1166,"_19":8504,"_41":6},"- Second sparse matrix or dense 2D array",{"_17":4865,"_19":8446,"_41":10},[],{"_17":8508,"_31":8509,"_33":8510,"_19":8511,"_36":8512,"_45":239,"_47":8518},"sp.sparse.kronsum","sp.sparse.kronsum(A, B, format?)","Kronecker sum of sparse matrices.\r","Kronecker sum of sparse matrices.\r\n\r\nkronsum(A, B) = kron(A, I_b) + kron(I_a, B)\r\n\r\nwhere I_a and I_b are identity matrices of shape A and B respectively.\r\nBoth A and B must be square matrices.",[8513,8515,8517],{"_17":1163,"_19":8514,"_41":6},"- First square sparse matrix or dense 2D array",{"_17":1166,"_19":8516,"_41":6},"- Second square sparse matrix or dense 2D array",{"_17":4865,"_19":8446,"_41":10},[],{"_17":8520,"_31":8521,"_33":8522,"_19":8522,"_36":8523,"_45":239,"_47":8532},"sp.sparse.random","sp.sparse.random(m, n, density?, format?, rng?)","Generate a sparse matrix with uniformly distributed random values.",[8524,8525,8526,8528,8529],{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":7893,"_19":8527,"_41":10},"- Density of non-zero values (0 to 1, default 0.01)",{"_17":4865,"_19":8446,"_41":10},{"_17":8530,"_19":8531,"_41":10},"rng","- Optional random number generator function (default Math.random)",[],{"_17":8534,"_31":8535,"_33":8536,"_19":8536,"_36":8537,"_45":239,"_47":8544},"sp.sparse.tril","sp.sparse.tril(A, k?, format?)","Return the lower triangular portion of a sparse matrix.",[8538,8540,8542],{"_17":1163,"_19":8539,"_41":6},"- Sparse matrix or dense 2D array",{"_17":4686,"_19":8541,"_41":10},"- Diagonal offset (default 0). k=0 is main diagonal, k>0 above, k<0 below.",{"_17":4865,"_19":8543,"_41":10},"- Output format: 'coo', 'csr', or 'csc' (default 'coo')",[],{"_17":8546,"_31":8547,"_33":8548,"_19":8548,"_36":8549,"_45":239,"_47":8553},"sp.sparse.triu","sp.sparse.triu(A, k?, format?)","Return the upper triangular portion of a sparse matrix.",[8550,8551,8552],{"_17":1163,"_19":8539,"_41":6},{"_17":4686,"_19":8541,"_41":10},{"_17":4865,"_19":8543,"_41":10},[],{"_17":8555,"_31":8556,"_33":8557,"_19":8557,"_36":8558,"_45":239,"_47":8561},"sp.sparse.vstack","sp.sparse.vstack(blocks, format?)","Stack sparse matrices vertically (row-wise).",[8559,8560],{"_17":8483,"_19":8484,"_41":6},{"_17":4865,"_19":8446,"_41":10},[],{"_17":8563,"_31":8564,"_33":8565,"_19":8565,"_36":8566,"_45":8571,"_47":8572},"sp.sparse.coo_matrix","sp.sparse.coo_matrix(arg, options?)","Factory function to create a COO matrix",[8567,8569],{"_17":8431,"_19":8568,"_41":6},"COOConstructorArrays | number[][]",{"_17":454,"_19":8570,"_41":10},"{\r\n shape?: [number, number];\r\n}","COOMatrix",[],{"_17":8574,"_31":8575,"_33":8576,"_19":1136,"_36":8577,"_45":8581,"_47":8582},"sp.sparse.csc_matrix","sp.sparse.csc_matrix(arg, options?)","csc_matrix",[8578,8580],{"_17":8431,"_19":8579,"_41":6},"SparseConstructorArrays | number[][]",{"_17":454,"_19":8570,"_41":10},"CSCMatrix",[],{"_17":8584,"_31":8585,"_33":8586,"_19":1136,"_36":8587,"_45":8590,"_47":8591},"sp.sparse.csr_matrix","sp.sparse.csr_matrix(arg, options?)","csr_matrix",[8588,8589],{"_17":8431,"_19":8579,"_41":6},{"_17":454,"_19":8570,"_41":10},"CSRMatrix",[],{"_17":8593,"_31":8594,"_33":8595,"_19":8595,"_36":8596,"_45":8600,"_47":8601},"sp.sparse.dia_matrix","sp.sparse.dia_matrix(arg, options?)","Factory function to create a DIA matrix",[8597,8599],{"_17":8431,"_19":8598,"_41":6},"DIAConstructorArrays | number[][]",{"_17":454,"_19":8570,"_41":10},"DIAMatrix",[],{"_17":8603,"_31":8604,"_33":8605,"_19":8605,"_36":8606,"_45":8610,"_47":8611},"sp.sparse.dok_matrix","sp.sparse.dok_matrix(arg, options?)","Factory function to create a DOK matrix",[8607,8609],{"_17":8431,"_19":8608,"_41":6},"number[][] | [number, number]",{"_17":454,"_19":8570,"_41":10},"DOKMatrix",[],{"_17":8613,"_31":8614,"_33":8615,"_19":8615,"_36":8616,"_45":8619,"_47":8620},"sp.sparse.lil_matrix","sp.sparse.lil_matrix(arg, options?)","Factory function to create a LIL matrix",[8617,8618],{"_17":8431,"_19":8608,"_41":6},{"_17":454,"_19":8570,"_41":10},"LILMatrix",[],{"_17":8622,"_31":8623,"_33":8353,"_19":8353,"_36":8624,"_45":8357,"_47":8626},"sp.sparse.aslinearoperator","sp.sparse.aslinearoperator(A)",[8625],{"_17":1163,"_19":8356,"_41":6},[],{"_17":8628,"_31":8629,"_33":8370,"_19":8371,"_36":8630,"_45":8376,"_47":8634},"sp.sparse.bicgstab","sp.sparse.bicgstab(A, b, options?)",[8631,8632,8633],{"_17":1163,"_19":8295,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":8636,"_31":8637,"_33":8381,"_19":8382,"_36":8638,"_45":8376,"_47":8642},"sp.sparse.cg","sp.sparse.cg(A, b, options?)",[8639,8640,8641],{"_17":1163,"_19":8385,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":8644,"_31":8645,"_33":8392,"_19":8393,"_36":8646,"_45":8376,"_47":8650},"sp.sparse.gmres","sp.sparse.gmres(A, b, options?)",[8647,8648,8649],{"_17":1163,"_19":8295,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8398,"_41":10},[],{"_17":8652,"_31":8653,"_33":8362,"_19":8362,"_36":8654,"_45":8365,"_47":8656},"sp.sparse.isLinearOperator","sp.sparse.isLinearOperator(x)",[8655],{"_17":405,"_19":481,"_41":6},[],{"_17":8658,"_31":8659,"_33":8403,"_19":8403,"_36":8660,"_45":1387,"_47":8663},"sp.sparse.linalg_norm","sp.sparse.linalg_norm(x, ord?)",[8661,8662],{"_17":405,"_19":8319,"_41":6},{"_17":8407,"_19":8408,"_41":10},[],{"_17":8665,"_31":8666,"_33":8667,"_19":8668,"_36":8669,"_45":8672,"_47":8673},"sp.special.i0","sp.special.i0(x)","Modified Bessel function of the first kind, order 0: I₀(x)\r","Modified Bessel function of the first kind, order 0: I₀(x)\r\n\r\nI₀(x) is related to J₀(ix) and grows exponentially for large x.\r\n\r\nProperties:\r\n - I₀(0) = 1\r\n - I₀(x) = I₀(-x) (even function)\r\n - I₀(x) ∼ e^x / √(2πx) as x → ∞",[8670],{"_17":405,"_19":8671,"_41":6},"- Input value(s). Can be a number or array of numbers.","Promise",[],{"_17":8675,"_31":8676,"_33":8677,"_19":8678,"_36":8679,"_45":8672,"_47":8681},"sp.special.i1","sp.special.i1(x)","Modified Bessel function of the first kind, order 1: I₁(x)\r","Modified Bessel function of the first kind, order 1: I₁(x)\r\n\r\nProperties:\r\n - I₁(0) = 0\r\n - I₁(-x) = -I₁(x) (odd function)",[8680],{"_17":405,"_19":8671,"_41":6},[],{"_17":8683,"_31":8684,"_33":8685,"_19":8686,"_36":8687,"_45":8672,"_47":8691},"sp.special.iv","sp.special.iv(v, x)","Modified Bessel function of the first kind, order v: Iᵥ(x)\r","Modified Bessel function of the first kind, order v: Iᵥ(x)\r\n\r\nGeneral modified Bessel function of the first kind for arbitrary order v.",[8688,8690],{"_17":676,"_19":8689,"_41":6},"- Order of the Bessel function.",{"_17":405,"_19":8671,"_41":6},[],{"_17":8693,"_31":8694,"_33":8695,"_19":8696,"_36":8697,"_45":8672,"_47":8699},"sp.special.j0","sp.special.j0(x)","Bessel functions via WebAssembly.\r","Bessel functions via WebAssembly.\r\nMirrors scipy.special Bessel function implementations.",[8698],{"_17":405,"_19":8671,"_41":6},[],{"_17":8701,"_31":8702,"_33":8703,"_19":8704,"_36":8705,"_45":8672,"_47":8707},"sp.special.j1","sp.special.j1(x)","Bessel function of the first kind, order 1: J₁(x)\r","Bessel function of the first kind, order 1: J₁(x)\r\n\r\nProperties:\r\n - J₁(0) = 0\r\n - J₁(x) oscillates with decreasing amplitude as x → ∞",[8706],{"_17":405,"_19":8671,"_41":6},[],{"_17":8709,"_31":8710,"_33":8711,"_19":8712,"_36":8713,"_45":8672,"_47":8716},"sp.special.jv","sp.special.jv(v, x)","Bessel function of the first kind, order v: Jᵥ(x)\r","Bessel function of the first kind, order v: Jᵥ(x)\r\n\r\nGeneral Bessel function of the first kind for arbitrary order v.",[8714,8715],{"_17":676,"_19":8689,"_41":6},{"_17":405,"_19":8671,"_41":6},[],{"_17":8718,"_31":8719,"_33":8720,"_19":8721,"_36":8722,"_45":8672,"_47":8725},"sp.special.k0","sp.special.k0(x)","Modified Bessel function of the second kind, order 0: K₀(x)\r","Modified Bessel function of the second kind, order 0: K₀(x)\r\n\r\nK₀(x) decays exponentially for large x and is singular at x = 0.\r\n\r\nProperties:\r\n - K₀(x) → ∞ as x → 0\r\n - K₀(x) ∼ √(π/(2x)) * e^(-x) as x → ∞",[8723],{"_17":405,"_19":8724,"_41":6},"- Input value(s). Must be positive. Can be a number or array of numbers.",[],{"_17":8727,"_31":8728,"_33":8729,"_19":8729,"_36":8730,"_45":8672,"_47":8732},"sp.special.k1","sp.special.k1(x)","Modified Bessel function of the second kind, order 1: K₁(x)",[8731],{"_17":405,"_19":8724,"_41":6},[],{"_17":8734,"_31":8735,"_33":8736,"_19":8737,"_36":8738,"_45":8672,"_47":8740},"sp.special.y0","sp.special.y0(x)","Bessel function of the second kind, order 0: Y₀(x)\r","Bessel function of the second kind, order 0: Y₀(x)\r\n\r\nAlso known as the Neumann function or Weber function.\r\nY₀(x) is singular at x = 0 and is real for x > 0.",[8739],{"_17":405,"_19":8724,"_41":6},[],{"_17":8742,"_31":8743,"_33":8744,"_19":8744,"_36":8745,"_45":8672,"_47":8747},"sp.special.y1","sp.special.y1(x)","Bessel function of the second kind, order 1: Y₁(x)",[8746],{"_17":405,"_19":8724,"_41":6},[],{"_17":8749,"_31":8750,"_33":8751,"_19":8752,"_36":8753,"_45":8672,"_47":8756},"sp.special.yv","sp.special.yv(v, x)","Bessel function of the second kind, order v: Yᵥ(x)\r","Bessel function of the second kind, order v: Yᵥ(x)\r\n\r\nGeneral Bessel function of the second kind for arbitrary order v.",[8754,8755],{"_17":676,"_19":8689,"_41":6},{"_17":405,"_19":8724,"_41":6},[],{"_17":8758,"_31":8759,"_33":8760,"_19":8761,"_36":8762,"_45":8672,"_47":8767},"sp.special.beta","sp.special.beta(a, b)","Beta function and related special functions via WebAssembly.\r","Beta function and related special functions via WebAssembly.\r\nMirrors scipy.special.beta, betaln functions.",[8763,8765],{"_17":664,"_19":8764,"_41":6},"- First parameter. Can be a number or array of numbers.",{"_17":408,"_19":8766,"_41":6},"- Second parameter. Can be a number or array of numbers.",[],{"_17":8769,"_31":8770,"_33":8771,"_19":8772,"_36":8773,"_45":8672,"_47":8776},"sp.special.betaln","sp.special.betaln(a, b)","Natural logarithm of the beta function: ln(B(a, b))\r","Natural logarithm of the beta function: ln(B(a, b))\r\n\r\nFor large arguments, betaln(a, b) is more accurate than log(beta(a, b))\r\nbecause it avoids overflow of the beta function.",[8774,8775],{"_17":664,"_19":8764,"_41":6},{"_17":408,"_19":8766,"_41":6},[],{"_17":8778,"_31":8779,"_33":8780,"_19":8780,"_36":8781,"_45":8789,"_47":8790},"sp.special.comb","sp.special.comb(N, k, options?)","Binomial coefficient (N choose k).",[8782,8785,8787],{"_17":8783,"_19":8784,"_41":6},"N","- Number of items (integer or array)",{"_17":4686,"_19":8786,"_41":6},"- Number of items to choose (integer or array)",{"_17":454,"_19":8788,"_41":10},"- Configuration options","Promise",[],{"_17":8792,"_31":8793,"_33":8794,"_19":8795,"_36":8796,"_45":8672,"_47":8798},"sp.special.erf","sp.special.erf(x)","Error functions via WebAssembly.\r","Error functions via WebAssembly.\r\nMirrors scipy.special.erf, erfc, erfcx, erfi functions.",[8797],{"_17":405,"_19":8671,"_41":6},[],{"_17":8800,"_31":8801,"_33":8802,"_19":8803,"_36":8804,"_45":8672,"_47":8806},"sp.special.erfc","sp.special.erfc(x)","Complementary error function: erfc(x) = 1 - erf(x)\r","Complementary error function: erfc(x) = 1 - erf(x)\r\n\r\nFor large x, erfc(x) is more accurate than computing 1 - erf(x)\r\ndirectly because erf(x) → 1 causes precision loss.",[8805],{"_17":405,"_19":8671,"_41":6},[],{"_17":8808,"_31":8809,"_33":8810,"_19":8811,"_36":8812,"_45":8672,"_47":8814},"sp.special.erfcx","sp.special.erfcx(x)","Scaled complementary error function: erfcx(x) = e^(x²) * erfc(x)\r","Scaled complementary error function: erfcx(x) = e^(x²) * erfc(x)\r\n\r\nThis function avoids the underflow/overflow issues that occur\r\nwhen computing erfc(x) for large |x|.\r\n\r\nProperties:\r\n - erfcx(0) = 1\r\n - erfcx(x) → 1/(√π * x) as x → ∞",[8813],{"_17":405,"_19":8671,"_41":6},[],{"_17":8816,"_31":8817,"_33":8818,"_19":8819,"_36":8820,"_45":8672,"_47":8822},"sp.special.erfi","sp.special.erfi(x)","Imaginary error function: erfi(x) = -i * erf(ix)\r","Imaginary error function: erfi(x) = -i * erf(ix)\r\n\r\nThe imaginary error function is the error function evaluated\r\nat an imaginary argument, made real.",[8821],{"_17":405,"_19":8671,"_41":6},[],{"_17":8824,"_31":8825,"_33":8826,"_19":8827,"_36":8828,"_45":8833,"_47":8834},"sp.special.factorial","sp.special.factorial(n, options?)","The factorial of a number or array of numbers.\r","The factorial of a number or array of numbers.\r\n\r\nThe factorial of non-negative integer n is the product of all\r\npositive integers less than or equal to n:\r\n\r\n n! = n × (n-1) × (n-2) × ... × 2 × 1\r\n\r\nFor example: 5! = 5 × 4 × 3 × 2 × 1 = 120\r\n\r\nWith `exact=false` (default), the factorial is approximated using the\r\ngamma function:\r\n\r\n n! = Γ(n+1)",[8829,8831],{"_17":1206,"_19":8830,"_41":6},"- Input value(s) for n!. Can be a number or array of numbers.",{"_17":454,"_19":8832,"_41":10},"- Optional settings for exact calculation and extend mode.","Promise",[],{"_17":8836,"_31":8837,"_33":8838,"_19":8839,"_36":8840,"_45":8833,"_47":8843},"sp.special.factorial2","sp.special.factorial2(n, options?)","Double factorial.\r","Double factorial.\r\n\r\nThis is the factorial with every second value skipped. For example:\r\n\r\n 7!! = 7 × 5 × 3 × 1 = 105\r\n 8!! = 8 × 6 × 4 × 2 = 384\r\n\r\nIt can be approximated numerically as:\r\n\r\n n!! = 2^(n/2) × Γ(n/2 + 1) × sqrt(2/π) if n is odd\r\n n!! = 2^(n/2) × Γ(n/2 + 1) if n is even",[8841,8842],{"_17":1206,"_19":8671,"_41":6},{"_17":454,"_19":8832,"_41":10},[],{"_17":8845,"_31":8846,"_33":8847,"_19":8848,"_36":8849,"_45":8833,"_47":8854},"sp.special.factorialk","sp.special.factorialk(n, k, options?)","Multifactorial of n of order k, n(!!...!).\r","Multifactorial of n of order k, n(!!...!).\r\n\r\nThis is the multifactorial of n skipping k values. For example:\r\n\r\n factorialk(17, 4) = 17!!!! = 17 × 13 × 9 × 5 × 1 = 8721\r\n\r\nIn particular, for any integer n:\r\n\r\n factorialk(n, 1) = factorial(n)\r\n factorialk(n, 2) = factorial2(n)\r\n\r\nWith `exact=false` (default), it can be approximated as (where r = n % k):\r\n\r\n n!(k) = k^((n-r)/k) × Γ(n/k + 1) / Γ(r/k + 1) × max(r, 1)",[8850,8851,8853],{"_17":1206,"_19":8671,"_41":6},{"_17":4686,"_19":8852,"_41":6},"- Order of multifactorial (how many values to skip).",{"_17":454,"_19":8832,"_41":10},[],{"_17":8856,"_31":8857,"_33":8858,"_19":8859,"_36":8860,"_45":8672,"_47":8862},"sp.special.gamma","sp.special.gamma(x)","Gamma function and related special functions via WebAssembly.\r","Gamma function and related special functions via WebAssembly.\r\nMirrors scipy.special.gamma, gammaln functions.",[8861],{"_17":405,"_19":8671,"_41":6},[],{"_17":8864,"_31":8865,"_33":8866,"_19":8867,"_36":8868,"_45":8672,"_47":8870},"sp.special.gammaln","sp.special.gammaln(x)","Natural logarithm of the absolute value of the gamma function.\r","Natural logarithm of the absolute value of the gamma function.\r\n\r\nFor large arguments, gammaln(x) is more accurate than log(gamma(x))\r\nbecause it avoids overflow of the gamma function.\r\n\r\nReturns: ln(|Γ(x)|)",[8869],{"_17":405,"_19":8671,"_41":6},[],{"_17":8872,"_31":8873,"_33":8874,"_19":8875,"_36":8876,"_45":8672,"_47":8878},"sp.special.rgamma","sp.special.rgamma(x)","Reciprocal of the gamma function: 1/Γ(x)\r","Reciprocal of the gamma function: 1/Γ(x)\r\n\r\nThis function is more numerically stable than computing 1/gamma(x),\r\nespecially for large |x| where gamma(x) might overflow or underflow.",[8877],{"_17":405,"_19":8671,"_41":6},[],{"_17":8880,"_31":8881,"_33":8882,"_19":8883,"_36":8884,"_45":8789,"_47":8889},"sp.special.perm","sp.special.perm(N, k, options?)","Permutations (k-permutations of N).\r","Permutations (k-permutations of N).\r\n\r\nComputes P(N, k) = N! / (N-k)!, the number of ways to arrange k items\r\nfrom N items where order matters.",[8885,8886,8888],{"_17":8783,"_19":8784,"_41":6},{"_17":4686,"_19":8887,"_41":6},"- Number of items to arrange (integer or array)",{"_17":454,"_19":8788,"_41":10},[],{"_17":8891,"_31":8892,"_33":8893,"_19":8894,"_36":8895,"_45":8899,"_47":8900},"sp.stats.describe","sp.stats.describe(a, options?)","Compute several descriptive statistics of the passed array.\r","Compute several descriptive statistics of the passed array.\r\n\r\nReturns a DescribeResult with: nobs, minmax, mean, variance,\r\nskewness, and kurtosis.",[8896,8898],{"_17":664,"_19":8897,"_41":6},"- Input data array",{"_17":454,"_19":8788,"_41":10},"Promise",[],{"_17":8902,"_31":8903,"_33":8904,"_19":8905,"_36":8906,"_45":8917,"_47":8918},"sp.stats.kurtosis","sp.stats.kurtosis(a, axis?, fisher?, bias?)","Compute the kurtosis (Fisher or Pearson) of a dataset.\r","Compute the kurtosis (Fisher or Pearson) of a dataset.\r\n\r\nKurtosis is the fourth central moment divided by the square of the\r\nvariance (second central moment). Fisher's definition subtracts 3\r\nso that the normal distribution has kurtosis 0.",[8907,8909,8911,8914],{"_17":664,"_19":8908,"_41":6},"- Input array",{"_17":2911,"_19":8910,"_41":10},"- Axis along which kurtosis is calculated. Default: 0",{"_17":8912,"_19":8913,"_41":10},"fisher","- If true (default), Fisher's definition (normal ==> 0.0).\r\n If false, Pearson's definition (normal ==> 3.0).",{"_17":8915,"_19":8916,"_41":10},"bias","- If false, apply bias correction. Default: true","Promise",[],{"_17":8920,"_31":8921,"_33":8922,"_19":8923,"_36":8924,"_45":8917,"_47":8930},"sp.stats.moment","sp.stats.moment(a, order?, axis?)","Compute the nth central moment of the data along the given axis.\r","Compute the nth central moment of the data along the given axis.\r\n\r\nThe nth central moment is E[(x - mean(x))^n].",[8925,8926,8928],{"_17":664,"_19":8908,"_41":6},{"_17":1246,"_19":8927,"_41":10},"- Order of the central moment (must be >= 0)",{"_17":2911,"_19":8929,"_41":10},"- Axis along which to compute the moment. Default: 0",[],{"_17":8932,"_31":8933,"_33":8934,"_19":8935,"_36":8936,"_45":8917,"_47":8942},"sp.stats.skew","sp.stats.skew(a, axis?, bias?)","Compute the sample skewness of a data set.\r","Compute the sample skewness of a data set.\r\n\r\nFor normally distributed data, the skewness should be about zero.\r\nFor unimodal continuous distributions, a negative skew indicates\r\nthe tail on the left side is longer, while a positive skew\r\nindicates the right side.\r\n\r\nUses Fisher-Pearson coefficient of skewness: m3 / m2^(3/2).",[8937,8938,8940],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":8939,"_41":10},"- Axis along which skewness is calculated. Default: 0",{"_17":8915,"_19":8941,"_41":10},"- If false, apply bias correction for statistical bias. Default: true",[],{"_17":8944,"_31":8945,"_33":8946,"_19":1136,"_36":8947,"_45":46,"_47":8950},"sp.configureWasm","sp.configureWasm(config)","configureWasm",[8948],{"_17":3805,"_19":8949,"_41":6},"WasmLoadConfig",[],{"_17":8952,"_31":8953,"_33":8954,"_19":1136,"_36":8955,"_45":2598,"_47":8956},"sp.isWasmLoaded","sp.isWasmLoaded()","isWasmLoaded",[],[],{"_17":8958,"_31":8959,"_33":8960,"_19":1136,"_36":8961,"_45":8962,"_47":8963},"sp.loadWasmModule","sp.loadWasmModule()","loadWasmModule",[],"Promise",[],{"_17":8965,"_31":8966,"_33":8967,"_19":1136,"_36":8968,"_45":46,"_47":8969},"sp.resetWasmModule","sp.resetWasmModule()","resetWasmModule",[],[],{"_15":8971,"_17":8972,"_19":8973,"_21":22,"_23":8974,"_25":8975,"_27":8976},"np-generated","Numerical Arrays (NumPy)","NumPy-inspired numerical array library for WebAssembly.","🔢","np",[8977,8990,9015,9033,9049,9064,9081,9093,9103,9118,9132,9143,9156,9168,9179,9191,9200,9211,9219,9229,9242,9256,9268,9277,9289,9304,9317,9332,9339,9346,9353,9360,9367,9375,9382,9393,9403,9416,9429,9436,9448,9458,9469,9478,9493,9502,9510,9523,9533,9542,9550,9558,9566,9578,9589,9596,9603,9616,9625,9640,9652,9662,9671,9684,9692,9701,9709,9717,9725,9734,9744,9757,9766,9778,9790,9799,9814,9821,9828,9836,9844,9852,9861,9870,9891,9899,9913,9928,9936,9947,9954,9962,9972,9984,9994,10009,10020,10033,10048,10057,10067,10074,10084,10096,10105,10116,10128,10138,10146,10154,10167,10174,10182,10199,10213,10224,10231,10238,10245,10261,10283,10294,10304,10318,10329,10340,10353,10360,10372,10380,10388,10398,10409,10418,10430,10444,10456,10470,10478,10490,10499,10508,10516,10524,10532,10539,10547,10555,10563,10572,10580,10592,10599,10608,10619,10629,10639,10647,10659,10672,10680,10687,10694,10703,10714,10724,10731,10740,10752,10766,10779,10790,10802,10812,10826,10835,10842,10849,10858,10866,10874,10883,10890,10898,10906,10914,10922,10942,10956,10965,10973,10982,10994,11005,11016,11028,11038,11057,11072,11088,11099,11107,11118,11128,11145,11154,11164,11171,11178,11190,11198,11206,11214,11222,11233,11240,11247,11253,11260,11267,11274,11281,11287,11294,11301,11314,11320,11329,11336,11344,11350,11357,11365,11372,11383,11389,11398,11405,11413,11419,11426,11434,11441,11450,11463,11480,11499,11511,11527,11536,11544,11552,11561,11570,11581,11593,11603,11612,11623,11631,11644,11657,11664,11673,11686,11706,11719,11726,11733,11746,11756,11766,11773,11780,11787,11800,11808,11815,11822,11830,11837,11848,11855,11862,11869,11879,11886,11893,11901,11908,11915,11921,11929,11936,11943,11951,11958,11967,11974,11981,11989,12001,12009,12017,12023,12031,12040,12050,12059,12066,12073,12079,12086,12093,12104,12110,12119,12126,12134,12140,12147,12155,12162,12171,12182,12190,12197,12205,12212,12220,12228,12240,12247,12257,12265,12274,12281,12289,12297,12305,12313,12321,12331,12344,12350,12362,12372,12382,12390,12399,12406,12413,12420,12427,12435,12443,12451,12458,12466,12474,12489,12496,12506,12519,12534,12543,12557,12568,12580,12590,12600,12609,12620,12630,12638,12650,12660,12669,12679,12688,12696,12704,12717,12726,12734,12750,12761,12770,12781,12791,12802,12815,12825,12834,12851,12864,12877,12891,12904,12917,12926,12935,12943,12950,12960,12968,12977,12985,12994,13002,13009,13021,13029,13043,13058,13068,13080,13090,13100,13117,13126,13141,13151,13160,13167,13174,13181,13188,13198,13205,13213,13223,13235,13242,13252,13261,13272,13279,13287,13296,13305,13317,13325,13337,13344,13352,13363,13376,13387,13400,13414,13424,13434,13446,13453,13462,13476,13483,13490,13500,13506,13512,13519,13530,13538,13548,13559,13569,13583,13593,13606,13613,13621,13633,13639,13650,13661,13669,13681,13691,13700,13711,13725,13733,13743,13750,13759,13771,13782,13791,13803,13810,13819,13827,13833,13846,13858,13868,13877,13888,13896,13910,13920,13928,13938,13946,13956,13963,13970,13977,13985,13992,14005,14014,14024,14034,14042,14050,14061,14068,14075,14084,14094,14105,14119,14126,14134,14141,14150,14161,14171,14181,14190,14199,14209,14217,14226,14235,14246,14255,14263,14271,14284,14298,14306,14320,14327,14335,14346,14358,14365,14376,14383,14395,14405,14415,14422,14429,14442,14454,14467,14477,14487,14495,14511,14521,14531,14541,14552,14562,14572,14581,14591,14600,14609,14616,14624,14633,14642,14650,14658,14666,14674,14681,14696,14705,14716,14732,14739,14754,14767,14776,14787,14797,14809,14821,14829,14837,14850,14861,14869,14876],{"_17":8978,"_31":8979,"_33":8980,"_19":8981,"_36":8982,"_45":46,"_47":8989},"np.testing.assert_","np.testing.assert_(val, msg?)","Assert a condition is true.\r","Assert a condition is true.\r\n\r\nUnlike the built-in assert, this works in optimized mode\r\nand provides a consistent interface.",[8983,8986],{"_17":8984,"_19":8985,"_41":6},"val","- Value to test for truthiness",{"_17":8987,"_19":8988,"_41":10},"msg","- Message to display on failure",[],{"_17":8991,"_31":8992,"_33":8993,"_19":8994,"_36":8995,"_45":46,"_47":9014},"np.testing.assert_allclose","np.testing.assert_allclose(actual, desired, rtol?, atol?, equal_nan?, err_msg?, _verbose?)","Assert that two arrays are element-wise equal within tolerance.\r","Assert that two arrays are element-wise equal within tolerance.\r\n\r\nThe comparison is:\r\n |actual - desired| <= atol + rtol * |desired|\r\n\r\nThis is the recommended assertion for floating-point comparisons.",[8996,8999,9002,9004,9006,9009,9012],{"_17":8997,"_19":8998,"_41":6},"actual","- Actual array",{"_17":9000,"_19":9001,"_41":6},"desired","- Expected array",{"_17":2072,"_19":9003,"_41":10},"- Relative tolerance (default: 1e-7)",{"_17":2075,"_19":9005,"_41":10},"- Absolute tolerance (default: 0)",{"_17":9007,"_19":9008,"_41":10},"equal_nan","- If true, NaN == NaN (default: true)",{"_17":9010,"_19":9011,"_41":10},"err_msg","- Custom error message",{"_17":9013,"_19":2598,"_41":10},"_verbose",[],{"_17":9016,"_31":9017,"_33":9018,"_19":9019,"_36":9020,"_45":46,"_47":9032},"np.testing.assert_almost_equal","np.testing.assert_almost_equal(actual, desired, decimal?, err_msg?, verbose?)","Assert that two values are equal up to specified decimal places.\r","Assert that two values are equal up to specified decimal places.\r\n\r\nComparison: |actual - desired| < 10^(-decimal)\r\n\r\nFor more control over tolerances, use assert_allclose instead.",[9021,9023,9025,9028,9029],{"_17":8997,"_19":9022,"_41":6},"- Actual value or array",{"_17":9000,"_19":9024,"_41":6},"- Expected value or array",{"_17":9026,"_19":9027,"_41":10},"decimal","- Number of decimal places (default: 7)",{"_17":9010,"_19":9011,"_41":10},{"_17":9030,"_19":9031,"_41":10},"verbose","- Show detailed output",[],{"_17":9034,"_31":9035,"_33":9036,"_19":9037,"_36":9038,"_45":46,"_47":9048},"np.testing.assert_approx_equal","np.testing.assert_approx_equal(actual, desired, significant?, err_msg?, verbose?)","Assert values are equal to specified significant figures.\r","Assert values are equal to specified significant figures.\r\n\r\nThe comparison is relative to the scale of the expected value.",[9039,9041,9043,9046,9047],{"_17":8997,"_19":9040,"_41":6},"- Actual value",{"_17":9000,"_19":9042,"_41":6},"- Expected value",{"_17":9044,"_19":9045,"_41":10},"significant","- Number of significant figures (default: 7)",{"_17":9010,"_19":9011,"_41":10},{"_17":9030,"_19":9031,"_41":10},[],{"_17":9050,"_31":9051,"_33":9052,"_19":9053,"_36":9054,"_45":46,"_47":9063},"np.testing.assert_array_almost_equal","np.testing.assert_array_almost_equal(x, y, decimal?, err_msg?, verbose?)","Assert arrays are element-wise equal up to decimal places.\r","Assert arrays are element-wise equal up to decimal places.\r\n\r\nCombination of assert_array_equal and assert_almost_equal.\r\nFirst checks shapes, then element values.",[9055,9057,9059,9061,9062],{"_17":405,"_19":9056,"_41":6},"- First array",{"_17":2467,"_19":9058,"_41":6},"- Second array",{"_17":9026,"_19":9060,"_41":10},"- Number of decimal places (default: 6)",{"_17":9010,"_19":9011,"_41":10},{"_17":9030,"_19":9031,"_41":10},[],{"_17":9065,"_31":9066,"_33":9067,"_19":9068,"_36":9069,"_45":46,"_47":9080},"np.testing.assert_array_compare","np.testing.assert_array_compare(comparison, x, y, header?, precision?)","Assert arrays satisfy a custom comparison.\r","Assert arrays satisfy a custom comparison.\r\n\r\nLow-level function for building custom assertions.",[9070,9073,9074,9075,9078],{"_17":9071,"_19":9072,"_41":6},"comparison","- Comparison function (a, b) => boolean",{"_17":405,"_19":9056,"_41":6},{"_17":2467,"_19":9058,"_41":6},{"_17":9076,"_19":9077,"_41":10},"header","- Error message header",{"_17":4907,"_19":9079,"_41":10},"- Decimal places for display",[],{"_17":9082,"_31":9083,"_33":9084,"_19":9085,"_36":9086,"_45":46,"_47":9092},"np.testing.assert_array_equal","np.testing.assert_array_equal(x, y, err_msg?, verbose?)","Assert that two arrays are element-wise equal.\r","Assert that two arrays are element-wise equal.\r\n\r\nCompares shape and all elements. For floating-point arrays,\r\nuse assert_allclose for tolerance-based comparison.",[9087,9088,9089,9090],{"_17":405,"_19":9056,"_41":6},{"_17":2467,"_19":9058,"_41":6},{"_17":9010,"_19":9011,"_41":10},{"_17":9030,"_19":9091,"_41":10},"- Show detailed output on failure",[],{"_17":9094,"_31":9095,"_33":9096,"_19":9096,"_36":9097,"_45":46,"_47":9102},"np.testing.assert_array_less","np.testing.assert_array_less(x, y, err_msg?, verbose?)","Assert that all elements of x are strictly less than those of y.",[9098,9099,9100,9101],{"_17":405,"_19":9056,"_41":6},{"_17":2467,"_19":9058,"_41":6},{"_17":9010,"_19":9011,"_41":10},{"_17":9030,"_19":9031,"_41":10},[],{"_17":9104,"_31":9105,"_33":9106,"_19":9107,"_36":9108,"_45":1387,"_47":9117},"np.testing.assert_array_max_ulp","np.testing.assert_array_max_ulp(a, b, maxulp?, dtype?)","Assert arrays differ by at most `maxulp` ULPs.\r","Assert arrays differ by at most `maxulp` ULPs.\r\n\r\nULP = Unit in the Last Place (floating-point precision unit).\r\nThis is the most precise way to compare floating-point numbers.",[9109,9110,9111,9114],{"_17":664,"_19":9056,"_41":6},{"_17":408,"_19":9058,"_41":6},{"_17":9112,"_19":9113,"_41":10},"maxulp","- Maximum ULP difference allowed (default: 1)",{"_17":9115,"_19":9116,"_41":10},"dtype","- Data type for comparison",[],{"_17":9119,"_31":9120,"_33":9121,"_19":9122,"_36":9123,"_45":46,"_47":9131},"np.testing.assert_equal","np.testing.assert_equal(actual, desired, err_msg?, verbose?)","Assert that two objects are equal.\r","Assert that two objects are equal.\r\n\r\nHandles comparison of:\r\n- Scalars (number, string, boolean)\r\n- Arrays (JavaScript arrays, nested arrays)\r\n- NDArrays (element-wise comparison)\r\n- Objects (deep equality)\r\n\r\nSpecial cases:\r\n- NaN == NaN is treated as True for testing purposes\r\n- Infinity values are compared correctly",[9124,9126,9127,9129],{"_17":8997,"_19":9125,"_41":6},"- Actual value obtained",{"_17":9000,"_19":9042,"_41":6},{"_17":9010,"_19":9128,"_41":10},"- Custom error message prefix",{"_17":9030,"_19":9130,"_41":10},"- If true, show detailed diff (default: true)",[],{"_17":9133,"_31":9134,"_33":9135,"_19":9135,"_36":9136,"_45":481,"_47":9142},"np.testing.assert_no_warnings","np.testing.assert_no_warnings(func, args)","Assert that a function emits no warnings.",[9137,9139],{"_17":8055,"_19":9138,"_41":6},"- Function to call",{"_17":9140,"_19":9141,"_41":6},"args","- Arguments to pass to function",[],{"_17":9144,"_31":9145,"_33":9146,"_19":9146,"_36":9147,"_45":46,"_47":9155},"np.testing.assert_raises","np.testing.assert_raises(exception_class, callable, args)","Assert that a callable raises the specified exception.",[9148,9151,9153],{"_17":9149,"_19":9150,"_41":6},"exception_class","- Expected exception type",{"_17":9152,"_19":9138,"_41":6},"callable",{"_17":9140,"_19":9154,"_41":6},"- Arguments to pass to callable",[],{"_17":9157,"_31":9158,"_33":9159,"_19":9159,"_36":9160,"_45":46,"_47":9167},"np.testing.assert_raises_regex","np.testing.assert_raises_regex(exception_class, expected_regexp, callable, args)","Assert exception is raised with matching message.",[9161,9162,9165,9166],{"_17":9149,"_19":9150,"_41":6},{"_17":9163,"_19":9164,"_41":6},"expected_regexp","- Regex pattern for message",{"_17":9152,"_19":9138,"_41":6},{"_17":9140,"_19":9154,"_41":6},[],{"_17":9169,"_31":9170,"_33":9171,"_19":9172,"_36":9173,"_45":46,"_47":9178},"np.testing.assert_string_equal","np.testing.assert_string_equal(actual, desired)","Assert that two strings are equal.\r","Assert that two strings are equal.\r\n\r\nProvides clear diff output for multi-line strings.",[9174,9176],{"_17":8997,"_19":9175,"_41":6},"- Actual string",{"_17":9000,"_19":9177,"_41":6},"- Expected string",[],{"_17":9180,"_31":9181,"_33":9182,"_19":9183,"_36":9184,"_45":481,"_47":9190},"np.testing.assert_warns","np.testing.assert_warns(warning_class, callable, args)","Assert that a function emits a warning.\r","Assert that a function emits a warning.\r\n\r\nNote: JavaScript doesn't have built-in warnings.\r\nThis integrates with a custom warning system if available.",[9185,9188,9189],{"_17":9186,"_19":9187,"_41":6},"warning_class","- Expected warning type",{"_17":9152,"_19":9138,"_41":6},{"_17":9140,"_19":9154,"_41":6},[],{"_17":9192,"_31":9193,"_33":9194,"_19":9194,"_36":9195,"_45":1387,"_47":9199},"np.testing.measure","np.testing.measure(code, times?)","Measure execution time of a code block.",[9196,9198],{"_17":3949,"_19":9197,"_41":6},"- Function to benchmark",{"_17":2896,"_19":2176,"_41":10},[],{"_17":9201,"_31":9202,"_33":9203,"_19":9203,"_36":9204,"_45":46,"_47":9210},"np.testing.print_assert_equal","np.testing.print_assert_equal(test_string, actual, desired)","Print comparison result for debugging.",[9205,9208,9209],{"_17":9206,"_19":9207,"_41":6},"test_string","- Description of test",{"_17":8997,"_19":9040,"_41":6},{"_17":9000,"_19":9042,"_41":6},[],{"_17":9212,"_31":9213,"_33":9214,"_19":9214,"_36":9215,"_45":9217,"_47":9218},"np.absolute","np.absolute(x)","Calculate the absolute value element-wise.",[9216],{"_17":405,"_19":9217,"_41":6},"NDArray",[],{"_17":9220,"_31":9221,"_33":9222,"_19":9222,"_36":9223,"_45":9217,"_47":9228},"np.add","np.add(x1, x2)","Add arguments element-wise.",[9224,9226],{"_17":9225,"_19":9217,"_41":6},"x1",{"_17":9227,"_19":9217,"_41":6},"x2",[],{"_17":9230,"_31":9231,"_33":9232,"_19":9232,"_36":9233,"_45":9240,"_47":9241},"np.all","np.all(a, axis?, keepdims?)","Test whether all array elements along a given axis evaluate to True.",[9234,9235,9237],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":9236,"_41":10},"- Axis along which to test (undefined for entire array)",{"_17":9238,"_19":9239,"_41":10},"keepdims","- If true, keep reduced axis as size-1 dimension","Promise",[],{"_17":9243,"_31":9244,"_33":9245,"_19":9245,"_36":9246,"_45":2194,"_47":9255},"np.allclose","np.allclose(a, b, rtol?, atol?, equal_nan?)","Returns True if two arrays are element-wise equal within a tolerance.",[9247,9248,9249,9251,9253],{"_17":664,"_19":9056,"_41":6},{"_17":408,"_19":9058,"_41":6},{"_17":2072,"_19":9250,"_41":10},"- Relative tolerance (default 1e-5)",{"_17":2075,"_19":9252,"_41":10},"- Absolute tolerance (default 1e-8)",{"_17":9007,"_19":9254,"_41":10},"- Whether to compare NaN's as equal (default false)",[],{"_17":9257,"_31":9258,"_33":9259,"_19":9260,"_36":9261,"_45":9266,"_47":9267},"np.angle","np.angle(z, deg?)","Return the angle of the complex argument.\r","Return the angle of the complex argument.\r\n\r\nThe angle is computed as the counterclockwise angle from the positive\r\nreal axis, using `arctan2(imag, real)`.",[9262,9264],{"_17":6241,"_19":9263,"_41":6},"- A complex number or array of complex numbers",{"_17":6397,"_19":9265,"_41":10},"- Return angle in degrees if true, radians if false (default)","Promise",[],{"_17":9269,"_31":9270,"_33":9271,"_19":9271,"_36":9272,"_45":9240,"_47":9276},"np.any","np.any(a, axis?, keepdims?)","Test whether any array element along a given axis evaluates to True.",[9273,9274,9275],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":9236,"_41":10},{"_17":9238,"_19":9239,"_41":10},[],{"_17":9278,"_31":9279,"_33":9280,"_19":9280,"_36":9281,"_45":9217,"_47":9288},"np.append","np.append(arr, values, axis?)","Append values to the end of an array.",[9282,9284,9286],{"_17":9283,"_19":8908,"_41":6},"arr",{"_17":560,"_19":9285,"_41":6},"- Values to append",{"_17":2911,"_19":9287,"_41":10},"- Axis along which to append (default: flatten both)",[],{"_17":9290,"_31":9291,"_33":9292,"_19":9293,"_36":9294,"_45":9266,"_47":9303},"np.applyAlongAxis","np.applyAlongAxis(func1d, axis, arr, args)","Apply a function to 1-D slices along the given axis.\r","Apply a function to 1-D slices along the given axis.\r\n\r\nExecute `func1d(a, ...args)` where `func1d` operates on 1-D arrays\r\nand `a` is a 1-D slice of `arr` along `axis`.",[9295,9298,9300,9301],{"_17":9296,"_19":9297,"_41":6},"func1d","- Function that accepts a 1-D array and returns a scalar or 1-D array",{"_17":2911,"_19":9299,"_41":6},"- Axis along which to apply `func1d`",{"_17":9283,"_19":8908,"_41":6},{"_17":9140,"_19":9302,"_41":6},"- Additional arguments to pass to `func1d`",[],{"_17":9305,"_31":9306,"_33":9307,"_19":9308,"_36":9309,"_45":9266,"_47":9316},"np.applyOverAxes","np.applyOverAxes(func, arr, axes)","Apply a function repeatedly over multiple axes.\r","Apply a function repeatedly over multiple axes.\r\n\r\n`func` is called as `func(a, axis)` where `a` is the current array\r\nand `axis` is the current axis being processed. The result should\r\nhave the same number of dimensions as the input, or one less if\r\nthe function reduces along the axis (in which case `expandDims` is\r\nautomatically called to maintain dimensionality).",[9310,9312,9313],{"_17":8055,"_19":9311,"_41":6},"- Function to apply, signature: (a, axis) => NDArray",{"_17":9283,"_19":8908,"_41":6},{"_17":9314,"_19":9315,"_41":6},"axes","- Axes over which to apply func",[],{"_17":9318,"_31":9319,"_33":9320,"_19":9320,"_36":9321,"_45":9266,"_47":9331},"np.arange","np.arange(start, end?, step?)","Create an NDArray with evenly spaced values within a given interval.",[9322,9325,9328],{"_17":9323,"_19":9324,"_41":6},"start","- Start value (or end if end is not provided)",{"_17":9326,"_19":9327,"_41":10},"end","- End value (exclusive)",{"_17":9329,"_19":9330,"_41":10},"step","- Step between values (default: 1)",[],{"_17":9333,"_31":9334,"_33":9335,"_19":9335,"_36":9336,"_45":9217,"_47":9338},"np.arccos","np.arccos(x)","Trigonometric inverse cosine, element-wise.",[9337],{"_17":405,"_19":9217,"_41":6},[],{"_17":9340,"_31":9341,"_33":9342,"_19":9342,"_36":9343,"_45":9217,"_47":9345},"np.arccosh","np.arccosh(x)","Inverse hyperbolic cosine, element-wise.",[9344],{"_17":405,"_19":9217,"_41":6},[],{"_17":9347,"_31":9348,"_33":9349,"_19":9349,"_36":9350,"_45":9217,"_47":9352},"np.arcsin","np.arcsin(x)","Inverse sine, element-wise.",[9351],{"_17":405,"_19":9217,"_41":6},[],{"_17":9354,"_31":9355,"_33":9356,"_19":9356,"_36":9357,"_45":9217,"_47":9359},"np.arcsinh","np.arcsinh(x)","Inverse hyperbolic sine element-wise.",[9358],{"_17":405,"_19":9217,"_41":6},[],{"_17":9361,"_31":9362,"_33":9363,"_19":9363,"_36":9364,"_45":9217,"_47":9366},"np.arctan","np.arctan(x)","Trigonometric inverse tangent, element-wise.",[9365],{"_17":405,"_19":9217,"_41":6},[],{"_17":9368,"_31":9369,"_33":9370,"_19":9370,"_36":9371,"_45":9217,"_47":9374},"np.arctan2","np.arctan2(x1, x2)","Element-wise arc tangent of x1/x2 choosing the quadrant correctly.",[9372,9373],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":9376,"_31":9377,"_33":9378,"_19":9378,"_36":9379,"_45":9217,"_47":9381},"np.arctanh","np.arctanh(x)","Inverse hyperbolic tangent element-wise.",[9380],{"_17":405,"_19":9217,"_41":6},[],{"_17":9383,"_31":9384,"_33":9385,"_19":9385,"_36":9386,"_45":8917,"_47":9392},"np.argmax","np.argmax(a, axis?, keepdims?)","Returns the indices of the maximum values along an axis.",[9387,9388,9390],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":9389,"_41":10},"- Axis along which to find argmax. null finds argmax of flattened array.",{"_17":9238,"_19":9391,"_41":10},"- If true, reduced axes are left with size 1",[],{"_17":9394,"_31":9395,"_33":9396,"_19":9396,"_36":9397,"_45":8917,"_47":9402},"np.argmin","np.argmin(a, axis?, keepdims?)","Returns the indices of the minimum values along an axis.",[9398,9399,9401],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":9400,"_41":10},"- Axis along which to find argmin. null finds argmin of flattened array.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":9404,"_31":9405,"_33":9406,"_19":9406,"_36":9407,"_45":9266,"_47":9415},"np.argpartition","np.argpartition(a, kth, axis?)","Returns the indices that would partition an array.",[9408,9410,9413],{"_17":664,"_19":9409,"_41":6},"- Array to partition",{"_17":9411,"_19":9412,"_41":6},"kth","- Index to partition around",{"_17":2911,"_19":9414,"_41":10},"- Axis along which to partition (default: -1)",[],{"_17":9417,"_31":9418,"_33":9419,"_19":9419,"_36":9420,"_45":9266,"_47":9428},"np.argsort","np.argsort(a, axis?, kind?)","Returns the indices that would sort an array.",[9421,9423,9425],{"_17":664,"_19":9422,"_41":6},"- Array to sort",{"_17":2911,"_19":9424,"_41":10},"- Axis along which to sort. null flattens the array.\r\n Default is -1 (last axis).",{"_17":9426,"_19":9427,"_41":10},"kind","- Sorting algorithm",[],{"_17":9430,"_31":9431,"_33":9432,"_19":9432,"_36":9433,"_45":9266,"_47":9435},"np.argwhere","np.argwhere(arr)","Find the indices of array elements that are non-zero, grouped by element.",[9434],{"_17":9283,"_19":8908,"_41":6},[],{"_17":9437,"_31":9438,"_33":9439,"_19":9439,"_36":9440,"_45":9266,"_47":9447},"np.array","np.array(data, shape?, options?)","Create an NDArray from a nested array or flat array with shape.",[9441,9443,9445],{"_17":1215,"_19":9442,"_41":6},"- Nested array or flat array of numbers",{"_17":8459,"_19":9444,"_41":10},"- Optional shape (inferred from nested structure if not provided)",{"_17":454,"_19":9446,"_41":10},"- Optional configuration (dtype)",[],{"_17":9449,"_31":9450,"_33":9451,"_19":9451,"_36":9452,"_45":1793,"_47":9457},"np.array2string","np.array2string(arr, options?)","Return a string representation of an array.",[9453,9455],{"_17":9283,"_19":9454,"_41":6},"- Array to convert",{"_17":454,"_19":9456,"_41":10},"- Override print options",[],{"_17":9459,"_31":9460,"_33":9461,"_19":9461,"_36":9462,"_45":2194,"_47":9468},"np.array_equal","np.array_equal(a1, a2, equal_nan?)","True if two arrays have the same shape and elements, False otherwise.",[9463,9465,9467],{"_17":9464,"_19":9056,"_41":6},"a1",{"_17":9466,"_19":9058,"_41":6},"a2",{"_17":9007,"_19":9254,"_41":10},[],{"_17":9470,"_31":9471,"_33":9472,"_19":9473,"_36":9474,"_45":2194,"_47":9477},"np.array_equiv","np.array_equiv(a1, a2)","Returns True if input arrays are shape consistent and all elements equal.\r","Returns True if input arrays are shape consistent and all elements equal.\r\n\r\nShape consistent means they are either the same shape, or one input array\r\ncan be broadcast to create the same shape as the other one.",[9475,9476],{"_17":9464,"_19":9056,"_41":6},{"_17":9466,"_19":9058,"_41":6},[],{"_17":9479,"_31":9480,"_33":9481,"_19":9482,"_36":9483,"_45":9491,"_47":9492},"np.array_split","np.array_split(arr, indices_or_sections, axis?)","Split an array into multiple sub-arrays as views.\r","Split an array into multiple sub-arrays as views.\r\nAllows unequal division (unlike split).",[9484,9486,9489],{"_17":9283,"_19":9485,"_41":6},"- Array to split",{"_17":9487,"_19":9488,"_41":6},"indices_or_sections","- Number of sections or split indices",{"_17":2911,"_19":9490,"_41":10},"- Axis along which to split (default: 0)","NDArray[]",[],{"_17":9494,"_31":9495,"_33":9496,"_19":9496,"_36":9497,"_45":1793,"_47":9501},"np.arrayRepr","np.arrayRepr(arr, options?)","Return the string representation of an array (with dtype info).",[9498,9500],{"_17":9283,"_19":9499,"_41":6},"- Array to represent",{"_17":454,"_19":9456,"_41":10},[],{"_17":9503,"_31":9504,"_33":9505,"_19":9505,"_36":9506,"_45":1793,"_47":9509},"np.arrayStr","np.arrayStr(arr, options?)","Return a string representation of an array (no dtype).",[9507,9508],{"_17":9283,"_19":9499,"_41":6},{"_17":454,"_19":9456,"_41":10},[],{"_17":9511,"_31":9512,"_33":9513,"_19":9514,"_36":9515,"_45":506,"_47":9522},"np.as_series","np.as_series(alist, trim?)","Convert input to a list of 1D coefficient arrays.\r","Convert input to a list of 1D coefficient arrays.\r\n\r\nThis is used to normalize multiple coefficient array inputs for\r\noperations that work with several polynomials.",[9516,9519],{"_17":9517,"_19":9518,"_41":6},"alist","- List of array-like coefficient sequences",{"_17":9520,"_19":9521,"_41":10},"trim","- If true, remove trailing zeros (default: true)",[],{"_17":9524,"_31":9525,"_33":9526,"_19":9527,"_36":9528,"_45":9266,"_47":9532},"np.asanyarray","np.asanyarray(a, options?)","Convert the input to an array, passing through ndarrays unchanged.\r","Convert the input to an array, passing through ndarrays unchanged.\r\n\r\nIn NumPy, this preserves subclasses of ndarray. In numwasm, there are\r\nno subclasses, so this behaves identically to asarray.",[9529,9531],{"_17":664,"_19":9530,"_41":6},"- Input data",{"_17":454,"_19":9446,"_41":10},[],{"_17":9534,"_31":9535,"_33":9536,"_19":9536,"_36":9537,"_45":9266,"_47":9541},"np.asarray","np.asarray(a, dtype?)","Convert the input to an array.",[9538,9539],{"_17":664,"_19":9530,"_41":6},{"_17":9115,"_19":9540,"_41":10},"- Optional data type",[],{"_17":9543,"_31":9544,"_33":9545,"_19":9545,"_36":9546,"_45":9266,"_47":9549},"np.asarray_chkfinite","np.asarray_chkfinite(a, options?)","Convert the input to an array, checking for NaNs or Infs.",[9547,9548],{"_17":664,"_19":9530,"_41":6},{"_17":454,"_19":9446,"_41":10},[],{"_17":9551,"_31":9552,"_33":9553,"_19":9553,"_36":9554,"_45":9266,"_47":9557},"np.ascontiguousarray","np.ascontiguousarray(a, options?)","Return a contiguous array (ndim >= 1) in memory (C order).",[9555,9556],{"_17":664,"_19":9530,"_41":6},{"_17":454,"_19":9446,"_41":10},[],{"_17":9559,"_31":9560,"_33":9561,"_19":9561,"_36":9562,"_45":9266,"_47":9565},"np.asfortranarray","np.asfortranarray(a, options?)","Return a contiguous array (ndim >= 1) in memory (Fortran order).",[9563,9564],{"_17":664,"_19":9530,"_41":6},{"_17":454,"_19":9446,"_41":10},[],{"_17":9567,"_31":9568,"_33":9569,"_19":9570,"_36":9571,"_45":9217,"_47":9577},"np.astype","np.astype(a, dtype, copy?)","Cast an array to a specified type.\r","Cast an array to a specified type.\r\n\r\nThis is the top-level function version of NDArray.astype().",[9572,9573,9575],{"_17":664,"_19":8908,"_41":6},{"_17":9115,"_19":9574,"_41":6},"- Target data type",{"_17":3572,"_19":9576,"_41":10},"- If true, always return a copy. Default false.",[],{"_17":9579,"_31":9580,"_33":9581,"_19":9582,"_36":9583,"_45":9587,"_47":9588},"np.atleast_1d","np.atleast_1d(arrs)","Convert inputs to arrays with at least one dimension.\r","Convert inputs to arrays with at least one dimension.\r\nScalar inputs are converted to 1D arrays. Higher-dimensional inputs are unchanged.",[9584],{"_17":9585,"_19":9586,"_41":6},"arrs","- Input arrays","NDArray | NDArray[]",[],{"_17":9590,"_31":9591,"_33":9592,"_19":9592,"_36":9593,"_45":9587,"_47":9595},"np.atleast_2d","np.atleast_2d(arrs)","View inputs as arrays with at least two dimensions.",[9594],{"_17":9585,"_19":9586,"_41":6},[],{"_17":9597,"_31":9598,"_33":9599,"_19":9599,"_36":9600,"_45":9587,"_47":9602},"np.atleast_3d","np.atleast_3d(arrs)","View inputs as arrays with at least three dimensions.",[9601],{"_17":9585,"_19":9586,"_41":6},[],{"_17":9604,"_31":9605,"_33":9606,"_19":9606,"_36":9607,"_45":8917,"_47":9615},"np.average","np.average(a, axis?, weights?, keepdims?)","Compute the weighted average along the specified axis.",[9608,9609,9611,9614],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":9610,"_41":10},"- Axis along which to compute average. null computes average of all elements.",{"_17":9612,"_19":9613,"_41":10},"weights","- Array of weights for each value. If null, all weights are equal to 1.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":9617,"_31":9618,"_33":9619,"_19":9620,"_36":9621,"_45":9266,"_47":9624},"np.bartlett","np.bartlett(M)","Return the Bartlett window.\r","Return the Bartlett window.\r\n\r\nThe Bartlett window is very similar to a triangular window, except\r\nthat the end points are at zero. Also known as the triangular or\r\nFejér window.\r\n\r\nFormula:\r\n w(n) = 1 + n/(M-1) for n <= 0\r\n w(n) = 1 - n/(M-1) for n > 0",[9622],{"_17":5526,"_19":9623,"_41":6},"- Number of points in the output window. If zero or less,\r\n an empty array is returned.",[],{"_17":9626,"_31":9627,"_33":9628,"_19":9628,"_36":9629,"_45":1793,"_47":9639},"np.baseRepr","np.baseRepr(num, base?, padding?)","Return a string representation of a number in the given base.",[9630,9633,9636],{"_17":9631,"_19":9632,"_41":6},"num","- Integer to convert",{"_17":9634,"_19":9635,"_41":10},"base","- Number base (2-36)",{"_17":9637,"_19":9638,"_41":10},"padding","- Minimum number of digits",[],{"_17":9641,"_31":9642,"_33":9643,"_19":9643,"_36":9644,"_45":9650,"_47":9651},"np.baseReprArray","np.baseReprArray(arr, base?, padding?)","Convert an array of numbers to base-N representations.",[9645,9647,9648],{"_17":9283,"_19":9646,"_41":6},"- Array of integers",{"_17":9634,"_19":9635,"_41":10},{"_17":9637,"_19":9649,"_41":10},"- Minimum digits per number","string[]",[],{"_17":9653,"_31":9654,"_33":9655,"_19":9656,"_36":9657,"_45":1793,"_47":9661},"np.binaryRepr","np.binaryRepr(num, width?)","Base Conversion Functions\r","Base Conversion Functions\r\n\r\nFunctions for converting numbers to binary and arbitrary base representations.\r\n\r\nReference: numpy/_core/numeric.py (binary_repr, base_repr)",[9658,9659],{"_17":9631,"_19":9632,"_41":6},{"_17":654,"_19":9660,"_41":10},"- Fixed width for two's complement representation",[],{"_17":9663,"_31":9664,"_33":9665,"_19":9665,"_36":9666,"_45":9650,"_47":9670},"np.binaryReprArray","np.binaryReprArray(arr, width?)","Convert an array of numbers to binary representations.",[9667,9668],{"_17":9283,"_19":9646,"_41":6},{"_17":654,"_19":9669,"_41":10},"- Fixed width for all representations",[],{"_17":9672,"_31":9673,"_33":9674,"_19":9674,"_36":9675,"_45":9266,"_47":9683},"np.bincount","np.bincount(x, weights?, minlength?)","Count number of occurrences of each value in array of non-negative ints.",[9676,9678,9680],{"_17":405,"_19":9677,"_41":6},"- Input array of non-negative integers",{"_17":9612,"_19":9679,"_41":10},"- Weights, array of the same shape as x (optional)",{"_17":9681,"_19":9682,"_41":10},"minlength","- Minimum number of bins for the output array (default: 0)",[],{"_17":9685,"_31":9686,"_33":9687,"_19":9687,"_36":9688,"_45":9217,"_47":9691},"np.bitwise_and","np.bitwise_and(x1, x2)","Compute the bit-wise AND of two arrays element-wise.",[9689,9690],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":9693,"_31":9694,"_33":9695,"_19":9696,"_36":9697,"_45":9217,"_47":9700},"np.bitwise_count","np.bitwise_count(x)","Computes the number of 1-bits in the absolute value of x.\r","Computes the number of 1-bits in the absolute value of x.\r\nAlso known as popcount or population count.\r\nInput array must be integers.",[9698],{"_17":405,"_19":9699,"_41":6},"- Input array of integers",[],{"_17":9702,"_31":9703,"_33":9704,"_19":9704,"_36":9705,"_45":9217,"_47":9708},"np.bitwise_or","np.bitwise_or(x1, x2)","Compute the bit-wise OR of two arrays element-wise.",[9706,9707],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":9710,"_31":9711,"_33":9712,"_19":9712,"_36":9713,"_45":9217,"_47":9716},"np.bitwise_xor","np.bitwise_xor(x1, x2)","Compute the bit-wise XOR of two arrays element-wise.",[9714,9715],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":9718,"_31":9719,"_33":9720,"_19":9721,"_36":9722,"_45":9266,"_47":9724},"np.blackman","np.blackman(M)","Return the Blackman window.\r","Return the Blackman window.\r\n\r\nThe Blackman window is a taper formed by using the first three\r\nterms of a summation of cosines. It was designed to have close to\r\nthe minimal leakage possible.\r\n\r\nFormula: w(n) = 0.42 + 0.5*cos(π*n/(M-1)) + 0.08*cos(2π*n/(M-1))",[9723],{"_17":5526,"_19":9623,"_41":6},[],{"_17":9726,"_31":9727,"_33":9728,"_19":9728,"_36":9729,"_45":9217,"_47":9733},"np.block","np.block(arrays)","Assemble an nd-array from nested lists of blocks.",[9730],{"_17":9731,"_19":9732,"_41":6},"arrays","- Nested list of arrays (1D list for hstack, 2D for block assembly)",[],{"_17":9735,"_31":9736,"_33":9737,"_19":9738,"_36":9739,"_45":9742,"_47":9743},"np.broadcastArrays","np.broadcastArrays(arrays)","Broadcast any number of arrays against each other.\r","Broadcast any number of arrays against each other.\r\n\r\nReturns views of the arrays with the same shape. All returned arrays\r\nshare data with their originals.",[9740],{"_17":9731,"_19":9741,"_41":6},"- Arrays to broadcast together","Promise",[],{"_17":9745,"_31":9746,"_33":9747,"_19":9747,"_36":9748,"_45":9755,"_47":9756},"np.broadcastShapes","np.broadcastShapes(shape1, shape2)","Compute the broadcast shape for two shapes.",[9749,9752],{"_17":9750,"_19":9751,"_41":6},"shape1","- First shape",{"_17":9753,"_19":9754,"_41":6},"shape2","- Second shape","Promise",[],{"_17":9758,"_31":9759,"_33":9760,"_19":9760,"_36":9761,"_45":9755,"_47":9765},"np.broadcastShapesMulti","np.broadcastShapesMulti(shapes)","Compute the broadcast shape for multiple shapes.",[9762],{"_17":9763,"_19":9764,"_41":6},"shapes","- Array of shapes",[],{"_17":9767,"_31":9768,"_33":9769,"_19":9770,"_36":9771,"_45":9266,"_47":9777},"np.broadcastTo","np.broadcastTo(arr, targetShape)","Broadcast an array to a target shape.\r","Broadcast an array to a target shape.\r\n\r\nReturns a view of the array with the target shape. The view shares\r\ndata with the original array but has zero strides for broadcast dimensions.",[9772,9774],{"_17":9283,"_19":9773,"_41":6},"- Array to broadcast",{"_17":9775,"_19":9776,"_41":6},"targetShape","- Target shape",[],{"_17":9779,"_31":9780,"_33":9781,"_19":9781,"_36":9782,"_45":9788,"_47":9789},"np.buildIndexSpecs","np.buildIndexSpecs(indices, shape)","Build IndexSpec array from parsed indices for C interop.",[9783,9786],{"_17":9784,"_19":9785,"_41":6},"indices","- Expanded index elements (no ellipsis)",{"_17":8459,"_19":9787,"_41":6},"- Shape of the array being indexed","IndexSpec[]",[],{"_17":9791,"_31":9792,"_33":9793,"_19":9793,"_36":9794,"_45":9797,"_47":9798},"np.bytes","np.bytes(length)","Return random bytes.",[9795],{"_17":2841,"_19":9796,"_41":6},"- Number of random bytes to generate","Uint8Array",[],{"_17":9800,"_31":9801,"_33":9802,"_19":9802,"_36":9803,"_45":2598,"_47":9813},"np.can_cast","np.can_cast(from, to, casting?)","Returns true if cast between data types can occur according to the casting rule.",[9804,9807,9810],{"_17":9805,"_19":9806,"_41":6},"from","- Data type to cast from",{"_17":9808,"_19":9809,"_41":6},"to","- Data type to cast to",{"_17":9811,"_19":9812,"_41":10},"casting","- Controls what kind of data casting may occur:\r\n- 'no': No casting allowed\r\n- 'equiv': Only byte-order changes allowed\r\n- 'safe': Only casts that can preserve values allowed\r\n- 'same_kind': Only safe casts or casts within a kind allowed\r\n- 'unsafe': Any data conversions allowed",[],{"_17":9815,"_31":9816,"_33":9817,"_19":9817,"_36":9818,"_45":9217,"_47":9820},"np.cbrt","np.cbrt(x)","Return the cube-root of an array, element-wise.",[9819],{"_17":405,"_19":9217,"_41":6},[],{"_17":9822,"_31":9823,"_33":9824,"_19":9824,"_36":9825,"_45":9217,"_47":9827},"np.ceil","np.ceil(x)","Return the ceiling of the input, element-wise.",[9826],{"_17":405,"_19":9217,"_41":6},[],{"_17":9829,"_31":9830,"_33":9831,"_19":9831,"_36":9832,"_45":374,"_47":9835},"np.cheb2poly","np.cheb2poly(c)","Convert Chebyshev coefficients to power series.",[9833],{"_17":713,"_19":9834,"_41":6},"- Chebyshev coefficients",[],{"_17":9837,"_31":9838,"_33":9839,"_19":9839,"_36":9840,"_45":374,"_47":9843},"np.chebadd","np.chebadd(c1, c2)","Add two Chebyshev polynomials.",[9841,9842],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":9845,"_31":9846,"_33":9847,"_19":9847,"_36":9848,"_45":506,"_47":9851},"np.chebcompanion","np.chebcompanion(c)","Generate Chebyshev companion matrix.",[9849],{"_17":713,"_19":9850,"_41":6},"- Coefficient array",[],{"_17":9853,"_31":9854,"_33":9855,"_19":9855,"_36":9856,"_45":374,"_47":9860},"np.chebder","np.chebder(c, m?)","Chebyshev derivative.",[9857,9858],{"_17":713,"_19":9850,"_41":6},{"_17":630,"_19":9859,"_41":10},"- Number of derivatives (default: 1)",[],{"_17":9862,"_31":9863,"_33":9864,"_19":9864,"_36":9865,"_45":9868,"_47":9869},"np.chebdiv","np.chebdiv(c1, c2)","Divide two Chebyshev polynomials.",[9866,9867],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},"[number[], number[]]",[],{"_17":9871,"_31":9872,"_33":9873,"_19":9873,"_36":9874,"_45":9889,"_47":9890},"np.chebfit","np.chebfit(x, y, deg, rcond?, full?, w?)","Chebyshev least squares fit.",[9875,9877,9879,9881,9884,9886],{"_17":405,"_19":9876,"_41":6},"- x values",{"_17":2467,"_19":9878,"_41":6},"- y values",{"_17":6397,"_19":9880,"_41":6},"- Degree of fitting polynomial",{"_17":9882,"_19":9883,"_41":10},"rcond","- Cutoff for small singular values",{"_17":7871,"_19":9885,"_41":10},"- If true, return extra info",{"_17":9887,"_19":9888,"_41":10},"w","- Weights","Promise",[],{"_17":9892,"_31":9893,"_33":9894,"_19":9894,"_36":9895,"_45":374,"_47":9898},"np.chebfromroots","np.chebfromroots(roots)","Construct Chebyshev polynomial from roots.",[9896],{"_17":6420,"_19":9897,"_41":6},"- Array of roots",[],{"_17":9900,"_31":9901,"_33":9902,"_19":9902,"_36":9903,"_45":374,"_47":9912},"np.chebint","np.chebint(c, m?, k?, lbnd?)","Chebyshev integral.",[9904,9905,9907,9909],{"_17":713,"_19":9850,"_41":6},{"_17":630,"_19":9906,"_41":10},"- Number of integrals (default: 1)",{"_17":4686,"_19":9908,"_41":10},"- Integration constants (default: all zero)",{"_17":9910,"_19":9911,"_41":10},"lbnd","- Lower bound (default: 0)",[],{"_17":9914,"_31":9915,"_33":9916,"_19":9917,"_36":9918,"_45":9926,"_47":9927},"np.chebinterpolate","np.chebinterpolate(func, deg, domain?)","Interpolate a function using Chebyshev polynomials.\r","Interpolate a function using Chebyshev polynomials.\r\n\r\nUses Chebyshev nodes for optimal interpolation on [-1, 1].",[9919,9921,9923],{"_17":8055,"_19":9920,"_41":6},"- Function to interpolate",{"_17":6397,"_19":9922,"_41":6},"- Degree of interpolating polynomial",{"_17":9924,"_19":9925,"_41":10},"domain","- Domain for interpolation (default: [-1, 1])","Promise",[],{"_17":9929,"_31":9930,"_33":9931,"_19":9931,"_36":9932,"_45":374,"_47":9935},"np.chebmul","np.chebmul(c1, c2)","Multiply two Chebyshev polynomials.",[9933,9934],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":9937,"_31":9938,"_33":9939,"_19":9939,"_36":9940,"_45":374,"_47":9946},"np.chebpow","np.chebpow(c, pow, maxpower?)","Raise Chebyshev polynomial to a power.",[9941,9942,9944],{"_17":713,"_19":374,"_41":6},{"_17":9943,"_19":1387,"_41":6},"pow",{"_17":9945,"_19":1387,"_41":10},"maxpower",[],{"_17":9948,"_31":9949,"_33":9950,"_19":9950,"_36":9951,"_45":9926,"_47":9953},"np.chebroots","np.chebroots(c)","Find Chebyshev polynomial roots.",[9952],{"_17":713,"_19":9850,"_41":6},[],{"_17":9955,"_31":9956,"_33":9957,"_19":9957,"_36":9958,"_45":374,"_47":9961},"np.chebsub","np.chebsub(c1, c2)","Subtract two Chebyshev polynomials.",[9959,9960],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":9963,"_31":9964,"_33":9965,"_19":9965,"_36":9966,"_45":1387,"_47":9971},"np.chebval","np.chebval(x, c)","Evaluate Chebyshev polynomial using Clenshaw's algorithm.",[9967,9969],{"_17":405,"_19":9968,"_41":6},"- Point at which to evaluate",{"_17":713,"_19":9970,"_41":6},"- Coefficient array [c0, c1, c2, ...] for c0*T_0 + c1*T_1 + c2*T_2 + ...",[],{"_17":9973,"_31":9974,"_33":9975,"_19":9975,"_36":9976,"_45":374,"_47":9983},"np.chebval2d","np.chebval2d(x, y, c)","Evaluate 2D Chebyshev polynomial.",[9977,9979,9981],{"_17":405,"_19":9978,"_41":6},"- x coordinates",{"_17":2467,"_19":9980,"_41":6},"- y coordinates",{"_17":713,"_19":9982,"_41":6},"- 2D coefficient array",[],{"_17":9985,"_31":9986,"_33":9987,"_19":9987,"_36":9988,"_45":506,"_47":9993},"np.chebvander","np.chebvander(x, deg)","Chebyshev Vandermonde matrix.",[9989,9991],{"_17":405,"_19":9990,"_41":6},"- Sample points",{"_17":6397,"_19":9992,"_41":6},"- Degree of polynomial",[],{"_17":9995,"_31":9996,"_33":9997,"_19":9997,"_36":9998,"_45":8917,"_47":10008},"np.choice","np.choice(a, size?, replace?, p?)","Generates a random sample from a given array or range.",[9999,10001,10003,10006],{"_17":664,"_19":10000,"_41":6},"- If an array, a random sample is generated from its elements.\r\n If an int, the random sample is generated from arange(a).",{"_17":1865,"_19":10002,"_41":10},"- Output shape. If null (default), a single value is returned.",{"_17":10004,"_19":10005,"_41":10},"replace","- Whether the sample is with or without replacement. Default is true.",{"_17":5212,"_19":10007,"_41":10},"- Probabilities associated with each entry in a. If not given, the sample\r\n assumes a uniform distribution over all entries.",[],{"_17":10010,"_31":10011,"_33":10012,"_19":10013,"_36":10014,"_45":9266,"_47":10019},"np.cholesky","np.cholesky(a, upper?)","Cholesky decomposition.\r","Cholesky decomposition.\r\n\r\nReturns the Cholesky factor of a Hermitian positive-definite matrix.",[10015,10017],{"_17":664,"_19":10016,"_41":6},"- Hermitian positive-definite matrix (N x N)",{"_17":4709,"_19":10018,"_41":10},"- If true, return upper triangular U (a = U^H @ U),\r\n otherwise return lower triangular L (a = L @ L^H)",[],{"_17":10021,"_31":10022,"_33":10023,"_19":10023,"_36":10024,"_45":9266,"_47":10032},"np.choose","np.choose(indices, choices, mode?)","Construct an array from an index array and a set of arrays to choose from.",[10025,10027,10030],{"_17":9784,"_19":10026,"_41":6},"- Array of indices into choices",{"_17":10028,"_19":10029,"_41":6},"choices","- Array of choice arrays",{"_17":6182,"_19":10031,"_41":10},"- How to handle out-of-bounds indices (default: 'raise')",[],{"_17":10034,"_31":10035,"_33":10036,"_19":10037,"_36":10038,"_45":9266,"_47":10047},"np.clip","np.clip(a, a_min, a_max)","Clip (limit) the values in an array.\r","Clip (limit) the values in an array.\r\n\r\nGiven an interval, values outside the interval are clipped to the interval edges.\r\nFor example, if an interval of [0, 1] is specified, values smaller than 0\r\nbecome 0, and values larger than 1 become 1.",[10039,10041,10044],{"_17":664,"_19":10040,"_41":6},"- Array containing elements to clip",{"_17":10042,"_19":10043,"_41":6},"a_min","- Minimum value. If null, clipping is not performed on the lower interval edge.",{"_17":10045,"_19":10046,"_41":6},"a_max","- Maximum value. If null, clipping is not performed on the upper interval edge.",[],{"_17":10049,"_31":10050,"_33":10051,"_19":10051,"_36":10052,"_45":9217,"_47":10056},"np.column_stack","np.column_stack(tup)","Stack 1-D arrays as columns into a 2-D array.",[10053],{"_17":10054,"_19":10055,"_41":6},"tup","- Sequence of 1-D or 2-D arrays",[],{"_17":10058,"_31":10059,"_33":10060,"_19":10060,"_36":10061,"_45":10065,"_47":10066},"np.common_type","np.common_type(dtypes)","Determine common type following standard coercion rules.",[10062],{"_17":10063,"_19":10064,"_41":6},"dtypes","DType[]","DType",[],{"_17":10068,"_31":10069,"_33":10070,"_19":10070,"_36":10071,"_45":10065,"_47":10073},"np.commonType","np.commonType(dtypes)","Get common type for multiple dtypes.",[10072],{"_17":10063,"_19":10064,"_41":6},[],{"_17":10075,"_31":10076,"_33":10077,"_19":10077,"_36":10078,"_45":9217,"_47":10083},"np.compare_chararrays","np.compare_chararrays(x1, x2)","Compare two string arrays element-wise.",[10079,10081],{"_17":9225,"_19":10080,"_41":6},"- First string array",{"_17":9227,"_19":10082,"_41":6},"- Second string array",[],{"_17":10085,"_31":10086,"_33":10087,"_19":10087,"_36":10088,"_45":9266,"_47":10095},"np.compress","np.compress(condition, arr, axis?)","Return selected slices of an array along given axis.",[10089,10092,10093],{"_17":10090,"_19":10091,"_41":6},"condition","- Boolean 1D array selecting which slices to keep",{"_17":9283,"_19":8908,"_41":6},{"_17":2911,"_19":10094,"_41":10},"- Axis along which to select (default: 0)",[],{"_17":10097,"_31":10098,"_33":10099,"_19":10100,"_36":10101,"_45":9755,"_47":10104},"np.computeBroadcastStrides","np.computeBroadcastStrides(arr, targetShape)","Compute the strides needed to broadcast an array to a target shape.\r","Compute the strides needed to broadcast an array to a target shape.\r\nThis is mainly for internal use.",[10102,10103],{"_17":9283,"_19":9773,"_41":6},{"_17":9775,"_19":9776,"_41":6},[],{"_17":10106,"_31":10107,"_33":10108,"_19":10108,"_36":10109,"_45":374,"_47":10115},"np.computeResultShape","np.computeResultShape(specs, shape)","Compute the result shape from index specifications.",[10110,10113],{"_17":10111,"_19":10112,"_41":6},"specs","- Array of IndexSpec",{"_17":8459,"_19":10114,"_41":6},"- Original array shape",[],{"_17":10117,"_31":10118,"_33":10119,"_19":10119,"_36":10120,"_45":9217,"_47":10127},"np.concatenate","np.concatenate(arrays, axis?, dtype?)","Join a sequence of arrays along an existing axis.",[10121,10123,10125],{"_17":9731,"_19":10122,"_41":6},"- Sequence of arrays to concatenate",{"_17":2911,"_19":10124,"_41":10},"- The axis along which to concatenate (default: 0)",{"_17":9115,"_19":10126,"_41":10},"- Optional dtype for the output array",[],{"_17":10129,"_31":10130,"_33":10131,"_19":10131,"_36":10132,"_45":3784,"_47":10137},"np.cond","np.cond(x, p?)","Compute the condition number of a matrix.",[10133,10135],{"_17":405,"_19":10134,"_41":6},"- Matrix",{"_17":5212,"_19":10136,"_41":10},"- Norm order (default: 2, using SVD)",[],{"_17":10139,"_31":10140,"_33":10141,"_19":10142,"_36":10143,"_45":46,"_47":10145},"np.configureWasm","np.configureWasm(config)","Configure WASM loading before initialization.\r","Configure WASM loading before initialization.\r\nMust be called before loadWasmModule() for custom URLs.",[10144],{"_17":3805,"_19":8949,"_41":6},[],{"_17":10147,"_31":10148,"_33":10149,"_19":10150,"_36":10151,"_45":9217,"_47":10153},"np.conjugate","np.conjugate(x)","Return the complex conjugate, element-wise.\r","Return the complex conjugate, element-wise.\r\n\r\nThe complex conjugate of a complex number is obtained by changing\r\nthe sign of its imaginary part.\r\n\r\nFor non-complex arrays, returns a copy of the input.",[10152],{"_17":405,"_19":8908,"_41":6},[],{"_17":10155,"_31":10156,"_33":10157,"_19":10158,"_36":10159,"_45":9266,"_47":10166},"np.convolve","np.convolve(a, v, mode?)","Returns the discrete, linear convolution of two one-dimensional sequences.\r","Returns the discrete, linear convolution of two one-dimensional sequences.\r\n\r\nThe convolution product is only given for points where the signals overlap completely.\r\nValues outside the signal boundary have no effect.",[10160,10162,10164],{"_17":664,"_19":10161,"_41":6},"- First one-dimensional input array",{"_17":676,"_19":10163,"_41":6},"- Second one-dimensional input array",{"_17":6182,"_19":10165,"_41":10},"- 'full', 'same', or 'valid':\r\n- 'full': Output is the full discrete linear convolution (default)\r\n- 'same': Output is the same size as a, centered with respect to the 'full' output\r\n- 'valid': Output consists only of those elements that do not rely on zero-padding",[],{"_17":10168,"_31":10169,"_33":10170,"_19":10170,"_36":10171,"_45":9266,"_47":10173},"np.copy","np.copy(a)","Return a copy of an array.",[10172],{"_17":664,"_19":8908,"_41":6},[],{"_17":10175,"_31":10176,"_33":10177,"_19":10177,"_36":10178,"_45":9217,"_47":10181},"np.copysign","np.copysign(x1, x2)","Change the sign of x1 to that of x2, element-wise.",[10179,10180],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10183,"_31":10184,"_33":10185,"_19":10185,"_36":10186,"_45":46,"_47":10198},"np.copyto","np.copyto(dst, src, _casting?, where?)","Copy values from one array to another, broadcasting as necessary.",[10187,10190,10193,10195],{"_17":10188,"_19":10189,"_41":6},"dst","- Destination array",{"_17":10191,"_19":10192,"_41":6},"src","- Source array",{"_17":10194,"_19":1793,"_41":10},"_casting",{"_17":10196,"_19":10197,"_41":10},"where","- Optional boolean mask array",[],{"_17":10200,"_31":10201,"_33":10202,"_19":10203,"_36":10204,"_45":9266,"_47":10212},"np.corrcoef","np.corrcoef(x, y?, rowvar?)","Return Pearson product-moment correlation coefficients.\r","Return Pearson product-moment correlation coefficients.\r\n\r\nThe correlation coefficient matrix of the variables.",[10205,10207,10209],{"_17":405,"_19":10206,"_41":6},"- A 1-D or 2-D array containing multiple variables and observations",{"_17":2467,"_19":10208,"_41":10},"- An additional set of variables and observations. Has the same shape as x.",{"_17":10210,"_19":10211,"_41":10},"rowvar","- If true, each row represents a variable, with observations in columns.\r\n If false, the relationship is transposed.",[],{"_17":10214,"_31":10215,"_33":10216,"_19":10217,"_36":10218,"_45":9266,"_47":10223},"np.correlate","np.correlate(a, v, mode?)","Cross-correlation of two 1-dimensional sequences.\r","Cross-correlation of two 1-dimensional sequences.\r\n\r\nThis function computes the correlation as generally understood in signal processing texts:\r\nc_k = sum_n a_{n+k} * conj(v_n)",[10219,10220,10221],{"_17":664,"_19":10161,"_41":6},{"_17":676,"_19":10163,"_41":6},{"_17":6182,"_19":10222,"_41":10},"- 'full', 'same', or 'valid':\r\n- 'full': Output is the full discrete linear correlation (default)\r\n- 'same': Output is the same size as a, centered with respect to the 'full' output\r\n- 'valid': Output consists only of those elements that do not rely on zero-padding",[],{"_17":10225,"_31":10226,"_33":10227,"_19":10227,"_36":10228,"_45":9217,"_47":10230},"np.cos","np.cos(x)","Cosine element-wise.",[10229],{"_17":405,"_19":9217,"_41":6},[],{"_17":10232,"_31":10233,"_33":10234,"_19":10234,"_36":10235,"_45":9217,"_47":10237},"np.cosh","np.cosh(x)","Hyperbolic cosine, element-wise.",[10236],{"_17":405,"_19":9217,"_41":6},[],{"_17":10239,"_31":10240,"_33":10241,"_19":10241,"_36":10242,"_45":3784,"_47":10244},"np.countNonzero","np.countNonzero(arr)","Count the number of nonzero elements in an array.",[10243],{"_17":9283,"_19":8908,"_41":6},[],{"_17":10246,"_31":10247,"_33":10248,"_19":10249,"_36":10250,"_45":9266,"_47":10260},"np.cov","np.cov(m, y?, rowvar?, bias?, ddof?)","Estimate a covariance matrix.\r","Estimate a covariance matrix.\r\n\r\nCovariance indicates the level to which two variables vary together.",[10251,10252,10254,10255,10257],{"_17":630,"_19":10206,"_41":6},{"_17":2467,"_19":10253,"_41":10},"- An additional set of variables and observations. Has the same shape as m.",{"_17":10210,"_19":10211,"_41":10},{"_17":8915,"_19":10256,"_41":10},"- If false (default), normalization is by (N-1). If true, normalization is by N.",{"_17":10258,"_19":10259,"_41":10},"ddof","- If not null, this overrides the bias setting. ddof=1 gives unbiased estimate,\r\n ddof=0 gives biased estimate.",[],{"_17":10262,"_31":10263,"_33":10264,"_19":10265,"_36":10266,"_45":9266,"_47":10282},"np.cross","np.cross(a, b, axisa?, axisb?, axisc?, axis?)","Return the cross product of two (arrays of) vectors.\r","Return the cross product of two (arrays of) vectors.\r\n\r\nThe cross product of a and b in R^3 is a vector perpendicular to both\r\na and b. The vectors are defined by the last axis by default.",[10267,10269,10271,10274,10277,10280],{"_17":664,"_19":10268,"_41":6},"- First vector(s)",{"_17":408,"_19":10270,"_41":6},"- Second vector(s)",{"_17":10272,"_19":10273,"_41":10},"axisa","- Axis of a that defines the vector(s) (default: -1)",{"_17":10275,"_19":10276,"_41":10},"axisb","- Axis of b that defines the vector(s) (default: -1)",{"_17":10278,"_19":10279,"_41":10},"axisc","- Axis of c that contains the cross product vectors (default: -1)",{"_17":2911,"_19":10281,"_41":10},"- If specified, overrides axisa, axisb, and axisc",[],{"_17":10284,"_31":10285,"_33":10286,"_19":10286,"_36":10287,"_45":9266,"_47":10293},"np.cumprod","np.cumprod(a, axis?, dtype?)","Return the cumulative product of elements along a given axis.",[10288,10289,10291],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":10290,"_41":10},"- Axis along which to compute cumprod. null = flatten first",{"_17":9115,"_19":10292,"_41":10},"- Type of output array (default: promotes integers to float64)",[],{"_17":10295,"_31":10296,"_33":10297,"_19":10297,"_36":10298,"_45":9266,"_47":10303},"np.cumsum","np.cumsum(a, axis?, dtype?)","Return the cumulative sum of the elements along a given axis.",[10299,10300,10302],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":10301,"_41":10},"- Axis along which to compute cumsum. null = flatten first",{"_17":9115,"_19":10292,"_41":10},[],{"_17":10305,"_31":10306,"_33":10307,"_19":10308,"_36":10309,"_45":9266,"_47":10317},"np.cumulative_prod","np.cumulative_prod(x, axis?, dtype?, _include_initial?)","Return the cumulative product of array elements.\r","Return the cumulative product of array elements.\r\n\r\nNumPy 2.0 alias for cumprod with include_initial support.",[10310,10311,10313,10315],{"_17":405,"_19":8908,"_41":6},{"_17":2911,"_19":10312,"_41":10},"- Axis along which to compute. Default: 0",{"_17":9115,"_19":10314,"_41":10},"- Type of output array",{"_17":10316,"_19":2598,"_41":10},"_include_initial",[],{"_17":10319,"_31":10320,"_33":10321,"_19":10322,"_36":10323,"_45":9266,"_47":10328},"np.cumulative_sum","np.cumulative_sum(x, axis?, dtype?, _include_initial?)","Return the cumulative sum of array elements.\r","Return the cumulative sum of array elements.\r\n\r\nNumPy 2.0 alias for cumsum with include_initial support.",[10324,10325,10326,10327],{"_17":405,"_19":8908,"_41":6},{"_17":2911,"_19":10312,"_41":10},{"_17":9115,"_19":10314,"_41":10},{"_17":10316,"_19":2598,"_41":10},[],{"_17":10330,"_31":10331,"_33":10332,"_19":10332,"_36":10333,"_45":9217,"_47":10339},"np.decode","np.decode(a, encoding?)","Decode bytes to strings using specified encoding.",[10334,10336],{"_17":664,"_19":10335,"_41":6},"- Array of byte arrays (Uint8Arrays)",{"_17":10337,"_19":10338,"_41":10},"encoding","- Character encoding (default 'utf-8')",[],{"_17":10341,"_31":10342,"_33":10343,"_19":10344,"_36":10345,"_45":10351,"_47":10352},"np.default_rng","np.default_rng(seed?, options?)","Construct a new Generator with the given BitGenerator.\r","Construct a new Generator with the given BitGenerator.\r\n\r\nIf seed is:\r\n- null/undefined: Use OS entropy\r\n- number/bigint: Create SeedSequence from the integer\r\n- array: Create SeedSequence from the array\r\n- SeedSequence: Use directly\r\n- BitGenerator: Use directly",[10346,10349],{"_17":10347,"_19":10348,"_41":10},"seed","- Seed value or BitGenerator",{"_17":454,"_19":10350,"_41":10},"- Options object with optional bitGenerator name","Generator_2",[],{"_17":10354,"_31":10355,"_33":10356,"_19":10356,"_36":10357,"_45":9217,"_47":10359},"np.degrees","np.degrees(x)","Convert angles from radians to degrees.",[10358],{"_17":405,"_19":9217,"_41":6},[],{"_17":10361,"_31":10362,"_33":10363,"_19":10363,"_36":10364,"_45":9266,"_47":10371},"np.deleteArr","np.deleteArr(arr, obj, axis?)","Return a new array with sub-arrays along an axis deleted.",[10365,10366,10369],{"_17":9283,"_19":8908,"_41":6},{"_17":10367,"_19":10368,"_41":6},"obj","- Index or indices to delete",{"_17":2911,"_19":10370,"_41":10},"- Axis along which to delete (default: flatten first)",[],{"_17":10373,"_31":10374,"_33":10375,"_19":10375,"_36":10376,"_45":10065,"_47":10379},"np.descrToDtype","np.descrToDtype(descr)","Parse NPY descriptor string to DType.",[10377],{"_17":10378,"_19":1793,"_41":6},"descr",[],{"_17":10381,"_31":10382,"_33":10383,"_19":10383,"_36":10384,"_45":3784,"_47":10387},"np.det","np.det(a)","Compute the determinant of an array.",[10385],{"_17":664,"_19":10386,"_41":6},"- Square matrix (N x N)",[],{"_17":10389,"_31":10390,"_33":10391,"_19":10391,"_36":10392,"_45":9266,"_47":10397},"np.diag","np.diag(v, k?)","Extract a diagonal or construct a diagonal array.",[10393,10395],{"_17":676,"_19":10394,"_41":6},"- Input array (1D to create diagonal matrix, 2D to extract diagonal)",{"_17":4686,"_19":10396,"_41":10},"- Diagonal offset (default: 0)",[],{"_17":10399,"_31":10400,"_33":10401,"_19":10401,"_36":10402,"_45":9742,"_47":10408},"np.diag_indices","np.diag_indices(n, ndim?)","Return the indices to access the main diagonal of an array.",[10403,10405],{"_17":1206,"_19":10404,"_41":6},"- Size of the array (along each dimension)",{"_17":10406,"_19":10407,"_41":10},"ndim","- Number of dimensions (default: 2)",[],{"_17":10410,"_31":10411,"_33":10412,"_19":10413,"_36":10414,"_45":9742,"_47":10417},"np.diag_indices_from","np.diag_indices_from(arr)","Return the indices to access the main diagonal of an array.\r","Return the indices to access the main diagonal of an array.\r\n\r\nThis returns a tuple of arrays, one for each dimension of a,\r\nsuitable for accessing the diagonal of an array.",[10415],{"_17":9283,"_19":10416,"_41":6},"- Array of which to get diagonal indices",[],{"_17":10419,"_31":10420,"_33":10421,"_19":10421,"_36":10422,"_45":9266,"_47":10429},"np.diagflat","np.diagflat(v, k?, options?)","Create a 2D array with the flattened input as a diagonal.",[10423,10425,10427],{"_17":676,"_19":10424,"_41":6},"- Input array, which will be flattened",{"_17":4686,"_19":10426,"_41":10},"- Diagonal to set (default: 0, main diagonal)",{"_17":454,"_19":10428,"_41":10},"NDArrayOptions",[],{"_17":10431,"_31":10432,"_33":10433,"_19":10433,"_36":10434,"_45":9266,"_47":10443},"np.diagonal","np.diagonal(arr, offset?, axis1?, axis2?)","Return specified diagonals from a 2D array.",[10435,10437,10439,10441],{"_17":9283,"_19":10436,"_41":6},"- Input array (must be 2D)",{"_17":3056,"_19":10438,"_41":10},"- Offset from main diagonal (default: 0)",{"_17":10440,"_19":1387,"_41":10},"axis1",{"_17":10442,"_19":1387,"_41":10},"axis2",[],{"_17":10445,"_31":10446,"_33":10447,"_19":10448,"_36":10449,"_45":9266,"_47":10455},"np.diff","np.diff(a, n?, axis?)","Calculate the n-th discrete difference along the given axis.\r","Calculate the n-th discrete difference along the given axis.\r\n\r\nThe first difference is given by out[i] = a[i+1] - a[i] along the given axis,\r\nhigher differences are calculated by using diff recursively.",[10450,10451,10453],{"_17":664,"_19":8908,"_41":6},{"_17":1206,"_19":10452,"_41":10},"- The number of times values are differenced. If zero, the input is returned as-is.",{"_17":2911,"_19":10454,"_41":10},"- The axis along which the difference is taken, default is the last axis.",[],{"_17":10457,"_31":10458,"_33":10459,"_19":10459,"_36":10460,"_45":9266,"_47":10469},"np.digitize","np.digitize(x, bins, right?)","Return the indices of the bins to which each value in input array belongs.",[10461,10463,10466],{"_17":405,"_19":10462,"_41":6},"- Input array to be binned",{"_17":10464,"_19":10465,"_41":6},"bins","- Array of bins. Must be 1-dimensional and monotonic.",{"_17":10467,"_19":10468,"_41":10},"right","- If true, bins[i-1] < x <= bins[i]. If false (default), bins[i-1] <= x < bins[i].",[],{"_17":10471,"_31":10472,"_33":10473,"_19":10473,"_36":10474,"_45":9217,"_47":10477},"np.divide","np.divide(x1, x2)","Divide arguments element-wise (true division).",[10475,10476],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10479,"_31":10480,"_33":10481,"_19":10482,"_36":10483,"_45":10488,"_47":10489},"np.divmod","np.divmod(x1, x2)","Return element-wise quotient and remainder simultaneously.\r","Return element-wise quotient and remainder simultaneously.\r\nEquivalent to (floor_divide(x1, x2), remainder(x1, x2)), but\r\nreturns both in one call.",[10484,10486],{"_17":9225,"_19":10485,"_41":6},"- Dividend array",{"_17":9227,"_19":10487,"_41":6},"- Divisor array","[NDArray, NDArray]",[],{"_17":10491,"_31":10492,"_33":10493,"_19":10494,"_36":10495,"_45":9266,"_47":10498},"np.dot","np.dot(a, b)","Dot product of two arrays.\r","Dot product of two arrays.\r\n\r\nFor 1-D arrays: inner product of vectors.\r\nFor 2-D arrays: matrix multiplication.",[10496,10497],{"_17":664,"_19":9056,"_41":6},{"_17":408,"_19":9058,"_41":6},[],{"_17":10500,"_31":10501,"_33":10502,"_19":10502,"_36":10503,"_45":9491,"_47":10507},"np.dsplit","np.dsplit(arr, indices_or_sections)","Split array into multiple sub-arrays along the 3rd axis (depth).",[10504,10506],{"_17":9283,"_19":10505,"_41":6},"- Array with at least 3 dimensions",{"_17":9487,"_19":9488,"_41":6},[],{"_17":10509,"_31":10510,"_33":10511,"_19":10511,"_36":10512,"_45":9217,"_47":10515},"np.dstack","np.dstack(tup)","Stack arrays in sequence along the third axis (depth-wise).",[10513],{"_17":10054,"_19":10514,"_41":6},"- Sequence of arrays",[],{"_17":10517,"_31":10518,"_33":10519,"_19":10520,"_36":10521,"_45":1387,"_47":10523},"np.dtypeAlignment","np.dtypeAlignment(dtype)","Get natural alignment for a dtype (for C struct compatibility).\r","Get natural alignment for a dtype (for C struct compatibility).\r\nMost types align to their size, capped at 8 bytes.",[10522],{"_17":9115,"_19":10065,"_41":6},[],{"_17":10525,"_31":10526,"_33":10527,"_19":10527,"_36":10528,"_45":10065,"_47":10531},"np.dtypeFromString","np.dtypeFromString(name)","Convert string dtype name to DType enum.",[10529],{"_17":17,"_19":10530,"_41":6},"- String name (e.g., 'float64', 'int32')",[],{"_17":10533,"_31":10534,"_33":10535,"_19":10535,"_36":10536,"_45":1387,"_47":10538},"np.dtypeSize","np.dtypeSize(dtype)","Get the size of a dtype in bytes.",[10537],{"_17":9115,"_19":10065,"_41":6},[],{"_17":10540,"_31":10541,"_33":10542,"_19":10543,"_36":10544,"_45":1793,"_47":10546},"np.dtypeToDescr","np.dtypeToDescr(dtype)","Convert DType to NPY descriptor string.\r","Convert DType to NPY descriptor string.\r\n\r\nFormat: \r\n- Endian: '<' (little), '>' (big), '|' (not applicable)\r\n- Type: 'b' (bool), 'i' (int), 'u' (uint), 'f' (float), 'c' (complex)\r\n- Size: bytes (1, 2, 4, 8, 16)",[10545],{"_17":9115,"_19":10065,"_41":6},[],{"_17":10548,"_31":10549,"_33":10550,"_19":10550,"_36":10551,"_45":1793,"_47":10554},"np.dtypeToString","np.dtypeToString(dtype)","Get dtype string name.",[10552],{"_17":9115,"_19":10553,"_41":6},"- DType enum value",[],{"_17":10556,"_31":10557,"_33":10558,"_19":10558,"_36":10559,"_45":10561,"_47":10562},"np.dtypeToTypedArrayConstructor","np.dtypeToTypedArrayConstructor(dtype)","Get the TypedArray constructor for a given dtype.",[10560],{"_17":9115,"_19":10553,"_41":6},"Float32ArrayConstructor | Float64ArrayConstructor | Int32ArrayConstructor | Int16ArrayConstructor | Int8ArrayConstructor | Uint32ArrayConstructor | Uint16ArrayConstructor | Uint8ArrayConstructor | BigInt64ArrayConstructor | BigUint64ArrayConstructor",[],{"_17":10564,"_31":10565,"_33":10566,"_19":10567,"_36":10568,"_45":9266,"_47":10571},"np.ediff1d","np.ediff1d(arr, options?)","Compute the differences between consecutive elements of an array.\r","Compute the differences between consecutive elements of an array.\r\n\r\nThis is implemented in TypeScript as it's straightforward and doesn't\r\nrequire WASM for performance.",[10569,10570],{"_17":9283,"_19":8908,"_41":6},{"_17":454,"_19":8788,"_41":10},[],{"_17":10573,"_31":10574,"_33":10575,"_19":10575,"_36":10576,"_45":10578,"_47":10579},"np.eig","np.eig(a)","Compute eigenvalues and right eigenvectors of a general matrix.",[10577],{"_17":664,"_19":10386,"_41":6},"Promise",[],{"_17":10581,"_31":10582,"_33":10583,"_19":10584,"_36":10585,"_45":10578,"_47":10591},"np.eigh","np.eigh(a, _UPLO?)","Compute eigenvalues and eigenvectors of a Hermitian/symmetric matrix.\r","Compute eigenvalues and eigenvectors of a Hermitian/symmetric matrix.\r\n\r\nEigenvalues are always real and returned in ascending order.",[10586,10588],{"_17":664,"_19":10587,"_41":6},"- Hermitian/symmetric matrix (N x N)",{"_17":10589,"_19":10590,"_41":10},"_UPLO","\"L\" | \"U\"",[],{"_17":10593,"_31":10594,"_33":10595,"_19":10595,"_36":10596,"_45":9266,"_47":10598},"np.eigvals","np.eigvals(a)","Compute eigenvalues only.",[10597],{"_17":664,"_19":9217,"_41":6},[],{"_17":10600,"_31":10601,"_33":10602,"_19":10602,"_36":10603,"_45":9266,"_47":10607},"np.eigvalsh","np.eigvalsh(a, UPLO?)","Compute eigenvalues of a Hermitian/symmetric matrix.",[10604,10605],{"_17":664,"_19":9217,"_41":6},{"_17":10606,"_19":10590,"_41":10},"UPLO",[],{"_17":10609,"_31":10610,"_33":10611,"_19":10612,"_36":10613,"_45":9266,"_47":10618},"np.einsum","np.einsum(subscripts, operands)","Evaluates the Einstein summation convention on the operands.\r","Evaluates the Einstein summation convention on the operands.\r\n\r\nUsing the Einstein summation convention, many common multi-dimensional,\r\nlinear algebraic array operations can be represented in a simple fashion.",[10614,10616],{"_17":5364,"_19":10615,"_41":6},"- Subscripts string in format \"ij,jk->ik\"",{"_17":10617,"_19":9586,"_41":6},"operands",[],{"_17":10620,"_31":10621,"_33":10622,"_19":10622,"_36":10623,"_45":10627,"_47":10628},"np.einsum_path","np.einsum_path(subscripts, operands)","Evaluates the lowest cost contraction order for an einsum expression.",[10624,10626],{"_17":5364,"_19":10625,"_41":6},"- Subscripts string",{"_17":10617,"_19":9586,"_41":6},"[number[][], string]",[],{"_17":10630,"_31":10631,"_33":10632,"_19":10633,"_36":10634,"_45":9266,"_47":10638},"np.empty","np.empty(shape, options?)","Create a new NDArray without initializing values.\r","Create a new NDArray without initializing values.\r\nFaster than zeros() but contains arbitrary values.",[10635,10637],{"_17":8459,"_19":10636,"_41":6},"- Array dimensions",{"_17":454,"_19":9446,"_41":10},[],{"_17":10640,"_31":10641,"_33":10642,"_19":10642,"_36":10643,"_45":9266,"_47":10646},"np.empty_like","np.empty_like(a)","Create an uninitialized array with the same shape and type as a given array.",[10644],{"_17":664,"_19":10645,"_41":6},"- Reference array",[],{"_17":10648,"_31":10649,"_33":10650,"_19":10651,"_36":10652,"_45":10657,"_47":10658},"np.encode","np.encode(a, _encoding?)","Encode strings to bytes using specified encoding.\r","Encode strings to bytes using specified encoding.\r\nReturns an array of Uint8Arrays (one per string element).",[10653,10655],{"_17":664,"_19":10654,"_41":6},"- Input string array",{"_17":10656,"_19":1793,"_41":10},"_encoding","Uint8Array[]",[],{"_17":10660,"_31":10661,"_33":10662,"_19":10662,"_36":10663,"_45":9217,"_47":10671},"np.endswith","np.endswith(a, suffix, start?, end?)","Return true for each element if the string ends with suffix.",[10664,10665,10667,10669],{"_17":664,"_19":10654,"_41":6},{"_17":4838,"_19":10666,"_41":6},"- Suffix to check",{"_17":9323,"_19":10668,"_41":10},"- Start position (default 0)",{"_17":9326,"_19":10670,"_41":10},"- End position (default string length)",[],{"_17":10673,"_31":10674,"_33":10675,"_19":10675,"_36":10676,"_45":9217,"_47":10679},"np.equal","np.equal(x1, x2)","Return (x1 == x2) element-wise.",[10677,10678],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10681,"_31":10682,"_33":10683,"_19":10683,"_36":10684,"_45":9217,"_47":10686},"np.exp","np.exp(x)","Calculate the exponential of all elements in the input array.",[10685],{"_17":405,"_19":9217,"_41":6},[],{"_17":10688,"_31":10689,"_33":10690,"_19":10690,"_36":10691,"_45":9217,"_47":10693},"np.exp2","np.exp2(x)","Calculate 2**x for all elements in the array.",[10692],{"_17":405,"_19":9217,"_41":6},[],{"_17":10695,"_31":10696,"_33":10697,"_19":10697,"_36":10698,"_45":9217,"_47":10702},"np.expand_dims","np.expand_dims(a, axis)","Expand the shape of an array by inserting a new axis.",[10699,10700],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":10701,"_41":6},"- Position in the expanded axes where the new axis is placed",[],{"_17":10704,"_31":10705,"_33":10706,"_19":10706,"_36":10707,"_45":10712,"_47":10713},"np.expandEllipsis","np.expandEllipsis(indices, ndim)","Expand ellipsis and validate index dimensions.",[10708,10710],{"_17":9784,"_19":10709,"_41":6},"- Array of index elements (may contain ellipsis)",{"_17":10406,"_19":10711,"_41":6},"- Number of dimensions in the array being indexed","IndexElement[]",[],{"_17":10715,"_31":10716,"_33":10717,"_19":10717,"_36":10718,"_45":9217,"_47":10723},"np.expandtabs","np.expandtabs(a, tabsize?)","Return element-wise copy with tabs expanded to spaces.",[10719,10720],{"_17":664,"_19":10654,"_41":6},{"_17":10721,"_19":10722,"_41":10},"tabsize","- Tab stop spacing (default 8)",[],{"_17":10725,"_31":10726,"_33":10727,"_19":10727,"_36":10728,"_45":9217,"_47":10730},"np.expm1","np.expm1(x)","Calculate exp(x) - 1 for all elements in the array.",[10729],{"_17":405,"_19":9217,"_41":6},[],{"_17":10732,"_31":10733,"_33":10734,"_19":10734,"_36":10735,"_45":9266,"_47":10739},"np.extract","np.extract(condition, arr)","Return elements of an array that satisfy some condition.",[10736,10738],{"_17":10090,"_19":10737,"_41":6},"- Boolean array, same shape as arr",{"_17":9283,"_19":8908,"_41":6},[],{"_17":10741,"_31":10742,"_33":10743,"_19":10743,"_36":10744,"_45":9266,"_47":10751},"np.eye","np.eye(N, M?, k?, options?)","Create a 2D array with ones on the diagonal and zeros elsewhere.",[10745,10746,10748,10750],{"_17":8783,"_19":652,"_41":6},{"_17":5526,"_19":10747,"_41":10},"- Number of columns (default: N)",{"_17":4686,"_19":10749,"_41":10},"- Diagonal offset (default: 0, main diagonal)",{"_17":454,"_19":9446,"_41":10},[],{"_17":10753,"_31":10754,"_33":10755,"_19":10755,"_36":10756,"_45":9217,"_47":10765},"np.fft","np.fft(a, n?, axis?, norm?)","Compute the one-dimensional discrete Fourier Transform.",[10757,10759,10761,10763],{"_17":664,"_19":10758,"_41":6},"- Input array (can be complex or real)",{"_17":1206,"_19":10760,"_41":10},"- Length of the transformed axis. If n < a.shape[axis], input is truncated.\r\n If n > a.shape[axis], input is zero-padded. Default: a.shape[axis]",{"_17":2911,"_19":10762,"_41":10},"- Axis over which to compute the FFT. Default: -1 (last axis)",{"_17":3633,"_19":10764,"_41":10},"- Normalization mode: \"backward\", \"ortho\", or \"forward\"",[],{"_17":10767,"_31":10768,"_33":10769,"_19":10769,"_36":10770,"_45":9217,"_47":10778},"np.fft2","np.fft2(a, s?, axes?, norm?)","Compute the 2-dimensional discrete Fourier Transform.",[10771,10772,10774,10776],{"_17":664,"_19":8908,"_41":6},{"_17":771,"_19":10773,"_41":10},"- Shape (length of each axis) of the output. Default: shape of a",{"_17":9314,"_19":10775,"_41":10},"- Axes over which to compute the FFT. Default: (-2, -1)",{"_17":3633,"_19":10777,"_41":10},"- Normalization mode",[],{"_17":10780,"_31":10781,"_33":10782,"_19":10783,"_36":10784,"_45":9266,"_47":10789},"np.fftfreq","np.fftfreq(n, d?)","Return the Discrete Fourier Transform sample frequencies.\r","Return the Discrete Fourier Transform sample frequencies.\r\n\r\nReturns an array of length n with the sample frequencies:\r\nf = [0, 1, ..., n/2-1, -n/2, ..., -1] / (d*n) if n is even\r\nf = [0, 1, ..., (n-1)/2, -(n-1)/2, ..., -1] / (d*n) if n is odd",[10785,10787],{"_17":1206,"_19":10786,"_41":6},"- Window length",{"_17":5512,"_19":10788,"_41":10},"- Sample spacing (default: 1.0)",[],{"_17":10791,"_31":10792,"_33":10793,"_19":10793,"_36":10794,"_45":9217,"_47":10801},"np.fftn","np.fftn(a, s?, axes?, norm?)","Compute the N-dimensional discrete Fourier Transform.",[10795,10796,10798,10800],{"_17":664,"_19":8908,"_41":6},{"_17":771,"_19":10797,"_41":10},"- Shape of the output along transformed axes",{"_17":9314,"_19":10799,"_41":10},"- Axes over which to compute the FFT. Default: all axes",{"_17":3633,"_19":10777,"_41":10},[],{"_17":10803,"_31":10804,"_33":10805,"_19":10806,"_36":10807,"_45":9217,"_47":10811},"np.fftshift","np.fftshift(x, axes?)","Shift the zero-frequency component to the center of the spectrum.\r","Shift the zero-frequency component to the center of the spectrum.\r\n\r\nThis function swaps half-spaces for all axes listed (or all axes by default).",[10808,10809],{"_17":405,"_19":8908,"_41":6},{"_17":9314,"_19":10810,"_41":10},"- Axes over which to shift. Default: all axes",[],{"_17":10813,"_31":10814,"_33":10815,"_19":10816,"_36":10817,"_45":375,"_47":10825},"np.fill_diagonal","np.fill_diagonal(a, val, wrap?)","Fill the main diagonal of the given array of any dimensionality.\r","Fill the main diagonal of the given array of any dimensionality.\r\n\r\nFor an array a with a.ndim >= 2, the diagonal is the list of\r\nlocations with indices a[i, i, ..., i] all identical. This function\r\nmodifies the input array in-place, it does not return a value.",[10818,10820,10822],{"_17":664,"_19":10819,"_41":6},"- Array to fill (modified in-place). Must be at least 2-D.",{"_17":8984,"_19":10821,"_41":6},"- Value to write on the diagonal",{"_17":10823,"_19":10824,"_41":10},"wrap","- For tall matrices, whether to \"wrap\" after filling the main diagonal",[],{"_17":10827,"_31":10828,"_33":10829,"_19":10829,"_36":10830,"_45":9650,"_47":10834},"np.find_duplicate","np.find_duplicate(list)","Find duplicate elements in a list.",[10831],{"_17":10832,"_19":10833,"_41":6},"list","- Array of strings to check",[],{"_17":10836,"_31":10837,"_33":10838,"_19":10838,"_36":10839,"_45":9266,"_47":10841},"np.flatnonzero","np.flatnonzero(arr)","Return flat indices of nonzero elements.",[10840],{"_17":9283,"_19":8908,"_41":6},[],{"_17":10843,"_31":10844,"_33":10845,"_19":10845,"_36":10846,"_45":9217,"_47":10848},"np.flatten","np.flatten(a)","Return a copy of the array collapsed into one dimension.",[10847],{"_17":664,"_19":8908,"_41":6},[],{"_17":10850,"_31":10851,"_33":10852,"_19":10852,"_36":10853,"_45":9217,"_47":10857},"np.flip","np.flip(arr, axis?)","Reverse the order of elements in an array along the given axis.",[10854,10855],{"_17":9283,"_19":8908,"_41":6},{"_17":2911,"_19":10856,"_41":10},"- Axis or axes along which to flip. Default is to flip all axes.",[],{"_17":10859,"_31":10860,"_33":10861,"_19":10861,"_36":10862,"_45":9217,"_47":10865},"np.fliplr","np.fliplr(arr)","Reverse the order of elements along axis 1 (left/right).",[10863],{"_17":9283,"_19":10864,"_41":6},"- Input array with at least 2 dimensions",[],{"_17":10867,"_31":10868,"_33":10869,"_19":10869,"_36":10870,"_45":9217,"_47":10873},"np.flipud","np.flipud(arr)","Reverse the order of elements along axis 0 (up/down).",[10871],{"_17":9283,"_19":10872,"_41":6},"- Input array with at least 1 dimension",[],{"_17":10875,"_31":10876,"_33":10877,"_19":10878,"_36":10879,"_45":9217,"_47":10882},"np.float_power","np.float_power(x1, x2)","First array elements raised to powers from second array, element-wise.\r","First array elements raised to powers from second array, element-wise.\r\nUnlike power, float_power always returns float64 output.\r\nIn numwasm, this is equivalent to power since we use float64 by default.",[10880,10881],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10884,"_31":10885,"_33":10886,"_19":10886,"_36":10887,"_45":9217,"_47":10889},"np.floor","np.floor(x)","Return the floor of the input, element-wise.",[10888],{"_17":405,"_19":9217,"_41":6},[],{"_17":10891,"_31":10892,"_33":10893,"_19":10893,"_36":10894,"_45":9217,"_47":10897},"np.floor_divide","np.floor_divide(x1, x2)","Return the largest integer smaller or equal to the division of the inputs.",[10895,10896],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10899,"_31":10900,"_33":10901,"_19":10901,"_36":10902,"_45":9217,"_47":10905},"np.fmax","np.fmax(x1, x2)","Element-wise maximum (ignores NaN).",[10903,10904],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10907,"_31":10908,"_33":10909,"_19":10909,"_36":10910,"_45":9217,"_47":10913},"np.fmin","np.fmin(x1, x2)","Element-wise minimum (ignores NaN).",[10911,10912],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10915,"_31":10916,"_33":10917,"_19":10917,"_36":10918,"_45":9217,"_47":10921},"np.fmod","np.fmod(x1, x2)","Returns element-wise remainder of floor_divide (C-style modulo).",[10919,10920],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":10923,"_31":10924,"_33":10925,"_19":10925,"_36":10926,"_45":1793,"_47":10941},"np.formatFloatPositional","np.formatFloatPositional(value, precision?, _unique?, fractional?, trim?, sign?, padLeft?, padRight?)","Format a float in positional notation.",[10927,10928,10929,10931,10933,10935,10937,10939],{"_17":514,"_19":1387,"_41":6},{"_17":4907,"_19":1387,"_41":10},{"_17":10930,"_19":2598,"_41":10},"_unique",{"_17":10932,"_19":2598,"_41":10},"fractional",{"_17":9520,"_19":10934,"_41":10},"\"k\" | \".\" | \"0\" | \"-\"",{"_17":10936,"_19":2598,"_41":10},"sign",{"_17":10938,"_19":1387,"_41":10},"padLeft",{"_17":10940,"_19":1387,"_41":10},"padRight",[],{"_17":10943,"_31":10944,"_33":10945,"_19":10945,"_36":10946,"_45":1793,"_47":10955},"np.formatFloatScientific","np.formatFloatScientific(value, precision?, _unique?, trim?, sign?, padLeft?, expDigits?)","Format a float in scientific notation.",[10947,10948,10949,10950,10951,10952,10953],{"_17":514,"_19":1387,"_41":6},{"_17":4907,"_19":1387,"_41":10},{"_17":10930,"_19":2598,"_41":10},{"_17":9520,"_19":10934,"_41":10},{"_17":10936,"_19":2598,"_41":10},{"_17":10938,"_19":1387,"_41":10},{"_17":10954,"_19":1387,"_41":10},"expDigits",[],{"_17":10957,"_31":10958,"_33":10959,"_19":10959,"_36":10960,"_45":1793,"_47":10964},"np.formatValue","np.formatValue(value, fmt)","Format a number according to printf-style format string.",[10961,10962],{"_17":514,"_19":1387,"_41":6},{"_17":10963,"_19":1793,"_41":6},"fmt",[],{"_17":10966,"_31":10967,"_33":10968,"_19":10969,"_36":10970,"_45":10488,"_47":10972},"np.frexp","np.frexp(x)","Decompose the elements of x into mantissa and twos exponent.\r","Decompose the elements of x into mantissa and twos exponent.\r\nReturns (mantissa, exponent), where x = mantissa * 2^exponent.\r\nThe mantissa lies in the open-closed interval (-1, 1) for float64,\r\nand the twos exponent is a signed integer.",[10971],{"_17":405,"_19":8908,"_41":6},[],{"_17":10974,"_31":10975,"_33":10976,"_19":10976,"_36":10977,"_45":1387,"_47":10981},"np.fromBaseRepr","np.fromBaseRepr(str, base?)","Convert a base-N string to a number.",[10978,10980],{"_17":4701,"_19":10979,"_41":6},"- String representation",{"_17":9634,"_19":9635,"_41":10},[],{"_17":10983,"_31":10984,"_33":10985,"_19":10985,"_36":10986,"_45":1387,"_47":10993},"np.fromBinaryRepr","np.fromBinaryRepr(binary, twosComplement?, width?)","Convert a binary string to a number.",[10987,10990,10992],{"_17":10988,"_19":10989,"_41":6},"binary","- Binary string (optionally with '0b' prefix)",{"_17":10991,"_19":2598,"_41":10},"twosComplement",{"_17":654,"_19":1387,"_41":10},[],{"_17":10995,"_31":10996,"_33":10997,"_19":10997,"_36":10998,"_45":9266,"_47":11004},"np.frombuffer","np.frombuffer(buffer, options?)","Interpret a buffer as a 1-dimensional array.",[10999,11002],{"_17":11000,"_19":11001,"_41":6},"buffer","- Buffer containing array data",{"_17":454,"_19":11003,"_41":10},"- Interpretation options",[],{"_17":11006,"_31":11007,"_33":11008,"_19":11008,"_36":11009,"_45":9266,"_47":11015},"np.fromfile","np.fromfile(file, options?)","Construct an array from data in a binary file.",[11010,11013],{"_17":11011,"_19":11012,"_41":6},"file","- File source (path, File object, URL, or ArrayBuffer)",{"_17":454,"_19":11014,"_41":10},"- Reading options",[],{"_17":11017,"_31":11018,"_33":11019,"_19":11020,"_36":11021,"_45":9266,"_47":11027},"np.fromfunction","np.fromfunction(func, shape, options?)","Construct an array by executing a function over each coordinate.\r","Construct an array by executing a function over each coordinate.\r\n\r\nThe resulting array has a value `fn(x, y, ...)` at coordinate `(x, y, ...)`.",[11022,11024,11026],{"_17":8055,"_19":11023,"_41":6},"- Function to execute on each coordinate (receives indices as arguments)",{"_17":8459,"_19":11025,"_41":6},"- Shape of the output array",{"_17":454,"_19":9446,"_41":10},[],{"_17":11029,"_31":11030,"_33":11031,"_19":11031,"_36":11032,"_45":9266,"_47":11037},"np.fromiter","np.fromiter(iter, options?)","Create a 1D array from an iterable object.",[11033,11036],{"_17":11034,"_19":11035,"_41":6},"iter","- Iterable yielding numbers",{"_17":454,"_19":9446,"_41":10},[],{"_17":11039,"_31":11040,"_33":11041,"_19":11042,"_36":11043,"_45":11055,"_47":11056},"np.frompyfunc","np.frompyfunc(func, nin, nout, identity?)","Create a ufunc-like wrapper from a JavaScript function.\r","Create a ufunc-like wrapper from a JavaScript function.\r\n\r\nTakes an arbitrary JavaScript function and returns a ufunc-like object\r\nthat can apply the function element-wise to arrays with broadcasting.",[11044,11046,11049,11052],{"_17":8055,"_19":11045,"_41":6},"- A JavaScript function that operates on scalars",{"_17":11047,"_19":11048,"_41":6},"nin","- The number of input arguments",{"_17":11050,"_19":11051,"_41":6},"nout","- The number of objects returned by func",{"_17":11053,"_19":11054,"_41":10},"identity","- Optional identity value for reduction operations","UfuncLike",[],{"_17":11058,"_31":11059,"_33":11060,"_19":11060,"_36":11061,"_45":9266,"_47":11071},"np.fromregex","np.fromregex(file, regexp, dtype?, options?)","Construct an array from a text file using regular expression parsing.",[11062,11064,11067,11069],{"_17":11011,"_19":11063,"_41":6},"- File source",{"_17":11065,"_19":11066,"_41":6},"regexp","- Regular expression with groups to extract",{"_17":9115,"_19":11068,"_41":10},"- Output data type",{"_17":454,"_19":11070,"_41":10},"- Additional options",[],{"_17":11073,"_31":11074,"_33":11075,"_19":11076,"_36":11077,"_45":9266,"_47":11087},"np.fromstring","np.fromstring(string, sep?, count?, options?)","Create a 1D array from text data in a string.\r","Create a 1D array from text data in a string.\r\n\r\nA simple way to quickly create 1D arrays from raw text. The string\r\nis parsed using a separator character.",[11078,11080,11083,11086],{"_17":1793,"_19":11079,"_41":6},"- String containing the data",{"_17":11081,"_19":11082,"_41":10},"sep","- Separator between data items. If empty string, treats the\r\n string as binary data with each character representing a byte.",{"_17":11084,"_19":11085,"_41":10},"count","- Number of items to read. Default is -1 (read all).",{"_17":454,"_19":9446,"_41":10},[],{"_17":11089,"_31":11090,"_33":11091,"_19":11091,"_36":11092,"_45":9266,"_47":11098},"np.full","np.full(shape, fillValue, options?)","Create a new NDArray filled with a constant value.",[11093,11094,11097],{"_17":8459,"_19":10636,"_41":6},{"_17":11095,"_19":11096,"_41":6},"fillValue","- Value to fill with",{"_17":454,"_19":9446,"_41":10},[],{"_17":11100,"_31":11101,"_33":11102,"_19":11102,"_36":11103,"_45":9266,"_47":11106},"np.full_like","np.full_like(a, fillValue)","Create an array filled with a value, with the same shape and type as a given array.",[11104,11105],{"_17":664,"_19":10645,"_41":6},{"_17":11095,"_19":11096,"_41":6},[],{"_17":11108,"_31":11109,"_33":11110,"_19":11111,"_36":11112,"_45":9217,"_47":11117},"np.gcd","np.gcd(x1, x2)","Returns the greatest common divisor of |x1| and |x2|.\r","Returns the greatest common divisor of |x1| and |x2|.\r\nInput arrays must be integers.",[11113,11115],{"_17":9225,"_19":11114,"_41":6},"- First array of integers",{"_17":9227,"_19":11116,"_41":6},"- Second array of integers",[],{"_17":11119,"_31":11120,"_33":11121,"_19":11122,"_36":11123,"_45":9266,"_47":11127},"np.genfromtxt","np.genfromtxt(file, options?)","Load data from a text file with handling for missing values.\r","Load data from a text file with handling for missing values.\r\nMore sophisticated than loadtxt, supports missing value replacement.",[11124,11125],{"_17":11011,"_19":11063,"_41":6},{"_17":454,"_19":11126,"_41":10},"- Parsing options",[],{"_17":11129,"_31":11130,"_33":11131,"_19":11131,"_36":11132,"_45":9266,"_47":11144},"np.geomspace","np.geomspace(start, stop, num?, endpoint?, options?)","Create an NDArray with numbers spaced evenly on a geometric scale.",[11133,11135,11138,11140,11143],{"_17":9323,"_19":11134,"_41":6},"- Start value (must be non-zero)",{"_17":11136,"_19":11137,"_41":6},"stop","- End value (must be non-zero)",{"_17":9631,"_19":11139,"_41":10},"- Number of samples (default: 50)",{"_17":11141,"_19":11142,"_41":10},"endpoint","- Include stop value (default: true)",{"_17":454,"_19":9446,"_41":10},[],{"_17":11146,"_31":11147,"_33":11148,"_19":11148,"_36":11149,"_45":11152,"_47":11153},"np.getBitGenerator","np.getBitGenerator(name)","Get a BitGenerator class by name.",[11150],{"_17":17,"_19":11151,"_41":6},"- Name of the BitGenerator (case-insensitive)","new (seed?: number | bigint | number[] | SeedSequence | null) => BitGenerator",[],{"_17":11155,"_31":11156,"_33":11157,"_19":11158,"_36":11159,"_45":11162,"_47":11163},"np.getdomain","np.getdomain(x)","Get the domain appropriate for given data points.\r","Get the domain appropriate for given data points.\r\n\r\nReturns the minimum and maximum of the data as the domain.",[11160],{"_17":405,"_19":11161,"_41":6},"- Data points","[number, number]",[],{"_17":11165,"_31":11166,"_33":11167,"_19":11167,"_36":11168,"_45":11169,"_47":11170},"np.getPrintoptions","np.getPrintoptions()","Get current print options.",[],"Required",[],{"_17":11172,"_31":11173,"_33":11174,"_19":11174,"_36":11175,"_45":11176,"_47":11177},"np.getWasmModule","np.getWasmModule()","Get the loaded WASM module synchronously.",[],"WasmModule",[],{"_17":11179,"_31":11180,"_33":11181,"_19":11182,"_36":11183,"_45":11188,"_47":11189},"np.gradient","np.gradient(f, args)","Return the gradient of an N-dimensional array.\r","Return the gradient of an N-dimensional array.\r\n\r\nThe gradient is computed using second order accurate central differences\r\nin the interior points and first order accurate one-sides (forward or backwards)\r\ndifferences at the boundaries.",[11184,11186],{"_17":7414,"_19":11185,"_41":6},"- An N-dimensional array containing samples of a scalar function",{"_17":9140,"_19":11187,"_41":6},"(number | number[] | NDArray | {\r\n axis?: number | number[];\r\n edge_order?: number;\r\n})[]","Promise",[],{"_17":11191,"_31":11192,"_33":11193,"_19":11193,"_36":11194,"_45":9217,"_47":11197},"np.greater","np.greater(x1, x2)","Return (x1 > x2) element-wise.",[11195,11196],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":11199,"_31":11200,"_33":11201,"_19":11201,"_36":11202,"_45":9217,"_47":11205},"np.greater_equal","np.greater_equal(x1, x2)","Return (x1 >= x2) element-wise.",[11203,11204],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":11207,"_31":11208,"_33":11209,"_19":11210,"_36":11211,"_45":9266,"_47":11213},"np.hamming","np.hamming(M)","Return the Hamming window.\r","Return the Hamming window.\r\n\r\nThe Hamming window is a taper formed by using a weighted cosine,\r\nsimilar to Hanning but with raised endpoints to reduce the first\r\nside lobe.\r\n\r\nFormula: w(n) = 0.54 + 0.46*cos(π*n/(M-1))",[11212],{"_17":5526,"_19":9623,"_41":6},[],{"_17":11215,"_31":11216,"_33":11217,"_19":11218,"_36":11219,"_45":9266,"_47":11221},"np.hanning","np.hanning(M)","Return the Hanning window (also known as Hann window).\r","Return the Hanning window (also known as Hann window).\r\n\r\nThe Hanning window is a taper formed by using a weighted cosine.\r\nNamed for Julius von Hann.\r\n\r\nFormula: w(n) = 0.5 + 0.5*cos(π*n/(M-1))",[11220],{"_17":5526,"_19":9623,"_41":6},[],{"_17":11223,"_31":11224,"_33":11225,"_19":11226,"_36":11227,"_45":9217,"_47":11232},"np.heaviside","np.heaviside(x1, x2)","Compute the Heaviside step function.\r","Compute the Heaviside step function.\r\n\r\nH(x) = 0 if x < 0\r\nH(x) = h0 if x == 0\r\nH(x) = 1 if x > 0",[11228,11230],{"_17":9225,"_19":11229,"_41":6},"- Input values",{"_17":9227,"_19":11231,"_41":6},"- Value of the function at x1 == 0 (h0)",[],{"_17":11234,"_31":11235,"_33":11236,"_19":11236,"_36":11237,"_45":374,"_47":11239},"np.herm2poly","np.herm2poly(c)","Convert Hermite coefficients to power series.",[11238],{"_17":713,"_19":374,"_41":6},[],{"_17":11241,"_31":11242,"_33":6845,"_19":1136,"_36":11243,"_45":374,"_47":11246},"np.hermadd","np.hermadd(c1, c2)",[11244,11245],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11248,"_31":11249,"_33":6894,"_19":1136,"_36":11250,"_45":506,"_47":11252},"np.hermcompanion","np.hermcompanion(c)",[11251],{"_17":713,"_19":374,"_41":6},[],{"_17":11254,"_31":11255,"_33":6813,"_19":1136,"_36":11256,"_45":374,"_47":11259},"np.hermder","np.hermder(c, m?)",[11257,11258],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},[],{"_17":11261,"_31":11262,"_33":6844,"_19":1136,"_36":11263,"_45":9868,"_47":11266},"np.hermdiv","np.hermdiv(c1, c2)",[11264,11265],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11268,"_31":11269,"_33":11270,"_19":11270,"_36":11271,"_45":374,"_47":11273},"np.herme2poly","np.herme2poly(c)","Convert HermiteE coefficients to power series.",[11272],{"_17":713,"_19":374,"_41":6},[],{"_17":11275,"_31":11276,"_33":6986,"_19":1136,"_36":11277,"_45":374,"_47":11280},"np.hermeadd","np.hermeadd(c1, c2)",[11278,11279],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11282,"_31":11283,"_33":7035,"_19":1136,"_36":11284,"_45":506,"_47":11286},"np.hermecompanion","np.hermecompanion(c)",[11285],{"_17":713,"_19":374,"_41":6},[],{"_17":11288,"_31":11289,"_33":6954,"_19":1136,"_36":11290,"_45":374,"_47":11293},"np.hermeder","np.hermeder(c, m?)",[11291,11292],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},[],{"_17":11295,"_31":11296,"_33":6985,"_19":1136,"_36":11297,"_45":9868,"_47":11300},"np.hermediv","np.hermediv(c1, c2)",[11298,11299],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11302,"_31":11303,"_33":6953,"_19":1136,"_36":11304,"_45":9889,"_47":11313},"np.hermefit","np.hermefit(x, y, deg, rcond?, full?, w?)",[11305,11306,11307,11308,11310,11311],{"_17":405,"_19":374,"_41":6},{"_17":2467,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},{"_17":9882,"_19":11309,"_41":10},"number | null",{"_17":7871,"_19":2598,"_41":10},{"_17":9887,"_19":11312,"_41":10},"number[] | null",[],{"_17":11315,"_31":11316,"_33":7034,"_19":1136,"_36":11317,"_45":374,"_47":11319},"np.hermefromroots","np.hermefromroots(roots)",[11318],{"_17":6420,"_19":374,"_41":6},[],{"_17":11321,"_31":11322,"_33":6964,"_19":1136,"_36":11323,"_45":374,"_47":11328},"np.hermeint","np.hermeint(c, m?, k?, lbnd?)",[11324,11325,11326,11327],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},{"_17":4686,"_19":374,"_41":10},{"_17":9910,"_19":1387,"_41":10},[],{"_17":11330,"_31":11331,"_33":6976,"_19":1136,"_36":11332,"_45":374,"_47":11335},"np.hermemul","np.hermemul(c1, c2)",[11333,11334],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11337,"_31":11338,"_33":7016,"_19":1136,"_36":11339,"_45":374,"_47":11343},"np.hermepow","np.hermepow(c, pow, maxpower?)",[11340,11341,11342],{"_17":713,"_19":374,"_41":6},{"_17":9943,"_19":1387,"_41":6},{"_17":9945,"_19":1387,"_41":10},[],{"_17":11345,"_31":11346,"_33":7026,"_19":1136,"_36":11347,"_45":9926,"_47":11349},"np.hermeroots","np.hermeroots(c)",[11348],{"_17":713,"_19":374,"_41":6},[],{"_17":11351,"_31":11352,"_33":7005,"_19":1136,"_36":11353,"_45":374,"_47":11356},"np.hermesub","np.hermesub(c1, c2)",[11354,11355],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11358,"_31":11359,"_33":11360,"_19":11360,"_36":11361,"_45":1387,"_47":11364},"np.hermeval","np.hermeval(x, c)","Evaluate HermiteE polynomial.",[11362,11363],{"_17":405,"_19":1387,"_41":6},{"_17":713,"_19":374,"_41":6},[],{"_17":11366,"_31":11367,"_33":7053,"_19":1136,"_36":11368,"_45":506,"_47":11371},"np.hermevander","np.hermevander(x, deg)",[11369,11370],{"_17":405,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},[],{"_17":11373,"_31":11374,"_33":6812,"_19":1136,"_36":11375,"_45":9889,"_47":11382},"np.hermfit","np.hermfit(x, y, deg, rcond?, full?, w?)",[11376,11377,11378,11379,11380,11381],{"_17":405,"_19":374,"_41":6},{"_17":2467,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},{"_17":9882,"_19":11309,"_41":10},{"_17":7871,"_19":2598,"_41":10},{"_17":9887,"_19":11312,"_41":10},[],{"_17":11384,"_31":11385,"_33":6893,"_19":1136,"_36":11386,"_45":374,"_47":11388},"np.hermfromroots","np.hermfromroots(roots)",[11387],{"_17":6420,"_19":374,"_41":6},[],{"_17":11390,"_31":11391,"_33":6823,"_19":1136,"_36":11392,"_45":374,"_47":11397},"np.hermint","np.hermint(c, m?, k?, lbnd?)",[11393,11394,11395,11396],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},{"_17":4686,"_19":374,"_41":10},{"_17":9910,"_19":1387,"_41":10},[],{"_17":11399,"_31":11400,"_33":6835,"_19":1136,"_36":11401,"_45":374,"_47":11404},"np.hermmul","np.hermmul(c1, c2)",[11402,11403],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11406,"_31":11407,"_33":6875,"_19":1136,"_36":11408,"_45":374,"_47":11412},"np.hermpow","np.hermpow(c, pow, maxpower?)",[11409,11410,11411],{"_17":713,"_19":374,"_41":6},{"_17":9943,"_19":1387,"_41":6},{"_17":9945,"_19":1387,"_41":10},[],{"_17":11414,"_31":11415,"_33":6885,"_19":1136,"_36":11416,"_45":9926,"_47":11418},"np.hermroots","np.hermroots(c)",[11417],{"_17":713,"_19":374,"_41":6},[],{"_17":11420,"_31":11421,"_33":6864,"_19":1136,"_36":11422,"_45":374,"_47":11425},"np.hermsub","np.hermsub(c1, c2)",[11423,11424],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":11427,"_31":11428,"_33":11429,"_19":11429,"_36":11430,"_45":1387,"_47":11433},"np.hermval","np.hermval(x, c)","Evaluate Hermite polynomial.",[11431,11432],{"_17":405,"_19":1387,"_41":6},{"_17":713,"_19":374,"_41":6},[],{"_17":11435,"_31":11436,"_33":6912,"_19":1136,"_36":11437,"_45":506,"_47":11440},"np.hermvander","np.hermvander(x, deg)",[11438,11439],{"_17":405,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},[],{"_17":11442,"_31":11443,"_33":11444,"_19":11444,"_36":11445,"_45":1793,"_47":11449},"np.hexRepr","np.hexRepr(num, width?)","Return the hexadecimal representation of a number.",[11446,11447],{"_17":9631,"_19":9632,"_41":6},{"_17":654,"_19":11448,"_41":10},"- Minimum number of hex digits",[],{"_17":11451,"_31":11452,"_33":11453,"_19":11453,"_36":11454,"_45":9217,"_47":11462},"np.hfft","np.hfft(a, n?, axis?, norm?)","Compute the FFT of a signal that has Hermitian symmetry (real spectrum).",[11455,11457,11459,11461],{"_17":664,"_19":11456,"_41":6},"- Input array with Hermitian symmetry",{"_17":1206,"_19":11458,"_41":10},"- Length of the transformed axis",{"_17":2911,"_19":11460,"_41":10},"- Axis over which to compute the FFT. Default: -1",{"_17":3633,"_19":10777,"_41":10},[],{"_17":11464,"_31":11465,"_33":11466,"_19":11466,"_36":11467,"_45":11478,"_47":11479},"np.histogram","np.histogram(a, bins?, range?, density?, weights?)","Compute the histogram of a dataset.",[11468,11469,11471,11474,11476],{"_17":664,"_19":9530,"_41":6},{"_17":10464,"_19":11470,"_41":10},"- Number of bins, method string, or explicit bin edges (default: 10)",{"_17":11472,"_19":11473,"_41":10},"range","- Lower and upper range of bins",{"_17":7893,"_19":11475,"_41":10},"- If true, return probability density instead of counts (default: false)",{"_17":9612,"_19":11477,"_41":10},"- Weights for each data point","Promise",[],{"_17":11481,"_31":11482,"_33":11483,"_19":11483,"_36":11484,"_45":11497,"_47":11498},"np.histogram2d","np.histogram2d(x, y, bins?, range?, density?, weights?)","Compute the bi-dimensional histogram of two data samples.",[11485,11487,11489,11491,11493,11495],{"_17":405,"_19":11486,"_41":6},"- Array of x coordinates",{"_17":2467,"_19":11488,"_41":6},"- Array of y coordinates",{"_17":10464,"_19":11490,"_41":10},"- Number of bins or [nx, ny] or [xedges, yedges] (default: 10)",{"_17":11472,"_19":11492,"_41":10},"- [[xmin, xmax], [ymin, ymax]]",{"_17":7893,"_19":11494,"_41":10},"- If true, return probability density (default: false)",{"_17":9612,"_19":11496,"_41":10},"- Weights for each sample","Promise",[],{"_17":11500,"_31":11501,"_33":11502,"_19":11502,"_36":11503,"_45":9266,"_47":11510},"np.histogram_bin_edges","np.histogram_bin_edges(a, bins?, range?, weights?)","Compute histogram bin edges.",[11504,11505,11507,11508],{"_17":664,"_19":9530,"_41":6},{"_17":10464,"_19":11506,"_41":10},"- Number of bins, bin method string, or explicit bin edges (default: 'auto')",{"_17":11472,"_19":11473,"_41":10},{"_17":9612,"_19":11509,"_41":10},"- Weights (used for some bin estimation methods)",[],{"_17":11512,"_31":11513,"_33":11514,"_19":11514,"_36":11515,"_45":11525,"_47":11526},"np.histogramdd","np.histogramdd(sample, bins?, range?, density?, weights?)","Compute the multidimensional histogram of some data.",[11516,11519,11521,11523,11524],{"_17":11517,"_19":11518,"_41":6},"sample","- Data to histogram (shape: [N, D] for N samples in D dimensions,\r\n or 1D array for single dimension)",{"_17":10464,"_19":11520,"_41":10},"- Number of bins per dimension or list of bin edges (default: 10)",{"_17":11472,"_19":11522,"_41":10},"- Ranges for each dimension [[min, max], ...]",{"_17":7893,"_19":11494,"_41":10},{"_17":9612,"_19":11496,"_41":10},"Promise",[],{"_17":11528,"_31":11529,"_33":11530,"_19":11530,"_36":11531,"_45":9491,"_47":11535},"np.hsplit","np.hsplit(arr, indices_or_sections)","Split an array into multiple sub-arrays horizontally (column-wise).",[11532,11534],{"_17":9283,"_19":11533,"_41":6},"- Array",{"_17":9487,"_19":9488,"_41":6},[],{"_17":11537,"_31":11538,"_33":11539,"_19":11540,"_36":11541,"_45":9217,"_47":11543},"np.hstack","np.hstack(tup)","Stack arrays in sequence horizontally (column-wise).\r","Stack arrays in sequence horizontally (column-wise).\r\nFor 1-D arrays, concatenates along axis 0.\r\nFor 2-D+ arrays, concatenates along axis 1.",[11542],{"_17":10054,"_19":10514,"_41":6},[],{"_17":11545,"_31":11546,"_33":11547,"_19":11547,"_36":11548,"_45":9217,"_47":11551},"np.hypot","np.hypot(x1, x2)","Given the \"legs\" of a right triangle, return its hypotenuse.",[11549,11550],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":11553,"_31":11554,"_33":11555,"_19":11556,"_36":11557,"_45":9266,"_47":11560},"np.i0","np.i0(x)","Modified Bessel function of the first kind, order 0.\r","Modified Bessel function of the first kind, order 0.\r\n\r\nUsually denoted I₀. This implementation uses Chebyshev polynomial\r\napproximations from the Cephes library, partitioning the domain\r\ninto [0, 8] and (8, ∞).",[11558],{"_17":405,"_19":11559,"_41":6},"- Input array, number, or array of numbers",[],{"_17":11562,"_31":11563,"_33":11564,"_19":11564,"_36":11565,"_45":9266,"_47":11569},"np.identity","np.identity(n, options?)","Create a square identity matrix.",[11566,11568],{"_17":1206,"_19":11567,"_41":6},"- Size of the matrix",{"_17":454,"_19":9446,"_41":10},[],{"_17":11571,"_31":11572,"_33":11573,"_19":11573,"_36":11574,"_45":9217,"_47":11580},"np.ifft","np.ifft(a, n?, axis?, norm?)","Compute the one-dimensional inverse discrete Fourier Transform.",[11575,11576,11577,11579],{"_17":664,"_19":8908,"_41":6},{"_17":1206,"_19":11458,"_41":10},{"_17":2911,"_19":11578,"_41":10},"- Axis over which to compute the inverse FFT. Default: -1",{"_17":3633,"_19":10777,"_41":10},[],{"_17":11582,"_31":11583,"_33":11584,"_19":11584,"_36":11585,"_45":9217,"_47":11592},"np.ifft2","np.ifft2(a, s?, axes?, norm?)","Compute the 2-dimensional inverse discrete Fourier Transform.",[11586,11587,11589,11590],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11588,"_41":10},"[number, number] | null",{"_17":9314,"_19":11162,"_41":10},{"_17":3633,"_19":11591,"_41":10},"FFTNorm",[],{"_17":11594,"_31":11595,"_33":11596,"_19":11596,"_36":11597,"_45":9217,"_47":11602},"np.ifftn","np.ifftn(a, s?, axes?, norm?)","Compute the N-dimensional inverse discrete Fourier Transform.",[11598,11599,11600,11601],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11312,"_41":10},{"_17":9314,"_19":11312,"_41":10},{"_17":3633,"_19":11591,"_41":10},[],{"_17":11604,"_31":11605,"_33":11606,"_19":11607,"_36":11608,"_45":9217,"_47":11611},"np.ifftshift","np.ifftshift(x, axes?)","The inverse of fftshift.\r","The inverse of fftshift.\r\n\r\nUndoes the effect of fftshift.",[11609,11610],{"_17":405,"_19":8908,"_41":6},{"_17":9314,"_19":10810,"_41":10},[],{"_17":11613,"_31":11614,"_33":11615,"_19":11615,"_36":11616,"_45":9217,"_47":11622},"np.ihfft","np.ihfft(a, n?, axis?, norm?)","Compute the inverse FFT of a signal that has Hermitian symmetry.",[11617,11619,11620,11621],{"_17":664,"_19":11618,"_41":6},"- Input array (real-valued)",{"_17":1206,"_19":11458,"_41":10},{"_17":2911,"_19":11578,"_41":10},{"_17":3633,"_19":10777,"_41":10},[],{"_17":11624,"_31":11625,"_33":11626,"_19":11627,"_36":11628,"_45":9217,"_47":11630},"np.imag","np.imag(val)","Return the imaginary part of the complex argument.\r","Return the imaginary part of the complex argument.\r\n\r\nFor non-complex arrays, returns an array of zeros with the same shape.",[11629],{"_17":8984,"_19":8908,"_41":6},[],{"_17":11632,"_31":11633,"_33":11634,"_19":11634,"_36":11635,"_45":9266,"_47":11643},"np.in1d","np.in1d(ar1, ar2, options?)","Test whether each element of ar1 is also present in ar2 (flat version).",[11636,11639,11642],{"_17":11637,"_19":11638,"_41":6},"ar1","- Input array (will be flattened)",{"_17":11640,"_19":11641,"_41":6},"ar2","- Values to test against",{"_17":454,"_19":8788,"_41":10},[],{"_17":11645,"_31":11646,"_33":11647,"_19":11647,"_36":11648,"_45":11188,"_47":11656},"np.indices","np.indices(dimensions, dtype?, sparse?)","Return an array representing the indices of a grid.",[11649,11652,11654],{"_17":11650,"_19":11651,"_41":6},"dimensions","- The shape of the grid",{"_17":9115,"_19":11653,"_41":10},"- Data type of the result (default: Int32)",{"_17":7840,"_19":11655,"_41":10},"- Return sparse representation (default: false)",[],{"_17":11658,"_31":11659,"_33":11660,"_19":11661,"_36":11662,"_45":375,"_47":11663},"np.initRandom","np.initRandom()","Initialize the random module.\r","Initialize the random module.\r\n\r\nThis must be called before using any random functions.\r\nIt loads the WASM module and sets up the default generator.",[],[],{"_17":11665,"_31":11666,"_33":11667,"_19":11668,"_36":11669,"_45":9266,"_47":11672},"np.inner","np.inner(a, b)","Inner product of two arrays.\r","Inner product of two arrays.\r\nFor 1-D arrays: dot product.\r\nFor N-D arrays: sum product over last axes.",[11670,11671],{"_17":664,"_19":9217,"_41":6},{"_17":408,"_19":9217,"_41":6},[],{"_17":11674,"_31":11675,"_33":11676,"_19":11676,"_36":11677,"_45":9217,"_47":11685},"np.insert","np.insert(arr, obj, values, axis?)","Insert values along the given axis before the given indices.",[11678,11679,11681,11683],{"_17":9283,"_19":8908,"_41":6},{"_17":10367,"_19":11680,"_41":6},"- Index or indices before which values are inserted",{"_17":560,"_19":11682,"_41":6},"- Values to insert",{"_17":2911,"_19":11684,"_41":10},"- Axis along which to insert (default: flatten first)",[],{"_17":11687,"_31":11688,"_33":11689,"_19":11690,"_36":11691,"_45":8917,"_47":11705},"np.interp","np.interp(x, xp, fp, left?, right?)","One-dimensional linear interpolation for monotonically increasing sample points.\r","One-dimensional linear interpolation for monotonically increasing sample points.\r\n\r\nReturns the one-dimensional piecewise linear interpolant to a function with\r\ngiven discrete data points (xp, fp), evaluated at x.",[11692,11694,11697,11700,11703],{"_17":405,"_19":11693,"_41":6},"- The x-coordinates at which to evaluate the interpolated values",{"_17":11695,"_19":11696,"_41":6},"xp","- The x-coordinates of the data points, must be increasing",{"_17":11698,"_19":11699,"_41":6},"fp","- The y-coordinates of the data points, same length as xp",{"_17":11701,"_19":11702,"_41":10},"left","- Value to return for x < xp[0], default is fp[0]",{"_17":10467,"_19":11704,"_41":10},"- Value to return for x > xp[-1], default is fp[-1]",[],{"_17":11707,"_31":11708,"_33":11709,"_19":11710,"_36":11711,"_45":11717,"_47":11718},"np.intersect1d","np.intersect1d(ar1, ar2, options?)","Find the intersection of two arrays.\r","Find the intersection of two arrays.\r\n\r\nReturns the sorted unique values that are in both input arrays.",[11712,11714,11716],{"_17":11637,"_19":11713,"_41":6},"- First input array",{"_17":11640,"_19":11715,"_41":6},"- Second input array",{"_17":454,"_19":8788,"_41":10},"Promise",[],{"_17":11720,"_31":11721,"_33":11722,"_19":11722,"_36":11723,"_45":9266,"_47":11725},"np.inv","np.inv(a)","Compute the (multiplicative) inverse of a matrix.",[11724],{"_17":664,"_19":10386,"_41":6},[],{"_17":11727,"_31":11728,"_33":11729,"_19":11729,"_36":11730,"_45":9217,"_47":11732},"np.invert","np.invert(x)","Compute bit-wise inversion, element-wise.",[11731],{"_17":405,"_19":9217,"_41":6},[],{"_17":11734,"_31":11735,"_33":11736,"_19":11737,"_36":11738,"_45":9217,"_47":11745},"np.irfft","np.irfft(a, n?, axis?, norm?)","Compute the inverse of the one-dimensional discrete Fourier Transform for real input.\r","Compute the inverse of the one-dimensional discrete Fourier Transform for real input.\r\n\r\nThis function computes the inverse of the one-dimensional n-point DFT of\r\nHermitian-symmetric input (from rfft). The input should have shape (..., n//2 + 1).",[11739,11741,11743,11744],{"_17":664,"_19":11740,"_41":6},"- Input array (complex, Hermitian-symmetric)",{"_17":1206,"_19":11742,"_41":10},"- Length of the output. If n is not given, it is determined from the\r\n input shape: n = 2 * (a.shape[axis] - 1)",{"_17":2911,"_19":11578,"_41":10},{"_17":3633,"_19":10777,"_41":10},[],{"_17":11747,"_31":11748,"_33":11749,"_19":11749,"_36":11750,"_45":9217,"_47":11755},"np.irfft2","np.irfft2(a, s?, axes?, norm?)","Compute the inverse of the 2-dimensional FFT of real input.",[11751,11752,11753,11754],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11588,"_41":10},{"_17":9314,"_19":11162,"_41":10},{"_17":3633,"_19":11591,"_41":10},[],{"_17":11757,"_31":11758,"_33":11759,"_19":11759,"_36":11760,"_45":9217,"_47":11765},"np.irfftn","np.irfftn(a, s?, axes?, norm?)","Compute the inverse of the N-dimensional FFT of real input.",[11761,11762,11763,11764],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11312,"_41":10},{"_17":9314,"_19":11312,"_41":10},{"_17":3633,"_19":11591,"_41":10},[],{"_17":11767,"_31":11768,"_33":11769,"_19":11769,"_36":11770,"_45":9217,"_47":11772},"np.isalnum","np.isalnum(a)","Return true for each element if all characters are alphanumeric.",[11771],{"_17":664,"_19":10654,"_41":6},[],{"_17":11774,"_31":11775,"_33":11776,"_19":11776,"_36":11777,"_45":9217,"_47":11779},"np.isalpha","np.isalpha(a)","Return true for each element if all characters are alphabetic.",[11778],{"_17":664,"_19":10654,"_41":6},[],{"_17":11781,"_31":11782,"_33":11783,"_19":11783,"_36":11784,"_45":2598,"_47":11786},"np.isBoolDType","np.isBoolDType(dtype)","Check if dtype is boolean.",[11785],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11788,"_31":11789,"_33":11790,"_19":11791,"_36":11792,"_45":9266,"_47":11799},"np.isclose","np.isclose(a, b, rtol?, atol?, equal_nan?)","Returns a boolean array where two arrays are element-wise equal within tolerance.\r","Returns a boolean array where two arrays are element-wise equal within tolerance.\r\n\r\nFormula: |a - b| <= (atol + rtol * |b|)",[11793,11794,11796,11797,11798],{"_17":664,"_19":9056,"_41":6},{"_17":408,"_19":11795,"_41":6},"- Second array (reference)",{"_17":2072,"_19":9250,"_41":10},{"_17":2075,"_19":9252,"_41":10},{"_17":9007,"_19":9254,"_41":10},[],{"_17":11801,"_31":11802,"_33":11803,"_19":11804,"_36":11805,"_45":9266,"_47":11807},"np.iscomplex","np.iscomplex(x)","Returns a bool array where True if input element is complex (imaginary part != 0).\r","Returns a bool array where True if input element is complex (imaginary part != 0).\r\nFor non-complex dtype arrays, returns all False.",[11806],{"_17":405,"_19":8908,"_41":6},[],{"_17":11809,"_31":11810,"_33":11811,"_19":11811,"_36":11812,"_45":2598,"_47":11814},"np.isComplexDType","np.isComplexDType(dtype)","Check if dtype is a complex type.",[11813],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11816,"_31":11817,"_33":11818,"_19":11818,"_36":11819,"_45":2598,"_47":11821},"np.iscomplexobj","np.iscomplexobj(x)","Check if the array has a complex dtype.",[11820],{"_17":405,"_19":8908,"_41":6},[],{"_17":11823,"_31":11824,"_33":11825,"_19":11826,"_36":11827,"_45":9217,"_47":11829},"np.isdecimal","np.isdecimal(a)","Return true for each element if all characters are decimal.\r","Return true for each element if all characters are decimal.\r\nDecimal characters are those in Unicode category \"Nd\".",[11828],{"_17":664,"_19":10654,"_41":6},[],{"_17":11831,"_31":11832,"_33":11833,"_19":11833,"_36":11834,"_45":9217,"_47":11836},"np.isdigit","np.isdigit(a)","Return true for each element if all characters are digits (0-9).",[11835],{"_17":664,"_19":10654,"_41":6},[],{"_17":11838,"_31":11839,"_33":11840,"_19":11841,"_36":11842,"_45":2598,"_47":11847},"np.isdtype","np.isdtype(dtype, kind)","Returns a boolean indicating whether the provided dtype is of the specified kind.\r","Returns a boolean indicating whether the provided dtype is of the specified kind.\r\n\r\nThis is the NumPy 2.0 version of issubdtype, with a more explicit API.",[11843,11845],{"_17":9115,"_19":11844,"_41":6},"- The dtype to check",{"_17":9426,"_19":11846,"_41":6},"- The dtype kind to check against",[],{"_17":11849,"_31":11850,"_33":11851,"_19":11851,"_36":11852,"_45":9266,"_47":11854},"np.isfinite","np.isfinite(x)","Test element-wise for finiteness (not infinity and not NaN).",[11853],{"_17":405,"_19":8908,"_41":6},[],{"_17":11856,"_31":11857,"_33":11858,"_19":11858,"_36":11859,"_45":2598,"_47":11861},"np.isFloatDType","np.isFloatDType(dtype)","Check if dtype is a floating point type.",[11860],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11863,"_31":11864,"_33":11865,"_19":11865,"_36":11866,"_45":2598,"_47":11868},"np.isfortran","np.isfortran(a)","Check if the array is Fortran contiguous but not C contiguous.",[11867],{"_17":664,"_19":8908,"_41":6},[],{"_17":11870,"_31":11871,"_33":11872,"_19":11873,"_36":11874,"_45":9266,"_47":11878},"np.isin","np.isin(ar1, ar2, options?)","Test whether each element of ar1 is also present in ar2.\r","Test whether each element of ar1 is also present in ar2.\r\n\r\nReturns a boolean array of the same shape as ar1.",[11875,11876,11877],{"_17":11637,"_19":8908,"_41":6},{"_17":11640,"_19":11641,"_41":6},{"_17":454,"_19":8788,"_41":10},[],{"_17":11880,"_31":11881,"_33":11882,"_19":11882,"_36":11883,"_45":9266,"_47":11885},"np.isinf","np.isinf(x)","Test element-wise for positive or negative infinity.",[11884],{"_17":405,"_19":8908,"_41":6},[],{"_17":11887,"_31":11888,"_33":11889,"_19":11889,"_36":11890,"_45":2598,"_47":11892},"np.isIntegerDType","np.isIntegerDType(dtype)","Check if dtype is an integer type (signed or unsigned).",[11891],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11894,"_31":11895,"_33":11896,"_19":11897,"_36":11898,"_45":9217,"_47":11900},"np.islower","np.islower(a)","Return true for each element if all cased characters are lowercase\r","Return true for each element if all cased characters are lowercase\r\nand there is at least one cased character.",[11899],{"_17":664,"_19":10654,"_41":6},[],{"_17":11902,"_31":11903,"_33":11904,"_19":11904,"_36":11905,"_45":9266,"_47":11907},"np.isnan","np.isnan(x)","Test element-wise for NaN.",[11906],{"_17":405,"_19":8908,"_41":6},[],{"_17":11909,"_31":11910,"_33":11911,"_19":11911,"_36":11912,"_45":9266,"_47":11914},"np.isneginf","np.isneginf(x)","Test element-wise for negative infinity.",[11913],{"_17":405,"_19":8908,"_41":6},[],{"_17":11916,"_31":11917,"_33":11918,"_19":11918,"_36":11919,"_45":2598,"_47":11920},"np.isNode","np.isNode()","Check if running in Node.js environment.",[],[],{"_17":11922,"_31":11923,"_33":11924,"_19":11925,"_36":11926,"_45":9217,"_47":11928},"np.isnumeric","np.isnumeric(a)","Return true for each element if all characters are numeric.\r","Return true for each element if all characters are numeric.\r\nNumeric characters include digit characters and characters\r\nthat have the Unicode numeric value property (subscripts, fractions, etc.).",[11927],{"_17":664,"_19":10654,"_41":6},[],{"_17":11930,"_31":11931,"_33":11932,"_19":11932,"_36":11933,"_45":2598,"_47":11935},"np.isNumericDType","np.isNumericDType(dtype)","Check if dtype is numeric (not bool).",[11934],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11937,"_31":11938,"_33":11939,"_19":11939,"_36":11940,"_45":9266,"_47":11942},"np.isposinf","np.isposinf(x)","Test element-wise for positive infinity.",[11941],{"_17":405,"_19":8908,"_41":6},[],{"_17":11944,"_31":11945,"_33":11946,"_19":11947,"_36":11948,"_45":9266,"_47":11950},"np.isreal","np.isreal(x)","Returns a bool array where True if input element is real (imaginary part == 0).\r","Returns a bool array where True if input element is real (imaginary part == 0).\r\nFor non-complex dtype arrays, returns all True.",[11949],{"_17":405,"_19":8908,"_41":6},[],{"_17":11952,"_31":11953,"_33":11954,"_19":11954,"_36":11955,"_45":2598,"_47":11957},"np.isrealobj","np.isrealobj(x)","Check if the array has a non-complex dtype.",[11956],{"_17":405,"_19":8908,"_41":6},[],{"_17":11959,"_31":11960,"_33":11961,"_19":11961,"_36":11962,"_45":2598,"_47":11966},"np.isscalar","np.isscalar(element)","Check if an element is a scalar type.",[11963],{"_17":11964,"_19":11965,"_41":6},"element","- Value to check",[],{"_17":11968,"_31":11969,"_33":11970,"_19":11970,"_36":11971,"_45":2598,"_47":11973},"np.isSignedDType","np.isSignedDType(dtype)","Check if dtype is a signed type.",[11972],{"_17":9115,"_19":10065,"_41":6},[],{"_17":11975,"_31":11976,"_33":11977,"_19":11977,"_36":11978,"_45":9217,"_47":11980},"np.isspace","np.isspace(a)","Return true for each element if all characters are whitespace.",[11979],{"_17":664,"_19":10654,"_41":6},[],{"_17":11982,"_31":11983,"_33":11984,"_19":11984,"_36":11985,"_45":11987,"_47":11988},"np.isStructuredDType","np.isStructuredDType(dtype)","Type guard for structured dtypes.",[11986],{"_17":9115,"_19":481,"_41":6},"dtype is StructuredDType",[],{"_17":11990,"_31":11991,"_33":11992,"_19":11992,"_36":11993,"_45":2598,"_47":12000},"np.issubdtype","np.issubdtype(arg1, arg2)","Return true if first argument is a typecode lower/equal in type hierarchy.",[11994,11997],{"_17":11995,"_19":11996,"_41":6},"arg1","- dtype to check",{"_17":11998,"_19":11999,"_41":6},"arg2","- dtype category or abstract type to compare against",[],{"_17":12002,"_31":12003,"_33":12004,"_19":12005,"_36":12006,"_45":9217,"_47":12008},"np.istitle","np.istitle(a)","Return true for each element if the string is titlecased.\r","Return true for each element if the string is titlecased.\r\nA string is titlecased if uppercase characters follow uncased\r\ncharacters and lowercase characters follow cased characters.",[12007],{"_17":664,"_19":10654,"_41":6},[],{"_17":12010,"_31":12011,"_33":12012,"_19":12013,"_36":12014,"_45":9217,"_47":12016},"np.isupper","np.isupper(a)","Return true for each element if all cased characters are uppercase\r","Return true for each element if all cased characters are uppercase\r\nand there is at least one cased character.",[12015],{"_17":664,"_19":10654,"_41":6},[],{"_17":12018,"_31":12019,"_33":12020,"_19":12020,"_36":12021,"_45":2598,"_47":12022},"np.isWasmLoaded","np.isWasmLoaded()","Check if the WASM module has been loaded.",[],[],{"_17":12024,"_31":12025,"_33":12026,"_19":12027,"_36":12028,"_45":2598,"_47":12030},"np.iterable","np.iterable(y)","Check whether the object is iterable.\r","Check whether the object is iterable.\r\n\r\nThis function returns True if the object is iterable, i.e., if it has\r\na Symbol.iterator method. Strings are considered iterable in JavaScript,\r\nbut this function returns false for strings to match NumPy behavior.",[12029],{"_17":2467,"_19":8493,"_41":6},[],{"_17":12032,"_31":12033,"_33":12034,"_19":12035,"_36":12036,"_45":9742,"_47":12039},"np.ix_","np.ix_(args)","Construct an open mesh from multiple sequences.\r","Construct an open mesh from multiple sequences.\r\nThis function takes N 1-D sequences and returns N outputs with N dimensions each,\r\nsuch that the shape in the ith dimension is the length of the ith input.",[12037],{"_17":9140,"_19":12038,"_41":6},"- 1-D sequences (arrays or NDArrays)",[],{"_17":12041,"_31":12042,"_33":12043,"_19":12044,"_36":12045,"_45":9266,"_47":12049},"np.kaiser","np.kaiser(M, beta)","Return the Kaiser window.\r","Return the Kaiser window.\r\n\r\nThe Kaiser window is a taper formed by using a Bessel function.\r\nIt provides a good approximation to the Digital Prolate Spheroidal\r\nSequence (DPSS/Slepian window).\r\n\r\nFormula: w(n) = I₀(β * sqrt(1 - (2n/(M-1))²)) / I₀(β)\r\n\r\nThe beta parameter controls the window shape:\r\n- β = 0: Rectangular window\r\n- β ≈ 5: Similar to Hamming\r\n- β ≈ 6: Similar to Hanning\r\n- β ≈ 8.6: Similar to Blackman\r\n- β = 14: Good starting point for most applications",[12046,12047],{"_17":5526,"_19":9623,"_41":6},{"_17":118,"_19":12048,"_41":6},"- Shape parameter for the window. Larger values produce\r\n narrower main lobe with lower side lobes.",[],{"_17":12051,"_31":12052,"_33":12053,"_19":12054,"_36":12055,"_45":9266,"_47":12058},"np.kron","np.kron(a, b)","Kronecker product of two arrays.\r","Kronecker product of two arrays.\r\n\r\nComputes the Kronecker product, a composite array made of blocks of the\r\nsecond array scaled by the first.",[12056,12057],{"_17":664,"_19":9056,"_41":6},{"_17":408,"_19":9058,"_41":6},[],{"_17":12060,"_31":12061,"_33":12062,"_19":12062,"_36":12063,"_45":374,"_47":12065},"np.lag2poly","np.lag2poly(c)","Convert Laguerre coefficients to power series.",[12064],{"_17":713,"_19":374,"_41":6},[],{"_17":12067,"_31":12068,"_33":7129,"_19":1136,"_36":12069,"_45":374,"_47":12072},"np.lagadd","np.lagadd(c1, c2)",[12070,12071],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12074,"_31":12075,"_33":7178,"_19":1136,"_36":12076,"_45":506,"_47":12078},"np.lagcompanion","np.lagcompanion(c)",[12077],{"_17":713,"_19":374,"_41":6},[],{"_17":12080,"_31":12081,"_33":7097,"_19":1136,"_36":12082,"_45":374,"_47":12085},"np.lagder","np.lagder(c, m?)",[12083,12084],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},[],{"_17":12087,"_31":12088,"_33":7128,"_19":1136,"_36":12089,"_45":9868,"_47":12092},"np.lagdiv","np.lagdiv(c1, c2)",[12090,12091],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12094,"_31":12095,"_33":7096,"_19":1136,"_36":12096,"_45":9889,"_47":12103},"np.lagfit","np.lagfit(x, y, deg, rcond?, full?, w?)",[12097,12098,12099,12100,12101,12102],{"_17":405,"_19":374,"_41":6},{"_17":2467,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},{"_17":9882,"_19":11309,"_41":10},{"_17":7871,"_19":2598,"_41":10},{"_17":9887,"_19":11312,"_41":10},[],{"_17":12105,"_31":12106,"_33":7177,"_19":1136,"_36":12107,"_45":374,"_47":12109},"np.lagfromroots","np.lagfromroots(roots)",[12108],{"_17":6420,"_19":374,"_41":6},[],{"_17":12111,"_31":12112,"_33":7107,"_19":1136,"_36":12113,"_45":374,"_47":12118},"np.lagint","np.lagint(c, m?, k?, lbnd?)",[12114,12115,12116,12117],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},{"_17":4686,"_19":374,"_41":10},{"_17":9910,"_19":1387,"_41":10},[],{"_17":12120,"_31":12121,"_33":7119,"_19":1136,"_36":12122,"_45":374,"_47":12125},"np.lagmul","np.lagmul(c1, c2)",[12123,12124],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12127,"_31":12128,"_33":7159,"_19":1136,"_36":12129,"_45":374,"_47":12133},"np.lagpow","np.lagpow(c, pow, maxpower?)",[12130,12131,12132],{"_17":713,"_19":374,"_41":6},{"_17":9943,"_19":1387,"_41":6},{"_17":9945,"_19":1387,"_41":10},[],{"_17":12135,"_31":12136,"_33":7169,"_19":1136,"_36":12137,"_45":9926,"_47":12139},"np.lagroots","np.lagroots(c)",[12138],{"_17":713,"_19":374,"_41":6},[],{"_17":12141,"_31":12142,"_33":7148,"_19":1136,"_36":12143,"_45":374,"_47":12146},"np.lagsub","np.lagsub(c1, c2)",[12144,12145],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12148,"_31":12149,"_33":12150,"_19":12150,"_36":12151,"_45":1387,"_47":12154},"np.lagval","np.lagval(x, c)","Evaluate Laguerre polynomial.",[12152,12153],{"_17":405,"_19":1387,"_41":6},{"_17":713,"_19":374,"_41":6},[],{"_17":12156,"_31":12157,"_33":7196,"_19":1136,"_36":12158,"_45":506,"_47":12161},"np.lagvander","np.lagvander(x, deg)",[12159,12160],{"_17":405,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},[],{"_17":12163,"_31":12164,"_33":12165,"_19":12166,"_36":12167,"_45":9217,"_47":12170},"np.lcm","np.lcm(x1, x2)","Returns the lowest common multiple of |x1| and |x2|.\r","Returns the lowest common multiple of |x1| and |x2|.\r\nInput arrays must be integers.",[12168,12169],{"_17":9225,"_19":11114,"_41":6},{"_17":9227,"_19":11116,"_41":6},[],{"_17":12172,"_31":12173,"_33":12174,"_19":12175,"_36":12176,"_45":9217,"_47":12181},"np.ldexp","np.ldexp(x1, x2)","Returns x1 * 2^x2, element-wise.\r","Returns x1 * 2^x2, element-wise.\r\n\r\nThe mantissas x1 and twos exponents x2 are used to construct\r\nfloating point numbers x = x1 * 2^x2.",[12177,12179],{"_17":9225,"_19":12178,"_41":6},"- Array of multipliers (mantissas)",{"_17":9227,"_19":12180,"_41":6},"- Array of twos exponents",[],{"_17":12183,"_31":12184,"_33":12185,"_19":12185,"_36":12186,"_45":9217,"_47":12189},"np.left_shift","np.left_shift(x1, x2)","Shift the bits of an integer to the left.",[12187,12188],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12191,"_31":12192,"_33":12193,"_19":12193,"_36":12194,"_45":374,"_47":12196},"np.leg2poly","np.leg2poly(c)","Convert Legendre coefficients to power series.",[12195],{"_17":713,"_19":374,"_41":6},[],{"_17":12198,"_31":12199,"_33":12200,"_19":12200,"_36":12201,"_45":374,"_47":12204},"np.legadd","np.legadd(c1, c2)","Add two Legendre polynomials.",[12202,12203],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12206,"_31":12207,"_33":12208,"_19":12208,"_36":12209,"_45":506,"_47":12211},"np.legcompanion","np.legcompanion(c)","Generate Legendre companion matrix.",[12210],{"_17":713,"_19":374,"_41":6},[],{"_17":12213,"_31":12214,"_33":12215,"_19":12215,"_36":12216,"_45":374,"_47":12219},"np.legder","np.legder(c, m?)","Legendre derivative.",[12217,12218],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},[],{"_17":12221,"_31":12222,"_33":12223,"_19":12223,"_36":12224,"_45":9868,"_47":12227},"np.legdiv","np.legdiv(c1, c2)","Divide two Legendre polynomials.",[12225,12226],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12229,"_31":12230,"_33":12231,"_19":12231,"_36":12232,"_45":9889,"_47":12239},"np.legfit","np.legfit(x, y, deg, rcond?, full?, w?)","Legendre least squares fit.",[12233,12234,12235,12236,12237,12238],{"_17":405,"_19":374,"_41":6},{"_17":2467,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},{"_17":9882,"_19":11309,"_41":10},{"_17":7871,"_19":2598,"_41":10},{"_17":9887,"_19":11312,"_41":10},[],{"_17":12241,"_31":12242,"_33":12243,"_19":12243,"_36":12244,"_45":374,"_47":12246},"np.legfromroots","np.legfromroots(roots)","Construct Legendre polynomial from roots.",[12245],{"_17":6420,"_19":374,"_41":6},[],{"_17":12248,"_31":12249,"_33":12250,"_19":12250,"_36":12251,"_45":374,"_47":12256},"np.legint","np.legint(c, m?, k?, lbnd?)","Legendre integral.",[12252,12253,12254,12255],{"_17":713,"_19":374,"_41":6},{"_17":630,"_19":1387,"_41":10},{"_17":4686,"_19":374,"_41":10},{"_17":9910,"_19":1387,"_41":10},[],{"_17":12258,"_31":12259,"_33":12260,"_19":12260,"_36":12261,"_45":374,"_47":12264},"np.legmul","np.legmul(c1, c2)","Multiply two Legendre polynomials.",[12262,12263],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12266,"_31":12267,"_33":12268,"_19":12268,"_36":12269,"_45":374,"_47":12273},"np.legpow","np.legpow(c, pow, maxpower?)","Raise Legendre polynomial to a power.",[12270,12271,12272],{"_17":713,"_19":374,"_41":6},{"_17":9943,"_19":1387,"_41":6},{"_17":9945,"_19":1387,"_41":10},[],{"_17":12275,"_31":12276,"_33":12277,"_19":12277,"_36":12278,"_45":9926,"_47":12280},"np.legroots","np.legroots(c)","Find Legendre polynomial roots.",[12279],{"_17":713,"_19":374,"_41":6},[],{"_17":12282,"_31":12283,"_33":12284,"_19":12284,"_36":12285,"_45":374,"_47":12288},"np.legsub","np.legsub(c1, c2)","Subtract two Legendre polynomials.",[12286,12287],{"_17":726,"_19":374,"_41":6},{"_17":729,"_19":374,"_41":6},[],{"_17":12290,"_31":12291,"_33":12292,"_19":12292,"_36":12293,"_45":1387,"_47":12296},"np.legval","np.legval(x, c)","Evaluate Legendre polynomial using Clenshaw-like algorithm.",[12294,12295],{"_17":405,"_19":9968,"_41":6},{"_17":713,"_19":9850,"_41":6},[],{"_17":12298,"_31":12299,"_33":12300,"_19":12300,"_36":12301,"_45":506,"_47":12304},"np.legvander","np.legvander(x, deg)","Legendre Vandermonde matrix.",[12302,12303],{"_17":405,"_19":374,"_41":6},{"_17":6397,"_19":1387,"_41":6},[],{"_17":12306,"_31":12307,"_33":12308,"_19":12308,"_36":12309,"_45":9217,"_47":12312},"np.less","np.less(x1, x2)","Return (x1 < x2) element-wise.",[12310,12311],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12314,"_31":12315,"_33":12316,"_19":12316,"_36":12317,"_45":9217,"_47":12320},"np.less_equal","np.less_equal(x1, x2)","Return (x1 <= x2) element-wise.",[12318,12319],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12322,"_31":12323,"_33":12324,"_19":12325,"_36":12326,"_45":9266,"_47":12330},"np.lexsort","np.lexsort(keys)","Perform an indirect stable sort using a sequence of keys.\r","Perform an indirect stable sort using a sequence of keys.\r\n\r\nGiven multiple sorting keys, lexsort returns an array of integer indices\r\nthat describes the sort order by multiple columns. The last key in the\r\nsequence is used for the primary sort order, the second-to-last key for\r\nthe secondary sort order, and so on.",[12327],{"_17":12328,"_19":12329,"_41":6},"keys","- Array of keys to sort by. Each key should be 1-D with the same length.\r\n The last key is the primary sort key.",[],{"_17":12332,"_31":12333,"_33":12334,"_19":12334,"_36":12335,"_45":9266,"_47":12343},"np.linspace","np.linspace(start, stop, num?, endpoint?, options?)","Create an NDArray with evenly spaced numbers over a specified interval.",[12336,12338,12340,12341,12342],{"_17":9323,"_19":12337,"_41":6},"- Start value",{"_17":11136,"_19":12339,"_41":6},"- End value",{"_17":9631,"_19":11139,"_41":10},{"_17":11141,"_19":11142,"_41":10},{"_17":454,"_19":9446,"_41":10},[],{"_17":12345,"_31":12346,"_33":12347,"_19":12347,"_36":12348,"_45":9650,"_47":12349},"np.listBitGenerators","np.listBitGenerators()","List available BitGenerator names.",[],[],{"_17":12351,"_31":12352,"_33":12353,"_19":12353,"_36":12354,"_45":9217,"_47":12361},"np.ljust","np.ljust(a, width, fillchar?)","Return element-wise left-justified string of given width.",[12355,12356,12358],{"_17":664,"_19":10654,"_41":6},{"_17":654,"_19":12357,"_41":6},"- Total width of output string",{"_17":12359,"_19":12360,"_41":10},"fillchar","- Padding character (default space)",[],{"_17":12363,"_31":12364,"_33":12365,"_19":12365,"_36":12366,"_45":9266,"_47":12371},"np.load","np.load(file, _options?)","Load an array from a NPY file.",[12367,12369],{"_17":11011,"_19":12368,"_41":6},"- File path (Node.js), File object (browser), ArrayBuffer, or URL",{"_17":8334,"_19":12370,"_41":10},"LoadOptions",[],{"_17":12373,"_31":12374,"_33":12375,"_19":12376,"_36":12377,"_45":9266,"_47":12381},"np.loadtxt","np.loadtxt(file, options?)","Load data from a text file.\r","Load data from a text file.\r\n\r\nEach row in the text file must have the same number of values.",[12378,12380],{"_17":11011,"_19":12379,"_41":6},"- File source (path, File object, or URL)",{"_17":454,"_19":11126,"_41":10},[],{"_17":12383,"_31":12384,"_33":12385,"_19":12386,"_36":12387,"_45":12388,"_47":12389},"np.loadWasmModule","np.loadWasmModule()","Load the WASM module asynchronously.\r","Load the WASM module asynchronously.\r\n\r\nThis function is idempotent - calling it multiple times will return\r\nthe same module instance. The module is loaded lazily on first call.",[],"Promise",[],{"_17":12391,"_31":12392,"_33":12393,"_19":12394,"_36":12395,"_45":12397,"_47":12398},"np.loadz","np.loadz(file)","Load arrays from a `.npz` file.\r","Load arrays from a `.npz` file.\r\n\r\nReturns an object with array names as keys and NDArrays as values.\r\nThe `files` property contains the list of array names.",[12396],{"_17":11011,"_19":12368,"_41":6},"Promise",[],{"_17":12400,"_31":12401,"_33":12402,"_19":12402,"_36":12403,"_45":9217,"_47":12405},"np.log","np.log(x)","Natural logarithm, element-wise.",[12404],{"_17":405,"_19":9217,"_41":6},[],{"_17":12407,"_31":12408,"_33":12409,"_19":12409,"_36":12410,"_45":9217,"_47":12412},"np.log10","np.log10(x)","Base-10 logarithm, element-wise.",[12411],{"_17":405,"_19":9217,"_41":6},[],{"_17":12414,"_31":12415,"_33":12416,"_19":12416,"_36":12417,"_45":9217,"_47":12419},"np.log1p","np.log1p(x)","Return the natural logarithm of one plus the input array, element-wise.",[12418],{"_17":405,"_19":9217,"_41":6},[],{"_17":12421,"_31":12422,"_33":12423,"_19":12423,"_36":12424,"_45":9217,"_47":12426},"np.log2","np.log2(x)","Base-2 logarithm of x.",[12425],{"_17":405,"_19":9217,"_41":6},[],{"_17":12428,"_31":12429,"_33":12430,"_19":12430,"_36":12431,"_45":9217,"_47":12434},"np.logaddexp","np.logaddexp(x1, x2)","Compute the logarithm of the sum of exponentials of the inputs.",[12432,12433],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12436,"_31":12437,"_33":12438,"_19":12438,"_36":12439,"_45":9217,"_47":12442},"np.logaddexp2","np.logaddexp2(x1, x2)","Compute log(2**x1 + 2**x2).",[12440,12441],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12444,"_31":12445,"_33":12446,"_19":12446,"_36":12447,"_45":9217,"_47":12450},"np.logical_and","np.logical_and(x1, x2)","Compute the truth value of x1 AND x2 element-wise.",[12448,12449],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12452,"_31":12453,"_33":12454,"_19":12454,"_36":12455,"_45":9217,"_47":12457},"np.logical_not","np.logical_not(x)","Compute the truth value of NOT x element-wise.",[12456],{"_17":405,"_19":9217,"_41":6},[],{"_17":12459,"_31":12460,"_33":12461,"_19":12461,"_36":12462,"_45":9217,"_47":12465},"np.logical_or","np.logical_or(x1, x2)","Compute the truth value of x1 OR x2 element-wise.",[12463,12464],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12467,"_31":12468,"_33":12469,"_19":12469,"_36":12470,"_45":9217,"_47":12473},"np.logical_xor","np.logical_xor(x1, x2)","Compute the truth value of x1 XOR x2, element-wise.",[12471,12472],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12475,"_31":12476,"_33":12477,"_19":12477,"_36":12478,"_45":9266,"_47":12488},"np.logspace","np.logspace(start, stop, num?, endpoint?, base?, options?)","Create an NDArray with numbers spaced evenly on a log scale.",[12479,12481,12483,12484,12485,12487],{"_17":9323,"_19":12480,"_41":6},"- Start value (power of base)",{"_17":11136,"_19":12482,"_41":6},"- End value (power of base)",{"_17":9631,"_19":11139,"_41":10},{"_17":11141,"_19":11142,"_41":10},{"_17":9634,"_19":12486,"_41":10},"- Base of the log scale (default: 10)",{"_17":454,"_19":9446,"_41":10},[],{"_17":12490,"_31":12491,"_33":12492,"_19":12492,"_36":12493,"_45":9217,"_47":12495},"np.lower","np.lower(a)","Return element-wise copy with uppercase characters converted to lowercase.",[12494],{"_17":664,"_19":10654,"_41":6},[],{"_17":12497,"_31":12498,"_33":12499,"_19":12499,"_36":12500,"_45":9217,"_47":12505},"np.lstrip","np.lstrip(a, chars?)","Return element-wise copy with leading characters removed.",[12501,12502],{"_17":664,"_19":10654,"_41":6},{"_17":12503,"_19":12504,"_41":10},"chars","- Characters to remove (default: whitespace)",[],{"_17":12507,"_31":12508,"_33":12509,"_19":12510,"_36":12511,"_45":12517,"_47":12518},"np.lstsq","np.lstsq(a, b, rcond?)","Return the least-squares solution to a linear matrix equation.\r","Return the least-squares solution to a linear matrix equation.\r\n\r\nComputes the vector x that approximately solves the equation a @ x = b.",[12512,12514,12516],{"_17":664,"_19":12513,"_41":6},"- Coefficient matrix (M x N)",{"_17":408,"_19":12515,"_41":6},"- Ordinate values (M,) or (M x K)",{"_17":9882,"_19":9883,"_41":10},"Promise",[],{"_17":12520,"_31":12521,"_33":12522,"_19":12523,"_36":12524,"_45":12532,"_47":12533},"np.mapdomain","np.mapdomain(x, old, new_)","Map x from old domain to new domain.\r","Map x from old domain to new domain.\r\n\r\nThe mapping is: new = off + scl * old\r\nwhere off and scl are computed from the domains.",[12525,12527,12529],{"_17":405,"_19":12526,"_41":6},"- Values to map (number, array, or NDArray)",{"_17":4793,"_19":12528,"_41":6},"- Original domain [min, max]",{"_17":12530,"_19":12531,"_41":6},"new_","- Target domain [min, max]","number[] | number",[],{"_17":12535,"_31":12536,"_33":12537,"_19":12538,"_36":12539,"_45":11162,"_47":12542},"np.mapparms","np.mapparms(old, new_)","Get linear mapping parameters between domains.\r","Get linear mapping parameters between domains.\r\n\r\nReturns [offset, scale] such that new = offset + scale * old",[12540,12541],{"_17":4793,"_19":12528,"_41":6},{"_17":12530,"_19":12531,"_41":6},[],{"_17":12544,"_31":12545,"_33":12546,"_19":12547,"_36":12548,"_45":12555,"_47":12556},"np.mask_indices","np.mask_indices(n, func, k?)","Return indices that are non-zero in the mask.\r","Return indices that are non-zero in the mask.\r\n\r\nCalling this function with a mask function that returns a 2-D array\r\nwill return indices appropriate for accessing the elements that would\r\nbe selected by the mask.",[12549,12551,12553],{"_17":1206,"_19":12550,"_41":6},"- Size of the array for which indices are needed",{"_17":8055,"_19":12552,"_41":6},"- A function whose call signature is similar to that of triu, tril.\r\n That is, func(n, k) returns a boolean array of shape (n, n).",{"_17":4686,"_19":12554,"_41":10},"- Diagonal offset","Promise<[NDArray, NDArray]>",[],{"_17":12558,"_31":12559,"_33":12560,"_19":12561,"_36":12562,"_45":9266,"_47":12567},"np.matmul","np.matmul(a, b)","Matrix multiplication of two arrays.\r","Matrix multiplication of two arrays.\r\n\r\nFor 2-D arrays: regular matrix multiplication.\r\nFor N-D arrays: broadcast over batch dimensions, matmul on last two.",[12563,12565],{"_17":664,"_19":12564,"_41":6},"- First array (..., M, K)",{"_17":408,"_19":12566,"_41":6},"- Second array (..., K, N)",[],{"_17":12569,"_31":12570,"_33":12571,"_19":12571,"_36":12572,"_45":8917,"_47":12579},"np.matrix_norm","np.matrix_norm(x, ord?, keepdims?)","Compute the matrix norm.",[12573,12575,12577],{"_17":405,"_19":12574,"_41":6},"- Input matrix (..., M, N)",{"_17":8407,"_19":12576,"_41":10},"- Order of the norm ('fro', 'nuc', 1, 2, -1, -2, Infinity, -Infinity)",{"_17":9238,"_19":12578,"_41":10},"- If true, axes are left with size one",[],{"_17":12581,"_31":12582,"_33":12583,"_19":12583,"_36":12584,"_45":9266,"_47":12589},"np.matrix_power","np.matrix_power(a, n)","Raise a square matrix to the (integer) power n.",[12585,12587],{"_17":664,"_19":12586,"_41":6},"- Square matrix",{"_17":1206,"_19":12588,"_41":6},"- Exponent (can be negative for inverse)",[],{"_17":12591,"_31":12592,"_33":12593,"_19":12593,"_36":12594,"_45":3784,"_47":12599},"np.matrix_rank","np.matrix_rank(A, tol?)","Return matrix rank using SVD method.",[12595,12597],{"_17":1163,"_19":12596,"_41":6},"- Matrix to determine rank of",{"_17":470,"_19":12598,"_41":10},"- Threshold for considering singular values as zero",[],{"_17":12601,"_31":12602,"_33":12603,"_19":12604,"_36":12605,"_45":9217,"_47":12608},"np.matrix_transpose","np.matrix_transpose(x)","Transposes the last two dimensions of an array.\r","Transposes the last two dimensions of an array.\r\n\r\nNumPy 2.0 addition: Equivalent to swapaxes(a, -2, -1).",[12606],{"_17":405,"_19":12607,"_41":6},"- Input array, must have at least 2 dimensions",[],{"_17":12610,"_31":12611,"_33":12612,"_19":12613,"_36":12614,"_45":9266,"_47":12619},"np.matvec","np.matvec(x1, x2)","Matrix-vector product.\r","Matrix-vector product.\r\n\r\nNumPy 2.0 addition. Computes the matrix-vector product of x1 and x2.\r\nEquivalent to matmul with 2D @ 1D broadcasting.",[12615,12617],{"_17":9225,"_19":12616,"_41":6},"- Matrix (..., M, N)",{"_17":9227,"_19":12618,"_41":6},"- Vector (..., N)",[],{"_17":12621,"_31":12622,"_33":12623,"_19":12623,"_36":12624,"_45":8917,"_47":12629},"np.max","np.max(a, axis?, keepdims?)","Return the maximum of an array or maximum along an axis.",[12625,12626,12628],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12627,"_41":10},"- Axis along which to find maximum. null finds maximum of all elements.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":12631,"_31":12632,"_33":12633,"_19":12633,"_36":12634,"_45":9217,"_47":12637},"np.maximum","np.maximum(x1, x2)","Element-wise maximum of array elements (propagates NaN).",[12635,12636],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12639,"_31":12640,"_33":12641,"_19":12641,"_36":12642,"_45":8917,"_47":12649},"np.mean","np.mean(a, axis?, keepdims?, dtype?)","Compute the arithmetic mean along the specified axis.",[12643,12644,12646,12647],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12645,"_41":10},"- Axis along which to compute mean. null computes mean of all elements.",{"_17":9238,"_19":9391,"_41":10},{"_17":9115,"_19":12648,"_41":10},"- Output dtype (default: float64 for integers, same as input otherwise)",[],{"_17":12651,"_31":12652,"_33":12653,"_19":12653,"_36":12654,"_45":8917,"_47":12659},"np.median","np.median(a, axis?, keepdims?)","Compute the median along the specified axis.",[12655,12656,12658],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12657,"_41":10},"- Axis along which to compute median. null computes median of all elements.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":12661,"_31":12662,"_33":12663,"_19":12663,"_36":12664,"_45":9742,"_47":12668},"np.meshgrid","np.meshgrid(xi)","Return coordinate matrices from coordinate vectors.",[12665],{"_17":12666,"_19":12667,"_41":6},"xi","- 1D coordinate arrays",[],{"_17":12670,"_31":12671,"_33":12672,"_19":12672,"_36":12673,"_45":8917,"_47":12678},"np.min","np.min(a, axis?, keepdims?)","Return the minimum of an array or minimum along an axis.",[12674,12675,12677],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12676,"_41":10},"- Axis along which to find minimum. null finds minimum of all elements.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":12680,"_31":12681,"_33":12682,"_19":12683,"_36":12684,"_45":10065,"_47":12687},"np.min_scalar_type","np.min_scalar_type(value)","Return the minimum scalar type needed to represent the value.\r","Return the minimum scalar type needed to represent the value.\r\n\r\nFor scalars, returns the smallest dtype that can hold the value.\r\nFor integers, finds the smallest integer type.\r\nFor floats, returns float64 (to preserve precision).",[12685],{"_17":514,"_19":12686,"_41":6},"- A scalar value",[],{"_17":12689,"_31":12690,"_33":12691,"_19":12691,"_36":12692,"_45":9217,"_47":12695},"np.minimum","np.minimum(x1, x2)","Element-wise minimum of array elements (propagates NaN).",[12693,12694],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12697,"_31":12698,"_33":12699,"_19":12700,"_36":12701,"_45":10488,"_47":12703},"np.modf","np.modf(x)","Return the fractional and integral parts of an array, element-wise.\r","Return the fractional and integral parts of an array, element-wise.\r\nThe fractional and integral parts are negative if the given number is negative.",[12702],{"_17":405,"_19":8908,"_41":6},[],{"_17":12705,"_31":12706,"_33":12707,"_19":12707,"_36":12708,"_45":9217,"_47":12716},"np.moveaxis","np.moveaxis(a, source, destination)","Move axes of an array to new positions.",[12709,12710,12713],{"_17":664,"_19":8908,"_41":6},{"_17":12711,"_19":12712,"_41":6},"source","- Original positions of the axes to move",{"_17":12714,"_19":12715,"_41":6},"destination","- Destination positions for each axis",[],{"_17":12718,"_31":12719,"_33":12720,"_19":12721,"_36":12722,"_45":9266,"_47":12725},"np.multi_dot","np.multi_dot(arrays)","Compute the dot product of two or more arrays in a single function call,\r","Compute the dot product of two or more arrays in a single function call,\r\nwhile automatically selecting the fastest evaluation order.\r\n\r\nUses dynamic programming to find the optimal parenthesization that\r\nminimizes the total number of scalar multiplications.",[12723],{"_17":9731,"_19":12724,"_41":6},"- List of arrays to multiply together",[],{"_17":12727,"_31":12728,"_33":12729,"_19":12729,"_36":12730,"_45":9217,"_47":12733},"np.multiply","np.multiply(x1, x2)","Multiply arguments element-wise.",[12731,12732],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12735,"_31":12736,"_33":12737,"_19":12737,"_36":12738,"_45":9266,"_47":12749},"np.nan_to_num","np.nan_to_num(x, nan?, posinf?, neginf?)","Replace NaN with zero and infinity with large finite numbers.",[12739,12740,12743,12746],{"_17":405,"_19":8908,"_41":6},{"_17":12741,"_19":12742,"_41":10},"nan","- Value to replace NaN with (default: 0.0)",{"_17":12744,"_19":12745,"_41":10},"posinf","- Value to replace positive infinity with (default: largest finite float)",{"_17":12747,"_19":12748,"_41":10},"neginf","- Value to replace negative infinity with (default: most negative finite float)",[],{"_17":12751,"_31":12752,"_33":12753,"_19":12753,"_36":12754,"_45":8917,"_47":12760},"np.nanargmax","np.nanargmax(a, axis?, keepdims?)","Return the indices of the maximum values along an axis, ignoring NaNs.",[12755,12756,12758],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12757,"_41":10},"- Axis along which to operate (null = flattened array)",{"_17":9238,"_19":12759,"_41":10},"- If true, reduced axes are left with size one",[],{"_17":12762,"_31":12763,"_33":12764,"_19":12764,"_36":12765,"_45":8917,"_47":12769},"np.nanargmin","np.nanargmin(a, axis?, keepdims?)","Return the indices of the minimum values along an axis, ignoring NaNs.",[12766,12767,12768],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12757,"_41":10},{"_17":9238,"_19":12759,"_41":10},[],{"_17":12771,"_31":12772,"_33":12773,"_19":12774,"_36":12775,"_45":9266,"_47":12780},"np.nancumprod","np.nancumprod(a, axis?, dtype?)","Return the cumulative product of array elements treating NaNs as one.\r","Return the cumulative product of array elements treating NaNs as one.\r\n\r\nThe cumulative product does not change when NaNs are encountered and\r\nleading NaNs are replaced by ones.",[12776,12777,12779],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12778,"_41":10},"- Axis along which to compute. null = flatten first",{"_17":9115,"_19":10314,"_41":10},[],{"_17":12782,"_31":12783,"_33":12784,"_19":12785,"_36":12786,"_45":9266,"_47":12790},"np.nancumsum","np.nancumsum(a, axis?, dtype?)","Return the cumulative sum of array elements treating NaNs as zero.\r","Return the cumulative sum of array elements treating NaNs as zero.\r\n\r\nThe cumulative sum does not change when NaNs are encountered and\r\nleading NaNs are replaced by zeros.",[12787,12788,12789],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12778,"_41":10},{"_17":9115,"_19":10314,"_41":10},[],{"_17":12792,"_31":12793,"_33":12794,"_19":12794,"_36":12795,"_45":8917,"_47":12801},"np.nanmax","np.nanmax(a, axis?, keepdims?)","Return maximum of an array or maximum along an axis, ignoring any NaNs.",[12796,12798,12800],{"_17":664,"_19":12797,"_41":6},"- Array containing numbers",{"_17":2911,"_19":12799,"_41":10},"- Axis or axes along which to operate (null = all elements)",{"_17":9238,"_19":12759,"_41":10},[],{"_17":12803,"_31":12804,"_33":12805,"_19":12805,"_36":12806,"_45":8917,"_47":12814},"np.nanmean","np.nanmean(a, axis?, keepdims?, dtype?)","Compute the arithmetic mean along the specified axis, ignoring NaNs.",[12807,12809,12811,12812],{"_17":664,"_19":12808,"_41":6},"- Array containing numbers whose mean is desired",{"_17":2911,"_19":12810,"_41":10},"- Axis or axes along which the means are computed (null = all elements)",{"_17":9238,"_19":12759,"_41":10},{"_17":9115,"_19":12813,"_41":10},"- Type to use in computing the mean",[],{"_17":12816,"_31":12817,"_33":12818,"_19":12818,"_36":12819,"_45":8917,"_47":12824},"np.nanmedian","np.nanmedian(a, axis?, keepdims?)","Compute the median along the specified axis, while ignoring NaNs.",[12820,12821,12823],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":12822,"_41":10},"- Axis or axes along which the medians are computed (null = all elements)",{"_17":9238,"_19":12759,"_41":10},[],{"_17":12826,"_31":12827,"_33":12828,"_19":12828,"_36":12829,"_45":8917,"_47":12833},"np.nanmin","np.nanmin(a, axis?, keepdims?)","Return minimum of an array or minimum along an axis, ignoring any NaNs.",[12830,12831,12832],{"_17":664,"_19":12797,"_41":6},{"_17":2911,"_19":12799,"_41":10},{"_17":9238,"_19":12759,"_41":10},[],{"_17":12835,"_31":12836,"_33":12837,"_19":12838,"_36":12839,"_45":8917,"_47":12850},"np.nanpercentile","np.nanpercentile(a, q, axis?, interpolation?, keepdims?)","Compute the q-th percentile of the data along the specified axis,\r","Compute the q-th percentile of the data along the specified axis,\r\nwhile ignoring NaN values.",[12840,12841,12844,12846,12849],{"_17":664,"_19":8908,"_41":6},{"_17":12842,"_19":12843,"_41":6},"q","- Percentile(s) to compute, in range [0, 100]",{"_17":2911,"_19":12845,"_41":10},"- Axis along which to compute (null = all elements)",{"_17":12847,"_19":12848,"_41":10},"interpolation","- Interpolation method ('linear', 'lower', 'higher', 'midpoint', 'nearest')",{"_17":9238,"_19":12759,"_41":10},[],{"_17":12852,"_31":12853,"_33":12854,"_19":12854,"_36":12855,"_45":8917,"_47":12863},"np.nanprod","np.nanprod(a, axis?, keepdims?, _dtype?)","Return the product of array elements over a given axis treating NaNs as one.",[12856,12858,12860,12861],{"_17":664,"_19":12857,"_41":6},"- Array containing numbers whose product is desired",{"_17":2911,"_19":12859,"_41":10},"- Axis or axes along which the product is computed (null = all elements)",{"_17":9238,"_19":12759,"_41":10},{"_17":12862,"_19":10065,"_41":10},"_dtype",[],{"_17":12865,"_31":12866,"_33":12867,"_19":12868,"_36":12869,"_45":8917,"_47":12876},"np.nanquantile","np.nanquantile(a, q, axis?, interpolation?, keepdims?)","Compute the q-th quantile of the data along the specified axis,\r","Compute the q-th quantile of the data along the specified axis,\r\nwhile ignoring NaN values.",[12870,12871,12873,12874,12875],{"_17":664,"_19":8908,"_41":6},{"_17":12842,"_19":12872,"_41":6},"- Quantile(s) to compute, in range [0, 1]",{"_17":2911,"_19":12845,"_41":10},{"_17":12847,"_19":12848,"_41":10},{"_17":9238,"_19":12759,"_41":10},[],{"_17":12878,"_31":12879,"_33":12880,"_19":12880,"_36":12881,"_45":8917,"_47":12890},"np.nanstd","np.nanstd(a, axis?, ddof?, keepdims?, dtype?)","Compute the standard deviation along the specified axis, ignoring NaNs.",[12882,12883,12885,12887,12888],{"_17":664,"_19":12797,"_41":6},{"_17":2911,"_19":12884,"_41":10},"- Axis or axes along which the standard deviation is computed (null = all elements)",{"_17":10258,"_19":12886,"_41":10},"- Delta Degrees of Freedom (divisor is N - ddof)",{"_17":9238,"_19":12759,"_41":10},{"_17":9115,"_19":12889,"_41":10},"- Type to use in computing the standard deviation",[],{"_17":12892,"_31":12893,"_33":12894,"_19":12894,"_36":12895,"_45":8917,"_47":12903},"np.nansum","np.nansum(a, axis?, keepdims?, dtype?)","Return the sum of array elements over a given axis treating NaNs as zero.",[12896,12898,12900,12901],{"_17":664,"_19":12897,"_41":6},"- Array containing numbers whose sum is desired",{"_17":2911,"_19":12899,"_41":10},"- Axis or axes along which the sum is computed (null = all elements)",{"_17":9238,"_19":12759,"_41":10},{"_17":9115,"_19":12902,"_41":10},"- The type of the returned array",[],{"_17":12905,"_31":12906,"_33":12907,"_19":12907,"_36":12908,"_45":8917,"_47":12916},"np.nanvar","np.nanvar(a, axis?, ddof?, keepdims?, dtype?)","Compute the variance along the specified axis, while ignoring NaNs.",[12909,12910,12912,12913,12914],{"_17":664,"_19":12797,"_41":6},{"_17":2911,"_19":12911,"_41":10},"- Axis or axes along which the variance is computed (null = all elements)",{"_17":10258,"_19":12886,"_41":10},{"_17":9238,"_19":12759,"_41":10},{"_17":9115,"_19":12915,"_41":10},"- Type to use in computing the variance",[],{"_17":12918,"_31":12919,"_33":12920,"_19":12920,"_36":12921,"_45":12924,"_47":12925},"np.ndenumerate","np.ndenumerate(arr)","Iterate over array with indices and values.",[12922],{"_17":9283,"_19":12923,"_41":6},"- Array to iterate","Generator<[number[], number]>",[],{"_17":12927,"_31":12928,"_33":12929,"_19":12929,"_36":12930,"_45":12933,"_47":12934},"np.ndindex","np.ndindex(shape)","Generate all index combinations for a shape.",[12931],{"_17":8459,"_19":12932,"_41":6},"- Dimensions","Generator",[],{"_17":12936,"_31":12937,"_33":12938,"_19":12938,"_36":12939,"_45":12941,"_47":12942},"np.nditer","np.nditer(arr)","Iterate over array elements.",[12940],{"_17":9283,"_19":12923,"_41":6},"Generator",[],{"_17":12944,"_31":12945,"_33":12946,"_19":12946,"_36":12947,"_45":9217,"_47":12949},"np.negative","np.negative(x)","Numerical negative, element-wise.",[12948],{"_17":405,"_19":9217,"_41":6},[],{"_17":12951,"_31":12952,"_33":12953,"_19":12953,"_36":12954,"_45":9217,"_47":12959},"np.nextafter","np.nextafter(x1, x2)","Return the next floating-point value after x1 towards x2, element-wise.",[12955,12957],{"_17":9225,"_19":12956,"_41":6},"- Starting values",{"_17":9227,"_19":12958,"_41":6},"- Direction values",[],{"_17":12961,"_31":12962,"_33":12963,"_19":12964,"_36":12965,"_45":9266,"_47":12967},"np.nonzero","np.nonzero(arr)","Find indices of nonzero elements.\r","Find indices of nonzero elements.\r\n\r\nReturns a 2D array of shape (num_nonzero, ndim) where each row\r\ncontains the multi-dimensional index of a nonzero element.",[12966],{"_17":9283,"_19":8908,"_41":6},[],{"_17":12969,"_31":12970,"_33":12971,"_19":12971,"_36":12972,"_45":3784,"_47":12976},"np.norm","np.norm(x, ord?)","Matrix or vector norm.",[12973,12974],{"_17":405,"_19":8908,"_41":6},{"_17":8407,"_19":12975,"_41":10},"- Order of the norm (default: 2 for vectors, 'fro' for matrices)\r\n Vector norms: 1, 2, inf, -inf, or any positive number\r\n Matrix norms: 1, 2, inf, -inf, 'fro', 'nuc'",[],{"_17":12978,"_31":12979,"_33":12980,"_19":12980,"_36":12981,"_45":9217,"_47":12984},"np.not_equal","np.not_equal(x1, x2)","Return (x1 != x2) element-wise.",[12982,12983],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":12986,"_31":12987,"_33":12988,"_19":12988,"_36":12989,"_45":1793,"_47":12993},"np.octalRepr","np.octalRepr(num, width?)","Return the octal representation of a number.",[12990,12991],{"_17":9631,"_19":9632,"_41":6},{"_17":654,"_19":12992,"_41":10},"- Minimum number of octal digits",[],{"_17":12995,"_31":12996,"_33":12997,"_19":12997,"_36":12998,"_45":9266,"_47":13001},"np.ones","np.ones(shape, options?)","Create a new NDArray filled with ones.",[12999,13000],{"_17":8459,"_19":10636,"_41":6},{"_17":454,"_19":9446,"_41":10},[],{"_17":13003,"_31":13004,"_33":13005,"_19":13005,"_36":13006,"_45":9266,"_47":13008},"np.ones_like","np.ones_like(a)","Create an array of ones with the same shape and type as a given array.",[13007],{"_17":664,"_19":10645,"_41":6},[],{"_17":13010,"_31":13011,"_33":13012,"_19":13013,"_36":13014,"_45":13019,"_47":13020},"np.openMemmap","np.openMemmap(file, options?)","Open a memory-mapped file.\r","Open a memory-mapped file.\r\n\r\nConvenience function wrapping Memmap.open().",[13015,13017],{"_17":11011,"_19":13016,"_41":6},"- File path or ArrayBuffer",{"_17":454,"_19":13018,"_41":10},"- Memmap options","Promise",[],{"_17":13022,"_31":13023,"_33":13024,"_19":13024,"_36":13025,"_45":9266,"_47":13028},"np.outer","np.outer(a, b)","Compute the outer product of two vectors.",[13026,13027],{"_17":664,"_19":9217,"_41":6},{"_17":408,"_19":9217,"_41":6},[],{"_17":13030,"_31":13031,"_33":13032,"_19":13033,"_36":13034,"_45":9266,"_47":13042},"np.packbits","np.packbits(a, axis?, bitorder?)","Pack the elements of a binary array into bits in a uint8 array.\r","Pack the elements of a binary array into bits in a uint8 array.\r\n\r\nThe result is padded to full bytes with zeros.",[13035,13037,13039],{"_17":664,"_19":13036,"_41":6},"- Input array of uint8 values (each treated as a single bit: 0 or non-zero)",{"_17":2911,"_19":13038,"_41":10},"- The axis along which to pack. If null, the input is flattened",{"_17":13040,"_19":13041,"_41":10},"bitorder","- Order of bits in the packed representation. 'big' (default) means\r\n the first bit goes into the highest bit of the byte; 'little' means\r\n the first bit goes into the lowest bit of the byte",[],{"_17":13044,"_31":13045,"_33":13046,"_19":13046,"_36":13047,"_45":9266,"_47":13057},"np.pad","np.pad(arr, pad_width, mode?, constant_values?)","Pad an array.",[13048,13049,13052,13054],{"_17":9283,"_19":8908,"_41":6},{"_17":13050,"_19":13051,"_41":6},"pad_width","- Number of values padded to edges of each axis",{"_17":6182,"_19":13053,"_41":10},"- Padding mode (default: 'constant')",{"_17":13055,"_19":13056,"_41":10},"constant_values","- Value to use for constant padding (default: 0)",[],{"_17":13059,"_31":13060,"_33":13061,"_19":13062,"_36":13063,"_45":9266,"_47":13067},"np.partition","np.partition(a, kth, axis?)","Return a partitioned copy of an array.\r","Return a partitioned copy of an array.\r\n\r\nCreates a copy of the array with its elements rearranged so that\r\nelements smaller than the kth element are moved before it and\r\nelements greater are moved after it.",[13064,13065,13066],{"_17":664,"_19":9409,"_41":6},{"_17":9411,"_19":9412,"_41":6},{"_17":2911,"_19":9414,"_41":10},[],{"_17":13069,"_31":13070,"_33":13071,"_19":13071,"_36":13072,"_45":8917,"_47":13079},"np.percentile","np.percentile(a, q, axis?, keepdims?)","Compute the q-th percentile of the data along the specified axis.",[13073,13074,13076,13078],{"_17":664,"_19":8908,"_41":6},{"_17":12842,"_19":13075,"_41":6},"- Percentile to compute, in range [0, 100]",{"_17":2911,"_19":13077,"_41":10},"- Axis along which to compute percentile. null computes percentile of flattened array.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":13081,"_31":13082,"_33":13083,"_19":13083,"_36":13084,"_45":9266,"_47":13089},"np.permutation","np.permutation(x, axis?)","Randomly permute a sequence, or return a permuted range.",[13085,13087],{"_17":405,"_19":13086,"_41":6},"- If an integer, randomly permute arange(x).\r\n If an array, make a copy and shuffle the elements randomly.",{"_17":2911,"_19":13088,"_41":10},"- Axis along which to permute (default 0)",[],{"_17":13091,"_31":13092,"_33":13093,"_19":13094,"_36":13095,"_45":9217,"_47":13099},"np.permute_dims","np.permute_dims(a, axes?)","Permute the dimensions of an array.\r","Permute the dimensions of an array.\r\nThis is an alias for transpose, added in NumPy 2.0.",[13096,13097],{"_17":664,"_19":8908,"_41":6},{"_17":9314,"_19":13098,"_41":10},"- Permutation of axes (optional, reverses all axes if not provided)",[],{"_17":13101,"_31":13102,"_33":13103,"_19":13104,"_36":13105,"_45":9266,"_47":13116},"np.piecewise","np.piecewise(x, condlist, funclist, args)","Evaluate a piecewise-defined function.\r","Evaluate a piecewise-defined function.\r\n\r\nGiven a set of conditions and corresponding functions, evaluate each\r\nfunction on the input only where its condition is true.",[13106,13108,13111,13114],{"_17":405,"_19":13107,"_41":6},"- Input array (domain of the piecewise function)",{"_17":13109,"_19":13110,"_41":6},"condlist","- List of boolean arrays defining conditions",{"_17":13112,"_19":13113,"_41":6},"funclist","- List of functions or constants for each condition.\r\n If funclist has one more element than condlist, the last\r\n element is used as the default (\"otherwise\") case.",{"_17":9140,"_19":13115,"_41":6},"- Additional arguments passed to all functions",[],{"_17":13118,"_31":13119,"_33":13120,"_19":13120,"_36":13121,"_45":9266,"_47":13125},"np.pinv","np.pinv(a, rcond?)","Compute the (Moore-Penrose) pseudo-inverse of a matrix.",[13122,13124],{"_17":664,"_19":13123,"_41":6},"- Matrix to pseudo-invert",{"_17":9882,"_19":9883,"_41":10},[],{"_17":13127,"_31":13128,"_33":13129,"_19":13130,"_36":13131,"_45":375,"_47":13140},"np.place","np.place(arr, mask, vals)","Change elements of an array based on conditional and input values.\r","Change elements of an array based on conditional and input values.\r\nSimilar to putmask, but places values sequentially.",[13132,13134,13137],{"_17":9283,"_19":13133,"_41":6},"- Array to modify (in place)",{"_17":13135,"_19":13136,"_41":6},"mask","- Boolean mask array",{"_17":13138,"_19":13139,"_41":6},"vals","- Values to place (used sequentially, cycled if needed)",[],{"_17":13142,"_31":13143,"_33":13144,"_19":13145,"_36":13146,"_45":374,"_47":13150},"np.poly","np.poly(seq_of_zeros)","Find the coefficients of a polynomial with the given sequence of roots.\r","Find the coefficients of a polynomial with the given sequence of roots.\r\n\r\nThis is a NumPy legacy function. Returns coefficients in descending\r\npowers order (highest power first), which is the opposite of the numpy.polynomial\r\nmodule convention.\r\n\r\nNOTE: This is the legacy numpy.poly function. For the modern API, use\r\npolyfromroots() from the polynomial module which uses ascending powers order.",[13147],{"_17":13148,"_19":13149,"_41":6},"seq_of_zeros","- A sequence of polynomial roots",[],{"_17":13152,"_31":13153,"_33":13154,"_19":13154,"_36":13155,"_45":374,"_47":13159},"np.poly2cheb","np.poly2cheb(pol)","Convert power series coefficients to Chebyshev coefficients.",[13156],{"_17":13157,"_19":13158,"_41":6},"pol","- Power series coefficients",[],{"_17":13161,"_31":13162,"_33":13163,"_19":13163,"_36":13164,"_45":374,"_47":13166},"np.poly2herm","np.poly2herm(pol)","Convert power series to Hermite coefficients.",[13165],{"_17":13157,"_19":374,"_41":6},[],{"_17":13168,"_31":13169,"_33":13170,"_19":13170,"_36":13171,"_45":374,"_47":13173},"np.poly2herme","np.poly2herme(pol)","Convert power series to HermiteE coefficients.",[13172],{"_17":13157,"_19":374,"_41":6},[],{"_17":13175,"_31":13176,"_33":13177,"_19":13177,"_36":13178,"_45":374,"_47":13180},"np.poly2lag","np.poly2lag(pol)","Convert power series to Laguerre coefficients.",[13179],{"_17":13157,"_19":374,"_41":6},[],{"_17":13182,"_31":13183,"_33":13184,"_19":13184,"_36":13185,"_45":374,"_47":13187},"np.poly2leg","np.poly2leg(pol)","Convert power series to Legendre coefficients.",[13186],{"_17":13157,"_19":374,"_41":6},[],{"_17":13189,"_31":13190,"_33":13191,"_19":13191,"_36":13192,"_45":374,"_47":13197},"np.polyadd","np.polyadd(c1, c2)","Add two coefficient arrays (power series).",[13193,13195],{"_17":726,"_19":13194,"_41":6},"- First coefficient array",{"_17":729,"_19":13196,"_41":6},"- Second coefficient array",[],{"_17":13199,"_31":13200,"_33":13201,"_19":13201,"_36":13202,"_45":506,"_47":13204},"np.polycompanion","np.polycompanion(c)","Generate companion matrix.",[13203],{"_17":713,"_19":9850,"_41":6},[],{"_17":13206,"_31":13207,"_33":13208,"_19":13208,"_36":13209,"_45":374,"_47":13212},"np.polyder","np.polyder(c, m?)","Polynomial derivative.",[13210,13211],{"_17":713,"_19":9850,"_41":6},{"_17":630,"_19":9859,"_41":10},[],{"_17":13214,"_31":13215,"_33":13216,"_19":13216,"_36":13217,"_45":9868,"_47":13222},"np.polydiv","np.polydiv(c1, c2)","Divide two coefficient arrays (power series).",[13218,13220],{"_17":726,"_19":13219,"_41":6},"- Dividend coefficient array",{"_17":729,"_19":13221,"_41":6},"- Divisor coefficient array",[],{"_17":13224,"_31":13225,"_33":13226,"_19":13226,"_36":13227,"_45":9889,"_47":13234},"np.polyfit","np.polyfit(x, y, deg, rcond?, full?, w?)","Least squares polynomial fit.",[13228,13229,13230,13231,13232,13233],{"_17":405,"_19":9876,"_41":6},{"_17":2467,"_19":9878,"_41":6},{"_17":6397,"_19":9880,"_41":6},{"_17":9882,"_19":9883,"_41":10},{"_17":7871,"_19":9885,"_41":10},{"_17":9887,"_19":9888,"_41":10},[],{"_17":13236,"_31":13237,"_33":13238,"_19":13238,"_36":13239,"_45":374,"_47":13241},"np.polyfromroots","np.polyfromroots(roots)","Construct polynomial from roots.",[13240],{"_17":6420,"_19":9897,"_41":6},[],{"_17":13243,"_31":13244,"_33":13245,"_19":13245,"_36":13246,"_45":374,"_47":13251},"np.polyint","np.polyint(c, m?, k?, lbnd?)","Polynomial integral.",[13247,13248,13249,13250],{"_17":713,"_19":9850,"_41":6},{"_17":630,"_19":9906,"_41":10},{"_17":4686,"_19":9908,"_41":10},{"_17":9910,"_19":9911,"_41":10},[],{"_17":13253,"_31":13254,"_33":13255,"_19":13256,"_36":13257,"_45":374,"_47":13260},"np.polymul","np.polymul(c1, c2)","Multiply two coefficient arrays (power series).\r","Multiply two coefficient arrays (power series).\r\nUses convolution.",[13258,13259],{"_17":726,"_19":13194,"_41":6},{"_17":729,"_19":13196,"_41":6},[],{"_17":13262,"_31":13263,"_33":13264,"_19":13264,"_36":13265,"_45":374,"_47":13271},"np.polypow","np.polypow(c, pow, maxpower?)","Raise polynomial to a non-negative integer power.",[13266,13267,13269],{"_17":713,"_19":9850,"_41":6},{"_17":9943,"_19":13268,"_41":6},"- Non-negative integer power",{"_17":9945,"_19":13270,"_41":10},"- Maximum allowed power (default: 100)",[],{"_17":13273,"_31":13274,"_33":13275,"_19":13275,"_36":13276,"_45":9926,"_47":13278},"np.polyroots","np.polyroots(c)","Find polynomial roots.",[13277],{"_17":713,"_19":9850,"_41":6},[],{"_17":13280,"_31":13281,"_33":13282,"_19":13282,"_36":13283,"_45":374,"_47":13286},"np.polysub","np.polysub(c1, c2)","Subtract two coefficient arrays (power series).",[13284,13285],{"_17":726,"_19":13194,"_41":6},{"_17":729,"_19":13196,"_41":6},[],{"_17":13288,"_31":13289,"_33":13290,"_19":13290,"_36":13291,"_45":1387,"_47":13295},"np.polyval","np.polyval(x, c)","Evaluate polynomial at x using Horner's method.",[13292,13293],{"_17":405,"_19":9968,"_41":6},{"_17":713,"_19":13294,"_41":6},"- Coefficient array [c0, c1, c2, ...] for c0 + c1*x + c2*x^2 + ...",[],{"_17":13297,"_31":13298,"_33":13299,"_19":13299,"_36":13300,"_45":374,"_47":13304},"np.polyval2d","np.polyval2d(x, y, c)","Evaluate 2D polynomial on x-y pairs.",[13301,13302,13303],{"_17":405,"_19":9978,"_41":6},{"_17":2467,"_19":9980,"_41":6},{"_17":713,"_19":9982,"_41":6},[],{"_17":13306,"_31":13307,"_33":13308,"_19":13308,"_36":13309,"_45":374,"_47":13316},"np.polyval3d","np.polyval3d(x, y, z, c)","Evaluate 3D polynomial on x-y-z triples.",[13310,13311,13312,13314],{"_17":405,"_19":9978,"_41":6},{"_17":2467,"_19":9980,"_41":6},{"_17":6241,"_19":13313,"_41":6},"- z coordinates",{"_17":713,"_19":13315,"_41":6},"- 3D coefficient array",[],{"_17":13318,"_31":13319,"_33":13320,"_19":13320,"_36":13321,"_45":506,"_47":13324},"np.polyvander","np.polyvander(x, deg)","Generate Vandermonde matrix.",[13322,13323],{"_17":405,"_19":9990,"_41":6},{"_17":6397,"_19":9992,"_41":6},[],{"_17":13326,"_31":13327,"_33":13328,"_19":13328,"_36":13329,"_45":506,"_47":13336},"np.polyvander2d","np.polyvander2d(x, y, deg)","Generate 2D Vandermonde matrix.",[13330,13332,13334],{"_17":405,"_19":13331,"_41":6},"- x sample points",{"_17":2467,"_19":13333,"_41":6},"- y sample points",{"_17":6397,"_19":13335,"_41":6},"- [degree in x, degree in y]",[],{"_17":13338,"_31":13339,"_33":13340,"_19":13340,"_36":13341,"_45":9217,"_47":13343},"np.positive","np.positive(x)","Numerical positive (returns a copy).",[13342],{"_17":405,"_19":9217,"_41":6},[],{"_17":13345,"_31":13346,"_33":13347,"_19":13347,"_36":13348,"_45":9217,"_47":13351},"np.power","np.power(x1, x2)","First array elements raised to powers from second array, element-wise.",[13349,13350],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":13353,"_31":13354,"_33":13355,"_19":13355,"_36":13356,"_45":8917,"_47":13362},"np.prod","np.prod(a, axis?, keepdims?, dtype?)","Return the product of array elements over a given axis.",[13357,13358,13360,13361],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":13359,"_41":10},"- Axis along which to compute product. null computes product of all elements.",{"_17":9238,"_19":9391,"_41":10},{"_17":9115,"_19":12648,"_41":10},[],{"_17":13364,"_31":13365,"_33":13366,"_19":13367,"_36":13368,"_45":10065,"_47":13375},"np.promoteTypes","np.promoteTypes(dtype1, dtype2)","Get result type when combining two dtypes.\r","Get result type when combining two dtypes.\r\nFollows NumPy promotion rules.",[13369,13372],{"_17":13370,"_19":13371,"_41":6},"dtype1","- First dtype",{"_17":13373,"_19":13374,"_41":6},"dtype2","- Second dtype",[],{"_17":13377,"_31":13378,"_33":13379,"_19":13380,"_36":13381,"_45":8917,"_47":13386},"np.ptp","np.ptp(a, axis?, keepdims?)","Range of values (maximum - minimum) along an axis.\r","Range of values (maximum - minimum) along an axis.\r\n\r\nThe name of the function comes from the acronym for 'peak to peak'.",[13382,13383,13385],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":13384,"_41":10},"- Axis along which to find the peak-to-peak value. null computes ptp of flattened array.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":13388,"_31":13389,"_33":13390,"_19":13390,"_36":13391,"_45":375,"_47":13399},"np.put","np.put(arr, indices, values, mode?)","Put values into an array at specified flat indices.",[13392,13394,13396,13398],{"_17":9283,"_19":13393,"_41":6},"- Target array (modified in place)",{"_17":9784,"_19":13395,"_41":6},"- Array of flat indices",{"_17":560,"_19":13397,"_41":6},"- Values to put (broadcast if smaller)",{"_17":6182,"_19":10031,"_41":10},[],{"_17":13401,"_31":13402,"_33":13403,"_19":13403,"_36":13404,"_45":375,"_47":13413},"np.put_along_axis","np.put_along_axis(arr, indicesArr, values, axis)","Put values into the destination array by matching 1d index and data slices.",[13405,13407,13409,13411],{"_17":9283,"_19":13406,"_41":6},"- Destination array (modified in place)",{"_17":13408,"_19":9217,"_41":6},"indicesArr",{"_17":560,"_19":13410,"_41":6},"- Values to put",{"_17":2911,"_19":13412,"_41":6},"- The axis to put along",[],{"_17":13415,"_31":13416,"_33":13129,"_19":13417,"_36":13418,"_45":375,"_47":13423},"np.putmask","np.putmask(arr, mask, values)","Change elements of an array based on conditional and input values.\r\nSets a.flat[n] = values[n % len(values)] for each n where mask.flat[n]==True.",[13419,13420,13421],{"_17":9283,"_19":13133,"_41":6},{"_17":13135,"_19":13136,"_41":6},{"_17":560,"_19":13422,"_41":6},"- Values to put (cycled if smaller than number of True in mask)",[],{"_17":13425,"_31":13426,"_33":13427,"_19":13428,"_36":13429,"_45":13432,"_47":13433},"np.qr","np.qr(a)","QR decomposition.\r","QR decomposition.\r\n\r\nFactor the matrix a as qr, where q is orthonormal and r is upper-triangular.",[13430],{"_17":664,"_19":13431,"_41":6},"- Matrix to factor (M x N)","Promise",[],{"_17":13435,"_31":13436,"_33":13437,"_19":13437,"_36":13438,"_45":8917,"_47":13445},"np.quantile","np.quantile(a, q, axis?, keepdims?)","Compute the q-th quantile of the data along the specified axis.",[13439,13440,13442,13444],{"_17":664,"_19":8908,"_41":6},{"_17":12842,"_19":13441,"_41":6},"- Quantile to compute, in range [0, 1]",{"_17":2911,"_19":13443,"_41":10},"- Axis along which to compute quantile. null computes quantile of flattened array.",{"_17":9238,"_19":9391,"_41":10},[],{"_17":13447,"_31":13448,"_33":13449,"_19":13449,"_36":13450,"_45":9217,"_47":13452},"np.radians","np.radians(x)","Convert angles from degrees to radians.",[13451],{"_17":405,"_19":9217,"_41":6},[],{"_17":13454,"_31":13455,"_33":13456,"_19":13457,"_36":13458,"_45":13460,"_47":13461},"np.rand","np.rand(shape)","Random values in a given shape.\r","Random values in a given shape.\r\n\r\nCreate an array of the given shape and populate it with random samples\r\nfrom a uniform distribution over [0, 1).",[13459],{"_17":8459,"_19":374,"_41":6},"NDArray | number",[],{"_17":13463,"_31":13464,"_33":13465,"_19":13465,"_36":13466,"_45":13460,"_47":13475},"np.randint","np.randint(low, high?, size?)","Return random integers from low (inclusive) to high (exclusive).",[13467,13470,13473],{"_17":13468,"_19":13469,"_41":6},"low","- Lower bound",{"_17":13471,"_19":13472,"_41":10},"high","- Upper bound (optional)",{"_17":1865,"_19":13474,"_41":10},"- Output shape",[],{"_17":13477,"_31":13478,"_33":13479,"_19":13479,"_36":13480,"_45":13460,"_47":13482},"np.randn","np.randn(args)","Draw samples from a standard normal distribution.",[13481],{"_17":9140,"_19":374,"_41":6},[],{"_17":13484,"_31":13485,"_33":13486,"_19":13486,"_36":13487,"_45":13460,"_47":13489},"np.random","np.random(size?)","Return random floats in the half-open interval [0.0, 1.0).",[13488],{"_17":1865,"_19":13474,"_41":10},[],{"_17":13491,"_31":13492,"_33":13465,"_19":13465,"_36":13493,"_45":13460,"_47":13499},"np.random_integers","np.random_integers(low, high?, size?)",[13494,13496,13498],{"_17":13468,"_19":13495,"_41":6},"- Lowest integer (unless high is None, then range is [0, low))",{"_17":13471,"_19":13497,"_41":10},"- Upper bound (exclusive). If None, range is [0, low)",{"_17":1865,"_19":13474,"_41":10},[],{"_17":13501,"_31":13502,"_33":13486,"_19":13486,"_36":13503,"_45":13460,"_47":13505},"np.random_sample","np.random_sample(size?)",[13504],{"_17":1865,"_19":13474,"_41":10},[],{"_17":13507,"_31":13508,"_33":13486,"_19":13486,"_36":13509,"_45":13460,"_47":13511},"np.ranf","np.ranf(size?)",[13510],{"_17":1865,"_19":13474,"_41":10},[],{"_17":13513,"_31":13514,"_33":13515,"_19":13515,"_36":13516,"_45":9217,"_47":13518},"np.ravel","np.ravel(a)","Return a contiguous flattened array.",[13517],{"_17":664,"_19":8908,"_41":6},[],{"_17":13520,"_31":13521,"_33":13522,"_19":13522,"_36":13523,"_45":9926,"_47":13529},"np.ravelMultiIndex","np.ravelMultiIndex(coords, shape)","Convert a tuple of coordinate arrays into flat indices.",[13524,13527],{"_17":13525,"_19":13526,"_41":6},"coords","- Array of coordinate arrays, one per dimension",{"_17":8459,"_19":13528,"_41":6},"- Shape of the array",[],{"_17":13531,"_31":13532,"_33":13533,"_19":13534,"_36":13535,"_45":9217,"_47":13537},"np.real","np.real(val)","Return the real part of the complex argument.\r","Return the real part of the complex argument.\r\n\r\nFor non-complex arrays, returns a copy of the input.",[13536],{"_17":8984,"_19":8908,"_41":6},[],{"_17":13539,"_31":13540,"_33":13541,"_19":13542,"_36":13543,"_45":9266,"_47":13547},"np.real_if_close","np.real_if_close(a, tol?)","If input is complex with all imaginary parts close to zero, return real parts.\r","If input is complex with all imaginary parts close to zero, return real parts.\r\n\r\n\"Close to zero\" is defined as `tol` times the machine epsilon of the type.",[13544,13545],{"_17":664,"_19":8908,"_41":6},{"_17":470,"_19":13546,"_41":10},"- Tolerance in machine epsilons for complex128, or absolute\r\n tolerance if tol < 1. Default is 100.",[],{"_17":13549,"_31":13550,"_33":13551,"_19":13551,"_36":13552,"_45":13557,"_47":13558},"np.recArray","np.recArray(data?, options?)","Create a record array.",[13553,13555],{"_17":1215,"_19":13554,"_41":10},"- Input data (list of tuples, existing array, or null for empty)",{"_17":454,"_19":13556,"_41":10},"- Creation options","Promise",[],{"_17":13560,"_31":13561,"_33":13562,"_19":13562,"_36":13563,"_45":13557,"_47":13568},"np.recFromarrays","np.recFromarrays(arrayList, options?)","Create a record array from a list of arrays (columns).",[13564,13567],{"_17":13565,"_19":13566,"_41":6},"arrayList","- List of arrays, one per field",{"_17":454,"_19":13556,"_41":10},[],{"_17":13570,"_31":13571,"_33":13572,"_19":13572,"_36":13573,"_45":13557,"_47":13582},"np.recFromfile","np.recFromfile(file, dtype, shape?, offset?)","Create a record array from a file.",[13574,13576,13578,13580],{"_17":11011,"_19":13575,"_41":6},"- File path (Node.js) or File object (browser)",{"_17":9115,"_19":13577,"_41":6},"- Structured dtype",{"_17":8459,"_19":13579,"_41":10},"- Shape of output array",{"_17":3056,"_19":13581,"_41":10},"- Byte offset into file",[],{"_17":13584,"_31":13585,"_33":13586,"_19":13586,"_36":13587,"_45":13557,"_47":13592},"np.recFromrecords","np.recFromrecords(recList, options?)","Create a record array from a list of records (rows).",[13588,13591],{"_17":13589,"_19":13590,"_41":6},"recList","- List of records (tuples or arrays)",{"_17":454,"_19":13556,"_41":10},[],{"_17":13594,"_31":13595,"_33":13596,"_19":13596,"_36":13597,"_45":13557,"_47":13605},"np.recFromstring","np.recFromstring(datastring, dtype, shape?, offset?)","Create a record array from a binary string/buffer.",[13598,13601,13602,13603],{"_17":13599,"_19":13600,"_41":6},"datastring","- Binary data (ArrayBuffer or typed array)",{"_17":9115,"_19":13577,"_41":6},{"_17":8459,"_19":13579,"_41":10},{"_17":3056,"_19":13604,"_41":10},"- Byte offset into data",[],{"_17":13607,"_31":13608,"_33":13609,"_19":13609,"_36":13610,"_45":9217,"_47":13612},"np.reciprocal","np.reciprocal(x)","Return the reciprocal of the argument, element-wise.",[13611],{"_17":405,"_19":9217,"_41":6},[],{"_17":13614,"_31":13615,"_33":13616,"_19":13616,"_36":13617,"_45":9217,"_47":13620},"np.remainder","np.remainder(x1, x2)","Return element-wise remainder of division (Python-style modulo).",[13618,13619],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":13622,"_31":13623,"_33":13624,"_19":13624,"_36":13625,"_45":9266,"_47":13632},"np.repeat","np.repeat(arr, repeats, axis?)","Repeat elements of an array.",[13626,13627,13630],{"_17":9283,"_19":8908,"_41":6},{"_17":13628,"_19":13629,"_41":6},"repeats","- Number of repetitions for each element",{"_17":2911,"_19":13631,"_41":10},"- Axis along which to repeat (default: flatten first)",[],{"_17":13634,"_31":13635,"_33":13636,"_19":13636,"_36":13637,"_45":46,"_47":13638},"np.resetPrintoptions","np.resetPrintoptions()","Reset print options to defaults.",[],[],{"_17":13640,"_31":13641,"_33":13642,"_19":13642,"_36":13643,"_45":9217,"_47":13649},"np.reshape","np.reshape(a, newshape)","Gives a new shape to an array without changing its data.",[13644,13646],{"_17":664,"_19":13645,"_41":6},"- Array to be reshaped",{"_17":13647,"_19":13648,"_41":6},"newshape","- New shape (can include one -1 for auto-calculation)",[],{"_17":13651,"_31":13652,"_33":13653,"_19":13654,"_36":13655,"_45":9266,"_47":13660},"np.resize","np.resize(arr, new_shape)","Return a new array with the specified shape.\r","Return a new array with the specified shape.\r\nIf the new array is larger than the original, it is filled with repeated copies.",[13656,13657],{"_17":9283,"_19":8908,"_41":6},{"_17":13658,"_19":13659,"_41":6},"new_shape","- Shape of the resized array",[],{"_17":13662,"_31":13663,"_33":13664,"_19":13664,"_36":13665,"_45":10065,"_47":13668},"np.result_type","np.result_type(dtypes)","Return the type that results from applying the type promotion rules to the arguments.",[13666],{"_17":10063,"_19":13667,"_41":6},"- Input dtypes",[],{"_17":13670,"_31":13671,"_33":13672,"_19":13673,"_36":13674,"_45":9217,"_47":13680},"np.rfft","np.rfft(a, n?, axis?, norm?)","Compute the one-dimensional discrete Fourier Transform for real input.\r","Compute the one-dimensional discrete Fourier Transform for real input.\r\n\r\nThis function computes the one-dimensional n-point DFT of a real-valued\r\narray. The output is Hermitian-symmetric, so only the positive frequencies\r\nare returned: output has shape (..., n//2 + 1).",[13675,13676,13678,13679],{"_17":664,"_19":11618,"_41":6},{"_17":1206,"_19":13677,"_41":10},"- Number of points in the FFT. If n < a.shape[axis], input is truncated.\r\n If n > a.shape[axis], input is zero-padded.",{"_17":2911,"_19":11460,"_41":10},{"_17":3633,"_19":10777,"_41":10},[],{"_17":13682,"_31":13683,"_33":13684,"_19":13684,"_36":13685,"_45":9217,"_47":13690},"np.rfft2","np.rfft2(a, s?, axes?, norm?)","Compute the 2-dimensional FFT of a real array.",[13686,13687,13688,13689],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11588,"_41":10},{"_17":9314,"_19":11162,"_41":10},{"_17":3633,"_19":11591,"_41":10},[],{"_17":13692,"_31":13693,"_33":13694,"_19":13695,"_36":13696,"_45":9266,"_47":13699},"np.rfftfreq","np.rfftfreq(n, d?)","Return the Discrete Fourier Transform sample frequencies for rfft.\r","Return the Discrete Fourier Transform sample frequencies for rfft.\r\n\r\nReturns an array of length n//2 + 1 with the positive sample frequencies:\r\nf = [0, 1, ..., n//2] / (d*n)",[13697,13698],{"_17":1206,"_19":10786,"_41":6},{"_17":5512,"_19":10788,"_41":10},[],{"_17":13701,"_31":13702,"_33":13703,"_19":13704,"_36":13705,"_45":9217,"_47":13710},"np.rfftn","np.rfftn(a, s?, axes?, norm?)","Compute the N-dimensional discrete Fourier Transform for real input.\r","Compute the N-dimensional discrete Fourier Transform for real input.\r\n\r\nThe output has Hermitian symmetry along the last transformed axis.\r\nOutput shape along the last axis: s[-1]//2 + 1",[13706,13707,13708,13709],{"_17":664,"_19":9217,"_41":6},{"_17":771,"_19":11312,"_41":10},{"_17":9314,"_19":11312,"_41":10},{"_17":3633,"_19":11591,"_41":10},[],{"_17":13712,"_31":13713,"_33":13714,"_19":13714,"_36":13715,"_45":9217,"_47":13724},"np.rfind","np.rfind(a, sub, start?, end?)","For each element, return the highest index where substring is found.",[13716,13717,13720,13722],{"_17":664,"_19":10654,"_41":6},{"_17":13718,"_19":13719,"_41":6},"sub","- Substring to search for",{"_17":9323,"_19":13721,"_41":10},"- Start position for search (default 0)",{"_17":9326,"_19":13723,"_41":10},"- End position for search (default string length)",[],{"_17":13726,"_31":13727,"_33":13728,"_19":13728,"_36":13729,"_45":9217,"_47":13732},"np.right_shift","np.right_shift(x1, x2)","Shift the bits of an integer to the right.",[13730,13731],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":13734,"_31":13735,"_33":13736,"_19":13736,"_36":13737,"_45":9217,"_47":13742},"np.rindex","np.rindex(a, sub, start?, end?)","Like rfind, but raises ValueError if substring is not found.",[13738,13739,13740,13741],{"_17":664,"_19":10654,"_41":6},{"_17":13718,"_19":13719,"_41":6},{"_17":9323,"_19":13721,"_41":10},{"_17":9326,"_19":13723,"_41":10},[],{"_17":13744,"_31":13745,"_33":13746,"_19":13746,"_36":13747,"_45":9217,"_47":13749},"np.rint","np.rint(x)","Round elements of the array to the nearest integer.",[13748],{"_17":405,"_19":9217,"_41":6},[],{"_17":13751,"_31":13752,"_33":13753,"_19":13753,"_36":13754,"_45":9217,"_47":13758},"np.rjust","np.rjust(a, width, fillchar?)","Return element-wise right-justified string of given width.",[13755,13756,13757],{"_17":664,"_19":10654,"_41":6},{"_17":654,"_19":12357,"_41":6},{"_17":12359,"_19":12360,"_41":10},[],{"_17":13760,"_31":13761,"_33":13762,"_19":13762,"_36":13763,"_45":9217,"_47":13770},"np.roll","np.roll(arr, shift, axis?)","Roll array elements along a given axis.",[13764,13765,13768],{"_17":9283,"_19":8908,"_41":6},{"_17":13766,"_19":13767,"_41":6},"shift","- Number of places to shift elements",{"_17":2911,"_19":13769,"_41":10},"- Axis along which to roll (default: flatten, roll, reshape)",[],{"_17":13772,"_31":13773,"_33":13774,"_19":13774,"_36":13775,"_45":9217,"_47":13781},"np.rollaxis","np.rollaxis(a, axis, start?)","Roll the specified axis backwards, until it lies in a given position.",[13776,13777,13779],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":13778,"_41":6},"- The axis to be rolled",{"_17":9323,"_19":13780,"_41":10},"- Start position (default: 0)",[],{"_17":13783,"_31":13784,"_33":13785,"_19":13786,"_36":13787,"_45":9926,"_47":13790},"np.roots","np.roots(p)","Find the roots of a polynomial with coefficients given in c.\r","Find the roots of a polynomial with coefficients given in c.\r\n\r\nThis is a NumPy legacy function. The coefficients are given in descending\r\npowers order (highest power first), which is the opposite of the numpy.polynomial\r\nmodule convention.\r\n\r\nNOTE: This is the legacy numpy.roots function. For the modern API, use\r\npolyroots() from the polynomial module which uses ascending powers order.",[13788],{"_17":5212,"_19":13789,"_41":6},"- Coefficient array in descending powers order [c_n, c_{n-1}, ..., c_1, c_0]",[],{"_17":13792,"_31":13793,"_33":13794,"_19":13794,"_36":13795,"_45":9217,"_47":13802},"np.rot90","np.rot90(arr, k?, axes?)","Rotate an array by 90 degrees in the plane specified by axes.",[13796,13798,13800],{"_17":9283,"_19":13797,"_41":6},"- Array with at least 2 dimensions",{"_17":4686,"_19":13799,"_41":10},"- Number of times to rotate by 90 degrees (default: 1)",{"_17":9314,"_19":13801,"_41":10},"- The two axes that define the plane of rotation (default: [0, 1])",[],{"_17":13804,"_31":13805,"_33":13806,"_19":13806,"_36":13807,"_45":9217,"_47":13809},"np.round","np.round(x)","Round to nearest even value (banker's rounding).",[13808],{"_17":405,"_19":9217,"_41":6},[],{"_17":13811,"_31":13812,"_33":13813,"_19":13813,"_36":13814,"_45":9217,"_47":13818},"np.rpartition","np.rpartition(a, sep)","Partition each element around the last occurrence of sep.",[13815,13816],{"_17":664,"_19":10654,"_41":6},{"_17":11081,"_19":13817,"_41":6},"- Separator string",[],{"_17":13820,"_31":13821,"_33":13822,"_19":13822,"_36":13823,"_45":9217,"_47":13826},"np.rstrip","np.rstrip(a, chars?)","Return element-wise copy with trailing characters removed.",[13824,13825],{"_17":664,"_19":10654,"_41":6},{"_17":12503,"_19":12504,"_41":10},[],{"_17":13828,"_31":13829,"_33":13486,"_19":13486,"_36":13830,"_45":13460,"_47":13832},"np.sample","np.sample(size?)",[13831],{"_17":1865,"_19":13474,"_41":10},[],{"_17":13834,"_31":13835,"_33":13836,"_19":13836,"_36":13837,"_45":13844,"_47":13845},"np.save","np.save(file, arr, _options?)","Save an array to a binary file in NPY format.",[13838,13840,13842],{"_17":11011,"_19":13839,"_41":6},"- File path (Node.js), FileSystemFileHandle (browser), or null to return ArrayBuffer",{"_17":9283,"_19":13841,"_41":6},"- Array to save",{"_17":8334,"_19":13843,"_41":10},"SaveOptions","Promise",[],{"_17":13847,"_31":13848,"_33":13849,"_19":13849,"_36":13850,"_45":375,"_47":13857},"np.savetxt","np.savetxt(file, arr, options?)","Save an array to a text file.",[13851,13853,13855],{"_17":11011,"_19":13852,"_41":6},"- Output file (path or FileSystemFileHandle)",{"_17":9283,"_19":13854,"_41":6},"- 1D or 2D array to save",{"_17":454,"_19":13856,"_41":10},"- Formatting options",[],{"_17":13859,"_31":13860,"_33":13861,"_19":13862,"_36":13863,"_45":13844,"_47":13867},"np.savez","np.savez(file, args)","Save multiple arrays to a single file in uncompressed `.npz` format.\r","Save multiple arrays to a single file in uncompressed `.npz` format.\r\n\r\nThe `.npz` file format is a ZIP archive containing multiple `.npy` files,\r\none for each array. Arrays are named 'arr_0', 'arr_1', etc. for positional\r\narguments, or by their keyword argument names.",[13864,13865],{"_17":11011,"_19":13839,"_41":6},{"_17":9140,"_19":13866,"_41":6},"- Arrays to save (positional) or object mapping names to arrays",[],{"_17":13869,"_31":13870,"_33":13871,"_19":13872,"_36":13873,"_45":13844,"_47":13876},"np.savez_compressed","np.savez_compressed(file, args)","Save multiple arrays to a single file in compressed `.npz` format.\r","Save multiple arrays to a single file in compressed `.npz` format.\r\n\r\nSimilar to `savez`, but each array is individually compressed using DEFLATE.\r\nThis can significantly reduce file size for sparse or repetitive data.",[13874,13875],{"_17":11011,"_19":13839,"_41":6},{"_17":9140,"_19":13866,"_41":6},[],{"_17":13878,"_31":13879,"_33":13880,"_19":13880,"_36":13881,"_45":8917,"_47":13887},"np.searchsorted","np.searchsorted(a, v, side?)","Find indices where elements should be inserted to maintain order.",[13882,13884,13885],{"_17":664,"_19":13883,"_41":6},"- Sorted 1D input array",{"_17":676,"_19":11682,"_41":6},{"_17":6022,"_19":13886,"_41":10},"- 'left' or 'right' side to insert",[],{"_17":13889,"_31":13890,"_33":13891,"_19":13891,"_36":13892,"_45":46,"_47":13895},"np.seed","np.seed(seed)","Seed the default random generator.",[13893],{"_17":10347,"_19":13894,"_41":6},"- Seed value",[],{"_17":13897,"_31":13898,"_33":13899,"_19":13899,"_36":13900,"_45":9266,"_47":13909},"np.select","np.select(condlist, choicelist, defaultValue?)","Return an array drawn from elements in choicelist, depending on conditions.",[13901,13903,13906],{"_17":13109,"_19":13902,"_41":6},"- List of boolean arrays (conditions)",{"_17":13904,"_19":13905,"_41":6},"choicelist","- List of arrays from which output elements are taken",{"_17":13907,"_19":13908,"_41":10},"defaultValue","- Value used when all conditions are False (default: 0)",[],{"_17":13911,"_31":13912,"_33":13913,"_19":13914,"_36":13915,"_45":9266,"_47":13919},"np.setdiff1d","np.setdiff1d(ar1, ar2, options?)","Find the set difference of two arrays.\r","Find the set difference of two arrays.\r\n\r\nReturns the sorted unique values in ar1 that are not in ar2.",[13916,13917,13918],{"_17":11637,"_19":11713,"_41":6},{"_17":11640,"_19":11715,"_41":6},{"_17":454,"_19":8788,"_41":10},[],{"_17":13921,"_31":13922,"_33":13923,"_19":13923,"_36":13924,"_45":46,"_47":13927},"np.setPrintoptions","np.setPrintoptions(options)","Set printing options globally.",[13925],{"_17":454,"_19":13926,"_41":6},"- New print options (partial, merged with current)",[],{"_17":13929,"_31":13930,"_33":13931,"_19":13932,"_36":13933,"_45":9266,"_47":13937},"np.setxor1d","np.setxor1d(ar1, ar2, options?)","Find the set exclusive-or of two arrays.\r","Find the set exclusive-or of two arrays.\r\n\r\nReturns the sorted unique values in exactly one (not both) of the input arrays.",[13934,13935,13936],{"_17":11637,"_19":11713,"_41":6},{"_17":11640,"_19":11715,"_41":6},{"_17":454,"_19":8788,"_41":10},[],{"_17":13939,"_31":13940,"_33":13941,"_19":13941,"_36":13942,"_45":2194,"_47":13945},"np.shapesAreBroadcastable","np.shapesAreBroadcastable(shape1, shape2)","Check if two shapes are broadcast-compatible.",[13943,13944],{"_17":9750,"_19":9751,"_41":6},{"_17":9753,"_19":9754,"_41":6},[],{"_17":13947,"_31":13948,"_33":13949,"_19":13949,"_36":13950,"_45":375,"_47":13955},"np.shuffle","np.shuffle(x, axis?)","Randomly shuffle elements of an array in-place along an axis.",[13951,13953],{"_17":405,"_19":13952,"_41":6},"- Array to shuffle (modified in-place)",{"_17":2911,"_19":13954,"_41":10},"- Axis along which to shuffle (default 0)",[],{"_17":13957,"_31":13958,"_33":13959,"_19":13959,"_36":13960,"_45":9217,"_47":13962},"np.sign","np.sign(x)","Returns element-wise sign: -1, 0, or +1.",[13961],{"_17":405,"_19":9217,"_41":6},[],{"_17":13964,"_31":13965,"_33":13966,"_19":13966,"_36":13967,"_45":9217,"_47":13969},"np.signbit","np.signbit(x)","Return element-wise True where signbit is set (less than zero).",[13968],{"_17":405,"_19":9217,"_41":6},[],{"_17":13971,"_31":13972,"_33":13973,"_19":13973,"_36":13974,"_45":9217,"_47":13976},"np.sin","np.sin(x)","Trigonometric sine, element-wise.",[13975],{"_17":405,"_19":9217,"_41":6},[],{"_17":13978,"_31":13979,"_33":13980,"_19":13981,"_36":13982,"_45":9217,"_47":13984},"np.sinc","np.sinc(x)","Return the normalized sinc function: sin(pi*x) / (pi*x).\r","Return the normalized sinc function: sin(pi*x) / (pi*x).\r\nThe sinc function is used in various signal processing applications.",[13983],{"_17":405,"_19":8908,"_41":6},[],{"_17":13986,"_31":13987,"_33":13988,"_19":13988,"_36":13989,"_45":9217,"_47":13991},"np.sinh","np.sinh(x)","Hyperbolic sine, element-wise.",[13990],{"_17":405,"_19":9217,"_41":6},[],{"_17":13993,"_31":13994,"_33":13995,"_19":13995,"_36":13996,"_45":14003,"_47":14004},"np.slice","np.slice(start?, stop?, step?)","Factory function for creating slices with cleaner syntax.",[13997,13999,14001],{"_17":9323,"_19":13998,"_41":10},"- Start index (null for default)",{"_17":11136,"_19":14000,"_41":10},"- Stop index (null for default)",{"_17":9329,"_19":14002,"_41":10},"- Step size (null for 1)","Slice",[],{"_17":14006,"_31":14007,"_33":14008,"_19":14009,"_36":14010,"_45":14012,"_47":14013},"np.slogdet","np.slogdet(a)","Compute sign and (natural) logarithm of the determinant.\r","Compute sign and (natural) logarithm of the determinant.\r\nMore numerically stable than computing det directly for large matrices.",[14011],{"_17":664,"_19":9217,"_41":6},"Promise",[],{"_17":14015,"_31":14016,"_33":14017,"_19":14017,"_36":14018,"_45":9266,"_47":14023},"np.solve","np.solve(a, b)","Solve a linear matrix equation: a @ x = b",[14019,14021],{"_17":664,"_19":14020,"_41":6},"- Coefficient matrix (N x N)",{"_17":408,"_19":14022,"_41":6},"- Ordinate values (N,) or (N x NRHS)",[],{"_17":14025,"_31":14026,"_33":14027,"_19":14027,"_36":14028,"_45":9266,"_47":14033},"np.sort","np.sort(a, axis?, kind?)","Return a sorted copy of an array.",[14029,14030,14031],{"_17":664,"_19":9422,"_41":6},{"_17":2911,"_19":9424,"_41":10},{"_17":9426,"_19":14032,"_41":10},"- Sorting algorithm: 'quicksort', 'mergesort', 'heapsort', or 'stable'",[],{"_17":14035,"_31":14036,"_33":14037,"_19":14038,"_36":14039,"_45":9217,"_47":14041},"np.sort_complex","np.sort_complex(a)","Sort a complex array using the real part first, then the imaginary part.\r","Sort a complex array using the real part first, then the imaginary part.\r\n\r\nThe input array is flattened before sorting. Non-complex arrays are\r\nconverted to complex in the output.",[14040],{"_17":664,"_19":11638,"_41":6},[],{"_17":14043,"_31":14044,"_33":14045,"_19":14046,"_36":14047,"_45":9217,"_47":14049},"np.spacing","np.spacing(x)","Return the distance between x and the nearest adjacent number.\r","Return the distance between x and the nearest adjacent number.\r\nThis is effectively the ulp (unit in the last place) of x.",[14048],{"_17":405,"_19":11229,"_41":6},[],{"_17":14051,"_31":14052,"_33":14053,"_19":14054,"_36":14055,"_45":9491,"_47":14060},"np.split","np.split(arr, indices_or_sections, axis?)","Split an array into multiple sub-arrays of equal size.\r","Split an array into multiple sub-arrays of equal size.\r\nRaises error if array cannot be split into equal sections.",[14056,14057,14059],{"_17":9283,"_19":9485,"_41":6},{"_17":9487,"_19":14058,"_41":6},"- Number of equal sections or split indices",{"_17":2911,"_19":9490,"_41":10},[],{"_17":14062,"_31":14063,"_33":14064,"_19":14064,"_36":14065,"_45":9217,"_47":14067},"np.sqrt","np.sqrt(x)","Return the non-negative square-root of an array, element-wise.",[14066],{"_17":405,"_19":9217,"_41":6},[],{"_17":14069,"_31":14070,"_33":14071,"_19":14071,"_36":14072,"_45":9217,"_47":14074},"np.square","np.square(x)","Return the element-wise square of the input.",[14073],{"_17":405,"_19":9217,"_41":6},[],{"_17":14076,"_31":14077,"_33":14078,"_19":14078,"_36":14079,"_45":9217,"_47":14083},"np.squeeze","np.squeeze(a, axis?)","Remove axes of length one from array.",[14080,14081],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":14082,"_41":10},"- Specific axis to squeeze (optional, -1 for all size-1 axes)",[],{"_17":14085,"_31":14086,"_33":14087,"_19":14087,"_36":14088,"_45":9217,"_47":14093},"np.stack","np.stack(arrays, axis?)","Join a sequence of arrays along a new axis.",[14089,14091],{"_17":9731,"_19":14090,"_41":6},"- Sequence of arrays with the same shape",{"_17":2911,"_19":14092,"_41":10},"- The axis in the result along which to stack (default: 0)",[],{"_17":14095,"_31":14096,"_33":14097,"_19":14097,"_36":14098,"_45":9217,"_47":14104},"np.startswith","np.startswith(a, prefix, start?, end?)","Return true for each element if the string starts with prefix.",[14099,14100,14102,14103],{"_17":664,"_19":10654,"_41":6},{"_17":4824,"_19":14101,"_41":6},"- Prefix to check",{"_17":9323,"_19":10668,"_41":10},{"_17":9326,"_19":10670,"_41":10},[],{"_17":14106,"_31":14107,"_33":14108,"_19":14108,"_36":14109,"_45":8917,"_47":14118},"np.std","np.std(a, axis?, ddof?, keepdims?, dtype?)","Compute the standard deviation along the specified axis.",[14110,14111,14113,14115,14116],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":14112,"_41":10},"- Axis along which to compute std. null computes std of all elements.",{"_17":10258,"_19":14114,"_41":10},"- Delta Degrees of Freedom. Divisor is N - ddof. Default: 0",{"_17":9238,"_19":9391,"_41":10},{"_17":9115,"_19":14117,"_41":10},"- Output dtype",[],{"_17":14120,"_31":14121,"_33":14122,"_19":14122,"_36":14123,"_45":9217,"_47":14125},"np.str_len","np.str_len(a)","Return the length of each element.",[14124],{"_17":664,"_19":10654,"_41":6},[],{"_17":14127,"_31":14128,"_33":14129,"_19":14129,"_36":14130,"_45":9217,"_47":14133},"np.strAdd","np.strAdd(x1, x2)","Return element-wise string concatenation.",[14131,14132],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14135,"_31":14136,"_33":14137,"_19":14137,"_36":14138,"_45":9217,"_47":14140},"np.strCapitalize","np.strCapitalize(a)","Return element-wise copy with first character capitalized and rest lowercase.",[14139],{"_17":664,"_19":10654,"_41":6},[],{"_17":14142,"_31":14143,"_33":14144,"_19":14144,"_36":14145,"_45":9217,"_47":14149},"np.strCenter","np.strCenter(a, width, fillchar?)","Return element-wise centered string of given width.",[14146,14147,14148],{"_17":664,"_19":10654,"_41":6},{"_17":654,"_19":12357,"_41":6},{"_17":12359,"_19":12360,"_41":10},[],{"_17":14151,"_31":14152,"_33":14153,"_19":14153,"_36":14154,"_45":9217,"_47":14160},"np.strCount","np.strCount(a, sub, start?, end?)","Return the number of non-overlapping occurrences of substring.",[14155,14156,14158,14159],{"_17":664,"_19":10654,"_41":6},{"_17":13718,"_19":14157,"_41":6},"- Substring to count",{"_17":9323,"_19":13721,"_41":10},{"_17":9326,"_19":13723,"_41":10},[],{"_17":14162,"_31":14163,"_33":14164,"_19":14164,"_36":14165,"_45":9217,"_47":14170},"np.strEqual","np.strEqual(x1, x2)","Return (x1 == x2) element-wise for string arrays.",[14166,14168],{"_17":9225,"_19":14167,"_41":6},"- First string array or JS string array",{"_17":9227,"_19":14169,"_41":6},"- Second string array or JS string array",[],{"_17":14172,"_31":14173,"_33":14174,"_19":14174,"_36":14175,"_45":9217,"_47":14180},"np.strFind","np.strFind(a, sub, start?, end?)","For each element, return the lowest index where substring is found.",[14176,14177,14178,14179],{"_17":664,"_19":10654,"_41":6},{"_17":13718,"_19":13719,"_41":6},{"_17":9323,"_19":13721,"_41":10},{"_17":9326,"_19":13723,"_41":10},[],{"_17":14182,"_31":14183,"_33":14184,"_19":14185,"_36":14186,"_45":9217,"_47":14189},"np.strGreater","np.strGreater(x1, x2)","Return (x1 > x2) element-wise for string arrays.\r","Return (x1 > x2) element-wise for string arrays.\r\nComparison is lexicographic.",[14187,14188],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14191,"_31":14192,"_33":14193,"_19":14194,"_36":14195,"_45":9217,"_47":14198},"np.strGreaterEqual","np.strGreaterEqual(x1, x2)","Return (x1 >= x2) element-wise for string arrays.\r","Return (x1 >= x2) element-wise for string arrays.\r\nComparison is lexicographic.",[14196,14197],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14200,"_31":14201,"_33":14202,"_19":14202,"_36":14203,"_45":9217,"_47":14208},"np.strIndex","np.strIndex(a, sub, start?, end?)","Like find, but raises ValueError if substring is not found.",[14204,14205,14206,14207],{"_17":664,"_19":10654,"_41":6},{"_17":13718,"_19":13719,"_41":6},{"_17":9323,"_19":13721,"_41":10},{"_17":9326,"_19":13723,"_41":10},[],{"_17":14210,"_31":14211,"_33":14212,"_19":14212,"_36":14213,"_45":9217,"_47":14216},"np.strip","np.strip(a, chars?)","Return element-wise copy with leading and trailing characters removed.",[14214,14215],{"_17":664,"_19":10654,"_41":6},{"_17":12503,"_19":12504,"_41":10},[],{"_17":14218,"_31":14219,"_33":14220,"_19":14221,"_36":14222,"_45":9217,"_47":14225},"np.strLess","np.strLess(x1, x2)","Return (x1 < x2) element-wise for string arrays.\r","Return (x1 < x2) element-wise for string arrays.\r\nComparison is lexicographic (dictionary order).",[14223,14224],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14227,"_31":14228,"_33":14229,"_19":14230,"_36":14231,"_45":9217,"_47":14234},"np.strLessEqual","np.strLessEqual(x1, x2)","Return (x1 <= x2) element-wise for string arrays.\r","Return (x1 <= x2) element-wise for string arrays.\r\nComparison is lexicographic.",[14232,14233],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14236,"_31":14237,"_33":14238,"_19":14239,"_36":14240,"_45":9217,"_47":14245},"np.strMod","np.strMod(a, values)","Return element-wise (a % i), i.e. string formatting.\r","Return element-wise (a % i), i.e. string formatting.\r\n\r\nThis is the printf-style string formatting operation.\r\nEach string in `a` is interpreted as a format string,\r\nand the corresponding values in `values` are substituted.",[14241,14243],{"_17":664,"_19":14242,"_41":6},"- Input format string array",{"_17":560,"_19":14244,"_41":6},"- Values to substitute (array or single value)",[],{"_17":14247,"_31":14248,"_33":14249,"_19":14249,"_36":14250,"_45":9217,"_47":14254},"np.strMultiply","np.strMultiply(a, i)","Return element-wise (a * i), string repeated i times.",[14251,14252],{"_17":664,"_19":10654,"_41":6},{"_17":2433,"_19":14253,"_41":6},"- Number of repetitions (or array of repetition counts)",[],{"_17":14256,"_31":14257,"_33":14258,"_19":14258,"_36":14259,"_45":9217,"_47":14262},"np.strNotEqual","np.strNotEqual(x1, x2)","Return (x1 != x2) element-wise for string arrays.",[14260,14261],{"_17":9225,"_19":10080,"_41":6},{"_17":9227,"_19":10082,"_41":6},[],{"_17":14264,"_31":14265,"_33":14266,"_19":14266,"_36":14267,"_45":9217,"_47":14270},"np.strPartition","np.strPartition(a, sep)","Partition each element around the first occurrence of sep.",[14268,14269],{"_17":664,"_19":10654,"_41":6},{"_17":11081,"_19":13817,"_41":6},[],{"_17":14272,"_31":14273,"_33":14274,"_19":14274,"_36":14275,"_45":9217,"_47":14283},"np.strReplace","np.strReplace(a, old, new_, count?)","Return element-wise copy with occurrences of old replaced by new.",[14276,14277,14279,14281],{"_17":664,"_19":10654,"_41":6},{"_17":4793,"_19":14278,"_41":6},"- Substring to replace",{"_17":12530,"_19":14280,"_41":6},"- Replacement string",{"_17":11084,"_19":14282,"_41":10},"- Maximum replacements per element (-1 for all)",[],{"_17":14285,"_31":14286,"_33":14287,"_19":14288,"_36":14289,"_45":9217,"_47":14297},"np.strSlice","np.strSlice(a, start?, stop?, step?)","Return element-wise sliced strings.\r","Return element-wise sliced strings.\r\n\r\nThis is the NumPy 2.0 string slicing function, providing\r\nPython-style string slicing for each element.",[14290,14291,14293,14295],{"_17":664,"_19":10654,"_41":6},{"_17":9323,"_19":14292,"_41":10},"- Start index (default 0)",{"_17":11136,"_19":14294,"_41":10},"- Stop index (default: end of string)",{"_17":9329,"_19":14296,"_41":10},"- Step size (default 1)",[],{"_17":14299,"_31":14300,"_33":14301,"_19":14302,"_36":14303,"_45":9217,"_47":14305},"np.strTitle","np.strTitle(a)","Return element-wise titlecased version.\r","Return element-wise titlecased version.\r\nWords start with uppercase, remaining characters are lowercase.",[14304],{"_17":664,"_19":10654,"_41":6},[],{"_17":14307,"_31":14308,"_33":14309,"_19":14310,"_36":14311,"_45":9217,"_47":14319},"np.strTranslate","np.strTranslate(a, table, deletechars?)","Return element-wise translation of string using a translation table.\r","Return element-wise translation of string using a translation table.\r\n\r\nEach character in the string is mapped through the translation table.\r\nCharacters not in the table are left unchanged.",[14312,14313,14316],{"_17":664,"_19":10654,"_41":6},{"_17":14314,"_19":14315,"_41":6},"table","- Translation table as a Map, object, or string pairs",{"_17":14317,"_19":14318,"_41":10},"deletechars","- Characters to delete (optional)",[],{"_17":14321,"_31":14322,"_33":14323,"_19":14323,"_36":14324,"_45":1387,"_47":14326},"np.structDtypeSize","np.structDtypeSize(dtype)","Get byte size for a given dtype.",[14325],{"_17":9115,"_19":10065,"_41":6},[],{"_17":14328,"_31":14329,"_33":14330,"_19":14330,"_36":14331,"_45":9217,"_47":14334},"np.subtract","np.subtract(x1, x2)","Subtract arguments, element-wise.",[14332,14333],{"_17":9225,"_19":9217,"_41":6},{"_17":9227,"_19":9217,"_41":6},[],{"_17":14336,"_31":14337,"_33":14338,"_19":14338,"_36":14339,"_45":8917,"_47":14345},"np.sum","np.sum(a, axis?, keepdims?, dtype?)","Sum of array elements over a given axis.",[14340,14341,14343,14344],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":14342,"_41":10},"- Axis along which to sum. null sums all elements.",{"_17":9238,"_19":9391,"_41":10},{"_17":9115,"_19":12648,"_41":10},[],{"_17":14347,"_31":14348,"_33":14349,"_19":14349,"_36":14350,"_45":14356,"_47":14357},"np.svd","np.svd(a, fullMatrices?)","Singular Value Decomposition.",[14351,14353],{"_17":664,"_19":14352,"_41":6},"- Matrix to decompose (M x N)",{"_17":14354,"_19":14355,"_41":10},"fullMatrices","- If true, U and Vh have full shapes (M x M) and (N x N)\r\n If false, shapes are reduced (M x K) and (K x N)","Promise",[],{"_17":14359,"_31":14360,"_33":14361,"_19":14361,"_36":14362,"_45":9266,"_47":14364},"np.svdvals","np.svdvals(a)","Return singular values only.",[14363],{"_17":664,"_19":9217,"_41":6},[],{"_17":14366,"_31":14367,"_33":14368,"_19":14368,"_36":14369,"_45":9217,"_47":14375},"np.swapaxes","np.swapaxes(a, axis1, axis2)","Interchange two axes of an array.",[14370,14371,14373],{"_17":664,"_19":8908,"_41":6},{"_17":10440,"_19":14372,"_41":6},"- First axis",{"_17":10442,"_19":14374,"_41":6},"- Second axis",[],{"_17":14377,"_31":14378,"_33":14379,"_19":14379,"_36":14380,"_45":9217,"_47":14382},"np.swapcase","np.swapcase(a)","Return element-wise copy with uppercase and lowercase swapped.",[14381],{"_17":664,"_19":10654,"_41":6},[],{"_17":14384,"_31":14385,"_33":14386,"_19":14386,"_36":14387,"_45":9266,"_47":14394},"np.take","np.take(arr, indices, axis?, mode?)","Take elements from an array along an axis.",[14388,14389,14391,14393],{"_17":9283,"_19":10192,"_41":6},{"_17":9784,"_19":14390,"_41":6},"- Array of indices to take",{"_17":2911,"_19":14392,"_41":10},"- Axis along which to take (default: 0)",{"_17":6182,"_19":10031,"_41":10},[],{"_17":14396,"_31":14397,"_33":14398,"_19":14398,"_36":14399,"_45":9266,"_47":14404},"np.take_along_axis","np.take_along_axis(arr, indicesArr, axis)","Take values from the input array by matching 1d index and data slices.",[14400,14401,14402],{"_17":9283,"_19":10192,"_41":6},{"_17":13408,"_19":9217,"_41":6},{"_17":2911,"_19":14403,"_41":6},"- The axis to take along",[],{"_17":14406,"_31":14407,"_33":14408,"_19":14408,"_36":14409,"_45":9266,"_47":14414},"np.takeFlat","np.takeFlat(arr, indices, mode?)","Take elements from a flattened array.",[14410,14412,14413],{"_17":9283,"_19":14411,"_41":6},"- Source array (will be flattened conceptually)",{"_17":9784,"_19":13395,"_41":6},{"_17":6182,"_19":10031,"_41":10},[],{"_17":14416,"_31":14417,"_33":14418,"_19":14418,"_36":14419,"_45":9217,"_47":14421},"np.tan","np.tan(x)","Compute tangent element-wise.",[14420],{"_17":405,"_19":9217,"_41":6},[],{"_17":14423,"_31":14424,"_33":14425,"_19":14425,"_36":14426,"_45":9217,"_47":14428},"np.tanh","np.tanh(x)","Compute hyperbolic tangent element-wise.",[14427],{"_17":405,"_19":9217,"_41":6},[],{"_17":14430,"_31":14431,"_33":14432,"_19":14433,"_36":14434,"_45":9266,"_47":14441},"np.tensordot","np.tensordot(a, b, axes?)","Compute tensor dot product along specified axes.\r","Compute tensor dot product along specified axes.\r\n\r\nFor tensors a and b, tensordot(a, b, axes) computes the sum of products\r\nover the specified axes.",[14435,14437,14439],{"_17":664,"_19":14436,"_41":6},"- First tensor",{"_17":408,"_19":14438,"_41":6},"- Second tensor",{"_17":9314,"_19":14440,"_41":10},"- Axes to sum over:\r\n- number N: last N axes of a with first N axes of b\r\n- [axesA, axesB]: specific axes for each tensor",[],{"_17":14443,"_31":14444,"_33":14445,"_19":14446,"_36":14447,"_45":9266,"_47":14453},"np.tensorinv","np.tensorinv(a, ind?)","Compute the 'inverse' of an N-dimensional array.\r","Compute the 'inverse' of an N-dimensional array.\r\n\r\nThe result is an inverse for a with respect to the tensordot operation\r\ntensordot(a, b, ind).",[14448,14450],{"_17":664,"_19":14449,"_41":6},"- Tensor to pseudo-invert",{"_17":14451,"_19":14452,"_41":10},"ind","- Number of first indices that are involved in the inverse sum",[],{"_17":14455,"_31":14456,"_33":14457,"_19":14458,"_36":14459,"_45":9266,"_47":14466},"np.tensorsolve","np.tensorsolve(a, b, axes?)","Solve the tensor equation a x = b for x.\r","Solve the tensor equation a x = b for x.\r\n\r\nIt is assumed that all indices of x are summed over in the product,\r\ntogether with the rightmost indices of a.",[14460,14462,14464],{"_17":664,"_19":14461,"_41":6},"- Coefficient tensor",{"_17":408,"_19":14463,"_41":6},"- Right-hand side tensor",{"_17":9314,"_19":14465,"_41":10},"- Axes in a to reorder to the right, for the solve",[],{"_17":14468,"_31":14469,"_33":14470,"_19":14470,"_36":14471,"_45":9266,"_47":14476},"np.tile","np.tile(arr, reps)","Construct an array by repeating arr the number of times given by reps.",[14472,14473],{"_17":9283,"_19":8908,"_41":6},{"_17":14474,"_19":14475,"_41":6},"reps","- Number of repetitions along each axis",[],{"_17":14478,"_31":14479,"_33":14480,"_19":14480,"_36":14481,"_45":3784,"_47":14486},"np.trace","np.trace(a, offset?, axis1?, axis2?)","Return the sum along diagonals of the array.",[14482,14483,14484,14485],{"_17":664,"_19":9217,"_41":6},{"_17":3056,"_19":1387,"_41":10},{"_17":10440,"_19":1387,"_41":10},{"_17":10442,"_19":1387,"_41":10},[],{"_17":14488,"_31":14489,"_33":14490,"_19":14490,"_36":14491,"_45":9217,"_47":14494},"np.transpose","np.transpose(a, axes?)","Reverse or permute the axes of an array.",[14492,14493],{"_17":664,"_19":8908,"_41":6},{"_17":9314,"_19":13098,"_41":10},[],{"_17":14496,"_31":14497,"_33":14498,"_19":14499,"_36":14500,"_45":8917,"_47":14510},"np.trapezoid","np.trapezoid(y, x?, dx?, axis?)","Integrate along the given axis using the composite trapezoidal rule.\r","Integrate along the given axis using the composite trapezoidal rule.\r\n\r\nIf x is provided, the integration happens in sequence along its elements.\r\nOtherwise, the default sample distance of 1 is used.",[14501,14503,14505,14508],{"_17":2467,"_19":14502,"_41":6},"- Array to be integrated",{"_17":405,"_19":14504,"_41":10},"- The sample points corresponding to y values. If null, dx is used.",{"_17":14506,"_19":14507,"_41":10},"dx","- Spacing between sample points when x is null. Default is 1.",{"_17":2911,"_19":14509,"_41":10},"- Axis along which to integrate",[],{"_17":14512,"_31":14513,"_33":14514,"_19":14514,"_36":14515,"_45":9266,"_47":14520},"np.tri","np.tri(N, M?, k?, options?)","Create a 2D array with ones at and below the given diagonal.",[14516,14517,14518,14519],{"_17":8783,"_19":652,"_41":6},{"_17":5526,"_19":10747,"_41":10},{"_17":4686,"_19":10396,"_41":10},{"_17":454,"_19":9446,"_41":10},[],{"_17":14522,"_31":14523,"_33":14524,"_19":14525,"_36":14526,"_45":9266,"_47":14530},"np.tril","np.tril(arr, k?)","Lower triangle of an array.\r","Lower triangle of an array.\r\n\r\nReturn a copy of an array with elements above the k-th diagonal zeroed.",[14527,14528],{"_17":9283,"_19":8908,"_41":6},{"_17":4686,"_19":14529,"_41":10},"- Diagonal above which to zero elements (default: 0)",[],{"_17":14532,"_31":14533,"_33":14534,"_19":14534,"_36":14535,"_45":12555,"_47":14540},"np.tril_indices","np.tril_indices(n, k?, m?)","Return the indices for the lower-triangle of an (n, m) array.",[14536,14537,14538],{"_17":1206,"_19":652,"_41":6},{"_17":4686,"_19":10749,"_41":10},{"_17":630,"_19":14539,"_41":10},"- Number of columns (default: n)",[],{"_17":14542,"_31":14543,"_33":14544,"_19":14545,"_36":14546,"_45":12555,"_47":14551},"np.tril_indices_from","np.tril_indices_from(arr, k?)","Return the indices for the lower-triangle of an (n, m) array.\r","Return the indices for the lower-triangle of an (n, m) array.\r\n\r\nThis is a specialized version that gets the shape from an input array.",[14547,14549],{"_17":9283,"_19":14548,"_41":6},"- Input array from which to get shape",{"_17":4686,"_19":14550,"_41":10},"- Diagonal offset (k=0 is main diagonal, k<0 is below, k>0 is above)",[],{"_17":14553,"_31":14554,"_33":14555,"_19":14555,"_36":14556,"_45":9217,"_47":14561},"np.trim_zeros","np.trim_zeros(arr, trim?)","Trim the leading and/or trailing zeros from a 1-D array.",[14557,14559],{"_17":9283,"_19":14558,"_41":6},"- Input 1-D array",{"_17":9520,"_19":14560,"_41":10},"- 'f' for front, 'b' for back, 'fb' for both (default: 'fb')",[],{"_17":14563,"_31":14564,"_33":14565,"_19":14566,"_36":14567,"_45":374,"_47":14571},"np.trimcoef","np.trimcoef(c, tol?)","Remove small trailing coefficients.\r","Remove small trailing coefficients.\r\n\r\nTrailing elements with absolute value less than or equal to `tol` are removed.",[14568,14569],{"_17":713,"_19":9850,"_41":6},{"_17":470,"_19":14570,"_41":10},"- Tolerance for considering coefficients as zero (default: 0)",[],{"_17":14573,"_31":14574,"_33":14575,"_19":14575,"_36":14576,"_45":374,"_47":14580},"np.trimseq","np.trimseq(seq)","Remove trailing zeros from a sequence.",[14577],{"_17":14578,"_19":14579,"_41":6},"seq","- Input sequence",[],{"_17":14582,"_31":14583,"_33":14584,"_19":14585,"_36":14586,"_45":9266,"_47":14590},"np.triu","np.triu(arr, k?)","Upper triangle of an array.\r","Upper triangle of an array.\r\n\r\nReturn a copy of an array with elements below the k-th diagonal zeroed.",[14587,14588],{"_17":9283,"_19":8908,"_41":6},{"_17":4686,"_19":14589,"_41":10},"- Diagonal below which to zero elements (default: 0)",[],{"_17":14592,"_31":14593,"_33":14594,"_19":14594,"_36":14595,"_45":12555,"_47":14599},"np.triu_indices","np.triu_indices(n, k?, m?)","Return the indices for the upper-triangle of an (n, m) array.",[14596,14597,14598],{"_17":1206,"_19":652,"_41":6},{"_17":4686,"_19":10749,"_41":10},{"_17":630,"_19":14539,"_41":10},[],{"_17":14601,"_31":14602,"_33":14603,"_19":14604,"_36":14605,"_45":12555,"_47":14608},"np.triu_indices_from","np.triu_indices_from(arr, k?)","Return the indices for the upper-triangle of an (n, m) array.\r","Return the indices for the upper-triangle of an (n, m) array.\r\n\r\nThis is a specialized version that gets the shape from an input array.",[14606,14607],{"_17":9283,"_19":14548,"_41":6},{"_17":4686,"_19":14550,"_41":10},[],{"_17":14610,"_31":14611,"_33":14612,"_19":14612,"_36":14613,"_45":9217,"_47":14615},"np.trunc","np.trunc(x)","Return the truncated value of the input, element-wise.",[14614],{"_17":405,"_19":9217,"_41":6},[],{"_17":14617,"_31":14618,"_33":14619,"_19":14619,"_36":14620,"_45":10065,"_47":14623},"np.typedArrayToDType","np.typedArrayToDType(arr)","Infer DType from a TypedArray.",[14621],{"_17":9283,"_19":14622,"_41":6},"- TypedArray instance",[],{"_17":14625,"_31":14626,"_33":14627,"_19":14628,"_36":14629,"_45":9266,"_47":14632},"np.union1d","np.union1d(ar1, ar2)","Find the union of two arrays.\r","Find the union of two arrays.\r\n\r\nReturns the sorted unique values that are in either of the input arrays.",[14630,14631],{"_17":11637,"_19":11713,"_41":6},{"_17":11640,"_19":11715,"_41":6},[],{"_17":14634,"_31":14635,"_33":14636,"_19":14636,"_36":14637,"_45":14640,"_47":14641},"np.unique","np.unique(arr, options?)","Find the unique elements of an array.",[14638,14639],{"_17":9283,"_19":11638,"_41":6},{"_17":454,"_19":8788,"_41":10},"Promise",[],{"_17":14643,"_31":14644,"_33":14645,"_19":14645,"_36":14646,"_45":14648,"_47":14649},"np.uniqueAll","np.uniqueAll(arr)","Return unique values, indices, inverse, and counts.",[14647],{"_17":9283,"_19":8908,"_41":6},"Promise",[],{"_17":14651,"_31":14652,"_33":14653,"_19":14653,"_36":14654,"_45":14656,"_47":14657},"np.uniqueCounts","np.uniqueCounts(arr)","Return unique values and their counts.",[14655],{"_17":9283,"_19":8908,"_41":6},"Promise<{\r\n values: NDArray;\r\n counts: NDArray;\r\n}>",[],{"_17":14659,"_31":14660,"_33":14661,"_19":14661,"_36":14662,"_45":14664,"_47":14665},"np.uniqueIndex","np.uniqueIndex(arr)","Return unique values and indices of first occurrence.",[14663],{"_17":9283,"_19":8908,"_41":6},"Promise<{\r\n values: NDArray;\r\n indices: NDArray;\r\n}>",[],{"_17":14667,"_31":14668,"_33":14669,"_19":14669,"_36":14670,"_45":14672,"_47":14673},"np.uniqueInverse","np.uniqueInverse(arr)","Return unique values and indices to reconstruct original.",[14671],{"_17":9283,"_19":8908,"_41":6},"Promise<{\r\n values: NDArray;\r\n inverse: NDArray;\r\n}>",[],{"_17":14675,"_31":14676,"_33":14677,"_19":14677,"_36":14678,"_45":9266,"_47":14680},"np.uniqueValues","np.uniqueValues(arr)","Return only the unique values (simplified interface).",[14679],{"_17":9283,"_19":8908,"_41":6},[],{"_17":14682,"_31":14683,"_33":14684,"_19":14685,"_36":14686,"_45":9266,"_47":14695},"np.unpackbits","np.unpackbits(a, axis?, count?, bitorder?)","Unpack elements of a uint8 array into a binary array.\r","Unpack elements of a uint8 array into a binary array.\r\n\r\nEach element is unpacked into 8 bits (or fewer for the last element\r\nif count is specified).",[14687,14689,14691,14693],{"_17":664,"_19":14688,"_41":6},"- Input array of uint8 values",{"_17":2911,"_19":14690,"_41":10},"- The axis along which to unpack. If null, the input is flattened",{"_17":11084,"_19":14692,"_41":10},"- Number of bits to unpack from the last dimension. If null,\r\n all bits are unpacked. Negative count removes bits from the end.",{"_17":13040,"_19":14694,"_41":10},"- Order of bits in the packed representation. 'big' (default) means\r\n the highest bit is unpacked first; 'little' means the lowest\r\n bit is unpacked first",[],{"_17":14697,"_31":14698,"_33":14699,"_19":14699,"_36":14700,"_45":14703,"_47":14704},"np.unravelIndex","np.unravelIndex(indices, shape)","Convert a flat index into a tuple of coordinate arrays.",[14701,14702],{"_17":9784,"_19":13395,"_41":6},{"_17":8459,"_19":13528,"_41":6},"Promise",[],{"_17":14706,"_31":14707,"_33":14708,"_19":14709,"_36":14710,"_45":9491,"_47":14715},"np.unstack","np.unstack(arr, axis?)","Unpack the array along a given axis.\r","Unpack the array along a given axis.\r\nThe inverse of stack.",[14711,14713],{"_17":9283,"_19":14712,"_41":6},"- Array to unpack",{"_17":2911,"_19":14714,"_41":10},"- Axis along which to unpack (default: 0)",[],{"_17":14717,"_31":14718,"_33":14719,"_19":14720,"_36":14721,"_45":9266,"_47":14731},"np.unwrap","np.unwrap(p, discont?, axis?, period?)","Unwrap by taking the complement of large deltas with respect to the period.\r","Unwrap by taking the complement of large deltas with respect to the period.\r\n\r\nThis unwraps a signal by changing absolute jumps greater than discont to\r\ntheir 2*pi complement.",[14722,14723,14726,14728],{"_17":5212,"_19":8908,"_41":6},{"_17":14724,"_19":14725,"_41":10},"discont","- Maximum discontinuity between values, default is pi",{"_17":2911,"_19":14727,"_41":10},"- Axis along which to unwrap",{"_17":14729,"_19":14730,"_41":10},"period","- Size of the range over which the input wraps, default is 2*pi",[],{"_17":14733,"_31":14734,"_33":14735,"_19":14735,"_36":14736,"_45":9217,"_47":14738},"np.upper","np.upper(a)","Return element-wise copy with lowercase characters converted to uppercase.",[14737],{"_17":664,"_19":10654,"_41":6},[],{"_17":14740,"_31":14741,"_33":14742,"_19":14743,"_36":14744,"_45":9266,"_47":14753},"np.vander","np.vander(x, N?, increasing?, options?)","Generate a Vandermonde matrix.\r","Generate a Vandermonde matrix.\r\n\r\nThe columns of the output matrix are powers of the input vector.\r\nThe order of the powers is determined by the `increasing` parameter.",[14745,14747,14749,14752],{"_17":405,"_19":14746,"_41":6},"- 1D input array",{"_17":8783,"_19":14748,"_41":10},"- Number of columns (default: length of x)",{"_17":14750,"_19":14751,"_41":10},"increasing","- Order of powers (default: false, decreasing)",{"_17":454,"_19":9446,"_41":10},[],{"_17":14755,"_31":14756,"_33":14757,"_19":14757,"_36":14758,"_45":8917,"_47":14766},"np.variance","np.variance(a, axis?, ddof?, keepdims?, dtype?)","Compute the variance along the specified axis.",[14759,14760,14762,14764,14765],{"_17":664,"_19":8908,"_41":6},{"_17":2911,"_19":14761,"_41":10},"- Axis along which to compute variance. null computes variance of all elements.",{"_17":10258,"_19":14763,"_41":10},"- Delta Degrees of Freedom. Divisor is N - ddof. Default: 0 (population variance)",{"_17":9238,"_19":9391,"_41":10},{"_17":9115,"_19":14117,"_41":10},[],{"_17":14768,"_31":14769,"_33":14770,"_19":14771,"_36":14772,"_45":3784,"_47":14775},"np.vdot","np.vdot(a, b)","Compute the dot product of two vectors (flattened inputs).\r","Compute the dot product of two vectors (flattened inputs).\r\nFor complex arrays, the first argument is conjugated.",[14773,14774],{"_17":664,"_19":9217,"_41":6},{"_17":408,"_19":9217,"_41":6},[],{"_17":14777,"_31":14778,"_33":14779,"_19":14780,"_36":14781,"_45":8917,"_47":14786},"np.vecdot","np.vecdot(x1, x2, axis?)","Compute the vector dot product of two arrays along the last axis.\r","Compute the vector dot product of two arrays along the last axis.\r\n\r\nNumPy 2.0 addition. For 1-D arrays, this is the same as dot.\r\nFor N-D arrays, sums the product of elements along the last axis.",[14782,14783,14784],{"_17":9225,"_19":11713,"_41":6},{"_17":9227,"_19":11715,"_41":6},{"_17":2911,"_19":14785,"_41":10},"- Axis along which to compute the dot product (default: -1)",[],{"_17":14788,"_31":14789,"_33":14790,"_19":14791,"_36":14792,"_45":9266,"_47":14796},"np.vecmat","np.vecmat(x1, x2)","Vector-matrix product.\r","Vector-matrix product.\r\n\r\nNumPy 2.0 addition. Computes the vector-matrix product of x1 and x2.\r\nEquivalent to matmul with 1D @ 2D broadcasting.",[14793,14795],{"_17":9225,"_19":14794,"_41":6},"- Vector (..., M)",{"_17":9227,"_19":12616,"_41":6},[],{"_17":14798,"_31":14799,"_33":14800,"_19":14800,"_36":14801,"_45":8917,"_47":14808},"np.vector_norm","np.vector_norm(x, ord?, axis?, keepdims?)","Compute the vector norm.",[14802,14803,14805,14807],{"_17":405,"_19":8908,"_41":6},{"_17":8407,"_19":14804,"_41":10},"- Order of the norm (default: 2, Euclidean)",{"_17":2911,"_19":14806,"_41":10},"- Axis along which to compute. null = flatten",{"_17":9238,"_19":12578,"_41":10},[],{"_17":14810,"_31":14811,"_33":14812,"_19":14812,"_36":14813,"_45":14819,"_47":14820},"np.vectorize","np.vectorize(pyfunc, options?)","Factory function for creating a Vectorize instance.",[14814,14817],{"_17":14815,"_19":14816,"_41":6},"pyfunc","- Function to vectorize",{"_17":454,"_19":14818,"_41":10},"- Vectorization options","Vectorize",[],{"_17":14822,"_31":14823,"_33":14824,"_19":14824,"_36":14825,"_45":9491,"_47":14828},"np.vsplit","np.vsplit(arr, indices_or_sections)","Split an array into multiple sub-arrays vertically (row-wise).",[14826,14827],{"_17":9283,"_19":13797,"_41":6},{"_17":9487,"_19":9488,"_41":6},[],{"_17":14830,"_31":14831,"_33":14832,"_19":14833,"_36":14834,"_45":9217,"_47":14836},"np.vstack","np.vstack(tup)","Stack arrays in sequence vertically (row-wise).\r","Stack arrays in sequence vertically (row-wise).\r\nEquivalent to concatenation along the first axis after making 1-D arrays 2-D.",[14835],{"_17":10054,"_19":10514,"_41":6},[],{"_17":14838,"_31":14839,"_33":14840,"_19":14841,"_36":14842,"_45":9266,"_47":14849},"np.where","np.where(condition, x?, y?)","Return elements chosen from x or y depending on condition.\r","Return elements chosen from x or y depending on condition.\r\n\r\nIf x and y are provided, returns an array where elements are taken\r\nfrom x where condition is true, and from y where condition is false.\r\n\r\nIf only condition is provided, returns the indices where condition is true\r\n(equivalent to nonzero).",[14843,14845,14847],{"_17":10090,"_19":14844,"_41":6},"- Boolean condition array",{"_17":405,"_19":14846,"_41":10},"- Values where condition is true (optional)",{"_17":2467,"_19":14848,"_41":10},"- Values where condition is false (optional)",[],{"_17":14851,"_31":14852,"_33":14853,"_19":14853,"_36":14854,"_45":14859,"_47":14860},"np.withPrintoptions","np.withPrintoptions(options, fn)","Execute a function with temporary print options.",[14855,14857],{"_17":454,"_19":14856,"_41":6},"- Temporary print options",{"_17":578,"_19":14858,"_41":6},"- Function to execute","T",[],{"_17":14862,"_31":14863,"_33":14864,"_19":14864,"_36":14865,"_45":9266,"_47":14868},"np.zeros","np.zeros(shape, options?)","Create a new NDArray filled with zeros.",[14866,14867],{"_17":8459,"_19":10636,"_41":6},{"_17":454,"_19":9446,"_41":10},[],{"_17":14870,"_31":14871,"_33":14872,"_19":14872,"_36":14873,"_45":9266,"_47":14875},"np.zeros_like","np.zeros_like(a)","Create an array of zeros with the same shape and type as a given array.",[14874],{"_17":664,"_19":10645,"_41":6},[],{"_17":14877,"_31":14878,"_33":14879,"_19":14880,"_36":14881,"_45":9217,"_47":14884},"np.zfill","np.zfill(a, width)","Return element-wise numeric string left-padded with zeros.\r","Return element-wise numeric string left-padded with zeros.\r\nSign prefix is handled correctly.",[14882,14883],{"_17":664,"_19":10654,"_41":6},{"_17":654,"_19":12357,"_41":6},[],{"_15":14886,"_17":14887,"_19":14888,"_21":22,"_23":14889,"_25":14890,"_27":14891},"ode-generated","ODE Solvers","ODE solvers from Hairer and Netlib, including dopri5, dop853, VODE, and more.","📈","ode",[14892,14900,14907,14913,14920,14926,14943,14954,14965,14976,14987,14998,15009,15020,15031,15042,15053,15064,15078,15089],{"_17":14893,"_31":14894,"_33":14895,"_19":1136,"_36":14896,"_45":46,"_47":14899},"ode.core.configureODE","ode.core.configureODE(config)","configureODE",[14897],{"_17":3805,"_19":14898,"_41":6},"ODELoadConfig",[],{"_17":14901,"_31":14902,"_33":14903,"_19":1136,"_36":14904,"_45":14905,"_47":14906},"ode.core.getODEModule","ode.core.getODEModule()","getODEModule",[],"ODEModule",[],{"_17":14908,"_31":14909,"_33":14910,"_19":1136,"_36":14911,"_45":2598,"_47":14912},"ode.core.isODELoaded","ode.core.isODELoaded()","isODELoaded",[],[],{"_17":14914,"_31":14915,"_33":14916,"_19":1136,"_36":14917,"_45":14918,"_47":14919},"ode.core.loadODEModule","ode.core.loadODEModule()","loadODEModule",[],"Promise",[],{"_17":14921,"_31":14922,"_33":14923,"_19":1136,"_36":14924,"_45":46,"_47":14925},"ode.core.resetODEModule","ode.core.resetODEModule()","resetODEModule",[],[],{"_17":14927,"_31":14928,"_33":14929,"_19":14930,"_36":14931,"_45":14941,"_47":14942},"ode.explicit.dop853","ode.explicit.dop853(fun, t_span, y0, options?)","Solve an ODE using the DOP853 method (Dormand-Prince 8(5,3)).\r","Solve an ODE using the DOP853 method (Dormand-Prince 8(5,3)).\r\n\r\nDOP853 is an explicit Runge-Kutta method of order 8 with embedded\r\nmethods of orders 5 and 3 for error estimation. More efficient than\r\nDOPRI5/RK45 when high accuracy is required.",[14932,14934,14937,14940],{"_17":8416,"_19":14933,"_41":6},"- ODE function: f(t, y) => dy/dt",{"_17":14935,"_19":14936,"_41":6},"t_span","- Time span [t0, tf]",{"_17":14938,"_19":14939,"_41":6},"y0","- Initial state vector",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":14944,"_31":14945,"_33":14946,"_19":14947,"_36":14948,"_45":14941,"_47":14953},"ode.explicit.dopri5","ode.explicit.dopri5(fun, t_span, y0, options?)","Solve an ODE using the DOPRI5 method (Dormand-Prince 5(4)).\r","Solve an ODE using the DOPRI5 method (Dormand-Prince 5(4)).\r\n\r\nDOPRI5 is an explicit Runge-Kutta method of order 5 with an embedded\r\norder 4 method for error estimation. Equivalent to SciPy's RK45.",[14949,14950,14951,14952],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":14955,"_31":14956,"_33":14957,"_19":14958,"_36":14959,"_45":14941,"_47":14964},"ode.explicit.dverk","ode.explicit.dverk(fun, t_span, y0, options?)","Solve an ODE using the DVERK method (Verner 6(5) RK).\r","Solve an ODE using the DVERK method (Verner 6(5) RK).\r\n\r\nDVERK is a higher-order explicit Runge-Kutta method with 6th order\r\naccuracy and 5th order error estimation. More efficient than RKF45\r\nfor problems requiring higher accuracy.",[14960,14961,14962,14963],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":14966,"_31":14967,"_33":14968,"_19":14969,"_36":14970,"_45":14941,"_47":14975},"ode.explicit.ode_abm","ode.explicit.ode_abm(fun, t_span, y0, options?)","Solve an ODE using the Adams-Bashforth-Moulton method.\r","Solve an ODE using the Adams-Bashforth-Moulton method.\r\n\r\nThis is a multistep predictor-corrector method. More efficient than\r\nsingle-step methods for smooth problems because it reuses previous\r\nfunction evaluations.",[14971,14972,14973,14974],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":14977,"_31":14978,"_33":14979,"_19":14980,"_36":14981,"_45":14941,"_47":14986},"ode.explicit.odex","ode.explicit.odex(fun, t_span, y0, options?)","Solve an ODE using the ODEX method (GBS Extrapolation).\r","Solve an ODE using the ODEX method (GBS Extrapolation).\r\n\r\nODEX is a GBS extrapolation method based on the explicit midpoint rule.\r\nIt features automatic order selection (up to very high orders) and is\r\nhighly efficient for smooth problems requiring high accuracy.",[14982,14983,14984,14985],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":14988,"_31":14989,"_33":14990,"_19":14991,"_36":14992,"_45":14941,"_47":14997},"ode.explicit.rkf45","ode.explicit.rkf45(fun, t_span, y0, options?)","Solve an ODE using the RKF45 method (Runge-Kutta-Fehlberg 4(5)).\r","Solve an ODE using the RKF45 method (Runge-Kutta-Fehlberg 4(5)).\r\n\r\nRKF45 is a classic explicit Runge-Kutta method with embedded error\r\nestimation. Similar to DOPRI5 but with a different embedded pair.",[14993,14994,14995,14996],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":14999,"_31":15000,"_33":15001,"_19":15002,"_36":15003,"_45":14941,"_47":15008},"ode.explicit.rksuite","ode.explicit.rksuite(fun, t_span, y0, options?)","Solve an ODE using RKSUITE.\r","Solve an ODE using RKSUITE.\r\n\r\nRKSUITE is a well-tested suite of Runge-Kutta methods with three\r\npairs available: (2,3), (4,5), and (7,8). It includes sophisticated\r\nerror control and optional global error assessment.",[15004,15005,15006,15007],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15010,"_31":15011,"_33":15012,"_19":15013,"_36":15014,"_45":14941,"_47":15019},"ode.implicit.radau","ode.implicit.radau(fun, t_span, y0, options?)","Solve an ODE using the RADAU method (Variable Order Radau IIA).\r","Solve an ODE using the RADAU method (Variable Order Radau IIA).\r\n\r\nRADAU is a variable order implicit Runge-Kutta method based on Radau IIA\r\nnodes. It can use orders 5, 9, or 13 (corresponding to 3, 5, or 7 stages)\r\nand automatically selects the optimal order during integration.",[15015,15016,15017,15018],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15021,"_31":15022,"_33":15023,"_19":15024,"_36":15025,"_45":14941,"_47":15030},"ode.implicit.radau5","ode.implicit.radau5(fun, t_span, y0, options?)","Solve an ODE using the RADAU5 method (Implicit Radau IIA order 5).\r","Solve an ODE using the RADAU5 method (Implicit Radau IIA order 5).\r\n\r\nRADAU5 is an implicit Runge-Kutta method suitable for stiff systems.\r\nUses Newton iteration with LU decomposition. Providing an analytical\r\nJacobian improves performance.",[15026,15027,15028,15029],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15032,"_31":15033,"_33":15034,"_19":15035,"_36":15036,"_45":14941,"_47":15041},"ode.implicit.rodas","ode.implicit.rodas(fun, t_span, y0, options?)","Solve an ODE using the RODAS method (Rosenbrock order 3(4)).\r","Solve an ODE using the RODAS method (Rosenbrock order 3(4)).\r\n\r\nRODAS is a Rosenbrock method suitable for stiff systems where Newton\r\niteration is not desired. It uses direct linear algebra (LU decomposition)\r\nrather than iterative solvers.",[15037,15038,15039,15040],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15043,"_31":15044,"_33":15045,"_19":15046,"_36":15047,"_45":14941,"_47":15052},"ode.implicit.vode","ode.implicit.vode(fun, t_span, y0, options?)","Solve an ODE using VODE (Variable-coefficient ODE solver).\r","Solve an ODE using VODE (Variable-coefficient ODE solver).\r\n\r\nVODE is the most versatile solver in the ODEPACK family. It automatically\r\nselects between Adams methods (for non-stiff problems) and BDF methods\r\n(for stiff problems) based on the mf parameter.",[15048,15049,15050,15051],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15054,"_31":15055,"_33":15056,"_19":15057,"_36":15058,"_45":14941,"_47":15063},"ode.implicit.vodpk","ode.implicit.vodpk(fun, t_span, y0, options?)","Solve an ODE using VODPK (VODE with Krylov methods).\r","Solve an ODE using VODPK (VODE with Krylov methods).\r\n\r\nVODPK is designed for large stiff systems where a full Jacobian would\r\nbe too expensive to compute and store. It uses GMRES with optional\r\npreconditioning.",[15059,15060,15061,15062],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15065,"_31":15066,"_33":15067,"_19":15068,"_36":15069,"_45":15076,"_47":15077},"ode.implicit.zvode","ode.implicit.zvode(fun, t_span, y0, options?)","Solve a complex-valued ODE using ZVODE.\r","Solve a complex-valued ODE using ZVODE.\r\n\r\nZVODE handles ODEs where both the state and derivatives are complex.\r\nThis is common in quantum mechanics and wave physics.",[15070,15072,15073,15075],{"_17":8416,"_19":15071,"_41":6},"- Complex ODE function: f(t, y) => dy/dt",{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":15074,"_41":6},"- Initial state vector (complex)",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":15079,"_31":15080,"_33":15081,"_19":15082,"_36":15083,"_45":14941,"_47":15088},"ode.rkc","ode.rkc(fun, t_span, y0, options?)","Solve an ODE using RKC (Runge-Kutta-Chebyshev).\r","Solve an ODE using RKC (Runge-Kutta-Chebyshev).\r\n\r\nRKC is designed for mildly stiff problems arising from spatial\r\ndiscretization of parabolic PDEs (e.g., heat equation, diffusion).\r\nIt is explicit but uses a variable number of stages to achieve\r\nstability for larger step sizes.",[15084,15085,15086,15087],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":15090,"_31":15091,"_33":15092,"_19":15093,"_36":15094,"_45":15099,"_47":15100},"ode.solve_ivp","ode.solve_ivp(fun, t_span, y0, options?)","Solve an initial value problem for a system of ODEs.\r","Solve an initial value problem for a system of ODEs.\r\n\r\nIntegrates a system of ordinary differential equations:\r\n dy/dt = f(t, y)\r\n y(t0) = y0",[15095,15096,15097,15098],{"_17":8416,"_19":14933,"_41":6},{"_17":14935,"_19":14936,"_41":6},{"_17":14938,"_19":14939,"_41":6},{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_15":15102,"_17":15103,"_19":15104,"_21":22,"_23":7346,"_25":7349,"_27":15105},"sym-generated","Symbolic Math (SymEngine)","Symbolic mathematics library based on SymEngine.",[15106,15119,15135,15146,15161,15167,15173,15182,15191,15200,15209,15218,15227,15236,15246,15255,15265,15273,15282,15290,15299,15308,15319,15328,15339,15349,15357,15366,15375,15383,15396,15407,15413,15422,15432,15441,15450,15458,15467,15475,15483,15494,15503,15514,15522,15530,15540,15550,15556,15564,15572,15581,15589,15598,15606,15615,15626,15634,15643,15653,15661,15670,15678,15689,15699,15711,15721,15730,15738,15744,15752,15762,15778,15786,15793,15801,15809,15816,15823,15830,15837,15847,15857,15864,15871,15879,15886,15894,15902,15909,15916,15928,15939,15953,15965,15973,15982,15996,16003,16012,16020,16031,16039,16047,16056,16065,16075,16084,16096,16104,16114,16122,16130,16138,16146,16154,16163,16171,16182,16193,16203,16212,16220,16228,16237,16245,16253,16259,16268,16274,16283,16291,16299,16307,16315,16324,16334,16342,16350,16361,16372,16382,16392,16400,16408,16416,16429,16437,16445,16454,16462,16470,16478,16486,16494,16502,16508,16518,16526],{"_17":15107,"_31":15108,"_33":15109,"_19":15110,"_36":15111,"_45":15117,"_47":15118},"sym.assumptions.refine","sym.assumptions.refine(expr, assumptions)","Simplifies an expression using the given assumptions.\r","Simplifies an expression using the given assumptions.\r\n\r\nThe `refine` function applies simplification rules that are valid\r\nunder the given assumptions. For example:\r\n\r\n- `abs(x)` → `x` when x is positive\r\n- `sqrt(x^2)` → `x` when x is positive\r\n- `floor(n)` → `n` when n is an integer\r\n- `sign(x)` → `1` when x is positive",[15112,15115],{"_17":15113,"_19":15114,"_41":6},"expr","- The expression to refine.",{"_17":7526,"_19":15116,"_41":6},"- The assumptions to apply.","Expr",[],{"_17":15120,"_31":15121,"_33":15122,"_19":15123,"_36":15124,"_45":15133,"_47":15134},"sym.assumptions.ask","sym.assumptions.ask(query, symbol, assumptions?)","Asks a query about a symbol under the given assumptions.\r","Asks a query about a symbol under the given assumptions.\r\n\r\nThis is a convenience function that dispatches to the appropriate\r\nquery method based on the query name or function.\r\n\r\nFor numbers (Integer, Rational, RealDouble), intrinsic properties\r\ncan be queried without assumptions.",[15125,15128,15131],{"_17":15126,"_19":15127,"_41":6},"query","- The query function (e.g., Q.positive) or name (e.g., 'positive').",{"_17":15129,"_19":15130,"_41":6},"symbol","- The symbol or expression to query.",{"_17":7526,"_19":15132,"_41":10},"- Optional assumptions to use. If not provided, uses empty assumptions.","Tribool",[],{"_17":15136,"_31":15137,"_33":15138,"_19":15139,"_36":15140,"_45":15117,"_47":15145},"sym.calculus.diff","sym.calculus.diff(expr, args)","Computes the derivative of a symbolic expression.\r","Computes the derivative of a symbolic expression.\r\n\r\nPerforms symbolic differentiation with support for multiple variables\r\nand higher-order derivatives. The function handles various calling\r\nconventions to express different types of derivatives.",[15141,15143],{"_17":15113,"_19":15142,"_41":6},"- The expression to differentiate.",{"_17":9140,"_19":15144,"_41":6},"- Symbols and optional derivative orders in alternating pattern.",[],{"_17":15147,"_31":15148,"_33":15149,"_19":15150,"_36":15151,"_45":15117,"_47":15160},"sym.calculus.series","sym.calculus.series(expr, x, x0?, n?)","Computes the Taylor series expansion of an expression around a point.\r","Computes the Taylor series expansion of an expression around a point.\r\n\r\nExpands a symbolic expression as a polynomial approximation using its\r\nTaylor series. Currently supports expansion around x = 0 (Maclaurin series).",[15152,15154,15156,15158],{"_17":15113,"_19":15153,"_41":6},"- The expression to expand.",{"_17":405,"_19":15155,"_41":6},"- The expansion variable (symbol).",{"_17":8419,"_19":15157,"_41":10},"- The expansion point (currently only 0 is supported).",{"_17":1206,"_19":15159,"_41":10},"- Number of terms in the series (precision parameter, default 6).",[],{"_17":15162,"_31":15163,"_33":15164,"_19":15164,"_36":15165,"_45":15117,"_47":15166},"sym.logic.BoolTrue","sym.logic.BoolTrue()","Creates the boolean constant True.",[],[],{"_17":15168,"_31":15169,"_33":15170,"_19":15170,"_36":15171,"_45":15117,"_47":15172},"sym.logic.BoolFalse","sym.logic.BoolFalse()","Creates the boolean constant False.",[],[],{"_17":15174,"_31":15175,"_33":15176,"_19":15177,"_36":15178,"_45":15117,"_47":15181},"sym.abs","sym.abs(x)","symngwasm - SymEngine-based symbolic mathematics in TypeScript with WebAssembly.\r","symngwasm - SymEngine-based symbolic mathematics in TypeScript with WebAssembly.\r\n\r\nA comprehensive symbolic computation library built on SymEngine (C++ library)\r\ncompiled to WebAssembly. Provides capabilities for symbolic algebra, calculus,\r\nequation solving, matrix operations, and expression manipulation.",[15179],{"_17":405,"_19":15180,"_41":6},"- The expression to take the absolute value of.",[],{"_17":15183,"_31":15184,"_33":15185,"_19":15186,"_36":15187,"_45":15117,"_47":15190},"sym.acos","sym.acos(x)","Computes the arccosine (inverse cosine) of a symbolic expression.\r","Computes the arccosine (inverse cosine) of a symbolic expression.\r\n\r\nReturns the angle whose cosine is x. The principal value is in [0, π].",[15188],{"_17":405,"_19":15189,"_41":6},"- The value (in the range [-1, 1] for real results).",[],{"_17":15192,"_31":15193,"_33":15194,"_19":15195,"_36":15196,"_45":15117,"_47":15199},"sym.acosh","sym.acosh(x)","Computes the inverse hyperbolic cosine of a symbolic expression.\r","Computes the inverse hyperbolic cosine of a symbolic expression.\r\n\r\nReturns the non-negative value y such that cosh(y) = x.\r\nAlso known as the area hyperbolic cosine: acosh(x) = ln(x + √(x² - 1)).",[15197],{"_17":405,"_19":15198,"_41":6},"- The argument (x ≥ 1 for real results).",[],{"_17":15201,"_31":15202,"_33":15203,"_19":15204,"_36":15205,"_45":15117,"_47":15208},"sym.acot","sym.acot(x)","Computes the arc-cotangent (inverse cotangent) of a symbolic expression.\r","Computes the arc-cotangent (inverse cotangent) of a symbolic expression.\r\n\r\nReturns the angle whose cotangent is x. The principal value is in (0, π).",[15206],{"_17":405,"_19":15207,"_41":6},"- The value (can be any real number except 0).",[],{"_17":15210,"_31":15211,"_33":15212,"_19":15213,"_36":15214,"_45":15117,"_47":15217},"sym.acoth","sym.acoth(x)","Computes the inverse hyperbolic cotangent of a symbolic expression.\r","Computes the inverse hyperbolic cotangent of a symbolic expression.\r\n\r\nReturns the value y such that coth(y) = x.\r\nAlso known as the area hyperbolic cotangent: acoth(x) = (1/2) * ln((x+1)/(x-1)).",[15215],{"_17":405,"_19":15216,"_41":6},"- The argument (|x| > 1 for real results).",[],{"_17":15219,"_31":15220,"_33":15221,"_19":15222,"_36":15223,"_45":15117,"_47":15226},"sym.acsc","sym.acsc(x)","Computes the arc-cosecant (inverse cosecant) of a symbolic expression.\r","Computes the arc-cosecant (inverse cosecant) of a symbolic expression.\r\n\r\nReturns the angle whose cosecant is x. The principal value is in [-π/2, π/2], excluding 0.",[15224],{"_17":405,"_19":15225,"_41":6},"- The value (|x| ≥ 1 for real results).",[],{"_17":15228,"_31":15229,"_33":15230,"_19":15231,"_36":15232,"_45":15117,"_47":15235},"sym.acsch","sym.acsch(x)","Computes the inverse hyperbolic cosecant of a symbolic expression.\r","Computes the inverse hyperbolic cosecant of a symbolic expression.\r\n\r\nReturns the value y such that csch(y) = x.\r\nAlso known as the area hyperbolic cosecant: acsch(x) = ln((1 + √(1+x²))/x) for x > 0.",[15233],{"_17":405,"_19":15234,"_41":6},"- The argument (x ≠ 0 for real results).",[],{"_17":15237,"_31":15238,"_33":15239,"_19":15239,"_36":15240,"_45":15117,"_47":15245},"sym.add","sym.add(a, b)","Add two expressions: a + b",[15241,15243],{"_17":664,"_19":15242,"_41":6},"First operand",{"_17":408,"_19":15244,"_41":6},"Second operand",[],{"_17":15247,"_31":15248,"_33":15249,"_19":15250,"_36":15251,"_45":15117,"_47":15254},"sym.arg","sym.arg(x)","Computes the argument (phase angle) of a complex expression.\r","Computes the argument (phase angle) of a complex expression.\r\n\r\nFor a complex number z = a + bi, arg(z) = atan2(b, a), which gives\r\nthe angle θ in the polar form z = r * e^(iθ). The result is in radians,\r\nranging from -π to π.",[15252],{"_17":405,"_19":15253,"_41":6},"- The complex expression to compute the argument of.",[],{"_17":15256,"_31":15257,"_33":15258,"_19":15259,"_36":15260,"_45":15263,"_47":15264},"sym.as_real_imag","sym.as_real_imag(expr)","Extracts the real and imaginary parts of a complex expression.\r","Extracts the real and imaginary parts of a complex expression.\r\n\r\nSeparates a complex expression into its real and imaginary components,\r\nreturning both as separate expressions.",[15261],{"_17":15113,"_19":15262,"_41":6},"- The complex expression to decompose.","{\r\n real: Expr;\r\n imag: Expr;\r\n}",[],{"_17":15266,"_31":15267,"_33":15268,"_19":15269,"_36":15270,"_45":15117,"_47":15272},"sym.asec","sym.asec(x)","Computes the arc-secant (inverse secant) of a symbolic expression.\r","Computes the arc-secant (inverse secant) of a symbolic expression.\r\n\r\nReturns the angle whose secant is x. The principal value is in [0, π], excluding π/2.",[15271],{"_17":405,"_19":15225,"_41":6},[],{"_17":15274,"_31":15275,"_33":15276,"_19":15277,"_36":15278,"_45":15117,"_47":15281},"sym.asech","sym.asech(x)","Computes the inverse hyperbolic secant of a symbolic expression.\r","Computes the inverse hyperbolic secant of a symbolic expression.\r\n\r\nReturns the non-negative value y such that sech(y) = x.\r\nAlso known as the area hyperbolic secant: asech(x) = ln((1 + √(1-x²))/x).",[15279],{"_17":405,"_19":15280,"_41":6},"- The argument (0 < x ≤ 1 for real results).",[],{"_17":15283,"_31":15284,"_33":15285,"_19":15286,"_36":15287,"_45":15117,"_47":15289},"sym.asin","sym.asin(x)","Computes the arcsine (inverse sine) of a symbolic expression.\r","Computes the arcsine (inverse sine) of a symbolic expression.\r\n\r\nReturns the angle whose sine is x. The principal value is in [-π/2, π/2].",[15288],{"_17":405,"_19":15189,"_41":6},[],{"_17":15291,"_31":15292,"_33":15293,"_19":15294,"_36":15295,"_45":15117,"_47":15298},"sym.asinh","sym.asinh(x)","Computes the inverse hyperbolic sine of a symbolic expression.\r","Computes the inverse hyperbolic sine of a symbolic expression.\r\n\r\nReturns the value y such that sinh(y) = x.\r\nAlso known as the area hyperbolic sine: asinh(x) = ln(x + √(x² + 1)).",[15296],{"_17":405,"_19":15297,"_41":6},"- The argument (can be any real number).",[],{"_17":15300,"_31":15301,"_33":15302,"_19":15303,"_36":15304,"_45":15117,"_47":15307},"sym.atan","sym.atan(x)","Computes the arctangent (inverse tangent) of a symbolic expression.\r","Computes the arctangent (inverse tangent) of a symbolic expression.\r\n\r\nReturns the angle whose tangent is x. The principal value is in (-π/2, π/2).",[15305],{"_17":405,"_19":15306,"_41":6},"- The value (can be any real number).",[],{"_17":15309,"_31":15310,"_33":15311,"_19":15312,"_36":15313,"_45":15117,"_47":15318},"sym.atan2","sym.atan2(y, x)","Computes the two-argument arctangent of symbolic expressions.\r","Computes the two-argument arctangent of symbolic expressions.\r\n\r\nReturns the angle θ in (-π, π] such that (cos(θ), sin(θ)) is proportional to (x, y).\r\nThis is the angle of the vector (x, y) from the positive x-axis, correctly handling\r\nall four quadrants.",[15314,15316],{"_17":2467,"_19":15315,"_41":6},"- The y-coordinate (opposite side / numerator in y/x).",{"_17":405,"_19":15317,"_41":6},"- The x-coordinate (adjacent side / denominator in y/x).",[],{"_17":15320,"_31":15321,"_33":15322,"_19":15323,"_36":15324,"_45":15117,"_47":15327},"sym.atanh","sym.atanh(x)","Computes the inverse hyperbolic tangent of a symbolic expression.\r","Computes the inverse hyperbolic tangent of a symbolic expression.\r\n\r\nReturns the value y such that tanh(y) = x.\r\nAlso known as the area hyperbolic tangent: atanh(x) = (1/2) * ln((1+x)/(1-x)).",[15325],{"_17":405,"_19":15326,"_41":6},"- The argument (-1 < x < 1 for real results).",[],{"_17":15329,"_31":15330,"_33":15331,"_19":15332,"_36":15333,"_45":15117,"_47":15338},"sym.beta","sym.beta(a, b)","Computes the beta function of symbolic expressions.\r","Computes the beta function of symbolic expressions.\r\n\r\nThe beta function B(a, b) is defined as the integral of t^(a-1)(1-t)^(b-1) from 0 to 1,\r\nand can be expressed in terms of the gamma function as B(a, b) = Γ(a)Γ(b)/Γ(a+b).",[15334,15336],{"_17":664,"_19":15335,"_41":6},"- The first parameter (as a symbolic expression).",{"_17":408,"_19":15337,"_41":6},"- The second parameter (as a symbolic expression).",[],{"_17":15340,"_31":15341,"_33":15342,"_19":15342,"_36":15343,"_45":15117,"_47":15348},"sym.binomial","sym.binomial(n, k)","Computes the binomial coefficient C(n, k) = n! / (k! * (n-k)!).",[15344,15346],{"_17":1206,"_19":15345,"_41":6},"- The total number of items.",{"_17":4686,"_19":15347,"_41":6},"- The number of items to choose.",[],{"_17":15350,"_31":15351,"_33":15352,"_19":15352,"_36":15353,"_45":15117,"_47":15356},"sym.boundary","sym.boundary(set)","Computes the boundary of a set.",[15354],{"_17":6153,"_19":15355,"_41":6},"- The set to find the boundary of.",[],{"_17":15358,"_31":15359,"_33":15360,"_19":15361,"_36":15362,"_45":15117,"_47":15365},"sym.cbrt","sym.cbrt(x)","Computes the cube root of a symbolic expression.\r","Computes the cube root of a symbolic expression.\r\n\r\nReturns the real cube root of x. Unlike square root, the cube root\r\nof a negative number is a negative real number. Equivalent to pow(x, 1/3).",[15363],{"_17":405,"_19":15364,"_41":6},"- The radicand (as a symbolic expression).",[],{"_17":15367,"_31":15368,"_33":15369,"_19":15370,"_36":15371,"_45":15117,"_47":15374},"sym.ceiling","sym.ceiling(x)","Computes the ceiling function of a symbolic expression.\r","Computes the ceiling function of a symbolic expression.\r\n\r\nReturns the smallest integer greater than or equal to x, denoted ⌈x⌉.\r\nAlso known as the least integer function.",[15372],{"_17":405,"_19":15373,"_41":6},"- The expression to compute the ceiling of.",[],{"_17":15376,"_31":15377,"_33":15378,"_19":15378,"_36":15379,"_45":15117,"_47":15382},"sym.closure","sym.closure(set)","Computes the closure of a set.",[15380],{"_17":6153,"_19":15381,"_41":6},"- The set to find the closure of.",[],{"_17":15384,"_31":15385,"_33":15386,"_19":15387,"_36":15388,"_45":15117,"_47":15395},"sym.coeff","sym.coeff(expr, x, n)","Extract the coefficient of x^n from an expression.\r","Extract the coefficient of x^n from an expression.\r\n\r\nFor a polynomial expression, returns the coefficient of the term x^n.\r\nIf n is 0, returns the constant term.",[15389,15391,15393],{"_17":15113,"_19":15390,"_41":6},"- The expression to extract the coefficient from.",{"_17":405,"_19":15392,"_41":6},"- The variable to extract the coefficient of.",{"_17":1206,"_19":15394,"_41":6},"- The power of x (as an expression, typically an Integer).",[],{"_17":15397,"_31":15398,"_33":15399,"_19":15399,"_36":15400,"_45":15117,"_47":15406},"sym.complement","sym.complement(a, universe)","Computes the complement of a set relative to another set.",[15401,15403],{"_17":664,"_19":15402,"_41":6},"- The set to complement.",{"_17":15404,"_19":15405,"_41":6},"universe","- The universe set (defaults to Reals if not specified).",[],{"_17":15408,"_31":15409,"_33":15410,"_19":15410,"_36":15411,"_45":15117,"_47":15412},"sym.Complexes","sym.Complexes()","Creates the set of complex numbers ℂ.",[],[],{"_17":15414,"_31":15415,"_33":15416,"_19":15417,"_36":15418,"_45":15117,"_47":15421},"sym.conjugate","sym.conjugate(x)","Computes the complex conjugate of an expression.\r","Computes the complex conjugate of an expression.\r\n\r\nFor a complex number z = a + bi, the conjugate is z* = a - bi.\r\nThis function works symbolically, so it can handle expressions\r\ncontaining symbolic variables.",[15419],{"_17":405,"_19":15420,"_41":6},"- The expression to conjugate.",[],{"_17":15423,"_31":15424,"_33":15425,"_19":15425,"_36":15426,"_45":15117,"_47":15431},"sym.contains","sym.contains(set, element)","Checks if an element is contained in a set.",[15427,15429],{"_17":6153,"_19":15428,"_41":6},"- The set to check.",{"_17":11964,"_19":15430,"_41":6},"- The element to check for.",[],{"_17":15433,"_31":15434,"_33":15435,"_19":15436,"_36":15437,"_45":15117,"_47":15440},"sym.cos","sym.cos(x)","Computes the cosine of a symbolic expression.\r","Computes the cosine of a symbolic expression.\r\n\r\nThe cosine function returns the ratio of the adjacent side to the hypotenuse\r\nin a right triangle. For symbolic expressions, it creates a symbolic cos(x)\r\nthat can be manipulated algebraically.",[15438],{"_17":405,"_19":15439,"_41":6},"- The angle in radians (as a symbolic expression).",[],{"_17":15442,"_31":15443,"_33":15444,"_19":15445,"_36":15446,"_45":15117,"_47":15449},"sym.cosh","sym.cosh(x)","Computes the hyperbolic cosine of a symbolic expression.\r","Computes the hyperbolic cosine of a symbolic expression.\r\n\r\nThe hyperbolic cosine is defined as cosh(x) = (e^x + e^(-x)) / 2.\r\nIt represents the x-coordinate of a point on the unit hyperbola,\r\nand also describes the shape of a hanging chain (catenary).",[15447],{"_17":405,"_19":15448,"_41":6},"- The argument (as a symbolic expression).",[],{"_17":15451,"_31":15452,"_33":15453,"_19":15454,"_36":15455,"_45":15117,"_47":15457},"sym.cot","sym.cot(x)","Computes the cotangent of a symbolic expression.\r","Computes the cotangent of a symbolic expression.\r\n\r\nThe cotangent function is defined as cot(x) = cos(x)/sin(x) = 1/tan(x),\r\nrepresenting the ratio of the adjacent side to the opposite side.",[15456],{"_17":405,"_19":15439,"_41":6},[],{"_17":15459,"_31":15460,"_33":15461,"_19":15462,"_36":15463,"_45":15117,"_47":15466},"sym.coth","sym.coth(x)","Computes the hyperbolic cotangent of a symbolic expression.\r","Computes the hyperbolic cotangent of a symbolic expression.\r\n\r\nThe hyperbolic cotangent is defined as coth(x) = cosh(x)/sinh(x) = 1/tanh(x).",[15464],{"_17":405,"_19":15465,"_41":6},"- The argument (as a symbolic expression, x ≠ 0).",[],{"_17":15468,"_31":15469,"_33":15470,"_19":15471,"_36":15472,"_45":15117,"_47":15474},"sym.csc","sym.csc(x)","Computes the cosecant of a symbolic expression.\r","Computes the cosecant of a symbolic expression.\r\n\r\nThe cosecant function is defined as csc(x) = 1/sin(x), representing\r\nthe ratio of the hypotenuse to the opposite side.",[15473],{"_17":405,"_19":15439,"_41":6},[],{"_17":15476,"_31":15477,"_33":15478,"_19":15479,"_36":15480,"_45":15117,"_47":15482},"sym.csch","sym.csch(x)","Computes the hyperbolic cosecant of a symbolic expression.\r","Computes the hyperbolic cosecant of a symbolic expression.\r\n\r\nThe hyperbolic cosecant is defined as csch(x) = 1/sinh(x) = 2/(e^x - e^(-x)).",[15481],{"_17":405,"_19":15465,"_41":6},[],{"_17":15484,"_31":15485,"_33":15486,"_19":15487,"_36":15488,"_45":15492,"_47":15493},"sym.cse","sym.cse(exprs)","Performs common subexpression elimination on a list of expressions.\r","Performs common subexpression elimination on a list of expressions.\r\n\r\nIdentifies repeated subexpressions and replaces them with generated symbols\r\nto reduce redundant computation. This is useful for optimizing numerical\r\nevaluation of complex expressions.",[15489],{"_17":15490,"_19":15491,"_41":6},"exprs","- The expressions to analyze for common subexpressions.","CSEResult",[],{"_17":15495,"_31":15496,"_33":15497,"_19":15498,"_36":15499,"_45":15117,"_47":15502},"sym.denom","sym.denom(expr)","Extracts the denominator of a rational expression.\r","Extracts the denominator of a rational expression.\r\n\r\nFor an expression representing a fraction p/q, returns q.\r\nFor non-fractional expressions, returns 1 (since any expression\r\ncan be viewed as itself over 1).",[15500],{"_17":15113,"_19":15501,"_41":6},"- The expression to extract the denominator from.",[],{"_17":15504,"_31":15505,"_33":15506,"_19":15506,"_36":15507,"_45":15512,"_47":15513},"sym.diag","sym.diag(values, k?)","Create a diagonal matrix from values.",[15508,15510],{"_17":560,"_19":15509,"_41":6},"Elements for the diagonal",{"_17":4686,"_19":15511,"_41":10},"Diagonal offset (default 0, positive for superdiagonals, negative for subdiagonals)","Matrix",[],{"_17":15515,"_31":15516,"_33":15517,"_19":15518,"_36":15519,"_45":15117,"_47":15521},"sym.digamma","sym.digamma(x)","Computes the digamma function of a symbolic expression.\r","Computes the digamma function of a symbolic expression.\r\n\r\nThe digamma function ψ(x) is the logarithmic derivative of the gamma function:\r\nψ(x) = d/dx ln(Γ(x)) = Γ'(x)/Γ(x). It is also known as the psi function.",[15520],{"_17":405,"_19":15448,"_41":6},[],{"_17":15523,"_31":15524,"_33":15525,"_19":15526,"_36":15527,"_45":15117,"_47":15529},"sym.dirichlet_eta","sym.dirichlet_eta(s)","Computes the Dirichlet eta function of a symbolic expression.\r","Computes the Dirichlet eta function of a symbolic expression.\r\n\r\nThe Dirichlet eta function η(s) is defined as Σ(n=1 to ∞) (-1)^(n-1)/n^s,\r\nwhich is the alternating version of the Riemann zeta function.\r\nIt is related to the zeta function by η(s) = (1 - 2^(1-s)) × ζ(s).",[15528],{"_17":771,"_19":15448,"_41":6},[],{"_17":15531,"_31":15532,"_33":15533,"_19":15533,"_36":15534,"_45":15117,"_47":15539},"sym.div","sym.div(a, b)","Divide two expressions: a / b",[15535,15537],{"_17":664,"_19":15536,"_41":6},"Numerator",{"_17":408,"_19":15538,"_41":6},"Denominator",[],{"_17":15541,"_31":15542,"_33":15543,"_19":15544,"_36":15545,"_45":15548,"_47":15549},"sym.dummy","sym.dummy(name?)","Creates a new unique dummy symbol.\r","Creates a new unique dummy symbol.\r\n\r\nConvenience function equivalent to `new Dummy(name)`.",[15546],{"_17":17,"_19":15547,"_41":10},"Optional name for the dummy.","Dummy",[],{"_17":15551,"_31":15552,"_33":15553,"_19":15553,"_36":15554,"_45":15117,"_47":15555},"sym.EmptySet","sym.EmptySet()","Creates the empty set ∅.",[],[],{"_17":15557,"_31":15558,"_33":15559,"_19":15560,"_36":15561,"_45":15117,"_47":15563},"sym.erf","sym.erf(x)","Computes the error function of a symbolic expression.\r","Computes the error function of a symbolic expression.\r\n\r\nThe error function erf(x) is defined as (2/√π) × ∫₀ˣ e^(-t²) dt.\r\nIt is the integral of the Gaussian distribution and is widely used\r\nin probability, statistics, and partial differential equations.",[15562],{"_17":405,"_19":15448,"_41":6},[],{"_17":15565,"_31":15566,"_33":15567,"_19":15568,"_36":15569,"_45":15117,"_47":15571},"sym.erfc","sym.erfc(x)","Computes the complementary error function of a symbolic expression.\r","Computes the complementary error function of a symbolic expression.\r\n\r\nThe complementary error function erfc(x) is defined as 1 - erf(x),\r\nor equivalently (2/√π) × ∫ₓ^∞ e^(-t²) dt. It is more accurate than\r\ncomputing 1 - erf(x) directly for large x.",[15570],{"_17":405,"_19":15448,"_41":6},[],{"_17":15573,"_31":15574,"_33":15575,"_19":15576,"_36":15577,"_45":15117,"_47":15580},"sym.exp","sym.exp(x)","Computes the exponential function of a symbolic expression.\r","Computes the exponential function of a symbolic expression.\r\n\r\nReturns e raised to the power of x, where e is Euler's number\r\n(approximately 2.71828). For symbolic expressions, creates a\r\nsymbolic exp(x) that can be manipulated algebraically.",[15578],{"_17":405,"_19":15579,"_41":6},"- The exponent (as a symbolic expression).",[],{"_17":15582,"_31":15583,"_33":15584,"_19":15585,"_36":15586,"_45":15117,"_47":15588},"sym.expand","sym.expand(expr)","Expands an expression by distributing multiplication over addition.\r","Expands an expression by distributing multiplication over addition.\r\n\r\nPerforms algebraic expansion of products and powers, converting expressions\r\nlike (a + b)² into a² + 2ab + b².",[15587],{"_17":15113,"_19":15153,"_41":6},[],{"_17":15590,"_31":15591,"_33":15592,"_19":15593,"_36":15594,"_45":15263,"_47":15597},"sym.expand_complex","sym.expand_complex(expr)","Expands a complex expression into its real and imaginary parts.\r","Expands a complex expression into its real and imaginary parts.\r\n\r\nAlias for . Separates a complex expression into\r\nits real and imaginary components.",[15595],{"_17":15113,"_19":15596,"_41":6},"- The complex expression to expand.",[],{"_17":15599,"_31":15600,"_33":15601,"_19":15602,"_36":15603,"_45":15117,"_47":15605},"sym.expand_trig","sym.expand_trig(expr)","Expands trigonometric functions using exponential identities.\r","Expands trigonometric functions using exponential identities.\r\n\r\nConverts trigonometric functions to their exponential form and then\r\nexpands the result. Useful for simplifying products of trig functions.",[15604],{"_17":15113,"_19":15153,"_41":6},[],{"_17":15607,"_31":15608,"_33":15609,"_19":15610,"_36":15611,"_45":15117,"_47":15614},"sym.exprFromWasm","sym.exprFromWasm(obj)","Create an Expr subclass instance from a WASM object based on its type.\r","Create an Expr subclass instance from a WASM object based on its type.\r\nUsed internally and by the matrices module to convert WASM basic pointers to Expr.",[15612],{"_17":10367,"_19":15613,"_41":6},"SymEngineObject",[],{"_17":15616,"_31":15617,"_33":15618,"_19":15618,"_36":15619,"_45":15512,"_47":15625},"sym.eye","sym.eye(n, m?, k?)","Create an identity matrix.",[15620,15622,15624],{"_17":1206,"_19":15621,"_41":6},"Number of rows (and columns if m not specified)",{"_17":630,"_19":15623,"_41":10},"Number of columns (optional, defaults to n)",{"_17":4686,"_19":15511,"_41":10},[],{"_17":15627,"_31":15628,"_33":15629,"_19":15629,"_36":15630,"_45":15117,"_47":15633},"sym.factorial","sym.factorial(n)","Computes the factorial n! = 1 * 2 * 3 * ... * n.",[15631],{"_17":1206,"_19":15632,"_41":6},"- The number (must be non-negative).",[],{"_17":15635,"_31":15636,"_33":15637,"_19":15638,"_36":15639,"_45":15117,"_47":15642},"sym.fibonacci","sym.fibonacci(n)","Computes the nth Fibonacci number.\r","Computes the nth Fibonacci number.\r\n\r\nF(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2)",[15640],{"_17":1206,"_19":15641,"_41":6},"- The index (must be non-negative).",[],{"_17":15644,"_31":15645,"_33":15646,"_19":15647,"_36":15648,"_45":15651,"_47":15652},"sym.fibonacci2","sym.fibonacci2(n)","Computes F(n) and F(n-1) simultaneously.\r","Computes F(n) and F(n-1) simultaneously.\r\n\r\nMore efficient when you need both values.",[15649],{"_17":1206,"_19":15650,"_41":6},"- The index (must be positive).","{\r\n fn: Expr;\r\n fn1: Expr;\r\n}",[],{"_17":15654,"_31":15655,"_33":15656,"_19":15656,"_36":15657,"_45":15117,"_47":15660},"sym.FiniteSet","sym.FiniteSet(args)","Creates a finite set from elements.",[15658],{"_17":9140,"_19":15659,"_41":6},"(number | Expr)[]",[],{"_17":15662,"_31":15663,"_33":15664,"_19":15665,"_36":15666,"_45":15117,"_47":15669},"sym.floor","sym.floor(x)","Computes the floor function of a symbolic expression.\r","Computes the floor function of a symbolic expression.\r\n\r\nReturns the greatest integer less than or equal to x, denoted ⌊x⌋.\r\nAlso known as the integer part or greatest integer function.",[15667],{"_17":405,"_19":15668,"_41":6},"- The expression to compute the floor of.",[],{"_17":15671,"_31":15672,"_33":15673,"_19":15674,"_36":15675,"_45":15117,"_47":15677},"sym.gamma","sym.gamma(x)","Computes the gamma function of a symbolic expression.\r","Computes the gamma function of a symbolic expression.\r\n\r\nThe gamma function Γ(x) extends the factorial to complex numbers.\r\nFor positive integers, Γ(n) = (n-1)!. It satisfies the recurrence\r\nrelation Γ(x+1) = x·Γ(x).",[15676],{"_17":405,"_19":15448,"_41":6},[],{"_17":15679,"_31":15680,"_33":15681,"_19":15682,"_36":15683,"_45":15117,"_47":15688},"sym.gcd","sym.gcd(a, b)","Compute the greatest common divisor of two expressions.\r","Compute the greatest common divisor of two expressions.\r\n\r\nFor integers, returns the largest positive integer that divides both.\r\nFor polynomials, returns the highest degree polynomial that divides both.",[15684,15686],{"_17":664,"_19":15685,"_41":6},"- First expression.",{"_17":408,"_19":15687,"_41":6},"- Second expression.",[],{"_17":15690,"_31":15691,"_33":15692,"_19":15693,"_36":15694,"_45":15697,"_47":15698},"sym.gcdex","sym.gcdex(a, b)","Compute the extended greatest common divisor.\r","Compute the extended greatest common divisor.\r\n\r\nReturns the GCD along with Bezout coefficients s and t such that:\r\ngcd(a, b) = s*a + t*b\r\n\r\nThis is useful for solving Diophantine equations and computing\r\nmodular inverses.",[15695,15696],{"_17":664,"_19":15685,"_41":6},{"_17":408,"_19":15687,"_41":6},"GCDExtResult",[],{"_17":15700,"_31":15701,"_33":15702,"_19":15703,"_36":15704,"_45":15709,"_47":15710},"sym.gcdext","sym.gcdext(a, b)","Computes the extended GCD of two numbers.\r","Computes the extended GCD of two numbers.\r\n\r\nReturns gcd(a, b) along with coefficients s and t such that\r\ngcd = s*a + t*b (Bézout's identity).",[15705,15707],{"_17":664,"_19":15706,"_41":6},"- First number.",{"_17":408,"_19":15708,"_41":6},"- Second number.","ExtendedGCDResult",[],{"_17":15712,"_31":15713,"_33":15714,"_19":15714,"_36":15715,"_45":2598,"_47":15720},"sym.hasSymbol","sym.hasSymbol(expr, symbol)","Checks if an expression contains a specific symbol.",[15716,15718],{"_17":15113,"_19":15717,"_41":6},"- The expression to search in.",{"_17":15129,"_19":15719,"_41":6},"- The symbol to search for.",[],{"_17":15722,"_31":15723,"_33":15724,"_19":15725,"_36":15726,"_45":15117,"_47":15729},"sym.im","sym.im(x)","Extracts the imaginary part of a complex expression.\r","Extracts the imaginary part of a complex expression.\r\n\r\nFor a complex number z = a + bi, im(z) returns b (not bi).\r\nThis function works symbolically on expressions containing\r\nsymbolic variables and the imaginary unit I.",[15727],{"_17":405,"_19":15728,"_41":6},"- The expression to extract the imaginary part from.",[],{"_17":15731,"_31":15732,"_33":15733,"_19":15733,"_36":15734,"_45":15117,"_47":15737},"sym.inf","sym.inf(set)","Computes the infimum (greatest lower bound) of a set.",[15735],{"_17":6153,"_19":15736,"_41":6},"- The set to find the infimum of.",[],{"_17":15739,"_31":15740,"_33":15741,"_19":15741,"_36":15742,"_45":15117,"_47":15743},"sym.Integers","sym.Integers()","Creates the set of integers ℤ.",[],[],{"_17":15745,"_31":15746,"_33":15747,"_19":15747,"_36":15748,"_45":15117,"_47":15751},"sym.interior","sym.interior(set)","Computes the interior of a set.",[15749],{"_17":6153,"_19":15750,"_41":6},"- The set to find the interior of.",[],{"_17":15753,"_31":15754,"_33":15755,"_19":15755,"_36":15756,"_45":15117,"_47":15761},"sym.intersection","sym.intersection(a, b)","Computes the intersection of two sets.",[15757,15759],{"_17":664,"_19":15758,"_41":6},"- First set.",{"_17":408,"_19":15760,"_41":6},"- Second set.",[],{"_17":15763,"_31":15764,"_33":15765,"_19":15765,"_36":15766,"_45":15117,"_47":15777},"sym.Interval","sym.Interval(start, end, leftOpen?, rightOpen?)","Creates an interval.",[15767,15769,15771,15774],{"_17":9323,"_19":15768,"_41":6},"- Start of the interval (can be number or Expr).",{"_17":9326,"_19":15770,"_41":6},"- End of the interval (can be number or Expr).",{"_17":15772,"_19":15773,"_41":10},"leftOpen","- If true, the interval is open on the left (excludes start).",{"_17":15775,"_19":15776,"_41":10},"rightOpen","- If true, the interval is open on the right (excludes end).",[],{"_17":15779,"_31":15780,"_33":15781,"_19":15781,"_36":15782,"_45":2598,"_47":15785},"sym.isComplex","sym.isComplex(expr)","Checks if the expression is a Complex number (exact complex).",[15783],{"_17":15113,"_19":15784,"_41":6},"- The expression to check.",[],{"_17":15787,"_31":15788,"_33":15789,"_19":15789,"_36":15790,"_45":2598,"_47":15792},"sym.isComplexDouble","sym.isComplexDouble(expr)","Checks if the expression is a ComplexDouble (floating-point complex).",[15791],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15794,"_31":15795,"_33":15796,"_19":15797,"_36":15798,"_45":2598,"_47":15800},"sym.isComplexMPC","sym.isComplexMPC(expr)","Checks if the expression is a ComplexMPC (arbitrary-precision complex).\r","Checks if the expression is a ComplexMPC (arbitrary-precision complex).\r\n\r\nNote: This requires MPC support in the build.",[15799],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15802,"_31":15803,"_33":15804,"_19":15804,"_36":15805,"_45":2598,"_47":15808},"sym.isComplexValued","sym.isComplexValued(expr)","Checks if the number is complex-valued (has non-zero imaginary part).",[15806],{"_17":15113,"_19":15807,"_41":6},"- The expression to check (should be a number).",[],{"_17":15810,"_31":15811,"_33":15812,"_19":15812,"_36":15813,"_45":2598,"_47":15815},"sym.isInteger","sym.isInteger(expr)","Checks if the expression is an Integer.",[15814],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15817,"_31":15818,"_33":15819,"_19":15819,"_36":15820,"_45":2598,"_47":15822},"sym.isNegative","sym.isNegative(expr)","Checks if the number is negative.",[15821],{"_17":15113,"_19":15807,"_41":6},[],{"_17":15824,"_31":15825,"_33":15826,"_19":15826,"_36":15827,"_45":2598,"_47":15829},"sym.isNumber","sym.isNumber(expr)","Checks if the expression is a Number (Integer, Rational, Real, Complex).",[15828],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15831,"_31":15832,"_33":15833,"_19":15833,"_36":15834,"_45":2598,"_47":15836},"sym.isPositive","sym.isPositive(expr)","Checks if the number is positive.",[15835],{"_17":15113,"_19":15807,"_41":6},[],{"_17":15838,"_31":15839,"_33":15840,"_19":15840,"_36":15841,"_45":2598,"_47":15846},"sym.isProperSubset","sym.isProperSubset(a, b)","Checks if set a is a proper subset of set b.",[15842,15844],{"_17":664,"_19":15843,"_41":6},"- Potential proper subset.",{"_17":408,"_19":15845,"_41":6},"- Potential superset.",[],{"_17":15848,"_31":15849,"_33":15850,"_19":15850,"_36":15851,"_45":2598,"_47":15856},"sym.isProperSuperset","sym.isProperSuperset(a, b)","Checks if set a is a proper superset of set b.",[15852,15854],{"_17":664,"_19":15853,"_41":6},"- Potential proper superset.",{"_17":408,"_19":15855,"_41":6},"- Potential subset.",[],{"_17":15858,"_31":15859,"_33":15860,"_19":15860,"_36":15861,"_45":2598,"_47":15863},"sym.isRational","sym.isRational(expr)","Checks if the expression is a Rational number.",[15862],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15865,"_31":15866,"_33":15867,"_19":15867,"_36":15868,"_45":2598,"_47":15870},"sym.isRealDouble","sym.isRealDouble(expr)","Checks if the expression is a RealDouble (floating-point real).",[15869],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15872,"_31":15873,"_33":15874,"_19":15875,"_36":15876,"_45":2598,"_47":15878},"sym.isRealMPFR","sym.isRealMPFR(expr)","Checks if the expression is a RealMPFR (arbitrary-precision real).\r","Checks if the expression is a RealMPFR (arbitrary-precision real).\r\n\r\nNote: This requires MPFR support in the build.",[15877],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15880,"_31":15881,"_33":15882,"_19":15882,"_36":15883,"_45":2598,"_47":15885},"sym.isSet","sym.isSet(expr)","Checks if the expression is a Set.",[15884],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15887,"_31":15888,"_33":15889,"_19":15889,"_36":15890,"_45":2598,"_47":15893},"sym.isSubset","sym.isSubset(a, b)","Checks if set a is a subset of set b.",[15891,15892],{"_17":664,"_19":15855,"_41":6},{"_17":408,"_19":15845,"_41":6},[],{"_17":15895,"_31":15896,"_33":15897,"_19":15897,"_36":15898,"_45":2598,"_47":15901},"sym.isSuperset","sym.isSuperset(a, b)","Checks if set a is a superset of set b.",[15899,15900],{"_17":664,"_19":15845,"_41":6},{"_17":408,"_19":15855,"_41":6},[],{"_17":15903,"_31":15904,"_33":15905,"_19":15905,"_36":15906,"_45":2598,"_47":15908},"sym.isSymbol","sym.isSymbol(expr)","Checks if the expression is a Symbol.",[15907],{"_17":15113,"_19":15784,"_41":6},[],{"_17":15910,"_31":15911,"_33":15912,"_19":15912,"_36":15913,"_45":2598,"_47":15915},"sym.isZero","sym.isZero(expr)","Checks if the number has value zero.",[15914],{"_17":15113,"_19":15807,"_41":6},[],{"_17":15917,"_31":15918,"_33":15919,"_19":15920,"_36":15921,"_45":15512,"_47":15927},"sym.jacobian","sym.jacobian(funcs, vars)","Compute the Jacobian matrix of a vector of functions with respect to variables.\r","Compute the Jacobian matrix of a vector of functions with respect to variables.\r\n\r\nThe Jacobian is a matrix of partial derivatives where element (i,j) is\r\nthe partial derivative of the i-th function with respect to the j-th variable.",[15922,15925],{"_17":15923,"_19":15924,"_41":6},"funcs","Column matrix of functions (expressions)",{"_17":7377,"_19":15926,"_41":6},"Column matrix of variables (symbols) to differentiate with respect to",[],{"_17":15929,"_31":15930,"_33":15931,"_19":15932,"_36":15933,"_45":15117,"_47":15938},"sym.kronecker_delta","sym.kronecker_delta(i, j)","Computes the Kronecker delta of two symbolic expressions.\r","Computes the Kronecker delta of two symbolic expressions.\r\n\r\nThe Kronecker delta δ(i, j) equals 1 if i = j and 0 otherwise.\r\nIt is the discrete analog of the Dirac delta function and is\r\nfundamental in linear algebra and tensor analysis.",[15934,15936],{"_17":2433,"_19":15935,"_41":6},"- The first index (as a symbolic expression).",{"_17":2435,"_19":15937,"_41":6},"- The second index (as a symbolic expression).",[],{"_17":15940,"_31":15941,"_33":15942,"_19":15943,"_36":15944,"_45":15951,"_47":15952},"sym.lambdify","sym.lambdify(expr, args, options?)","Converts a symbolic expression to a fast numerical function.\r","Converts a symbolic expression to a fast numerical function.\r\n\r\nCreates a compiled numerical evaluation function that can be called\r\nwith numerical values for the symbols. This is much faster than\r\nusing `evalf()` repeatedly for the same expression structure.",[15945,15947,15949],{"_17":15113,"_19":15946,"_41":6},"- The expression to evaluate.",{"_17":9140,"_19":15948,"_41":6},"- Symbol or array of symbols that will be the function arguments.",{"_17":454,"_19":15950,"_41":10},"- Options for the lambdification.","LambdaFunction",[],{"_17":15954,"_31":15955,"_33":15956,"_19":15957,"_36":15958,"_45":15963,"_47":15964},"sym.lambdifyMulti","sym.lambdifyMulti(exprs, args, options?)","Converts multiple symbolic expressions to a fast numerical function.\r","Converts multiple symbolic expressions to a fast numerical function.\r\n\r\nSimilar to `lambdify`, but returns an array of results for multiple\r\nexpressions evaluated at the same point.",[15959,15961,15962],{"_17":15490,"_19":15960,"_41":6},"- Array of expressions to evaluate.",{"_17":9140,"_19":15948,"_41":6},{"_17":454,"_19":15950,"_41":10},"LambdaFunctionMulti",[],{"_17":15966,"_31":15967,"_33":15968,"_19":15969,"_36":15970,"_45":15117,"_47":15972},"sym.lambertw","sym.lambertw(x)","Computes the Lambert W function of a symbolic expression.\r","Computes the Lambert W function of a symbolic expression.\r\n\r\nThe Lambert W function W(x) is defined as the inverse of f(w) = w*e^w.\r\nThat is, if y = W(x), then y*e^y = x. This function returns the\r\nprincipal branch W₀(x).",[15971],{"_17":405,"_19":15448,"_41":6},[],{"_17":15974,"_31":15975,"_33":15976,"_19":15977,"_36":15978,"_45":15117,"_47":15981},"sym.lcm","sym.lcm(a, b)","Compute the least common multiple of two expressions.\r","Compute the least common multiple of two expressions.\r\n\r\nFor integers, returns the smallest positive integer divisible by both.\r\nFor polynomials, returns the lowest degree polynomial divisible by both.",[15979,15980],{"_17":664,"_19":15685,"_41":6},{"_17":408,"_19":15687,"_41":6},[],{"_17":15983,"_31":15984,"_33":15985,"_19":15986,"_36":15987,"_45":15994,"_47":15995},"sym.linsolve","sym.linsolve(system, symbols)","Solves a system of linear equations.\r","Solves a system of linear equations.\r\n\r\nGiven a system of linear equations and the variables to solve for,\r\nreturns the solution values. Uses Gaussian elimination internally.",[15988,15991],{"_17":15989,"_19":15990,"_41":6},"system","- Array of linear equations (each treated as `expr = 0`).",{"_17":15992,"_19":15993,"_41":6},"symbols","- Array of symbols to solve for.","Expr[]",[],{"_17":15997,"_31":15998,"_33":15999,"_19":15999,"_36":16000,"_45":16001,"_47":16002},"sym.loadWasmModule","sym.loadWasmModule()","Load the WASM module (singleton pattern)",[],"Promise",[],{"_17":16004,"_31":16005,"_33":16006,"_19":16007,"_36":16008,"_45":15117,"_47":16011},"sym.log","sym.log(x)","Computes the natural logarithm of a symbolic expression.\r","Computes the natural logarithm of a symbolic expression.\r\n\r\nReturns the natural (base e) logarithm of x. For symbolic expressions,\r\ncreates a symbolic log(x) that can be manipulated algebraically.",[16009],{"_17":405,"_19":16010,"_41":6},"- The argument (positive real or complex expression).",[],{"_17":16013,"_31":16014,"_33":16015,"_19":16016,"_36":16017,"_45":15117,"_47":16019},"sym.loggamma","sym.loggamma(x)","Computes the log-gamma function of a symbolic expression.\r","Computes the log-gamma function of a symbolic expression.\r\n\r\nThe log-gamma function is defined as log(Γ(x)), which is useful for\r\nnumerical computation when Γ(x) would overflow, and for computing\r\nratios of gamma functions.",[16018],{"_17":405,"_19":15448,"_41":6},[],{"_17":16021,"_31":16022,"_33":16023,"_19":16024,"_36":16025,"_45":15117,"_47":16030},"sym.lowergamma","sym.lowergamma(s, x)","Computes the lower incomplete gamma function of symbolic expressions.\r","Computes the lower incomplete gamma function of symbolic expressions.\r\n\r\nThe lower incomplete gamma function γ(s, x) is defined as the integral\r\nof t^(s-1)e^(-t) from 0 to x. It represents the cumulative distribution\r\nfunction of the gamma distribution (up to normalization).",[16026,16028],{"_17":771,"_19":16027,"_41":6},"- The shape parameter (as a symbolic expression).",{"_17":405,"_19":16029,"_41":6},"- The upper limit of integration (as a symbolic expression).",[],{"_17":16032,"_31":16033,"_33":16034,"_19":16035,"_36":16036,"_45":15117,"_47":16038},"sym.lucas","sym.lucas(n)","Computes the nth Lucas number.\r","Computes the nth Lucas number.\r\n\r\nL(0) = 2, L(1) = 1, L(n) = L(n-1) + L(n-2)",[16037],{"_17":1206,"_19":15641,"_41":6},[],{"_17":16040,"_31":16041,"_33":16042,"_19":16042,"_36":16043,"_45":16045,"_47":16046},"sym.lucas2","sym.lucas2(n)","Computes L(n) and L(n-1) simultaneously.",[16044],{"_17":1206,"_19":15650,"_41":6},"{\r\n ln: Expr;\r\n ln1: Expr;\r\n}",[],{"_17":16048,"_31":16049,"_33":16050,"_19":16051,"_36":16052,"_45":15117,"_47":16055},"sym.Max","sym.Max(args)","Computes the maximum of multiple symbolic expressions.\r","Computes the maximum of multiple symbolic expressions.\r\n\r\nReturns the largest value among the given arguments. For symbolic arguments\r\nthat cannot be compared numerically, returns a symbolic Max expression that\r\nmay simplify when more information is available.",[16053],{"_17":9140,"_19":16054,"_41":6},"- Two or more expressions to find the maximum of.",[],{"_17":16057,"_31":16058,"_33":16059,"_19":16060,"_36":16061,"_45":15117,"_47":16064},"sym.Min","sym.Min(args)","Computes the minimum of multiple symbolic expressions.\r","Computes the minimum of multiple symbolic expressions.\r\n\r\nReturns the smallest value among the given arguments. For symbolic arguments\r\nthat cannot be compared numerically, returns a symbolic Min expression that\r\nmay simplify when more information is available.",[16062],{"_17":9140,"_19":16063,"_41":6},"- Two or more expressions to find the minimum of.",[],{"_17":16066,"_31":16067,"_33":16068,"_19":16068,"_36":16069,"_45":15117,"_47":16074},"sym.mod","sym.mod(n, d)","Computes n mod d (modulo, rounding toward zero).",[16070,16072],{"_17":1206,"_19":16071,"_41":6},"- The dividend.",{"_17":5512,"_19":16073,"_41":6},"- The divisor.",[],{"_17":16076,"_31":16077,"_33":16078,"_19":16079,"_36":16080,"_45":15117,"_47":16083},"sym.modF","sym.modF(n, d)","Computes n mod d (modulo, rounding toward -infinity).\r","Computes n mod d (modulo, rounding toward -infinity).\r\n\r\nThis is the floor division remainder, which always has the same sign as d.",[16081,16082],{"_17":1206,"_19":16071,"_41":6},{"_17":5512,"_19":16073,"_41":6},[],{"_17":16085,"_31":16086,"_33":16087,"_19":16088,"_36":16089,"_45":16094,"_47":16095},"sym.modInverse","sym.modInverse(a, m)","Computes the modular inverse of a modulo m.\r","Computes the modular inverse of a modulo m.\r\n\r\nReturns b such that a*b ≡ 1 (mod m), if it exists.",[16090,16092],{"_17":664,"_19":16091,"_41":6},"- The number to invert.",{"_17":630,"_19":16093,"_41":6},"- The modulus.","Expr | null",[],{"_17":16097,"_31":16098,"_33":16099,"_19":16099,"_36":16100,"_45":15117,"_47":16103},"sym.mul","sym.mul(a, b)","Multiply two expressions: a * b",[16101,16102],{"_17":664,"_19":15242,"_41":6},{"_17":408,"_19":15244,"_41":6},[],{"_17":16105,"_31":16106,"_33":16107,"_19":16108,"_36":16109,"_45":15117,"_47":16113},"sym.N","sym.N(expr, precision?)","Evaluates an expression numerically to the specified precision.\r","Evaluates an expression numerically to the specified precision.\r\n\r\nThis is a convenience function equivalent to `expr.evalf(precision)`.\r\nIt mirrors SymPy's `N()` function.",[16110,16111],{"_17":15113,"_19":15946,"_41":6},{"_17":4907,"_19":16112,"_41":10},"- Number of bits of precision (default: 53, i.e., double precision).",[],{"_17":16115,"_31":16116,"_33":16117,"_19":16117,"_36":16118,"_45":15117,"_47":16121},"sym.neg","sym.neg(a)","Negate an expression: -a",[16119],{"_17":664,"_19":16120,"_41":6},"The operand",[],{"_17":16123,"_31":16124,"_33":16125,"_19":16125,"_36":16126,"_45":2598,"_47":16129},"sym.neq","sym.neq(a, b)","Checks if two expressions are not equal.",[16127,16128],{"_17":664,"_19":15685,"_41":6},{"_17":408,"_19":15687,"_41":6},[],{"_17":16131,"_31":16132,"_33":16133,"_19":16133,"_36":16134,"_45":15117,"_47":16137},"sym.nextprime","sym.nextprime(n)","Finds the next prime number after a given number.",[16135],{"_17":1206,"_19":16136,"_41":6},"- The starting number.",[],{"_17":16139,"_31":16140,"_33":16141,"_19":16141,"_36":16142,"_45":15117,"_47":16145},"sym.ntheory_gcd","sym.ntheory_gcd(a, b)","Computes the greatest common divisor (GCD) of two numbers.",[16143,16144],{"_17":664,"_19":15706,"_41":6},{"_17":408,"_19":15708,"_41":6},[],{"_17":16147,"_31":16148,"_33":16149,"_19":16149,"_36":16150,"_45":15117,"_47":16153},"sym.ntheory_lcm","sym.ntheory_lcm(a, b)","Computes the least common multiple (LCM) of two numbers.",[16151,16152],{"_17":664,"_19":15706,"_41":6},{"_17":408,"_19":15708,"_41":6},[],{"_17":16155,"_31":16156,"_33":16157,"_19":16158,"_36":16159,"_45":15117,"_47":16162},"sym.numer","sym.numer(expr)","Extracts the numerator of a rational expression.\r","Extracts the numerator of a rational expression.\r\n\r\nFor an expression representing a fraction p/q, returns p.\r\nFor non-fractional expressions, returns the expression itself\r\n(since any expression can be viewed as itself over 1).",[16160],{"_17":15113,"_19":16161,"_41":6},"- The expression to extract the numerator from.",[],{"_17":16164,"_31":16165,"_33":16166,"_19":16166,"_36":16167,"_45":15512,"_47":16170},"sym.ones","sym.ones(rows, cols)","Create a matrix of ones.",[16168,16169],{"_17":2401,"_19":3943,"_41":6},{"_17":2391,"_19":3945,"_41":6},[],{"_17":16172,"_31":16173,"_33":16174,"_19":16175,"_36":16176,"_45":15117,"_47":16181},"sym.parse","sym.parse(str, options?)","Parses a mathematical expression from a string.\r","Parses a mathematical expression from a string.\r\n\r\nConverts a string representation of a mathematical expression into\r\na symbolic expression object. Supports standard mathematical notation\r\nincluding:\r\n- Arithmetic operators: `+`, `-`, `*`, `/`, `^` (power)\r\n- Parentheses for grouping\r\n- Function calls: `sin(x)`, `cos(x)`, `exp(x)`, etc.\r\n- Constants: `pi`, `E`, `I` (imaginary unit)\r\n- Scientific notation: `1e-5`, `3.14e2`",[16177,16179],{"_17":4701,"_19":16178,"_41":6},"- The string to parse.",{"_17":454,"_19":16180,"_41":10},"- Parsing options.",[],{"_17":16183,"_31":16184,"_33":16185,"_19":16186,"_36":16187,"_45":15117,"_47":16192},"sym.polygamma","sym.polygamma(n, x)","Computes the polygamma function of symbolic expressions.\r","Computes the polygamma function of symbolic expressions.\r\n\r\nThe polygamma function ψ^(n)(x) is the (n+1)th derivative of the log-gamma function,\r\nor equivalently the nth derivative of the digamma function:\r\nψ^(n)(x) = d^n/dx^n ψ(x) = d^(n+1)/dx^(n+1) ln(Γ(x))",[16188,16190],{"_17":1206,"_19":16189,"_41":6},"- The order of the derivative (n ≥ 0).",{"_17":405,"_19":16191,"_41":6},"- The argument at which to evaluate.",[],{"_17":16194,"_31":16195,"_33":16196,"_19":16196,"_36":16197,"_45":15117,"_47":16202},"sym.pow","sym.pow(base, exp)","Raise to a power: base ** exp",[16198,16200],{"_17":9634,"_19":16199,"_41":6},"The base (Expr or number)",{"_17":4280,"_19":16201,"_41":6},"The exponent (Expr or number)",[],{"_17":16204,"_31":16205,"_33":16206,"_19":16207,"_36":16208,"_45":15117,"_47":16211},"sym.powsimp","sym.powsimp(expr)","Simplifies expressions with powers by combining bases and exponents.\r","Simplifies expressions with powers by combining bases and exponents.\r\n\r\nApplies power rules to simplify expressions involving exponents,\r\nsuch as combining x^a * x^b = x^(a+b).",[16209],{"_17":15113,"_19":16210,"_41":6},"- The expression to simplify.",[],{"_17":16213,"_31":16214,"_33":16215,"_19":16215,"_36":16216,"_45":15117,"_47":16219},"sym.quotient","sym.quotient(n, d)","Computes n / d (quotient, rounding toward zero).",[16217,16218],{"_17":1206,"_19":16071,"_41":6},{"_17":5512,"_19":16073,"_41":6},[],{"_17":16221,"_31":16222,"_33":16223,"_19":16223,"_36":16224,"_45":15117,"_47":16227},"sym.quotientF","sym.quotientF(n, d)","Computes n / d (quotient, rounding toward -infinity).",[16225,16226],{"_17":1206,"_19":16071,"_41":6},{"_17":5512,"_19":16073,"_41":6},[],{"_17":16229,"_31":16230,"_33":16231,"_19":16231,"_36":16232,"_45":16235,"_47":16236},"sym.quotientMod","sym.quotientMod(n, d)","Computes both quotient and remainder at once (rounding toward zero).",[16233,16234],{"_17":1206,"_19":16071,"_41":6},{"_17":5512,"_19":16073,"_41":6},"QuotientModResult",[],{"_17":16238,"_31":16239,"_33":16240,"_19":16240,"_36":16241,"_45":16235,"_47":16244},"sym.quotientModF","sym.quotientModF(n, d)","Computes both quotient and remainder (rounding toward -infinity).",[16242,16243],{"_17":1206,"_19":16071,"_41":6},{"_17":5512,"_19":16073,"_41":6},[],{"_17":16246,"_31":16247,"_33":16248,"_19":16249,"_36":16250,"_45":15117,"_47":16252},"sym.radsimp","sym.radsimp(expr)","Simplifies expressions involving radicals (roots).\r","Simplifies expressions involving radicals (roots).\r\n\r\nRationalizes denominators and simplifies expressions containing\r\nsquare roots, cube roots, and other radicals.",[16251],{"_17":15113,"_19":16210,"_41":6},[],{"_17":16254,"_31":16255,"_33":16256,"_19":16256,"_36":16257,"_45":15117,"_47":16258},"sym.Rationals","sym.Rationals()","Creates the set of rational numbers ℚ.",[],[],{"_17":16260,"_31":16261,"_33":16262,"_19":16263,"_36":16264,"_45":15117,"_47":16267},"sym.re","sym.re(x)","Extracts the real part of a complex expression.\r","Extracts the real part of a complex expression.\r\n\r\nFor a complex number z = a + bi, re(z) returns a.\r\nThis function works symbolically on expressions containing\r\nsymbolic variables and the imaginary unit I.",[16265],{"_17":405,"_19":16266,"_41":6},"- The expression to extract the real part from.",[],{"_17":16269,"_31":16270,"_33":16271,"_19":16271,"_36":16272,"_45":15117,"_47":16273},"sym.Reals","sym.Reals()","Creates the set of real numbers ℝ.",[],[],{"_17":16275,"_31":16276,"_33":16277,"_19":16278,"_36":16279,"_45":15117,"_47":16282},"sym.rewrite_as_cos","sym.rewrite_as_cos(expr)","Rewrites trigonometric functions in terms of cosine only.\r","Rewrites trigonometric functions in terms of cosine only.\r\n\r\nConverts all trigonometric functions in an expression to use only\r\nthe cosine function, using identities like sin(x) = cos(π/2 - x).",[16280],{"_17":15113,"_19":16281,"_41":6},"- The expression to rewrite.",[],{"_17":16284,"_31":16285,"_33":16286,"_19":16287,"_36":16288,"_45":15117,"_47":16290},"sym.rewrite_as_exp","sym.rewrite_as_exp(expr)","Rewrites trigonometric functions in terms of complex exponentials.\r","Rewrites trigonometric functions in terms of complex exponentials.\r\n\r\nUses Euler's formula to convert sine and cosine to exponential form:\r\n- sin(x) = (e^(ix) - e^(-ix)) / (2i)\r\n- cos(x) = (e^(ix) + e^(-ix)) / 2",[16289],{"_17":15113,"_19":16281,"_41":6},[],{"_17":16292,"_31":16293,"_33":16294,"_19":16295,"_36":16296,"_45":15117,"_47":16298},"sym.rewrite_as_sin","sym.rewrite_as_sin(expr)","Rewrites trigonometric functions in terms of sine only.\r","Rewrites trigonometric functions in terms of sine only.\r\n\r\nConverts all trigonometric functions in an expression to use only\r\nthe sine function, using identities like cos(x) = sin(π/2 - x).",[16297],{"_17":15113,"_19":16281,"_41":6},[],{"_17":16300,"_31":16301,"_33":16302,"_19":16303,"_36":16304,"_45":15117,"_47":16306},"sym.sec","sym.sec(x)","Computes the secant of a symbolic expression.\r","Computes the secant of a symbolic expression.\r\n\r\nThe secant function is defined as sec(x) = 1/cos(x), representing\r\nthe ratio of the hypotenuse to the adjacent side.",[16305],{"_17":405,"_19":15439,"_41":6},[],{"_17":16308,"_31":16309,"_33":16310,"_19":16311,"_36":16312,"_45":15117,"_47":16314},"sym.sech","sym.sech(x)","Computes the hyperbolic secant of a symbolic expression.\r","Computes the hyperbolic secant of a symbolic expression.\r\n\r\nThe hyperbolic secant is defined as sech(x) = 1/cosh(x) = 2/(e^x + e^(-x)).",[16313],{"_17":405,"_19":15448,"_41":6},[],{"_17":16316,"_31":16317,"_33":16318,"_19":16319,"_36":16320,"_45":15117,"_47":16323},"sym.sign","sym.sign(x)","Computes the sign (signum) function of a symbolic expression.\r","Computes the sign (signum) function of a symbolic expression.\r\n\r\nReturns -1 if x < 0, 0 if x = 0, and +1 if x > 0. For complex numbers,\r\nreturns x/|x| (the unit complex number in the direction of x).",[16321],{"_17":405,"_19":16322,"_41":6},"- The expression to compute the sign of.",[],{"_17":16325,"_31":16326,"_33":16327,"_19":16328,"_36":16329,"_45":15117,"_47":16333},"sym.simplify","sym.simplify(expr, assumptions?)","Simplifies an expression using heuristic algorithms.\r","Simplifies an expression using heuristic algorithms.\r\n\r\nApplies various simplification rules to reduce an expression to a simpler\r\nequivalent form. This includes combining like terms, canceling common factors,\r\nand applying algebraic identities.\r\n\r\nWhen assumptions are provided, the expression is first refined using those\r\nassumptions before applying simplification rules. This enables simplifications\r\nlike `sqrt(x^2) → x` when `x` is known to be positive.",[16330,16331],{"_17":15113,"_19":16210,"_41":6},{"_17":7526,"_19":16332,"_41":10},"- Optional assumptions about symbols (e.g., x is positive).",[],{"_17":16335,"_31":16336,"_33":16337,"_19":16338,"_36":16339,"_45":15117,"_47":16341},"sym.sin","sym.sin(x)","Computes the sine of a symbolic expression.\r","Computes the sine of a symbolic expression.\r\n\r\nThe sine function returns the ratio of the opposite side to the hypotenuse\r\nin a right triangle. For symbolic expressions, it creates a symbolic sin(x)\r\nthat can be manipulated algebraically.",[16340],{"_17":405,"_19":15439,"_41":6},[],{"_17":16343,"_31":16344,"_33":16345,"_19":16346,"_36":16347,"_45":15117,"_47":16349},"sym.sinh","sym.sinh(x)","Computes the hyperbolic sine of a symbolic expression.\r","Computes the hyperbolic sine of a symbolic expression.\r\n\r\nThe hyperbolic sine is defined as sinh(x) = (e^x - e^(-x)) / 2.\r\nIt represents the y-coordinate of a point on the unit hyperbola.",[16348],{"_17":405,"_19":15448,"_41":6},[],{"_17":16351,"_31":16352,"_33":16353,"_19":16354,"_36":16355,"_45":15994,"_47":16360},"sym.solve","sym.solve(expr, symbol)","Solves an equation for a given symbol.\r","Solves an equation for a given symbol.\r\n\r\nGiven an expression treated as `expr = 0`, finds all values of the symbol\r\nthat satisfy the equation. This is a general solver that can handle\r\npolynomial, rational, and some transcendental equations.",[16356,16358],{"_17":15113,"_19":16357,"_41":6},"- The equation to solve (treated as `expr = 0`).",{"_17":15129,"_19":16359,"_41":6},"- The symbol to solve for.",[],{"_17":16362,"_31":16363,"_33":16364,"_19":16365,"_36":16366,"_45":15994,"_47":16371},"sym.solve_poly","sym.solve_poly(f, x)","Solve a polynomial equation for a variable.\r","Solve a polynomial equation for a variable.\r\n\r\nFinds all solutions to the equation f(x) = 0 where f is a polynomial\r\nin x. Only works when the solution set is finite.",[16367,16369],{"_17":7414,"_19":16368,"_41":6},"- The polynomial equation (set equal to zero).",{"_17":405,"_19":16370,"_41":6},"- The variable to solve for.",[],{"_17":16373,"_31":16374,"_33":16375,"_19":16376,"_36":16377,"_45":15994,"_47":16381},"sym.solve_rational","sym.solve_rational(expr, symbol)","Solves a rational equation for a given symbol.\r","Solves a rational equation for a given symbol.\r\n\r\nSpecialized solver for equations involving ratios of polynomials.\r\nThis solver is more efficient than the general `solve` function\r\nfor purely rational equations.",[16378,16380],{"_17":15113,"_19":16379,"_41":6},"- The rational equation to solve (treated as `expr = 0`).",{"_17":15129,"_19":16359,"_41":6},[],{"_17":16383,"_31":16384,"_33":16385,"_19":16386,"_36":16387,"_45":15994,"_47":16391},"sym.solve_trig","sym.solve_trig(expr, symbol)","Solves a trigonometric equation for a given symbol.\r","Solves a trigonometric equation for a given symbol.\r\n\r\nSpecialized solver for equations involving trigonometric functions\r\n(sin, cos, tan, etc.). Returns finite solutions when possible.",[16388,16390],{"_17":15113,"_19":16389,"_41":6},"- The trigonometric equation to solve (treated as `expr = 0`).",{"_17":15129,"_19":16359,"_41":6},[],{"_17":16393,"_31":16394,"_33":16395,"_19":16396,"_36":16397,"_45":15117,"_47":16399},"sym.sqrt","sym.sqrt(x)","Computes the square root of a symbolic expression.\r","Computes the square root of a symbolic expression.\r\n\r\nReturns the principal square root of x. Equivalent to pow(x, 1/2) or x^(1/2).\r\nFor negative real numbers, returns a complex result involving I.",[16398],{"_17":405,"_19":15364,"_41":6},[],{"_17":16401,"_31":16402,"_33":16403,"_19":16403,"_36":16404,"_45":15117,"_47":16407},"sym.sub","sym.sub(a, b)","Subtract two expressions: a - b",[16405,16406],{"_17":664,"_19":15242,"_41":6},{"_17":408,"_19":15244,"_41":6},[],{"_17":16409,"_31":16410,"_33":16411,"_19":16411,"_36":16412,"_45":15117,"_47":16415},"sym.sup","sym.sup(set)","Computes the supremum (least upper bound) of a set.",[16413],{"_17":6153,"_19":16414,"_41":6},"- The set to find the supremum of.",[],{"_17":16417,"_31":16418,"_33":16419,"_19":16420,"_36":16421,"_45":16427,"_47":16428},"sym.symbols","sym.symbols(names, assumptions?)","Create multiple symbols at once.\r","Create multiple symbols at once.\r\nMirrors sympy.symbols.",[16422,16425],{"_17":16423,"_19":16424,"_41":6},"names","Space-separated or comma-separated symbol names",{"_17":7526,"_19":16426,"_41":10},"Optional assumptions to apply to all symbols","Symbol_2[]",[],{"_17":16430,"_31":16431,"_33":16432,"_19":16433,"_36":16434,"_45":15117,"_47":16436},"sym.tan","sym.tan(x)","Computes the tangent of a symbolic expression.\r","Computes the tangent of a symbolic expression.\r\n\r\nThe tangent function is defined as tan(x) = sin(x)/cos(x), representing\r\nthe ratio of the opposite side to the adjacent side in a right triangle.",[16435],{"_17":405,"_19":15439,"_41":6},[],{"_17":16438,"_31":16439,"_33":16440,"_19":16441,"_36":16442,"_45":15117,"_47":16444},"sym.tanh","sym.tanh(x)","Computes the hyperbolic tangent of a symbolic expression.\r","Computes the hyperbolic tangent of a symbolic expression.\r\n\r\nThe hyperbolic tangent is defined as tanh(x) = sinh(x)/cosh(x) = (e^x - e^(-x))/(e^x + e^(-x)).\r\nIt is a sigmoid-like function bounded between -1 and 1.",[16443],{"_17":405,"_19":15448,"_41":6},[],{"_17":16446,"_31":16447,"_33":16448,"_19":16449,"_36":16450,"_45":1793,"_47":16453},"sym.toCCode","sym.toCCode(expr)","Converts an expression to C code.\r","Converts an expression to C code.\r\n\r\nGenerates a C code string that evaluates the expression.\r\nUseful for code generation and numerical computation.",[16451],{"_17":15113,"_19":16452,"_41":6},"- The expression to convert.",[],{"_17":16455,"_31":16456,"_33":16457,"_19":16458,"_36":16459,"_45":1793,"_47":16461},"sym.toJSCode","sym.toJSCode(expr)","Converts an expression to JavaScript code.\r","Converts an expression to JavaScript code.\r\n\r\nGenerates a JavaScript code string that evaluates the expression.\r\nUseful for generating runtime code or numerical computation.",[16460],{"_17":15113,"_19":16452,"_41":6},[],{"_17":16463,"_31":16464,"_33":16465,"_19":16466,"_36":16467,"_45":1793,"_47":16469},"sym.toJuliaCode","sym.toJuliaCode(expr)","Converts an expression to Julia code.\r","Converts an expression to Julia code.\r\n\r\nGenerates a Julia code string that evaluates the expression.\r\nUseful for interoperability with Julia-based numerical computation.",[16468],{"_17":15113,"_19":16452,"_41":6},[],{"_17":16471,"_31":16472,"_33":16473,"_19":16474,"_36":16475,"_45":1793,"_47":16477},"sym.toLatex","sym.toLatex(expr)","Converts an expression to LaTeX format.\r","Converts an expression to LaTeX format.\r\n\r\nGenerates a LaTeX string representation suitable for rendering\r\nin mathematical documents or web pages using MathJax/KaTeX.",[16476],{"_17":15113,"_19":16452,"_41":6},[],{"_17":16479,"_31":16480,"_33":16481,"_19":16482,"_36":16483,"_45":1793,"_47":16485},"sym.toMathML","sym.toMathML(expr)","Converts an expression to MathML format.\r","Converts an expression to MathML format.\r\n\r\nGenerates a MathML string representation for web-based\r\nmathematical rendering.",[16484],{"_17":15113,"_19":16452,"_41":6},[],{"_17":16487,"_31":16488,"_33":16489,"_19":16490,"_36":16491,"_45":15117,"_47":16493},"sym.trigsimp","sym.trigsimp(expr)","Simplifies trigonometric expressions using trigonometric identities.\r","Simplifies trigonometric expressions using trigonometric identities.\r\n\r\nApplies identities such as sin²(x) + cos²(x) = 1 to simplify\r\nexpressions involving trigonometric functions.",[16492],{"_17":15113,"_19":16210,"_41":6},[],{"_17":16495,"_31":16496,"_33":16497,"_19":16497,"_36":16498,"_45":15117,"_47":16501},"sym.union","sym.union(a, b)","Computes the union of two sets.",[16499,16500],{"_17":664,"_19":15758,"_41":6},{"_17":408,"_19":15760,"_41":6},[],{"_17":16503,"_31":16504,"_33":16505,"_19":16505,"_36":16506,"_45":15117,"_47":16507},"sym.UniversalSet","sym.UniversalSet()","Creates the universal set (contains all elements).",[],[],{"_17":16509,"_31":16510,"_33":16511,"_19":16512,"_36":16513,"_45":15117,"_47":16517},"sym.uppergamma","sym.uppergamma(s, x)","Computes the upper incomplete gamma function of symbolic expressions.\r","Computes the upper incomplete gamma function of symbolic expressions.\r\n\r\nThe upper incomplete gamma function Γ(s, x) is defined as the integral\r\nof t^(s-1)e^(-t) from x to infinity. It's the complement of the lower\r\nincomplete gamma function.",[16514,16515],{"_17":771,"_19":16027,"_41":6},{"_17":405,"_19":16516,"_41":6},"- The lower limit of integration (as a symbolic expression).",[],{"_17":16519,"_31":16520,"_33":16521,"_19":16521,"_36":16522,"_45":15512,"_47":16525},"sym.zeros","sym.zeros(rows, cols)","Create a matrix of zeros.",[16523,16524],{"_17":2401,"_19":3943,"_41":6},{"_17":2391,"_19":3945,"_41":6},[],{"_17":16527,"_31":16528,"_33":16529,"_19":16530,"_36":16531,"_45":15117,"_47":16533},"sym.zeta","sym.zeta(s)","Computes the Riemann zeta function of a symbolic expression.\r","Computes the Riemann zeta function of a symbolic expression.\r\n\r\nThe Riemann zeta function ζ(s) is defined as Σ(n=1 to ∞) 1/n^s for Re(s) > 1,\r\nand extended to other values by analytic continuation. It is fundamental\r\nin number theory and has deep connections to the distribution of prime numbers.",[16532],{"_17":771,"_19":15448,"_41":6},[],{"_15":16535,"_17":16536,"_19":16537,"_21":22,"_23":5036,"_25":16538,"_27":16539},"eigen-generated","Linear Algebra (Eigen)","Eigen linear algebra library for matrix operations.","eigen",[16540,16548,16555,16561,16569,16576,16585,16593,16599,16609,16619,16628,16636,16644,16652,16661,16672,16682,16690,16697,16706,16714,16724,16732,16740,16748,16755,16762,16769,16778,16785,16794,16803,16812,16821,16828,16839,16848,16856,16863,16871,16878,16886,16897,16905,16914,16922,16929,16940,16947,16954,16961,16968,16976,16986,16996,17005,17015,17023,17031,17041,17048,17057,17065,17073,17082,17090,17098,17105,17113,17123,17136,17146,17154,17162,17170,17177,17184,17191,17198,17205,17212,17219,17226,17233,17240,17247,17254,17261,17270,17277,17285,17294,17301,17309,17317,17325,17333,17341,17349,17357,17365,17373,17380,17387,17393,17401,17408,17417,17424,17432,17443,17453,17466,17473,17483,17497,17504,17513,17521,17530,17540,17548,17555,17563,17570,17578,17586,17596,17606,17616,17624,17635,17645,17653,17662,17671,17680,17688,17698,17705,17714,17722,17729,17745,17756,17767,17775,17784,17791,17798,17809,17822,17832,17842,17850,17857,17867,17879,17891,17898,17905,17919,17929,17949,17958,17966,17975,17984,17992,18005,18013,18022,18031,18043,18054,18064,18074,18081,18087,18094,18101,18112,18121,18130,18138,18146,18153,18162,18174,18183,18193,18202,18211,18219,18228,18236,18243,18252,18261,18270,18278,18286,18293,18302,18309,18318,18325,18336,18343,18350,18361,18371,18379,18388,18397,18404,18411,18419,18427,18434,18444,18452,18462,18470,18479,18487,18495,18502,18509,18516,18523,18531,18539,18546,18553,18560,18569,18577,18584,18590,18596,18602,18608,18614,18621,18629],{"_17":16541,"_31":16542,"_33":16543,"_19":16544,"_36":16545,"_45":46,"_47":16547},"eigen.core.configureEigen","eigen.core.configureEigen(config)","Configure the Eigen WASM module loader.\r","Configure the Eigen WASM module loader.\r\n\r\nMust be called before loadEigenModule() if custom configuration is needed.",[16546],{"_17":3805,"_19":8788,"_41":6},[],{"_17":16549,"_31":16550,"_33":16551,"_19":16551,"_36":16552,"_45":16553,"_47":16554},"eigen.core.getEigenModule","eigen.core.getEigenModule()","Get the loaded Eigen WASM module.",[],"EigenModule",[],{"_17":16556,"_31":16557,"_33":16558,"_19":16558,"_36":16559,"_45":2598,"_47":16560},"eigen.core.isEigenLoaded","eigen.core.isEigenLoaded()","Check if the Eigen WASM module has been loaded.",[],[],{"_17":16562,"_31":16563,"_33":16564,"_19":16565,"_36":16566,"_45":16567,"_47":16568},"eigen.core.loadEigenModule","eigen.core.loadEigenModule()","Load and initialize the Eigen WASM module.\r","Load and initialize the Eigen WASM module.\r\n\r\nThis function is safe to call multiple times - the module is only loaded once\r\nand subsequent calls return the cached module.",[],"Promise",[],{"_17":16570,"_31":16571,"_33":16572,"_19":16573,"_36":16574,"_45":46,"_47":16575},"eigen.core.resetEigenModule","eigen.core.resetEigenModule()","Reset the Eigen WASM module state.\r","Reset the Eigen WASM module state.\r\n\r\nThis clears the cached module and allows reconfiguration.\r\nUseful for testing or when module needs to be reloaded.",[],[],{"_17":16577,"_31":16578,"_33":16579,"_19":16580,"_36":16581,"_45":1387,"_47":16584},"eigen.core.allocateFloat64Array","eigen.core.allocateFloat64Array(size)","Eigen WASM Memory Management Utilities\r","Eigen WASM Memory Management Utilities\r\n\r\nHelper functions for managing memory transfers between JavaScript and WASM.\r\nEigen uses column-major storage order (Fortran-style), same as LAPACK.",[16582],{"_17":1865,"_19":16583,"_41":6},"- Number of float64 elements to allocate",[],{"_17":16586,"_31":16587,"_33":16588,"_19":16588,"_36":16589,"_45":1387,"_47":16592},"eigen.core.allocateInt32Array","eigen.core.allocateInt32Array(size)","Allocate memory for an Int32Array on the WASM heap.",[16590],{"_17":1865,"_19":16591,"_41":6},"- Number of int32 elements to allocate",[],{"_17":16594,"_31":16595,"_33":16596,"_19":16596,"_36":16597,"_45":1387,"_47":16598},"eigen.core.allocatePointer","eigen.core.allocatePointer()","Allocate memory for a pointer (used for output parameters).",[],[],{"_17":16600,"_31":16601,"_33":16602,"_19":16602,"_36":16603,"_45":506,"_47":16608},"eigen.core.columnMajorToRowMajor","eigen.core.columnMajorToRowMajor(data, rows, cols)","Convert a column-major Float64Array to 2D row-major array.",[16604,16606,16607],{"_17":1215,"_19":16605,"_41":6},"- Column-major data",{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":16610,"_31":16611,"_33":16612,"_19":16612,"_36":16613,"_45":1130,"_47":16618},"eigen.core.copyFromWasm","eigen.core.copyFromWasm(ptr, size)","Copy data from WASM heap memory to a new Float64Array.",[16614,16616],{"_17":310,"_19":16615,"_41":6},"- Pointer to source data in WASM memory",{"_17":1865,"_19":16617,"_41":6},"- Number of float64 elements to copy",[],{"_17":16620,"_31":16621,"_33":16622,"_19":16622,"_36":16623,"_45":422,"_47":16627},"eigen.core.copyInt32FromWasm","eigen.core.copyInt32FromWasm(ptr, size)","Copy Int32 data from WASM heap memory to a new Int32Array.",[16624,16625],{"_17":310,"_19":16615,"_41":6},{"_17":1865,"_19":16626,"_41":6},"- Number of int32 elements to copy",[],{"_17":16629,"_31":16630,"_33":16631,"_19":16631,"_36":16632,"_45":1387,"_47":16635},"eigen.core.copyInt32ToWasm","eigen.core.copyInt32ToWasm(data)","Copy Int32 data to WASM heap memory.",[16633],{"_17":1215,"_19":16634,"_41":6},"- Source data (Int32Array or number[])",[],{"_17":16637,"_31":16638,"_33":16639,"_19":16639,"_36":16640,"_45":1387,"_47":16643},"eigen.core.copyToWasm","eigen.core.copyToWasm(data)","Copy a JavaScript array to WASM heap memory.",[16641],{"_17":1215,"_19":16642,"_41":6},"- Source data (Float64Array or number[])",[],{"_17":16645,"_31":16646,"_33":16647,"_19":16647,"_36":16648,"_45":46,"_47":16651},"eigen.core.freeMemory","eigen.core.freeMemory(ptr)","Free memory on the WASM heap.",[16649],{"_17":310,"_19":16650,"_41":6},"- Pointer to free (obtained from allocate* functions or _malloc)",[],{"_17":16653,"_31":16654,"_33":16655,"_19":16655,"_36":16656,"_45":1387,"_47":16660},"eigen.core.readPointer","eigen.core.readPointer(ptrPtr)","Read a pointer value from WASM memory.",[16657],{"_17":16658,"_19":16659,"_41":6},"ptrPtr","- Pointer to the pointer to read",[],{"_17":16662,"_31":16663,"_33":16664,"_19":16665,"_36":16666,"_45":16670,"_47":16671},"eigen.core.rowMajorToColumnMajor","eigen.core.rowMajorToColumnMajor(arr2d)","Convert a 2D row-major array to column-major Float64Array.\r","Convert a 2D row-major array to column-major Float64Array.\r\n\r\nEigen uses column-major storage (like Fortran/MATLAB), while JavaScript\r\ntypically uses row-major ordering. This function converts between them.",[16667],{"_17":16668,"_19":16669,"_41":6},"arr2d","- 2D array in row-major order (arr[row][col])","{\r\n data: Float64Array;\r\n rows: number;\r\n cols: number;\r\n}",[],{"_17":16673,"_31":16674,"_33":16675,"_19":16675,"_36":16676,"_45":1130,"_47":16681},"eigen.core.viewWasmMemory","eigen.core.viewWasmMemory(ptr, size)","Create a view into WASM heap memory without copying.",[16677,16679],{"_17":310,"_19":16678,"_41":6},"- Pointer to data in WASM memory",{"_17":1865,"_19":16680,"_41":6},"- Number of float64 elements",[],{"_17":16683,"_31":16684,"_33":16685,"_19":16686,"_36":16687,"_45":16688,"_47":16689},"eigen.core.getEigenWrappers","eigen.core.getEigenWrappers()","Get type-safe wrapped functions for all Eigen WASM operations.\r","Get type-safe wrapped functions for all Eigen WASM operations.\r\n\r\nThe wrappers are cached after first creation for performance.",[],"EigenWrappers",[],{"_17":16691,"_31":16692,"_33":16693,"_19":16694,"_36":16695,"_45":46,"_47":16696},"eigen.core.resetWrappers","eigen.core.resetWrappers()","Reset the cached wrappers.\r","Reset the cached wrappers.\r\n\r\nCalled internally when the module is reset.",[],[],{"_17":16698,"_31":16699,"_33":16700,"_19":16700,"_36":16701,"_45":16704,"_47":16705},"eigen.decompositions.cholesky","eigen.decompositions.cholesky(A)","Compute Cholesky decomposition: A = LL^T",[16702],{"_17":1163,"_19":16703,"_41":6},"- Symmetric positive-definite matrix","CholeskyResult",[],{"_17":16707,"_31":16708,"_33":16709,"_19":16709,"_36":16710,"_45":2598,"_47":16713},"eigen.decompositions.isPositiveDefinite","eigen.decompositions.isPositiveDefinite(A)","Check if a matrix is positive-definite by attempting Cholesky decomposition.",[16711],{"_17":1163,"_19":16712,"_41":6},"- Symmetric matrix",[],{"_17":16715,"_31":16716,"_33":16717,"_19":16717,"_36":16718,"_45":2598,"_47":16723},"eigen.decompositions.isSymmetric","eigen.decompositions.isSymmetric(A, tol?)","Check if a matrix is symmetric within a tolerance.",[16719,16721],{"_17":1163,"_19":16720,"_41":6},"- Matrix to check",{"_17":470,"_19":16722,"_41":10},"- Tolerance for element comparison (default: 1e-10)",[],{"_17":16725,"_31":16726,"_33":16727,"_19":16727,"_36":16728,"_45":16730,"_47":16731},"eigen.decompositions.eig","eigen.decompositions.eig(A)","Compute eigenvalue decomposition for general (non-symmetric) matrices.",[16729],{"_17":1163,"_19":12586,"_41":6},"EigResult",[],{"_17":16733,"_31":16734,"_33":16735,"_19":16735,"_36":16736,"_45":16738,"_47":16739},"eigen.decompositions.eigSymmetric","eigen.decompositions.eigSymmetric(A)","Compute eigenvalue decomposition for symmetric matrices: A = V * D * V^T",[16737],{"_17":1163,"_19":16712,"_41":6},"EigSymmetricResult",[],{"_17":16741,"_31":16742,"_33":16743,"_19":16743,"_36":16744,"_45":16746,"_47":16747},"eigen.decompositions.eigvals","eigen.decompositions.eigvals(A)","Compute eigenvalues only for general matrices.",[16745],{"_17":1163,"_19":12586,"_41":6},"{\r\n real: Float64Array;\r\n imag: Float64Array;\r\n}",[],{"_17":16749,"_31":16750,"_33":16751,"_19":16751,"_36":16752,"_45":1130,"_47":16754},"eigen.decompositions.eigvalsSymmetric","eigen.decompositions.eigvalsSymmetric(A)","Compute eigenvalues only for symmetric matrices.",[16753],{"_17":1163,"_19":16712,"_41":6},[],{"_17":16756,"_31":16757,"_33":16758,"_19":16758,"_36":16759,"_45":2598,"_47":16761},"eigen.decompositions.hasNegativeEigenvalues","eigen.decompositions.hasNegativeEigenvalues(A)","Check if all eigenvalues have negative real parts.",[16760],{"_17":1163,"_19":12586,"_41":6},[],{"_17":16763,"_31":16764,"_33":16765,"_19":16765,"_36":16766,"_45":2598,"_47":16768},"eigen.decompositions.hasPositiveEigenvalues","eigen.decompositions.hasPositiveEigenvalues(A)","Check if all eigenvalues have positive real parts.",[16767],{"_17":1163,"_19":12586,"_41":6},[],{"_17":16770,"_31":16771,"_33":16772,"_19":16772,"_36":16773,"_45":2598,"_47":16777},"eigen.decompositions.hasRealEigenvalues","eigen.decompositions.hasRealEigenvalues(A, tol?)","Check if all eigenvalues are real (within tolerance).",[16774,16775],{"_17":1163,"_19":12586,"_41":6},{"_17":470,"_19":16776,"_41":10},"- Tolerance for imaginary parts (default: 1e-10)",[],{"_17":16779,"_31":16780,"_33":16781,"_19":16781,"_36":16782,"_45":1387,"_47":16784},"eigen.decompositions.spectralRadius","eigen.decompositions.spectralRadius(A)","Compute the spectral radius of a matrix.",[16783],{"_17":1163,"_19":12586,"_41":6},[],{"_17":16786,"_31":16787,"_33":16788,"_19":16788,"_36":16789,"_45":2598,"_47":16793},"eigen.decompositions.isSingular","eigen.decompositions.isSingular(A, tol?)","Check if a matrix is singular (has zero or near-zero determinant).",[16790,16791],{"_17":1163,"_19":12586,"_41":6},{"_17":470,"_19":16792,"_41":10},"- Tolerance for zero comparison (default: 1e-14)",[],{"_17":16795,"_31":16796,"_33":16797,"_19":16797,"_36":16798,"_45":16801,"_47":16802},"eigen.decompositions.lu","eigen.decompositions.lu(A)","Compute LU decomposition with partial pivoting: PA = LU",[16799],{"_17":1163,"_19":16800,"_41":6},"- Square matrix to decompose","LUResult",[],{"_17":16804,"_31":16805,"_33":16806,"_19":16806,"_36":16807,"_45":16810,"_47":16811},"eigen.decompositions.qr","eigen.decompositions.qr(A)","Compute QR decomposition: A = QR",[16808],{"_17":1163,"_19":16809,"_41":6},"- Matrix to decompose (m × n)","QRResult",[],{"_17":16813,"_31":16814,"_33":16815,"_19":16815,"_36":16816,"_45":1387,"_47":16820},"eigen.decompositions.rankQR","eigen.decompositions.rankQR(A, tol?)","Compute the numerical rank of a matrix using QR decomposition.",[16817,16818],{"_17":1163,"_19":10134,"_41":6},{"_17":470,"_19":16819,"_41":10},"- Tolerance for zero diagonal elements (default: 1e-10)",[],{"_17":16822,"_31":16823,"_33":16824,"_19":16824,"_36":16825,"_45":1387,"_47":16827},"eigen.decompositions.condSVD","eigen.decompositions.condSVD(A)","Compute the condition number of a matrix using SVD.",[16826],{"_17":1163,"_19":10134,"_41":6},[],{"_17":16829,"_31":16830,"_33":16831,"_19":16831,"_36":16832,"_45":16837,"_47":16838},"eigen.decompositions.pinv","eigen.decompositions.pinv(A, tol?)","Compute the Moore-Penrose pseudoinverse using SVD.",[16833,16835],{"_17":1163,"_19":16834,"_41":6},"- Matrix (m × n)",{"_17":470,"_19":16836,"_41":10},"- Tolerance for zero singular values","MatrixHandle",[],{"_17":16840,"_31":16841,"_33":16842,"_19":16842,"_36":16843,"_45":1387,"_47":16847},"eigen.decompositions.rankSVD","eigen.decompositions.rankSVD(A, tol?)","Compute the numerical rank of a matrix using SVD.",[16844,16845],{"_17":1163,"_19":10134,"_41":6},{"_17":470,"_19":16846,"_41":10},"- Tolerance for zero singular values (default: max(m,n) * eps * s[0])",[],{"_17":16849,"_31":16850,"_33":16851,"_19":16851,"_36":16852,"_45":16854,"_47":16855},"eigen.decompositions.svd","eigen.decompositions.svd(A)","Compute the Singular Value Decomposition: A = U * diag(S) * V^T",[16853],{"_17":1163,"_19":16809,"_41":6},"SVDResult",[],{"_17":16857,"_31":16858,"_33":16859,"_19":16859,"_36":16860,"_45":1130,"_47":16862},"eigen.decompositions.svdvals","eigen.decompositions.svdvals(A)","Compute only the singular values of a matrix.",[16861],{"_17":1163,"_19":16834,"_41":6},[],{"_17":16864,"_31":16865,"_33":16866,"_19":16866,"_36":16867,"_45":1387,"_47":16870},"eigen.dense.cols","eigen.dense.cols(A)","Get the number of columns in a matrix.",[16868],{"_17":1163,"_19":16869,"_41":6},"- Matrix handle",[],{"_17":16872,"_31":16873,"_33":16874,"_19":16874,"_36":16875,"_45":1387,"_47":16877},"eigen.dense.dataPtr","eigen.dense.dataPtr(A)","Get the raw data pointer for a matrix.",[16876],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16879,"_31":16880,"_33":16881,"_19":16881,"_36":16882,"_45":46,"_47":16885},"eigen.dense.destroy","eigen.dense.destroy(A)","Free the memory associated with a matrix.",[16883],{"_17":1163,"_19":16884,"_41":6},"- Matrix handle to destroy",[],{"_17":16887,"_31":16888,"_33":16889,"_19":16889,"_36":16890,"_45":1387,"_47":16896},"eigen.dense.get","eigen.dense.get(A, i, j)","Get a single element from a matrix.",[16891,16892,16894],{"_17":1163,"_19":16869,"_41":6},{"_17":2433,"_19":16893,"_41":6},"- Row index (0-based)",{"_17":2435,"_19":16895,"_41":6},"- Column index (0-based)",[],{"_17":16898,"_31":16899,"_33":16900,"_19":16900,"_36":16901,"_45":1130,"_47":16904},"eigen.dense.getCol","eigen.dense.getCol(A, j)","Get a column from a matrix as a Float64Array.",[16902,16903],{"_17":1163,"_19":16869,"_41":6},{"_17":2435,"_19":16895,"_41":6},[],{"_17":16906,"_31":16907,"_33":16908,"_19":16908,"_36":16909,"_45":1130,"_47":16913},"eigen.dense.getDiag","eigen.dense.getDiag(A, k?)","Get the diagonal of a matrix as a Float64Array.",[16910,16911],{"_17":1163,"_19":16869,"_41":6},{"_17":4686,"_19":16912,"_41":10},"- Diagonal offset (0 = main diagonal, >0 = above, <0 = below)",[],{"_17":16915,"_31":16916,"_33":16917,"_19":16917,"_36":16918,"_45":1130,"_47":16921},"eigen.dense.getRow","eigen.dense.getRow(A, i)","Get a row from a matrix as a Float64Array.",[16919,16920],{"_17":1163,"_19":16869,"_41":6},{"_17":2433,"_19":16893,"_41":6},[],{"_17":16923,"_31":16924,"_33":16925,"_19":16925,"_36":16926,"_45":1387,"_47":16928},"eigen.dense.rows","eigen.dense.rows(A)","Get the number of rows in a matrix.",[16927],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16930,"_31":16931,"_33":16932,"_19":16932,"_36":16933,"_45":46,"_47":16939},"eigen.dense.set","eigen.dense.set(A, i, j, value)","Set a single element in a matrix.",[16934,16935,16936,16937],{"_17":1163,"_19":16869,"_41":6},{"_17":2433,"_19":16893,"_41":6},{"_17":2435,"_19":16895,"_41":6},{"_17":514,"_19":16938,"_41":6},"- Value to set",[],{"_17":16941,"_31":16942,"_33":16943,"_19":16943,"_36":16944,"_45":11162,"_47":16946},"eigen.dense.shape","eigen.dense.shape(A)","Get the shape of a matrix as [rows, cols].",[16945],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16948,"_31":16949,"_33":16950,"_19":16950,"_36":16951,"_45":1387,"_47":16953},"eigen.dense.size","eigen.dense.size(A)","Get the total number of elements in a matrix.",[16952],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16955,"_31":16956,"_33":16957,"_19":16957,"_36":16958,"_45":1130,"_47":16960},"eigen.dense.toArray","eigen.dense.toArray(A)","Convert a matrix to a Float64Array (column-major order).",[16959],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16962,"_31":16963,"_33":16964,"_19":16964,"_36":16965,"_45":506,"_47":16967},"eigen.dense.toArray2D","eigen.dense.toArray2D(A)","Convert a matrix to a 2D JavaScript array (row-major order).",[16966],{"_17":1163,"_19":16869,"_41":6},[],{"_17":16969,"_31":16970,"_33":16971,"_19":16972,"_36":16973,"_45":16837,"_47":16975},"eigen.dense.abs","eigen.dense.abs(A)","Eigenwasm - High-level TypeScript API for Eigen Linear Algebra Library\r","Eigenwasm - High-level TypeScript API for Eigen Linear Algebra Library\r\n\r\nThis package provides TypeScript bindings for the Eigen C++ linear algebra library\r\ncompiled to WebAssembly. It offers both functional and object-oriented APIs for\r\ndense matrices, vectors, sparse matrices, decompositions, and linear solvers.",[16974],{"_17":1163,"_19":10134,"_41":6},[],{"_17":16977,"_31":16978,"_33":16979,"_19":16979,"_36":16980,"_45":16837,"_47":16985},"eigen.dense.add","eigen.dense.add(A, B)","Add two matrices: C = A + B",[16981,16983],{"_17":1163,"_19":16982,"_41":6},"- First matrix",{"_17":1166,"_19":16984,"_41":6},"- Second matrix (must have same dimensions as A)",[],{"_17":16987,"_31":16988,"_33":16989,"_19":16989,"_36":16990,"_45":16837,"_47":16995},"eigen.dense.addScalar","eigen.dense.addScalar(A, scalar)","Add a scalar to all elements: C = A + scalar",[16991,16992],{"_17":1163,"_19":10134,"_41":6},{"_17":16993,"_19":16994,"_41":6},"scalar","- Scalar value to add",[],{"_17":16997,"_31":16998,"_33":16999,"_19":16999,"_36":17000,"_45":16837,"_47":17004},"eigen.dense.divScalar","eigen.dense.divScalar(A, scalar)","Divide all elements by a scalar: C = A / scalar",[17001,17002],{"_17":1163,"_19":10134,"_41":6},{"_17":16993,"_19":17003,"_41":6},"- Scalar divisor",[],{"_17":17006,"_31":17007,"_33":17008,"_19":17008,"_36":17009,"_45":16837,"_47":17014},"eigen.dense.elementDiv","eigen.dense.elementDiv(A, B)","Element-wise division: C = A ./ B",[17010,17012],{"_17":1163,"_19":17011,"_41":6},"- First matrix (numerator)",{"_17":1166,"_19":17013,"_41":6},"- Second matrix (denominator, must have same dimensions as A)",[],{"_17":17016,"_31":17017,"_33":17018,"_19":17018,"_36":17019,"_45":16837,"_47":17022},"eigen.dense.elementMul","eigen.dense.elementMul(A, B)","Element-wise multiplication: C = A .* B",[17020,17021],{"_17":1163,"_19":16982,"_41":6},{"_17":1166,"_19":16984,"_41":6},[],{"_17":17024,"_31":17025,"_33":17026,"_19":17026,"_36":17027,"_45":16837,"_47":17030},"eigen.dense.elementPow","eigen.dense.elementPow(A, p)","Compute the power of each element: C = A .^ p",[17028,17029],{"_17":1163,"_19":10134,"_41":6},{"_17":5212,"_19":1007,"_41":6},[],{"_17":17032,"_31":17033,"_33":17034,"_19":17034,"_36":17035,"_45":16837,"_47":17040},"eigen.dense.mul","eigen.dense.mul(A, B)","Multiply two matrices: C = A * B",[17036,17038],{"_17":1163,"_19":17037,"_41":6},"- First matrix (m × k)",{"_17":1166,"_19":17039,"_41":6},"- Second matrix (k × n)",[],{"_17":17042,"_31":17043,"_33":17044,"_19":17044,"_36":17045,"_45":16837,"_47":17047},"eigen.dense.neg","eigen.dense.neg(A)","Negate a matrix: C = -A",[17046],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17049,"_31":17050,"_33":17051,"_19":17051,"_36":17052,"_45":16837,"_47":17056},"eigen.dense.scale","eigen.dense.scale(A, scalar)","Multiply a matrix by a scalar: C = A * scalar",[17053,17054],{"_17":1163,"_19":10134,"_41":6},{"_17":16993,"_19":17055,"_41":6},"- Scalar value",[],{"_17":17058,"_31":17059,"_33":17060,"_19":17060,"_36":17061,"_45":16837,"_47":17064},"eigen.dense.sqrt","eigen.dense.sqrt(A)","Compute element-wise square root: C = sqrt(A)",[17062],{"_17":1163,"_19":17063,"_41":6},"- Matrix (elements should be non-negative)",[],{"_17":17066,"_31":17067,"_33":17068,"_19":17068,"_36":17069,"_45":16837,"_47":17072},"eigen.dense.sub","eigen.dense.sub(A, B)","Subtract two matrices: C = A - B",[17070,17071],{"_17":1163,"_19":16982,"_41":6},{"_17":1166,"_19":16984,"_41":6},[],{"_17":17074,"_31":17075,"_33":17076,"_19":17076,"_36":17077,"_45":16837,"_47":17081},"eigen.dense.subScalar","eigen.dense.subScalar(A, scalar)","Subtract a scalar from all elements: C = A - scalar",[17078,17079],{"_17":1163,"_19":10134,"_41":6},{"_17":16993,"_19":17080,"_41":6},"- Scalar value to subtract",[],{"_17":17083,"_31":17084,"_33":17085,"_19":17085,"_36":17086,"_45":16837,"_47":17089},"eigen.dense.clone","eigen.dense.clone(A)","Create a deep copy of a matrix.",[17087],{"_17":1163,"_19":17088,"_41":6},"- Matrix handle to copy",[],{"_17":17091,"_31":17092,"_33":17093,"_19":17093,"_36":17094,"_45":16837,"_47":17097},"eigen.dense.diag","eigen.dense.diag(values)","Create a diagonal matrix from a vector of diagonal values.",[17095],{"_17":560,"_19":17096,"_41":6},"- Values to place on the diagonal",[],{"_17":17099,"_31":17100,"_33":15618,"_19":15618,"_36":17101,"_45":16837,"_47":17104},"eigen.dense.eye","eigen.dense.eye(n)",[17102],{"_17":1206,"_19":17103,"_41":6},"- Size of the square matrix",[],{"_17":17106,"_31":17107,"_33":17108,"_19":17108,"_36":17109,"_45":16837,"_47":17112},"eigen.dense.fromArray2D","eigen.dense.fromArray2D(arr2d)","Create a matrix from a 2D JavaScript array (row-major order).",[17110],{"_17":16668,"_19":17111,"_41":6},"- 2D array where arr2d[i][j] is element at row i, column j",[],{"_17":17114,"_31":17115,"_33":17116,"_19":17116,"_36":17117,"_45":16837,"_47":17122},"eigen.dense.full","eigen.dense.full(rows, cols, value)","Create a matrix filled with a constant value.",[17118,17119,17120],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},{"_17":514,"_19":17121,"_41":6},"- Value to fill the matrix with",[],{"_17":17124,"_31":17125,"_33":17126,"_19":17127,"_36":17128,"_45":16837,"_47":17135},"eigen.dense.linspace","eigen.dense.linspace(start, end, n)","Create a matrix with linearly spaced values.\r","Create a matrix with linearly spaced values.\r\n\r\nCreates a row vector with `n` values linearly spaced between `start` and `end`.",[17129,17131,17133],{"_17":9323,"_19":17130,"_41":6},"- Starting value",{"_17":9326,"_19":17132,"_41":6},"- Ending value (inclusive)",{"_17":1206,"_19":17134,"_41":6},"- Number of values",[],{"_17":17137,"_31":17138,"_33":17139,"_19":17139,"_36":17140,"_45":16837,"_47":17145},"eigen.dense.matrix","eigen.dense.matrix(data, rows, cols)","Create a matrix from a Float64Array (column-major order).",[17141,17143,17144],{"_17":1215,"_19":17142,"_41":6},"- Matrix data in column-major order",{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":17147,"_31":17148,"_33":17149,"_19":17149,"_36":17150,"_45":16837,"_47":17153},"eigen.dense.ones","eigen.dense.ones(rows, cols)","Create a matrix filled with ones.",[17151,17152],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":17155,"_31":17156,"_33":17157,"_19":17157,"_36":17158,"_45":16837,"_47":17161},"eigen.dense.random","eigen.dense.random(rows, cols)","Create a matrix with random values in the range [-1, 1].",[17159,17160],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":17163,"_31":17164,"_33":17165,"_19":17165,"_36":17166,"_45":16837,"_47":17169},"eigen.dense.zeros","eigen.dense.zeros(rows, cols)","Create a matrix filled with zeros.",[17167,17168],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":17171,"_31":17172,"_33":17173,"_19":17173,"_36":17174,"_45":2598,"_47":17176},"eigen.dense.allFinite","eigen.dense.allFinite(A)","Check if all matrix elements are finite (not NaN or Infinity).",[17175],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17178,"_31":17179,"_33":17180,"_19":17180,"_36":17181,"_45":1387,"_47":17183},"eigen.dense.det","eigen.dense.det(A)","Compute the determinant of a square matrix.",[17182],{"_17":1163,"_19":12586,"_41":6},[],{"_17":17185,"_31":17186,"_33":17187,"_19":17187,"_36":17188,"_45":2598,"_47":17190},"eigen.dense.hasInf","eigen.dense.hasInf(A)","Check if a matrix contains any infinite values.",[17189],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17192,"_31":17193,"_33":17194,"_19":17194,"_36":17195,"_45":2598,"_47":17197},"eigen.dense.hasNaN","eigen.dense.hasNaN(A)","Check if a matrix contains any NaN values.",[17196],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17199,"_31":17200,"_33":17201,"_19":17201,"_36":17202,"_45":1387,"_47":17204},"eigen.dense.max","eigen.dense.max(A)","Find the maximum element in a matrix.",[17203],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17206,"_31":17207,"_33":17208,"_19":17208,"_36":17209,"_45":1387,"_47":17211},"eigen.dense.mean","eigen.dense.mean(A)","Compute the mean of all elements in a matrix.",[17210],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17213,"_31":17214,"_33":17215,"_19":17215,"_36":17216,"_45":1387,"_47":17218},"eigen.dense.min","eigen.dense.min(A)","Find the minimum element in a matrix.",[17217],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17220,"_31":17221,"_33":17222,"_19":17222,"_36":17223,"_45":1387,"_47":17225},"eigen.dense.norm","eigen.dense.norm(A)","Compute the Frobenius norm of a matrix: ||A||_F = sqrt(sum(a_ij^2))",[17224],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17227,"_31":17228,"_33":17229,"_19":17229,"_36":17230,"_45":1387,"_47":17232},"eigen.dense.norm1","eigen.dense.norm1(A)","Compute the 1-norm (maximum absolute column sum).",[17231],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17234,"_31":17235,"_33":17236,"_19":17236,"_36":17237,"_45":1387,"_47":17239},"eigen.dense.normInf","eigen.dense.normInf(A)","Compute the infinity-norm (maximum absolute row sum).",[17238],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17241,"_31":17242,"_33":17243,"_19":17243,"_36":17244,"_45":1387,"_47":17246},"eigen.dense.normMax","eigen.dense.normMax(A)","Compute the max norm (maximum absolute element).",[17245],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17248,"_31":17249,"_33":17250,"_19":17250,"_36":17251,"_45":1387,"_47":17253},"eigen.dense.normSquared","eigen.dense.normSquared(A)","Compute the squared Frobenius norm: ||A||_F^2 = sum(a_ij^2)",[17252],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17255,"_31":17256,"_33":17257,"_19":17257,"_36":17258,"_45":1387,"_47":17260},"eigen.dense.prod","eigen.dense.prod(A)","Compute the product of all elements in a matrix.",[17259],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17262,"_31":17263,"_33":17264,"_19":17264,"_36":17265,"_45":1387,"_47":17269},"eigen.dense.std","eigen.dense.std(A, ddof?)","Compute the standard deviation of all elements in a matrix.",[17266,17267],{"_17":1163,"_19":10134,"_41":6},{"_17":10258,"_19":17268,"_41":10},"- Delta degrees of freedom (0 for population, 1 for sample std)",[],{"_17":17271,"_31":17272,"_33":17273,"_19":17273,"_36":17274,"_45":1387,"_47":17276},"eigen.dense.sum","eigen.dense.sum(A)","Compute the sum of all elements in a matrix.",[17275],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17278,"_31":17279,"_33":17280,"_19":17280,"_36":17281,"_45":1387,"_47":17284},"eigen.dense.trace","eigen.dense.trace(A)","Compute the trace of a matrix (sum of diagonal elements).",[17282],{"_17":1163,"_19":17283,"_41":6},"- Matrix (typically square)",[],{"_17":17286,"_31":17287,"_33":17288,"_19":17288,"_36":17289,"_45":1387,"_47":17293},"eigen.dense.variance","eigen.dense.variance(A, ddof?)","Compute the variance of all elements in a matrix.",[17290,17291],{"_17":1163,"_19":10134,"_41":6},{"_17":10258,"_19":17292,"_41":10},"- Delta degrees of freedom (0 for population, 1 for sample variance)",[],{"_17":17295,"_31":17296,"_33":17297,"_19":17297,"_36":17298,"_45":16837,"_47":17300},"eigen.dense.adjoint","eigen.dense.adjoint(A)","Compute the adjoint (conjugate transpose) of a matrix: B = A^H",[17299],{"_17":1163,"_19":10134,"_41":6},[],{"_17":17302,"_31":17303,"_33":17304,"_19":17304,"_36":17305,"_45":16837,"_47":17308},"eigen.dense.conjugate","eigen.dense.conjugate(A)","Compute the complex conjugate of a matrix.",[17306],{"_17":1163,"_19":17307,"_41":6},"- Matrix to conjugate",[],{"_17":17310,"_31":17311,"_33":17312,"_19":17312,"_36":17313,"_45":16837,"_47":17316},"eigen.dense.inverse","eigen.dense.inverse(A)","Compute the inverse of a square matrix: B = A^(-1)",[17314],{"_17":1163,"_19":17315,"_41":6},"- Square matrix to invert",[],{"_17":17318,"_31":17319,"_33":17320,"_19":17320,"_36":17321,"_45":16837,"_47":17324},"eigen.dense.normalize","eigen.dense.normalize(A)","Compute the normalized matrix (divide by Frobenius norm).",[17322],{"_17":1163,"_19":17323,"_41":6},"- Matrix to normalize",[],{"_17":17326,"_31":17327,"_33":17328,"_19":17328,"_36":17329,"_45":46,"_47":17332},"eigen.dense.normalizeInPlace","eigen.dense.normalizeInPlace(A)","Normalize a matrix in-place (divide by Frobenius norm).",[17330],{"_17":1163,"_19":17331,"_41":6},"- Matrix to normalize (modified in-place)",[],{"_17":17334,"_31":17335,"_33":17336,"_19":17336,"_36":17337,"_45":46,"_47":17340},"eigen.dense.setIdentity","eigen.dense.setIdentity(A)","Set a matrix to identity in-place.",[17338],{"_17":1163,"_19":17339,"_41":6},"- Square matrix to set to identity (modified in-place)",[],{"_17":17342,"_31":17343,"_33":17344,"_19":17344,"_36":17345,"_45":46,"_47":17348},"eigen.dense.setOnes","eigen.dense.setOnes(A)","Set all matrix elements to one in-place.",[17346],{"_17":1163,"_19":17347,"_41":6},"- Matrix to fill with ones (modified in-place)",[],{"_17":17350,"_31":17351,"_33":17352,"_19":17352,"_36":17353,"_45":46,"_47":17356},"eigen.dense.setRandom","eigen.dense.setRandom(A)","Set all matrix elements to random values in [-1, 1] in-place.",[17354],{"_17":1163,"_19":17355,"_41":6},"- Matrix to randomize (modified in-place)",[],{"_17":17358,"_31":17359,"_33":17360,"_19":17360,"_36":17361,"_45":46,"_47":17364},"eigen.dense.setZero","eigen.dense.setZero(A)","Set all matrix elements to zero in-place.",[17362],{"_17":1163,"_19":17363,"_41":6},"- Matrix to zero (modified in-place)",[],{"_17":17366,"_31":17367,"_33":17368,"_19":17368,"_36":17369,"_45":16837,"_47":17372},"eigen.dense.transpose","eigen.dense.transpose(A)","Compute the transpose of a matrix: B = A^T",[17370],{"_17":1163,"_19":17371,"_41":6},"- Matrix to transpose",[],{"_17":17374,"_31":17375,"_33":17165,"_19":17165,"_36":17376,"_45":15512,"_47":17379},"eigen.dense.Matrix.zeros","eigen.dense.Matrix.zeros(rows, cols)",[17377,17378],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":17381,"_31":17382,"_33":17149,"_19":17149,"_36":17383,"_45":15512,"_47":17386},"eigen.dense.Matrix.ones","eigen.dense.Matrix.ones(rows, cols)",[17384,17385],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":17388,"_31":17389,"_33":15618,"_19":15618,"_36":17390,"_45":15512,"_47":17392},"eigen.dense.Matrix.eye","eigen.dense.Matrix.eye(n)",[17391],{"_17":1206,"_19":1387,"_41":6},[],{"_17":17394,"_31":17395,"_33":17396,"_19":17396,"_36":17397,"_45":15512,"_47":17400},"eigen.dense.Matrix.random","eigen.dense.Matrix.random(rows, cols)","Create a matrix with random values in [-1, 1].",[17398,17399],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":17402,"_31":17403,"_33":17404,"_19":17404,"_36":17405,"_45":15512,"_47":17407},"eigen.dense.Matrix.from","eigen.dense.Matrix.from(arr2d)","Create a matrix from a 2D array.",[17406],{"_17":16668,"_19":506,"_41":6},[],{"_17":17409,"_31":17410,"_33":17411,"_19":17411,"_36":17412,"_45":15512,"_47":17416},"eigen.dense.Matrix.fromData","eigen.dense.Matrix.fromData(data, rows, cols)","Create a matrix from a Float64Array (column-major).",[17413,17414,17415],{"_17":1215,"_19":1130,"_41":6},{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":17418,"_31":17419,"_33":17420,"_19":17420,"_36":17421,"_45":15512,"_47":17423},"eigen.dense.Matrix.diag","eigen.dense.Matrix.diag(values)","Create a diagonal matrix.",[17422],{"_17":560,"_19":374,"_41":6},[],{"_17":17425,"_31":17426,"_33":17116,"_19":17116,"_36":17427,"_45":15512,"_47":17431},"eigen.dense.Matrix.full","eigen.dense.Matrix.full(rows, cols, value)",[17428,17429,17430],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":17433,"_31":17434,"_33":17435,"_19":17435,"_36":17436,"_45":17441,"_47":17442},"eigen.operators.addOp","eigen.operators.addOp(A, B)","Add two linear operators: (A + B) * x = A * x + B * x",[17437,17439],{"_17":1163,"_19":17438,"_41":6},"- First linear operator",{"_17":1166,"_19":17440,"_41":6},"- Second linear operator","LinearOperator",[],{"_17":17444,"_31":17445,"_33":17446,"_19":17446,"_36":17447,"_45":17441,"_47":17452},"eigen.operators.affineOp","eigen.operators.affineOp(A, b)","Create an operator that applies A and then adds a constant vector.",[17448,17450],{"_17":1163,"_19":17449,"_41":6},"- Linear operator",{"_17":408,"_19":17451,"_41":6},"- Constant vector to add",[],{"_17":17454,"_31":17455,"_33":17456,"_19":17456,"_36":17457,"_45":17441,"_47":17465},"eigen.operators.blockDiagonalOp","eigen.operators.blockDiagonalOp(operators, inputDims, outputDims)","Create a block diagonal operator from multiple operators.",[17458,17461,17463],{"_17":17459,"_19":17460,"_41":6},"operators","- Array of linear operators for each block",{"_17":17462,"_19":374,"_41":6},"inputDims",{"_17":17464,"_19":374,"_41":6},"outputDims",[],{"_17":17467,"_31":17468,"_33":17469,"_19":17469,"_36":17470,"_45":17441,"_47":17472},"eigen.operators.cacheOp","eigen.operators.cacheOp(A)","Wrap an operator to cache its result for repeated calls with the same input.",[17471],{"_17":1163,"_19":17449,"_41":6},[],{"_17":17474,"_31":17475,"_33":17476,"_19":17476,"_36":17477,"_45":17441,"_47":17482},"eigen.operators.composeOp","eigen.operators.composeOp(A, B)","Compose two linear operators: (A * B) * x = A(B(x))",[17478,17480],{"_17":1163,"_19":17479,"_41":6},"- Outer operator (applied second)",{"_17":1166,"_19":17481,"_41":6},"- Inner operator (applied first)",[],{"_17":17484,"_31":17485,"_33":17486,"_19":17486,"_36":17487,"_45":17441,"_47":17496},"eigen.operators.linearCombinationOp","eigen.operators.linearCombinationOp(alpha, A, beta, B)","Create a linear combination of operators: (alpha*A + beta*B) * x",[17488,17490,17492,17494],{"_17":60,"_19":17489,"_41":6},"- Coefficient for A",{"_17":1163,"_19":17491,"_41":6},"- First operator",{"_17":118,"_19":17493,"_41":6},"- Coefficient for B",{"_17":1166,"_19":17495,"_41":6},"- Second operator",[],{"_17":17498,"_31":17499,"_33":17500,"_19":17500,"_36":17501,"_45":17441,"_47":17503},"eigen.operators.negOp","eigen.operators.negOp(A)","Negate a linear operator: (-A) * x = -(A * x)",[17502],{"_17":1163,"_19":17449,"_41":6},[],{"_17":17505,"_31":17506,"_33":17507,"_19":17507,"_36":17508,"_45":17441,"_47":17512},"eigen.operators.scaleOp","eigen.operators.scaleOp(A, alpha)","Scale a linear operator: (alpha * A) * x = alpha * (A * x)",[17509,17510],{"_17":1163,"_19":17449,"_41":6},{"_17":60,"_19":17511,"_41":6},"- Scalar multiplier",[],{"_17":17514,"_31":17515,"_33":17516,"_19":17516,"_36":17517,"_45":17441,"_47":17520},"eigen.operators.stackOp","eigen.operators.stackOp(operators)","Create an operator that applies multiple operators and returns the concatenated result.",[17518],{"_17":17459,"_19":17519,"_41":6},"- Array of linear operators",[],{"_17":17522,"_31":17523,"_33":17524,"_19":17524,"_36":17525,"_45":17441,"_47":17529},"eigen.operators.subOp","eigen.operators.subOp(A, B)","Subtract two linear operators: (A - B) * x = A * x - B * x",[17526,17527],{"_17":1163,"_19":17438,"_41":6},{"_17":1166,"_19":17528,"_41":6},"- Second linear operator (subtracted)",[],{"_17":17531,"_31":17532,"_33":17533,"_19":17533,"_36":17534,"_45":17441,"_47":17539},"eigen.operators.transposeOp","eigen.operators.transposeOp(_A, transposeOperator)","Create the transpose operator: A^T where A^T(y) = A^*(y) in the dual sense.",[17535,17537],{"_17":17536,"_19":17441,"_41":6},"_A",{"_17":17538,"_19":17441,"_41":6},"transposeOperator",[],{"_17":17541,"_31":17542,"_33":17543,"_19":17543,"_36":17544,"_45":17441,"_47":17547},"eigen.operators.denseMatvec","eigen.operators.denseMatvec(A)","Create a matrix-vector multiplication operator from a dense matrix.",[17545],{"_17":1163,"_19":17546,"_41":6},"- Dense matrix handle",[],{"_17":17549,"_31":17550,"_33":17551,"_19":17551,"_36":17552,"_45":17441,"_47":17554},"eigen.operators.denseMatvecTranspose","eigen.operators.denseMatvecTranspose(A)","Create a transpose matrix-vector operator: x -> A^T * x",[17553],{"_17":1163,"_19":17546,"_41":6},[],{"_17":17556,"_31":17557,"_33":17558,"_19":17558,"_36":17559,"_45":17441,"_47":17562},"eigen.operators.diagMatvec","eigen.operators.diagMatvec(d)","Create a diagonal matrix-vector operator from a vector of diagonal elements.",[17560],{"_17":5512,"_19":17561,"_41":6},"- Vector of diagonal elements",[],{"_17":17564,"_31":17565,"_33":17566,"_19":17566,"_36":17567,"_45":17441,"_47":17569},"eigen.operators.identityOp","eigen.operators.identityOp(n)","Create an identity operator: x -> x (copy)",[17568],{"_17":1206,"_19":1081,"_41":6},[],{"_17":17571,"_31":17572,"_33":17573,"_19":17573,"_36":17574,"_45":17441,"_47":17577},"eigen.operators.sparseMatvec","eigen.operators.sparseMatvec(S)","Create a matrix-vector multiplication operator from a sparse matrix.",[17575],{"_17":5680,"_19":17576,"_41":6},"- Sparse matrix handle",[],{"_17":17579,"_31":17580,"_33":17581,"_19":17581,"_36":17582,"_45":17441,"_47":17585},"eigen.operators.symmetricMatvec","eigen.operators.symmetricMatvec(A)","Create a symmetric matrix-vector operator with only lower triangular storage.",[17583],{"_17":1163,"_19":17584,"_41":6},"- Lower triangular part of a symmetric matrix",[],{"_17":17587,"_31":17588,"_33":17589,"_19":17589,"_36":17590,"_45":17441,"_47":17595},"eigen.operators.zeroOp","eigen.operators.zeroOp(m, n?)","Create a zero operator: x -> 0",[17591,17593],{"_17":630,"_19":17592,"_41":6},"- Output dimension",{"_17":1206,"_19":17594,"_41":10},"- Input dimension (optional, defaults to m)",[],{"_17":17597,"_31":17598,"_33":17599,"_19":17599,"_36":17600,"_45":16837,"_47":17605},"eigen.solvers.solveCholesky","eigen.solvers.solveCholesky(A, b)","Solve the linear system Ax = b using Cholesky decomposition.",[17601,17603],{"_17":1163,"_19":17602,"_41":6},"- Symmetric positive-definite coefficient matrix (n × n)",{"_17":408,"_19":17604,"_41":6},"- Right-hand side (n × 1 or n × k for multiple RHS)",[],{"_17":17607,"_31":17608,"_33":17609,"_19":17609,"_36":17610,"_45":16837,"_47":17615},"eigen.solvers.solveNormalEquations","eigen.solvers.solveNormalEquations(A, b)","Solve the normal equations A^T A x = A^T b using Cholesky decomposition.",[17611,17613],{"_17":1163,"_19":17612,"_41":6},"- Coefficient matrix (m × n)",{"_17":408,"_19":17614,"_41":6},"- Right-hand side (m × 1)",[],{"_17":17617,"_31":17618,"_33":17619,"_19":17619,"_36":17620,"_45":16837,"_47":17623},"eigen.solvers.lstsq","eigen.solvers.lstsq(A, b)","Solve the least squares problem: minimize ||Ax - b||_2",[17621,17622],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":17614,"_41":6},[],{"_17":17625,"_31":17626,"_33":17627,"_19":17627,"_36":17628,"_45":17633,"_47":17634},"eigen.solvers.lstsqFull","eigen.solvers.lstsqFull(A, b, rcond?)","Solve least squares with full diagnostic output.",[17629,17630,17631],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":17614,"_41":6},{"_17":9882,"_19":17632,"_41":10},"- Cutoff for small singular values (default: machine epsilon * max(m,n))","LeastSquaresResult",[],{"_17":17636,"_31":17637,"_33":17638,"_19":17638,"_36":17639,"_45":16837,"_47":17644},"eigen.solvers.lstsqWeighted","eigen.solvers.lstsqWeighted(A, b, weights)","Solve weighted least squares: minimize ||W^(1/2)(Ax - b)||_2",[17640,17641,17642],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":17614,"_41":6},{"_17":9612,"_19":17643,"_41":6},"- Weights vector (m × 1), non-negative",[],{"_17":17646,"_31":17647,"_33":17648,"_19":17648,"_36":17649,"_45":16837,"_47":17652},"eigen.solvers.inverseLU","eigen.solvers.inverseLU(A)","Compute the inverse of a matrix using LU decomposition.",[17650],{"_17":1163,"_19":17651,"_41":6},"- Square matrix (n × n)",[],{"_17":17654,"_31":17655,"_33":17656,"_19":17656,"_36":17657,"_45":16837,"_47":17661},"eigen.solvers.solveLU","eigen.solvers.solveLU(A, b)","Solve the linear system Ax = b using LU decomposition.",[17658,17660],{"_17":1163,"_19":17659,"_41":6},"- Square coefficient matrix (n × n)",{"_17":408,"_19":17604,"_41":6},[],{"_17":17663,"_31":17664,"_33":17665,"_19":17665,"_36":17666,"_45":16837,"_47":17670},"eigen.solvers.leastSquaresQR","eigen.solvers.leastSquaresQR(A, b)","Solve a least squares problem: minimize ||Ax - b||_2",[17667,17669],{"_17":1163,"_19":17668,"_41":6},"- Coefficient matrix (m × n, typically m ≥ n)",{"_17":408,"_19":17614,"_41":6},[],{"_17":17672,"_31":17673,"_33":17674,"_19":17674,"_36":17675,"_45":16837,"_47":17679},"eigen.solvers.solveQR","eigen.solvers.solveQR(A, b)","Solve the linear system Ax = b using QR decomposition.",[17676,17678],{"_17":1163,"_19":17677,"_41":6},"- Coefficient matrix (m × n, m ≥ n)",{"_17":408,"_19":17614,"_41":6},[],{"_17":17681,"_31":17682,"_33":2027,"_19":2027,"_36":17683,"_45":16837,"_47":17687},"eigen.solvers.solve","eigen.solvers.solve(A, b)",[17684,17686],{"_17":1163,"_19":17685,"_41":6},"- Coefficient matrix (n × n for square, m × n for least squares)",{"_17":408,"_19":17604,"_41":6},[],{"_17":17689,"_31":17690,"_33":17691,"_19":17691,"_36":17692,"_45":16837,"_47":17697},"eigen.solvers.solveMultiple","eigen.solvers.solveMultiple(A, B)","Solve multiple linear systems with the same coefficient matrix.",[17693,17695],{"_17":1163,"_19":17694,"_41":6},"- Coefficient matrix (n × n)",{"_17":1166,"_19":17696,"_41":6},"- Right-hand sides matrix (n × k)",[],{"_17":17699,"_31":17700,"_33":17701,"_19":17701,"_36":17702,"_45":46,"_47":17704},"eigen.sparse.destroySparse","eigen.sparse.destroySparse(S)","Destroy a sparse matrix and free its memory.",[17703],{"_17":5680,"_19":17576,"_41":6},[],{"_17":17706,"_31":17707,"_33":17708,"_19":17708,"_36":17709,"_45":17712,"_47":17713},"eigen.sparse.sparse","eigen.sparse.sparse(rows, cols)","Create an empty sparse matrix with given dimensions.",[17710,17711],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},"SparseMatrixHandle",[],{"_17":17715,"_31":17716,"_33":17717,"_19":17717,"_36":17718,"_45":17712,"_47":17721},"eigen.sparse.sparseDiag","eigen.sparse.sparseDiag(diagonal)","Create a sparse diagonal matrix.",[17719],{"_17":17720,"_19":17096,"_41":6},"diagonal",[],{"_17":17723,"_31":17724,"_33":17725,"_19":17725,"_36":17726,"_45":17712,"_47":17728},"eigen.sparse.sparseEye","eigen.sparse.sparseEye(n)","Create a sparse identity matrix.",[17727],{"_17":1206,"_19":11567,"_41":6},[],{"_17":17730,"_31":17731,"_33":17732,"_19":17732,"_36":17733,"_45":17712,"_47":17744},"eigen.sparse.sparseFromCOO","eigen.sparse.sparseFromCOO(rows, cols, rowIndices, colIndices, values)","Create a sparse matrix from COO (Coordinate) format arrays.",[17734,17735,17736,17739,17742],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},{"_17":17737,"_19":17738,"_41":6},"rowIndices","- Array of row indices",{"_17":17740,"_19":17741,"_41":6},"colIndices","- Array of column indices",{"_17":560,"_19":17743,"_41":6},"- Array of values",[],{"_17":17746,"_31":17747,"_33":17748,"_19":17748,"_36":17749,"_45":17712,"_47":17755},"eigen.sparse.sparseFromDense","eigen.sparse.sparseFromDense(denseHandle, tol?)","Create a sparse matrix from a dense matrix, keeping only non-zero elements.",[17750,17753],{"_17":17751,"_19":17752,"_41":6},"denseHandle","- Handle to dense matrix",{"_17":470,"_19":17754,"_41":10},"- Tolerance for considering values as zero (default: 0)",[],{"_17":17757,"_31":17758,"_33":17759,"_19":17759,"_36":17760,"_45":17712,"_47":17766},"eigen.sparse.sparseFromTriplets","eigen.sparse.sparseFromTriplets(rows, cols, triplets)","Create a sparse matrix from a list of triplets (COO format).",[17761,17762,17763],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},{"_17":17764,"_19":17765,"_41":6},"triplets","- Array of {row, col, value} objects",[],{"_17":17768,"_31":17769,"_33":17770,"_19":17770,"_36":17771,"_45":17773,"_47":17774},"eigen.sparse.createMatvec","eigen.sparse.createMatvec(S)","Create a sparse matrix-vector product function (closure).",[17772],{"_17":5680,"_19":8319,"_41":6},"(x: VectorHandle) => VectorHandle",[],{"_17":17776,"_31":17777,"_33":17778,"_19":17778,"_36":17779,"_45":1387,"_47":17783},"eigen.sparse.density","eigen.sparse.density(S, rows, cols)","Get the density of a sparse matrix (nnz / total elements).",[17780,17781,17782],{"_17":5680,"_19":17576,"_41":6},{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},[],{"_17":17785,"_31":17786,"_33":17787,"_19":17787,"_36":17788,"_45":2598,"_47":17790},"eigen.sparse.isEmpty","eigen.sparse.isEmpty(S)","Check if a sparse matrix is empty (has no non-zeros).",[17789],{"_17":5680,"_19":17576,"_41":6},[],{"_17":17792,"_31":17793,"_33":17794,"_19":17794,"_36":17795,"_45":1387,"_47":17797},"eigen.sparse.nnz","eigen.sparse.nnz(S)","Get the number of non-zero elements in a sparse matrix.",[17796],{"_17":5680,"_19":17576,"_41":6},[],{"_17":17799,"_31":17800,"_33":17801,"_19":17801,"_36":17802,"_45":17807,"_47":17808},"eigen.sparse.sparseMV","eigen.sparse.sparseMV(S, x)","Compute sparse matrix-vector product: y = S * x",[17803,17805],{"_17":5680,"_19":17804,"_41":6},"- Sparse matrix (m × n)",{"_17":405,"_19":17806,"_41":6},"- Input vector (n × 1)","VectorHandle",[],{"_17":17810,"_31":17811,"_33":17812,"_19":17812,"_36":17813,"_45":17807,"_47":17821},"eigen.sparse.sparseSolve","eigen.sparse.sparseSolve(S, b, method?)","Solve sparse linear system with automatic method selection.",[17814,17816,17818],{"_17":5680,"_19":17815,"_41":6},"- Sparse coefficient matrix (n × n)",{"_17":408,"_19":17817,"_41":6},"- Right-hand side vector (n × 1)",{"_17":17819,"_19":17820,"_41":10},"method","- Solver method: 'auto', 'lu', 'cg', 'bicgstab'",[],{"_17":17823,"_31":17824,"_33":17825,"_19":17825,"_36":17826,"_45":17807,"_47":17831},"eigen.sparse.sparseSolveBiCGSTAB","eigen.sparse.sparseSolveBiCGSTAB(S, b, _options?)","Solve sparse linear system Ax = b using BiCGSTAB method.",[17827,17828,17829],{"_17":5680,"_19":17815,"_41":6},{"_17":408,"_19":17817,"_41":6},{"_17":8334,"_19":17830,"_41":10},"IterativeSolverOptions",[],{"_17":17833,"_31":17834,"_33":17835,"_19":17835,"_36":17836,"_45":17807,"_47":17841},"eigen.sparse.sparseSolveCG","eigen.sparse.sparseSolveCG(S, b, _options?)","Solve sparse linear system Ax = b using Conjugate Gradient method.",[17837,17839,17840],{"_17":5680,"_19":17838,"_41":6},"- Sparse coefficient matrix (n × n), must be symmetric positive-definite",{"_17":408,"_19":17817,"_41":6},{"_17":8334,"_19":17830,"_41":10},[],{"_17":17843,"_31":17844,"_33":17845,"_19":17845,"_36":17846,"_45":17807,"_47":17849},"eigen.sparse.sparseSolveLU","eigen.sparse.sparseSolveLU(S, b)","Solve sparse linear system Ax = b using SparseLU (direct method).",[17847,17848],{"_17":5680,"_19":17815,"_41":6},{"_17":408,"_19":17817,"_41":6},[],{"_17":17851,"_31":17852,"_33":17708,"_19":17708,"_36":17853,"_45":239,"_47":17856},"eigen.sparse.SparseMatrix.create","eigen.sparse.SparseMatrix.create(rows, cols)",[17854,17855],{"_17":2401,"_19":1387,"_41":6},{"_17":2391,"_19":1387,"_41":6},[],{"_17":17858,"_31":17859,"_33":17860,"_19":17860,"_36":17861,"_45":239,"_47":17866},"eigen.sparse.SparseMatrix.fromTriplets","eigen.sparse.SparseMatrix.fromTriplets(rows, cols, triplets)","Create a sparse matrix from triplets (COO format).",[17862,17863,17864],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},{"_17":17764,"_19":17865,"_41":6},"- Array of {row, col, value} triplets",[],{"_17":17868,"_31":17869,"_33":17870,"_19":17870,"_36":17871,"_45":239,"_47":17878},"eigen.sparse.SparseMatrix.fromCOO","eigen.sparse.SparseMatrix.fromCOO(rows, cols, rowIndices, colIndices, values)","Create a sparse matrix from separate COO arrays.",[17872,17873,17874,17875,17876],{"_17":2401,"_19":652,"_41":6},{"_17":2391,"_19":1189,"_41":6},{"_17":17737,"_19":17738,"_41":6},{"_17":17740,"_19":17741,"_41":6},{"_17":560,"_19":17877,"_41":6},"- Array of non-zero values",[],{"_17":17880,"_31":17881,"_33":17882,"_19":17883,"_36":17884,"_45":239,"_47":17890},"eigen.sparse.SparseMatrix.fromDense","eigen.sparse.SparseMatrix.fromDense(data, tolerance?)","Create a sparse matrix from a dense 2D array.\r","Create a sparse matrix from a dense 2D array.\r\nOnly non-zero values are stored.",[17885,17887],{"_17":1215,"_19":17886,"_41":6},"- 2D array in row-major order",{"_17":17888,"_19":17889,"_41":10},"tolerance","- Values with |value| < tolerance are treated as zero",[],{"_17":17892,"_31":17893,"_33":17725,"_19":17725,"_36":17894,"_45":239,"_47":17897},"eigen.sparse.SparseMatrix.eye","eigen.sparse.SparseMatrix.eye(n)",[17895],{"_17":1206,"_19":17896,"_41":6},"- Matrix dimension (n × n)",[],{"_17":17899,"_31":17900,"_33":17717,"_19":17717,"_36":17901,"_45":239,"_47":17904},"eigen.sparse.SparseMatrix.diag","eigen.sparse.SparseMatrix.diag(diagonal)",[17902],{"_17":17720,"_19":17903,"_41":6},"- Diagonal values",[],{"_17":17906,"_31":17907,"_33":17908,"_19":17908,"_36":17909,"_45":239,"_47":17918},"eigen.sparse.SparseMatrix.tridiag","eigen.sparse.SparseMatrix.tridiag(n, lower, main, upper)","Create a sparse tridiagonal matrix.",[17910,17911,17913,17916],{"_17":1206,"_19":1207,"_41":6},{"_17":4695,"_19":17912,"_41":6},"- Value on sub-diagonal",{"_17":17914,"_19":17915,"_41":6},"main","- Value on main diagonal",{"_17":4709,"_19":17917,"_41":6},"- Value on super-diagonal",[],{"_17":17920,"_31":17921,"_33":17922,"_19":17922,"_36":17923,"_45":239,"_47":17928},"eigen.sparse.SparseMatrix.banded","eigen.sparse.SparseMatrix.banded(n, bands)","Create a sparse matrix from a banded structure.",[17924,17925],{"_17":1206,"_19":1207,"_41":6},{"_17":17926,"_19":17927,"_41":6},"bands","- Array of {offset, values} where offset is band position",[],{"_17":17930,"_31":17931,"_33":17932,"_19":17932,"_36":17933,"_45":16837,"_47":17948},"eigen.utilities.block","eigen.utilities.block(A, startRow, startCol, numRows, numCols)","Extract a submatrix (block) from a matrix.",[17934,17936,17939,17942,17945],{"_17":1163,"_19":17935,"_41":6},"- Source matrix handle",{"_17":17937,"_19":17938,"_41":6},"startRow","- Starting row index (0-based)",{"_17":17940,"_19":17941,"_41":6},"startCol","- Starting column index (0-based)",{"_17":17943,"_19":17944,"_41":6},"numRows","- Number of rows in the block",{"_17":17946,"_19":17947,"_41":6},"numCols","- Number of columns in the block",[],{"_17":17950,"_31":17951,"_33":17952,"_19":17952,"_36":17953,"_45":16837,"_47":17957},"eigen.utilities.blockDiag","eigen.utilities.blockDiag(matrices)","Create a block diagonal matrix from multiple matrices.",[17954],{"_17":17955,"_19":17956,"_41":6},"matrices","- Array of matrix handles to place on the diagonal",[],{"_17":17959,"_31":17960,"_33":17961,"_19":17961,"_36":17962,"_45":17807,"_47":17965},"eigen.utilities.col","eigen.utilities.col(A, j)","Extract a column from a matrix as a vector.",[17963,17964],{"_17":1163,"_19":16869,"_41":6},{"_17":2435,"_19":16895,"_41":6},[],{"_17":17967,"_31":17968,"_33":17969,"_19":17969,"_36":17970,"_45":17807,"_47":17974},"eigen.utilities.diagonal","eigen.utilities.diagonal(A, k?)","Extract the diagonal of a matrix as a vector.",[17971,17972],{"_17":1163,"_19":16869,"_41":6},{"_17":4686,"_19":17973,"_41":10},"- Diagonal offset (0 = main, positive = above, negative = below)",[],{"_17":17976,"_31":17977,"_33":17978,"_19":17978,"_36":17979,"_45":17807,"_47":17983},"eigen.utilities.flatten","eigen.utilities.flatten(A, order?)","Flatten a matrix to a vector.",[17980,17981],{"_17":1163,"_19":16869,"_41":6},{"_17":1246,"_19":17982,"_41":10},"- 'F' for column-major (default), 'C' for row-major",[],{"_17":17985,"_31":17986,"_33":17987,"_19":17987,"_36":17988,"_45":16837,"_47":17991},"eigen.utilities.hstack","eigen.utilities.hstack(matrices)","Horizontally concatenate matrices: [A, B, C, ...]",[17989],{"_17":17955,"_19":17990,"_41":6},"- Array of matrix handles to concatenate",[],{"_17":17993,"_31":17994,"_33":17995,"_19":17995,"_36":17996,"_45":16837,"_47":18004},"eigen.utilities.reshape","eigen.utilities.reshape(A, newRows, newCols)","Reshape a matrix to new dimensions.",[17997,17998,18001],{"_17":1163,"_19":16869,"_41":6},{"_17":17999,"_19":18000,"_41":6},"newRows","- New number of rows",{"_17":18002,"_19":18003,"_41":6},"newCols","- New number of columns",[],{"_17":18006,"_31":18007,"_33":18008,"_19":18008,"_36":18009,"_45":17807,"_47":18012},"eigen.utilities.row","eigen.utilities.row(A, i)","Extract a row from a matrix as a vector.",[18010,18011],{"_17":1163,"_19":16869,"_41":6},{"_17":2433,"_19":16893,"_41":6},[],{"_17":18014,"_31":18015,"_33":18016,"_19":18016,"_36":18017,"_45":16837,"_47":18021},"eigen.utilities.selectCols","eigen.utilities.selectCols(A, indices)","Extract columns from a matrix.",[18018,18019],{"_17":1163,"_19":16869,"_41":6},{"_17":9784,"_19":18020,"_41":6},"- Array of column indices to extract",[],{"_17":18023,"_31":18024,"_33":18025,"_19":18025,"_36":18026,"_45":16837,"_47":18030},"eigen.utilities.selectRows","eigen.utilities.selectRows(A, indices)","Extract rows from a matrix.",[18027,18028],{"_17":1163,"_19":16869,"_41":6},{"_17":9784,"_19":18029,"_41":6},"- Array of row indices to extract",[],{"_17":18032,"_31":18033,"_33":18034,"_19":18034,"_36":18035,"_45":46,"_47":18042},"eigen.utilities.setBlock","eigen.utilities.setBlock(A, startRow, startCol, B)","Set a block of a matrix to values from another matrix.",[18036,18038,18039,18040],{"_17":1163,"_19":18037,"_41":6},"- Target matrix handle (modified in place)",{"_17":17937,"_19":17938,"_41":6},{"_17":17940,"_19":17941,"_41":6},{"_17":1166,"_19":18041,"_41":6},"- Source matrix containing values to set",[],{"_17":18044,"_31":18045,"_33":18046,"_19":18046,"_36":18047,"_45":46,"_47":18053},"eigen.utilities.setCol","eigen.utilities.setCol(A, j, v)","Set a column of a matrix from a vector.",[18048,18050,18051],{"_17":1163,"_19":18049,"_41":6},"- Matrix handle (modified in place)",{"_17":2435,"_19":16895,"_41":6},{"_17":676,"_19":18052,"_41":6},"- Vector containing new column values",[],{"_17":18055,"_31":18056,"_33":18057,"_19":18057,"_36":18058,"_45":46,"_47":18063},"eigen.utilities.setDiagonal","eigen.utilities.setDiagonal(A, v, k?)","Set the diagonal of a matrix from a vector.",[18059,18060,18062],{"_17":1163,"_19":18049,"_41":6},{"_17":676,"_19":18061,"_41":6},"- Vector containing diagonal values",{"_17":4686,"_19":17973,"_41":10},[],{"_17":18065,"_31":18066,"_33":18067,"_19":18067,"_36":18068,"_45":46,"_47":18073},"eigen.utilities.setRow","eigen.utilities.setRow(A, i, v)","Set a row of a matrix from a vector.",[18069,18070,18071],{"_17":1163,"_19":18049,"_41":6},{"_17":2433,"_19":16893,"_41":6},{"_17":676,"_19":18072,"_41":6},"- Vector containing new row values",[],{"_17":18075,"_31":18076,"_33":18077,"_19":18077,"_36":18078,"_45":16837,"_47":18080},"eigen.utilities.vstack","eigen.utilities.vstack(matrices)","Vertically concatenate matrices: [A; B; C; ...]",[18079],{"_17":17955,"_19":17990,"_41":6},[],{"_17":18082,"_31":18083,"_33":16824,"_19":16824,"_36":18084,"_45":1387,"_47":18086},"eigen.utilities.cond","eigen.utilities.cond(A)",[18085],{"_17":1163,"_19":16869,"_41":6},[],{"_17":18088,"_31":18089,"_33":18090,"_19":18090,"_36":18091,"_45":1387,"_47":18093},"eigen.utilities.frobeniusNorm","eigen.utilities.frobeniusNorm(A)","Compute the Frobenius norm of a matrix.",[18092],{"_17":1163,"_19":16869,"_41":6},[],{"_17":18095,"_31":18096,"_33":18097,"_19":18097,"_36":18098,"_45":1387,"_47":18100},"eigen.utilities.nuclearNorm","eigen.utilities.nuclearNorm(A)","Compute the nuclear norm (trace norm) of a matrix.",[18099],{"_17":1163,"_19":16869,"_41":6},[],{"_17":18102,"_31":18103,"_33":18104,"_19":18104,"_36":18105,"_45":18110,"_47":18111},"eigen.utilities.nullspace","eigen.utilities.nullspace(A, tolerance?)","Compute an orthonormal basis for the null space of A.",[18106,18108],{"_17":1163,"_19":18107,"_41":6},"- Matrix handle (m × n)",{"_17":17888,"_19":18109,"_41":10},"- Singular values below this define the null space","VectorHandle[]",[],{"_17":18113,"_31":18114,"_33":18115,"_19":18115,"_36":18116,"_45":1387,"_47":18120},"eigen.utilities.numericalRank","eigen.utilities.numericalRank(A, tolerance?)","Compute the numerical rank using a tolerance.",[18117,18118],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18119,"_41":10},"- Absolute tolerance for considering a singular value as zero",[],{"_17":18122,"_31":18123,"_33":18124,"_19":18124,"_36":18125,"_45":16837,"_47":18129},"eigen.utilities.pinv","eigen.utilities.pinv(A, tolerance?)","Compute the Moore-Penrose pseudoinverse of a matrix.",[18126,18127],{"_17":1163,"_19":18107,"_41":6},{"_17":17888,"_19":18128,"_41":10},"- Singular values below this are treated as zero",[],{"_17":18131,"_31":18132,"_33":18133,"_19":18133,"_36":18134,"_45":18110,"_47":18137},"eigen.utilities.range","eigen.utilities.range(A, tolerance?)","Compute an orthonormal basis for the column space (range) of A.",[18135,18136],{"_17":1163,"_19":18107,"_41":6},{"_17":17888,"_19":18128,"_41":10},[],{"_17":18139,"_31":18140,"_33":18141,"_19":18141,"_36":18142,"_45":1387,"_47":18145},"eigen.utilities.rank","eigen.utilities.rank(A, tolerance?)","Compute the matrix rank using SVD.",[18143,18144],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18128,"_41":10},[],{"_17":18147,"_31":18148,"_33":18149,"_19":18149,"_36":18150,"_45":1387,"_47":18152},"eigen.utilities.spectralNorm","eigen.utilities.spectralNorm(A)","Compute the spectral norm (2-norm) of a matrix.",[18151],{"_17":1163,"_19":16869,"_41":6},[],{"_17":18154,"_31":18155,"_33":18156,"_19":18156,"_36":18157,"_45":2598,"_47":18161},"eigen.utilities.isDiagonal","eigen.utilities.isDiagonal(A, tolerance?)","Check if a matrix is diagonal.",[18158,18159],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18160,"_41":10},"- Maximum allowed off-diagonal value",[],{"_17":18163,"_31":18164,"_33":18165,"_19":18165,"_36":18166,"_45":2598,"_47":18173},"eigen.utilities.isEqual","eigen.utilities.isEqual(A, B, tolerance?)","Check if two matrices are equal within a tolerance.",[18167,18169,18171],{"_17":1163,"_19":18168,"_41":6},"- First matrix handle",{"_17":1166,"_19":18170,"_41":6},"- Second matrix handle",{"_17":17888,"_19":18172,"_41":10},"- Maximum allowed element-wise difference",[],{"_17":18175,"_31":18176,"_33":18177,"_19":18177,"_36":18178,"_45":2598,"_47":18182},"eigen.utilities.isIdentity","eigen.utilities.isIdentity(A, tolerance?)","Check if a matrix is the identity matrix.",[18179,18180],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18181,"_41":10},"- Maximum allowed deviation",[],{"_17":18184,"_31":18185,"_33":18186,"_19":18186,"_36":18187,"_45":2598,"_47":18192},"eigen.utilities.isInvertible","eigen.utilities.isInvertible(A, tolerance?)","Check if a matrix is invertible (non-singular).",[18188,18190],{"_17":1163,"_19":18189,"_41":6},"- Matrix handle (must be square)",{"_17":17888,"_19":18191,"_41":10},"- Tolerance for determinant check",[],{"_17":18194,"_31":18195,"_33":18196,"_19":18196,"_36":18197,"_45":2598,"_47":18201},"eigen.utilities.isLowerTriangular","eigen.utilities.isLowerTriangular(A, tolerance?)","Check if a matrix is lower triangular.",[18198,18199],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18200,"_41":10},"- Maximum allowed above-diagonal value",[],{"_17":18203,"_31":18204,"_33":18205,"_19":18205,"_36":18206,"_45":2598,"_47":18210},"eigen.utilities.isOrthogonal","eigen.utilities.isOrthogonal(A, tolerance?)","Check if a matrix is orthogonal (A^T * A = I).",[18207,18208],{"_17":1163,"_19":18189,"_41":6},{"_17":17888,"_19":18209,"_41":10},"- Maximum allowed deviation from identity",[],{"_17":18212,"_31":18213,"_33":18214,"_19":18214,"_36":18215,"_45":2598,"_47":18218},"eigen.utilities.isPositiveDefinite","eigen.utilities.isPositiveDefinite(A)","Check if a matrix is positive definite.",[18216],{"_17":1163,"_19":18217,"_41":6},"- Matrix handle (must be square and symmetric)",[],{"_17":18220,"_31":18221,"_33":18222,"_19":18222,"_36":18223,"_45":2598,"_47":18227},"eigen.utilities.isPositiveSemiDefinite","eigen.utilities.isPositiveSemiDefinite(A, tolerance?)","Check if a matrix is positive semi-definite.",[18224,18225],{"_17":1163,"_19":18189,"_41":6},{"_17":17888,"_19":18226,"_41":10},"- Tolerance for eigenvalue check",[],{"_17":18229,"_31":18230,"_33":18231,"_19":18231,"_36":18232,"_45":2598,"_47":18235},"eigen.utilities.isSingular","eigen.utilities.isSingular(A, tolerance?)","Check if a matrix is singular (determinant is zero).",[18233,18234],{"_17":1163,"_19":18189,"_41":6},{"_17":17888,"_19":18191,"_41":10},[],{"_17":18237,"_31":18238,"_33":18239,"_19":18239,"_36":18240,"_45":2598,"_47":18242},"eigen.utilities.isSquare","eigen.utilities.isSquare(A)","Check if a matrix is square (rows == cols).",[18241],{"_17":1163,"_19":16869,"_41":6},[],{"_17":18244,"_31":18245,"_33":18246,"_19":18246,"_36":18247,"_45":2598,"_47":18251},"eigen.utilities.isSymmetric","eigen.utilities.isSymmetric(A, tolerance?)","Check if a matrix is symmetric (A == A^T) within a tolerance.",[18248,18249],{"_17":1163,"_19":18189,"_41":6},{"_17":17888,"_19":18250,"_41":10},"- Maximum allowed difference between A[i,j] and A[j,i]",[],{"_17":18253,"_31":18254,"_33":18255,"_19":18255,"_36":18256,"_45":2598,"_47":18260},"eigen.utilities.isUpperTriangular","eigen.utilities.isUpperTriangular(A, tolerance?)","Check if a matrix is upper triangular.",[18257,18258],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18259,"_41":10},"- Maximum allowed below-diagonal value",[],{"_17":18262,"_31":18263,"_33":18264,"_19":18264,"_36":18265,"_45":2598,"_47":18269},"eigen.utilities.isZero","eigen.utilities.isZero(A, tolerance?)","Check if a matrix is the zero matrix.",[18266,18267],{"_17":1163,"_19":16869,"_41":6},{"_17":17888,"_19":18268,"_41":10},"- Maximum allowed value",[],{"_17":18271,"_31":18272,"_33":18273,"_19":18273,"_36":18274,"_45":1387,"_47":18277},"eigen.vector.dataPtrVec","eigen.vector.dataPtrVec(v)","Get the raw data pointer for a vector.",[18275],{"_17":676,"_19":18276,"_41":6},"- Vector handle",[],{"_17":18279,"_31":18280,"_33":18281,"_19":18281,"_36":18282,"_45":46,"_47":18285},"eigen.vector.destroyVec","eigen.vector.destroyVec(v)","Free the memory associated with a vector.",[18283],{"_17":676,"_19":18284,"_41":6},"- Vector handle to destroy",[],{"_17":18287,"_31":18288,"_33":18289,"_19":18289,"_36":18290,"_45":1387,"_47":18292},"eigen.vector.firstVec","eigen.vector.firstVec(v)","Get the first element of a vector.",[18291],{"_17":676,"_19":18276,"_41":6},[],{"_17":18294,"_31":18295,"_33":18296,"_19":18296,"_36":18297,"_45":1387,"_47":18301},"eigen.vector.getVec","eigen.vector.getVec(v, i)","Get a single element from a vector.",[18298,18299],{"_17":676,"_19":18276,"_41":6},{"_17":2433,"_19":18300,"_41":6},"- Index (0-based)",[],{"_17":18303,"_31":18304,"_33":18305,"_19":18305,"_36":18306,"_45":1387,"_47":18308},"eigen.vector.lastVec","eigen.vector.lastVec(v)","Get the last element of a vector.",[18307],{"_17":676,"_19":18276,"_41":6},[],{"_17":18310,"_31":18311,"_33":18312,"_19":18312,"_36":18313,"_45":46,"_47":18317},"eigen.vector.setVec","eigen.vector.setVec(v, i, value)","Set a single element in a vector.",[18314,18315,18316],{"_17":676,"_19":18276,"_41":6},{"_17":2433,"_19":18300,"_41":6},{"_17":514,"_19":16938,"_41":6},[],{"_17":18319,"_31":18320,"_33":18321,"_19":18321,"_36":18322,"_45":1387,"_47":18324},"eigen.vector.sizeVec","eigen.vector.sizeVec(v)","Get the size (length) of a vector.",[18323],{"_17":676,"_19":18276,"_41":6},[],{"_17":18326,"_31":18327,"_33":18328,"_19":18328,"_36":18329,"_45":1130,"_47":18335},"eigen.vector.sliceVec","eigen.vector.sliceVec(v, start, end)","Get a slice of a vector as a new Float64Array.",[18330,18331,18333],{"_17":676,"_19":18276,"_41":6},{"_17":9323,"_19":18332,"_41":6},"- Start index (inclusive, 0-based)",{"_17":9326,"_19":18334,"_41":6},"- End index (exclusive)",[],{"_17":18337,"_31":18338,"_33":18339,"_19":18339,"_36":18340,"_45":1130,"_47":18342},"eigen.vector.toArrayVec","eigen.vector.toArrayVec(v)","Convert a vector to a Float64Array.",[18341],{"_17":676,"_19":18276,"_41":6},[],{"_17":18344,"_31":18345,"_33":18346,"_19":18346,"_36":18347,"_45":374,"_47":18349},"eigen.vector.toJSArrayVec","eigen.vector.toJSArrayVec(v)","Convert a vector to a JavaScript array.",[18348],{"_17":676,"_19":18276,"_41":6},[],{"_17":18351,"_31":18352,"_33":18353,"_19":18353,"_36":18354,"_45":17807,"_47":18360},"eigen.vector.arangeVec","eigen.vector.arangeVec(start, end, step?)","Create a vector with values from start to end with given step.",[18355,18356,18358],{"_17":9323,"_19":17130,"_41":6},{"_17":9326,"_19":18357,"_41":6},"- Ending value (exclusive)",{"_17":9329,"_19":18359,"_41":10},"- Step size (default: 1)",[],{"_17":18362,"_31":18363,"_33":18364,"_19":18364,"_36":18365,"_45":17807,"_47":18370},"eigen.vector.basisVec","eigen.vector.basisVec(n, i)","Create a standard basis vector (one-hot vector).",[18366,18368],{"_17":1206,"_19":18367,"_41":6},"- Vector length",{"_17":2433,"_19":18369,"_41":6},"- Index of the 1 element (0-based)",[],{"_17":18372,"_31":18373,"_33":18374,"_19":18374,"_36":18375,"_45":17807,"_47":18378},"eigen.vector.cloneVec","eigen.vector.cloneVec(v)","Create a copy of a vector.",[18376],{"_17":676,"_19":18377,"_41":6},"- Vector to copy",[],{"_17":18380,"_31":18381,"_33":18382,"_19":18382,"_36":18383,"_45":17807,"_47":18387},"eigen.vector.fullVec","eigen.vector.fullVec(n, value)","Create a vector filled with a constant value.",[18384,18385],{"_17":1206,"_19":18367,"_41":6},{"_17":514,"_19":18386,"_41":6},"- Fill value",[],{"_17":18389,"_31":18390,"_33":18391,"_19":18391,"_36":18392,"_45":17807,"_47":18396},"eigen.vector.linspaceVec","eigen.vector.linspaceVec(start, end, n)","Create a vector with linearly spaced values.",[18393,18394,18395],{"_17":9323,"_19":17130,"_41":6},{"_17":9326,"_19":17132,"_41":6},{"_17":1206,"_19":17134,"_41":6},[],{"_17":18398,"_31":18399,"_33":18400,"_19":18400,"_36":18401,"_45":17807,"_47":18403},"eigen.vector.onesVec","eigen.vector.onesVec(n)","Create a vector filled with ones.",[18402],{"_17":1206,"_19":18367,"_41":6},[],{"_17":18405,"_31":18406,"_33":18407,"_19":18407,"_36":18408,"_45":17807,"_47":18410},"eigen.vector.randomVec","eigen.vector.randomVec(n)","Create a vector with random values in [-1, 1].",[18409],{"_17":1206,"_19":18367,"_41":6},[],{"_17":18412,"_31":18413,"_33":18414,"_19":18414,"_36":18415,"_45":17807,"_47":18418},"eigen.vector.vector","eigen.vector.vector(data)","Create a vector from a Float64Array.",[18416],{"_17":1215,"_19":18417,"_41":6},"- Vector data",[],{"_17":18420,"_31":18421,"_33":18422,"_19":18422,"_36":18423,"_45":17807,"_47":18426},"eigen.vector.vectorFromArray","eigen.vector.vectorFromArray(arr)","Create a vector from a JavaScript array.",[18424],{"_17":9283,"_19":18425,"_41":6},"- Array of numbers",[],{"_17":18428,"_31":18429,"_33":18430,"_19":18430,"_36":18431,"_45":17807,"_47":18433},"eigen.vector.zerosVec","eigen.vector.zerosVec(n)","Create a vector filled with zeros.",[18432],{"_17":1206,"_19":18367,"_41":6},[],{"_17":18435,"_31":18436,"_33":18437,"_19":18437,"_36":18438,"_45":17807,"_47":18443},"eigen.vector.addVec","eigen.vector.addVec(u, v)","Add two vectors: w = u + v",[18439,18441],{"_17":6452,"_19":18440,"_41":6},"- First vector",{"_17":676,"_19":18442,"_41":6},"- Second vector (must have same length)",[],{"_17":18445,"_31":18446,"_33":18447,"_19":18447,"_36":18448,"_45":1387,"_47":18451},"eigen.vector.angleVec","eigen.vector.angleVec(u, v)","Compute the angle between two vectors in radians.",[18449,18450],{"_17":6452,"_19":18440,"_41":6},{"_17":676,"_19":18442,"_41":6},[],{"_17":18453,"_31":18454,"_33":18455,"_19":18455,"_36":18456,"_45":17807,"_47":18461},"eigen.vector.cross","eigen.vector.cross(u, v)","Compute the cross product of two 3D vectors: u × v",[18457,18459],{"_17":6452,"_19":18458,"_41":6},"- First 3D vector",{"_17":676,"_19":18460,"_41":6},"- Second 3D vector",[],{"_17":18463,"_31":18464,"_33":18465,"_19":18465,"_36":18466,"_45":1387,"_47":18469},"eigen.vector.distanceVec","eigen.vector.distanceVec(u, v)","Compute the distance between two vectors: ||u - v||_2",[18467,18468],{"_17":6452,"_19":18440,"_41":6},{"_17":676,"_19":18442,"_41":6},[],{"_17":18471,"_31":18472,"_33":18473,"_19":18473,"_36":18474,"_45":1387,"_47":18478},"eigen.vector.dot","eigen.vector.dot(u, v)","Compute the dot product of two vectors: u · v",[18475,18476],{"_17":6452,"_19":18440,"_41":6},{"_17":676,"_19":18477,"_41":6},"- Second vector (must have same length as u)",[],{"_17":18480,"_31":18481,"_33":18482,"_19":18482,"_36":18483,"_45":17807,"_47":18486},"eigen.vector.elementMulVec","eigen.vector.elementMulVec(u, v)","Compute element-wise product: w_i = u_i * v_i",[18484,18485],{"_17":6452,"_19":18440,"_41":6},{"_17":676,"_19":18442,"_41":6},[],{"_17":18488,"_31":18489,"_33":18490,"_19":18490,"_36":18491,"_45":1387,"_47":18494},"eigen.vector.maxVec","eigen.vector.maxVec(v)","Find the maximum element.",[18492],{"_17":676,"_19":18493,"_41":6},"- Vector",[],{"_17":18496,"_31":18497,"_33":18498,"_19":18498,"_36":18499,"_45":1387,"_47":18501},"eigen.vector.meanVec","eigen.vector.meanVec(v)","Compute the mean of all elements.",[18500],{"_17":676,"_19":18493,"_41":6},[],{"_17":18503,"_31":18504,"_33":18505,"_19":18505,"_36":18506,"_45":1387,"_47":18508},"eigen.vector.minVec","eigen.vector.minVec(v)","Find the minimum element.",[18507],{"_17":676,"_19":18493,"_41":6},[],{"_17":18510,"_31":18511,"_33":18512,"_19":18512,"_36":18513,"_45":17807,"_47":18515},"eigen.vector.negVec","eigen.vector.negVec(v)","Negate a vector: w = -v",[18514],{"_17":676,"_19":18493,"_41":6},[],{"_17":18517,"_31":18518,"_33":18519,"_19":18519,"_36":18520,"_45":1387,"_47":18522},"eigen.vector.norm1Vec","eigen.vector.norm1Vec(v)","Compute the L1 norm (Manhattan norm): ||v||_1 = sum(|v_i|)",[18521],{"_17":676,"_19":18493,"_41":6},[],{"_17":18524,"_31":18525,"_33":18526,"_19":18526,"_36":18527,"_45":17807,"_47":18530},"eigen.vector.normalizeVec","eigen.vector.normalizeVec(v)","Return a normalized copy of a vector.",[18528],{"_17":676,"_19":18529,"_41":6},"- Vector to normalize",[],{"_17":18532,"_31":18533,"_33":18534,"_19":18534,"_36":18535,"_45":46,"_47":18538},"eigen.vector.normalizeVecInPlace","eigen.vector.normalizeVecInPlace(v)","Normalize a vector in-place (divide by its norm).",[18536],{"_17":676,"_19":18537,"_41":6},"- Vector to normalize (modified in-place)",[],{"_17":18540,"_31":18541,"_33":18542,"_19":18542,"_36":18543,"_45":1387,"_47":18545},"eigen.vector.normInfVec","eigen.vector.normInfVec(v)","Compute the infinity norm (max norm): ||v||_∞ = max(|v_i|)",[18544],{"_17":676,"_19":18493,"_41":6},[],{"_17":18547,"_31":18548,"_33":18549,"_19":18549,"_36":18550,"_45":1387,"_47":18552},"eigen.vector.normSquaredVec","eigen.vector.normSquaredVec(v)","Compute the squared Euclidean norm: ||v||_2^2 = sum(v_i^2)",[18551],{"_17":676,"_19":18493,"_41":6},[],{"_17":18554,"_31":18555,"_33":18556,"_19":18556,"_36":18557,"_45":1387,"_47":18559},"eigen.vector.normVec","eigen.vector.normVec(v)","Compute the Euclidean (L2) norm of a vector: ||v||_2 = sqrt(sum(v_i^2))",[18558],{"_17":676,"_19":18493,"_41":6},[],{"_17":18561,"_31":18562,"_33":18563,"_19":18563,"_36":18564,"_45":17807,"_47":18568},"eigen.vector.scaleVec","eigen.vector.scaleVec(v, scalar)","Scale a vector: w = scalar * v",[18565,18566],{"_17":676,"_19":18493,"_41":6},{"_17":16993,"_19":18567,"_41":6},"- Scale factor",[],{"_17":18570,"_31":18571,"_33":18572,"_19":18572,"_36":18573,"_45":17807,"_47":18576},"eigen.vector.subVec","eigen.vector.subVec(u, v)","Subtract two vectors: w = u - v",[18574,18575],{"_17":6452,"_19":18440,"_41":6},{"_17":676,"_19":18442,"_41":6},[],{"_17":18578,"_31":18579,"_33":18580,"_19":18580,"_36":18581,"_45":1387,"_47":18583},"eigen.vector.sumVec","eigen.vector.sumVec(v)","Compute the sum of all elements.",[18582],{"_17":676,"_19":18493,"_41":6},[],{"_17":18585,"_31":18586,"_33":18430,"_19":18430,"_36":18587,"_45":2465,"_47":18589},"eigen.vector.Vector.zeros","eigen.vector.Vector.zeros(n)",[18588],{"_17":1206,"_19":1387,"_41":6},[],{"_17":18591,"_31":18592,"_33":18400,"_19":18400,"_36":18593,"_45":2465,"_47":18595},"eigen.vector.Vector.ones","eigen.vector.Vector.ones(n)",[18594],{"_17":1206,"_19":1387,"_41":6},[],{"_17":18597,"_31":18598,"_33":18407,"_19":18407,"_36":18599,"_45":2465,"_47":18601},"eigen.vector.Vector.random","eigen.vector.Vector.random(n)",[18600],{"_17":1206,"_19":1387,"_41":6},[],{"_17":18603,"_31":18604,"_33":18422,"_19":18422,"_36":18605,"_45":2465,"_47":18607},"eigen.vector.Vector.from","eigen.vector.Vector.from(arr)",[18606],{"_17":9283,"_19":374,"_41":6},[],{"_17":18609,"_31":18610,"_33":18414,"_19":18414,"_36":18611,"_45":2465,"_47":18613},"eigen.vector.Vector.fromData","eigen.vector.Vector.fromData(data)",[18612],{"_17":1215,"_19":1130,"_41":6},[],{"_17":18615,"_31":18616,"_33":18382,"_19":18382,"_36":18617,"_45":2465,"_47":18620},"eigen.vector.Vector.full","eigen.vector.Vector.full(n, value)",[18618,18619],{"_17":1206,"_19":1387,"_41":6},{"_17":514,"_19":1387,"_41":6},[],{"_17":18622,"_31":18623,"_33":18624,"_19":18624,"_36":18625,"_45":2465,"_47":18628},"eigen.vector.Vector.basis","eigen.vector.Vector.basis(n, i)","Create a standard basis vector (one-hot).",[18626,18627],{"_17":1206,"_19":1387,"_41":6},{"_17":2433,"_19":1387,"_41":6},[],{"_17":18630,"_31":18631,"_33":18391,"_19":18391,"_36":18632,"_45":2465,"_47":18636},"eigen.vector.Vector.linspace","eigen.vector.Vector.linspace(start, end, n)",[18633,18634,18635],{"_17":9323,"_19":1387,"_41":6},{"_17":9326,"_19":1387,"_41":6},{"_17":1206,"_19":1387,"_41":6},[],{"_15":18638,"_17":18639,"_19":18640,"_21":22,"_23":18641,"_25":18642,"_27":18643},"quad-generated","Numerical Integration (QUADPACK)","QUADPACK numerical integration routines.","∫","quad",[18644,18660,18674,18688,18699,18712,18723,18736,18746,18758,18771,18784,18793,18802,18809,18815,18822,18833,18841,18852,18863,18870,18877,18886,18893],{"_17":18645,"_31":18646,"_33":18647,"_19":18648,"_36":18649,"_45":18658,"_47":18659},"quad.integrateFns.integrate","quad.integrateFns.integrate(f, a, b, options?)","Compute the definite integral of f(x).\r","Compute the definite integral of f(x).\r\n\r\nThis is the unified integration API that automatically selects the\r\nmost appropriate QUADPACK routine based on the integration bounds\r\nand options provided.\r\n\r\n**Auto-detection logic:**\r\n1. If bounds include ±Infinity:\r\n - If omega specified: quad_fourier (Fourier transform)\r\n - Otherwise: quad_inf (infinite interval)\r\n2. If omega specified: quad_osc (oscillatory)\r\n3. If c specified: quad_cauchy (Cauchy principal value)\r\n4. If alfa or beta specified: quad_singular (algebraic singularities)\r\n5. If points specified: quad_break (user break points)\r\n6. If rule specified: quad_rule (explicit GK rule)\r\n7. Otherwise: quad (general adaptive)",[18650,18652,18654,18656],{"_17":7414,"_19":18651,"_41":6},"- The integrand function f(x)",{"_17":664,"_19":18653,"_41":6},"- Lower limit of integration (use -Infinity for lower infinite)",{"_17":408,"_19":18655,"_41":6},"- Upper limit of integration (use Infinity for upper infinite)",{"_17":454,"_19":18657,"_41":10},"- Integration options","Promise",[],{"_17":18661,"_31":18662,"_33":18663,"_19":18664,"_36":18665,"_45":18658,"_47":18673},"quad.quadBreakFns.quad_break","quad.quadBreakFns.quad_break(f, a, b, options)","Compute the integral of f(x) over [a, b] with user-specified break points.\r","Compute the integral of f(x) over [a, b] with user-specified break points.\r\n\r\nUses QUADPACK's DQAGP routine. This is designed for integrands that have\r\nknown difficulties (discontinuities, peaks, rapid changes) at specific\r\npoints within the integration interval.\r\n\r\nThe algorithm subdivides at the specified break points, ensuring that\r\nno subinterval crosses these difficult locations.",[18666,18667,18669,18671],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18668,"_41":6},"- Lower limit of integration",{"_17":408,"_19":18670,"_41":6},"- Upper limit of integration",{"_17":454,"_19":18672,"_41":6},"- Integration options including break points",[],{"_17":18675,"_31":18676,"_33":18677,"_19":18678,"_36":18679,"_45":18686,"_47":18687},"quad.quadFixedFns.quad_fixed","quad.quadFixedFns.quad_fixed(f, a, b, rule)","Evaluate the integral of f(x) over [a, b] using a fixed Gauss-Kronrod rule.\r","Evaluate the integral of f(x) over [a, b] using a fixed Gauss-Kronrod rule.\r\n\r\nThis function applies a single Gauss-Kronrod quadrature rule without\r\nany adaptive subdivision. It's useful for:\r\n- Building custom integration strategies\r\n- Quick estimates when you know the function is smooth\r\n- Performance-critical code where overhead must be minimized\r\n\r\nAvailable rules:\r\n- 15-point: 7 Gauss + 8 Kronrod points (fastest)\r\n- 21-point: 10 Gauss + 11 Kronrod points\r\n- 31-point: 15 Gauss + 16 Kronrod points\r\n- 41-point: 20 Gauss + 21 Kronrod points\r\n- 51-point: 25 Gauss + 26 Kronrod points\r\n- 61-point: 30 Gauss + 31 Kronrod points (most accurate)",[18680,18681,18682,18683],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":18684,"_19":18685,"_41":6},"rule","- Gauss-Kronrod rule order (15, 21, 31, 41, 51, or 61)","Promise",[],{"_17":18689,"_31":18690,"_33":18691,"_19":18692,"_36":18693,"_45":18658,"_47":18698},"quad.quadFns.quad","quad.quadFns.quad(f, a, b, options?)","Compute the definite integral of f(x) over [a, b].\r","Compute the definite integral of f(x) over [a, b].\r\n\r\nUses QUADPACK's DQAGS routine, which is the best general-purpose\r\nadaptive integrator. It handles most integrands well, including\r\nthose with integrable singularities.",[18694,18695,18696,18697],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18657,"_41":10},[],{"_17":18700,"_31":18701,"_33":18702,"_19":18703,"_36":18704,"_45":18658,"_47":18711},"quad.quadInfFns.quad_inf","quad.quadInfFns.quad_inf(f, a, b, options?)","Compute the integral of f(x) over an infinite or semi-infinite interval.\r","Compute the integral of f(x) over an infinite or semi-infinite interval.\r\n\r\nUses QUADPACK's DQAGI routine. The interval type is determined\r\nautomatically from the bounds:\r\n- [a, Infinity]: Semi-infinite upper (∫[a,∞) f(x) dx)\r\n- [-Infinity, b]: Semi-infinite lower (∫(-∞,b] f(x) dx)\r\n- [-Infinity, Infinity]: Doubly infinite (∫(-∞,∞) f(x) dx)",[18705,18706,18708,18710],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18707,"_41":6},"- Lower limit (use -Infinity for lower infinite)",{"_17":408,"_19":18709,"_41":6},"- Upper limit (use Infinity for upper infinite)",{"_17":454,"_19":18657,"_41":10},[],{"_17":18713,"_31":18714,"_33":18715,"_19":18716,"_36":18717,"_45":18658,"_47":18722},"quad.quadNgFns.quad_ng","quad.quadNgFns.quad_ng(f, a, b, options?)","Compute the integral of f(x) over [a, b] using non-adaptive integration.\r","Compute the integral of f(x) over [a, b] using non-adaptive integration.\r\n\r\nUses QUADPACK's DQNG routine, which applies progressively higher-order\r\nGauss-Kronrod rules (10, 21, 43, 87 points) until the requested accuracy\r\nis achieved or all rules are exhausted.\r\n\r\nThis is the fastest integration routine but only suitable for smooth,\r\nwell-behaved functions without singularities or rapid oscillations.",[18718,18719,18720,18721],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18657,"_41":10},[],{"_17":18724,"_31":18725,"_33":18726,"_19":18727,"_36":18728,"_45":18658,"_47":18735},"quad.quadOscFns.quad_osc","quad.quadOscFns.quad_osc(f, a, b, options)","Compute the integral of f(x) * w(x) over [a, b] where w(x) is oscillatory.\r","Compute the integral of f(x) * w(x) over [a, b] where w(x) is oscillatory.\r\n\r\nUses QUADPACK's DQAWO routine. Computes integrals of the form:\r\n- ∫[a,b] f(x) * cos(ω*x) dx (when weight='cos')\r\n- ∫[a,b] f(x) * sin(ω*x) dx (when weight='sin')",[18729,18731,18732,18733],{"_17":7414,"_19":18730,"_41":6},"- The integrand function f(x) (without the oscillatory weight)",{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18734,"_41":6},"- Integration options (omega is required)",[],{"_17":18737,"_31":18738,"_33":18739,"_19":18740,"_36":18741,"_45":18658,"_47":18745},"quad.quadOscFns.quad_fourier","quad.quadOscFns.quad_fourier(f, a, options)","Compute the Fourier integral of f(x) * w(x) over [a, ∞).\r","Compute the Fourier integral of f(x) * w(x) over [a, ∞).\r\n\r\nUses QUADPACK's DQAWF routine. Computes integrals of the form:\r\n- ∫[a,∞) f(x) * cos(ω*x) dx (when weight='cos')\r\n- ∫[a,∞) f(x) * sin(ω*x) dx (when weight='sin')\r\n\r\nThe function f(x) should decay sufficiently fast as x → ∞.",[18742,18743,18744],{"_17":7414,"_19":18730,"_41":6},{"_17":664,"_19":18668,"_41":6},{"_17":454,"_19":18734,"_41":6},[],{"_17":18747,"_31":18748,"_33":18749,"_19":18750,"_36":18751,"_45":18658,"_47":18757},"quad.quadRuleFns.quad_rule","quad.quadRuleFns.quad_rule(f, a, b, options?)","Compute the integral of f(x) over [a, b] with explicit Gauss-Kronrod rule.\r","Compute the integral of f(x) over [a, b] with explicit Gauss-Kronrod rule.\r\n\r\nUses QUADPACK's DQAG routine. This is similar to quad() but allows you\r\nto specify which Gauss-Kronrod rule to use for each subinterval.\r\n\r\nHigher-order rules are more efficient for smooth functions:\r\n- Rule 1 (GK15): 15-point rule, fastest per subdivision\r\n- Rule 2 (GK21): 21-point rule\r\n- Rule 3 (GK31): 31-point rule, good default\r\n- Rule 4 (GK41): 41-point rule\r\n- Rule 5 (GK51): 51-point rule\r\n- Rule 6 (GK61): 61-point rule, most accurate per subdivision",[18752,18753,18754,18755],{"_17":7414,"_19":18651,"_41":6},{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18756,"_41":10},"- Integration options including rule selection",[],{"_17":18759,"_31":18760,"_33":18761,"_19":18762,"_36":18763,"_45":18658,"_47":18770},"quad.quadSingularFns.quad_singular","quad.quadSingularFns.quad_singular(f, a, b, options)","Compute the integral of f(x) * w(x) over [a, b] with singular weight.\r","Compute the integral of f(x) * w(x) over [a, b] with singular weight.\r\n\r\nUses QUADPACK's DQAWS routine. Computes integrals of the form:\r\n∫[a,b] f(x) * (x-a)^α * (b-x)^β * v(x) dx\r\n\r\nwhere v(x) is an optional logarithmic factor:\r\n- wgtfunc=1: v(x) = 1\r\n- wgtfunc=2: v(x) = log(x-a)\r\n- wgtfunc=3: v(x) = log(b-x)\r\n- wgtfunc=4: v(x) = log(x-a) * log(b-x)",[18764,18766,18767,18768],{"_17":7414,"_19":18765,"_41":6},"- The integrand function f(x) (without the singular weight)",{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18769,"_41":6},"- Integration options (alfa and beta are required)",[],{"_17":18772,"_31":18773,"_33":18774,"_19":18775,"_36":18776,"_45":18658,"_47":18783},"quad.quadSingularFns.quad_cauchy","quad.quadSingularFns.quad_cauchy(f, a, b, options)","Compute the Cauchy principal value of f(x)/(x-c) over [a, b].\r","Compute the Cauchy principal value of f(x)/(x-c) over [a, b].\r\n\r\nUses QUADPACK's DQAWC routine. Computes:\r\nP.V. ∫[a,b] f(x) / (x-c) dx\r\n\r\nwhere c is a point in the open interval (a, b).",[18777,18779,18780,18781],{"_17":7414,"_19":18778,"_41":6},"- The integrand function f(x) (the numerator)",{"_17":664,"_19":18668,"_41":6},{"_17":408,"_19":18670,"_41":6},{"_17":454,"_19":18782,"_41":6},"- Integration options (c is required)",[],{"_17":18785,"_31":18786,"_33":18787,"_19":18788,"_36":18789,"_45":46,"_47":18792},"quad.configureQUADPACK","quad.configureQUADPACK(config)","QuadWasm - QUADPACK WebAssembly Module\r","QuadWasm - QUADPACK WebAssembly Module\r\n\r\nThis package provides a WebAssembly build of QUADPACK (Quadrature PACKage),\r\na Fortran library for numerical integration of one-dimensional functions.\r\n\r\n## High-Level API\r\n\r\nFor most use cases, use the high-level functions that handle all the\r\ncomplexity of memory management and callback registration:",[18790],{"_17":3805,"_19":18791,"_41":6},"QUADPACKLoadConfig",[],{"_17":18794,"_31":18795,"_33":18796,"_19":18796,"_36":18797,"_45":1793,"_47":18801},"quad.getQuadpackMessage","quad.getQuadpackMessage(ier)","Get human-readable error message for QUADPACK error code.",[18798],{"_17":18799,"_19":18800,"_41":6},"ier","- QUADPACK error code",[],{"_17":18803,"_31":18804,"_33":18805,"_19":1136,"_36":18806,"_45":18807,"_47":18808},"quad.getQUADPACKModule","quad.getQUADPACKModule()","getQUADPACKModule",[],"QUADPACKModule",[],{"_17":18810,"_31":18811,"_33":18812,"_19":1136,"_36":18813,"_45":2598,"_47":18814},"quad.isQUADPACKLoaded","quad.isQUADPACKLoaded()","isQUADPACKLoaded",[],[],{"_17":18816,"_31":18817,"_33":18818,"_19":1136,"_36":18819,"_45":18820,"_47":18821},"quad.loadQUADPACKModule","quad.loadQUADPACKModule()","loadQUADPACKModule",[],"Promise",[],{"_17":18823,"_31":18824,"_33":18825,"_19":18825,"_36":18826,"_45":1387,"_47":18832},"quad.quadBreakIworkSize","quad.quadBreakIworkSize(limit, npts)","Calculate integer workspace size for break point routines (DQAGP).",[18827,18830],{"_17":18828,"_19":18829,"_41":6},"limit","- Maximum number of subdivisions",{"_17":2826,"_19":18831,"_41":6},"- Number of break points (not including a and b)",[],{"_17":18834,"_31":18835,"_33":18836,"_19":18836,"_36":18837,"_45":1387,"_47":18840},"quad.quadBreakWorkSize","quad.quadBreakWorkSize(limit, npts)","Calculate workspace size for break point routines (DQAGP).",[18838,18839],{"_17":18828,"_19":18829,"_41":6},{"_17":2826,"_19":18831,"_41":6},[],{"_17":18842,"_31":18843,"_33":18844,"_19":18844,"_36":18845,"_45":1387,"_47":18851},"quad.quadFourierIworkSize","quad.quadFourierIworkSize(limlst, limit)","Calculate integer workspace size for Fourier routines (DQAWF).",[18846,18849],{"_17":18847,"_19":18848,"_41":6},"limlst","- Maximum number of cycles",{"_17":18828,"_19":18850,"_41":6},"- Maximum subdivisions per cycle",[],{"_17":18853,"_31":18854,"_33":18855,"_19":18855,"_36":18856,"_45":1387,"_47":18862},"quad.quadFourierWorkSize","quad.quadFourierWorkSize(limlst, limit, maxp1)","Calculate workspace size for Fourier routines (DQAWF).",[18857,18858,18859],{"_17":18847,"_19":18848,"_41":6},{"_17":18828,"_19":18850,"_41":6},{"_17":18860,"_19":18861,"_41":6},"maxp1","- Maximum Chebyshev moments",[],{"_17":18864,"_31":18865,"_33":18866,"_19":18866,"_36":18867,"_45":1387,"_47":18869},"quad.quadIworkSize","quad.quadIworkSize(limit)","Calculate integer workspace size for basic adaptive routines.",[18868],{"_17":18828,"_19":18829,"_41":6},[],{"_17":18871,"_31":18872,"_33":18873,"_19":18873,"_36":18874,"_45":1387,"_47":18876},"quad.quadOscIworkSize","quad.quadOscIworkSize(limit)","Calculate integer workspace size for oscillatory routines (DQAWO).",[18875],{"_17":18828,"_19":18829,"_41":6},[],{"_17":18878,"_31":18879,"_33":18880,"_19":18880,"_36":18881,"_45":1387,"_47":18885},"quad.quadOscWorkSize","quad.quadOscWorkSize(limit, maxp1)","Calculate workspace size for oscillatory routines (DQAWO).",[18882,18883],{"_17":18828,"_19":18829,"_41":6},{"_17":18860,"_19":18884,"_41":6},"- Maximum number of Chebyshev moments",[],{"_17":18887,"_31":18888,"_33":18889,"_19":18889,"_36":18890,"_45":1387,"_47":18892},"quad.quadWorkSize","quad.quadWorkSize(limit)","Calculate workspace size for basic adaptive routines (DQAGS, DQAG, etc.).",[18891],{"_17":18828,"_19":18829,"_41":6},[],{"_17":18894,"_31":18895,"_33":18896,"_19":1136,"_36":18897,"_45":46,"_47":18898},"quad.resetQUADPACKModule","quad.resetQUADPACKModule()","resetQUADPACKModule",[],[],{"_15":18900,"_17":18901,"_19":18902,"_21":22,"_23":18903,"_25":18904,"_27":18905},"ar-generated","Eigenvalue Solvers (ARPACK)","ARPACK eigenvalue solvers for large sparse matrices.","λ","ar",[18906,18929,18945,18967,18987,19003,19016,19035,19051,19064,19076,19089,19102,19112,19120,19140,19156,19178,19195,19210,19224,19241,19255,19267,19283,19298,19310,19320,19335,19348,19360,19370,19382,19398,19407,19418,19426,19439,19449,19457,19464,19474,19486,19499,19509,19522,19537,19549,19562,19574,19586,19598,19613,19625,19634,19645,19654,19664,19677,19688,19703,19720,19735,19752,19771,19786,19799,19811,19819,19831,19840,19847,19855,19862,19870,19877,19884,19891,19898,19905,19911,19918,19924,19931,19938],{"_17":18907,"_31":18908,"_33":18909,"_19":18910,"_36":18911,"_45":8299,"_47":18928},"ar.advanced.bucklingEigs","ar.advanced.bucklingEigs(Kmatvec, Kgmatvec, solveShifted, n, nev, sigma, options?)","Compute buckling eigenvalues and modes.\r","Compute buckling eigenvalues and modes.\r\n\r\nSolves the buckling problem K*x = λ*Kg*x where:\r\n- K is the stiffness matrix (symmetric positive definite)\r\n- Kg is the geometric stiffness matrix (symmetric)\r\n- λ is the buckling load factor\r\n\r\nUses shift-invert buckling mode (ARPACK mode 4) to find eigenvalues\r\nnearest to the shift sigma.",[18912,18915,18918,18921,18922,18925,18927],{"_17":18913,"_19":18914,"_41":6},"Kmatvec","- Stiffness matrix operator K*x",{"_17":18916,"_19":18917,"_41":6},"Kgmatvec","- Geometric stiffness matrix operator Kg*x",{"_17":18919,"_19":18920,"_41":6},"solveShifted","- Solves (K - sigma*Kg)*y = x, returns y",{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":18924,"_41":6},"nev","- Number of buckling modes to compute",{"_17":82,"_19":18926,"_41":6},"- Shift value (find eigenvalues near sigma)",{"_17":454,"_19":8285,"_41":10},[],{"_17":18930,"_31":18931,"_33":18932,"_19":18933,"_36":18934,"_45":18943,"_47":18944},"ar.advanced.criticalBucklingLoad","ar.advanced.criticalBucklingLoad(Kmatvec, Kgmatvec, solveShifted, n, options?)","Compute critical buckling load and mode.\r","Compute critical buckling load and mode.\r\n\r\nConvenience function that finds the smallest positive buckling\r\neigenvalue and its corresponding mode shape.",[18935,18937,18939,18941,18942],{"_17":18913,"_19":18936,"_41":6},"- Stiffness matrix operator",{"_17":18916,"_19":18938,"_41":6},"- Geometric stiffness matrix operator",{"_17":18919,"_19":18940,"_41":6},"- Solver for (K - sigma*Kg)*y = x",{"_17":1206,"_19":1207,"_41":6},{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":18946,"_31":18947,"_33":18948,"_19":18949,"_36":18950,"_45":8299,"_47":18966},"ar.advanced.cayleyEigs","ar.advanced.cayleyEigs(Amatvec, Bmatvec, solveCayleyMinus, n, nev, sigma, options?)","Compute eigenvalues using the Cayley transform.\r","Compute eigenvalues using the Cayley transform.\r\n\r\nSolves A*x = λ*B*x using the Cayley transformation, which is useful\r\nwhen you want eigenvalues on both sides of a shift sigma.\r\n\r\nThe Cayley operator is: OP = inv(A - sigma*B) * (A + sigma*B)",[18951,18954,18957,18960,18961,18963,18965],{"_17":18952,"_19":18953,"_41":6},"Amatvec","- Matrix operator A*x",{"_17":18955,"_19":18956,"_41":6},"Bmatvec","- Matrix operator B*x (B must be symmetric positive definite)",{"_17":18958,"_19":18959,"_41":6},"solveCayleyMinus","- Solves (A - sigma*B)*y = x, returns y",{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":18962,"_41":6},"- Number of eigenvalues to compute",{"_17":82,"_19":18964,"_41":6},"- Shift value",{"_17":454,"_19":8285,"_41":10},[],{"_17":18968,"_31":18969,"_33":18970,"_19":18971,"_36":18972,"_45":8299,"_47":18986},"ar.advanced.eigsInInterval","ar.advanced.eigsInInterval(Amatvec, Bmatvec, createSolver, n, nev, interval, options?)","Compute eigenvalues in an interval using Cayley transform.\r","Compute eigenvalues in an interval using Cayley transform.\r\n\r\nUses multiple Cayley transforms to find eigenvalues in a given interval\r\n[a, b] by placing the shift at the midpoint.",[18973,18974,18976,18979,18980,18982,18985],{"_17":18952,"_19":18953,"_41":6},{"_17":18955,"_19":18975,"_41":6},"- Matrix operator B*x",{"_17":18977,"_19":18978,"_41":6},"createSolver","- Function that creates a solver for (A - sigma*B)*y = x",{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":18981,"_41":6},"- Number of eigenvalues to find",{"_17":18983,"_19":18984,"_41":6},"interval","- Interval [a, b] to search for eigenvalues",{"_17":454,"_19":8285,"_41":10},[],{"_17":18988,"_31":18989,"_33":18990,"_19":18991,"_36":18992,"_45":19001,"_47":19002},"ar.complex.zeigs","ar.complex.zeigs(matvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a complex matrix.\r","Compute eigenvalues and eigenvectors of a complex matrix.\r\n\r\nUses ARPACK's ZNAUPD/ZNEUPD routines with the Implicitly Restarted\r\nArnoldi Method. This is efficient for large sparse complex matrices\r\nwhere only a few eigenvalues are needed.",[18993,18996,18998,19000],{"_17":18994,"_19":18995,"_41":6},"matvec","- Function computing y = A*x where A is a complex matrix",{"_17":1206,"_19":18997,"_41":6},"- Dimension of the matrix (A is n×n)",{"_17":18923,"_19":18999,"_41":6},"- Number of eigenvalues to compute (must satisfy 0 < nev < n-1)",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19004,"_31":19005,"_33":19006,"_19":19007,"_36":19008,"_45":19014,"_47":19015},"ar.complex.zeigsh","ar.complex.zeigsh(matvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a complex Hermitian matrix.\r","Compute eigenvalues and eigenvectors of a complex Hermitian matrix.\r\n\r\nUses ARPACK's ZNAUPD/ZNEUPD routines with the Implicitly Restarted\r\nArnoldi Method. For Hermitian matrices, the eigenvalues are guaranteed\r\nto be real, but the eigenvectors are complex.",[19009,19011,19012,19013],{"_17":18994,"_19":19010,"_41":6},"- Function computing y = A*x where A is Hermitian (A = A^H)",{"_17":1206,"_19":18997,"_41":6},{"_17":18923,"_19":18999,"_41":6},{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19017,"_31":19018,"_33":19019,"_19":19020,"_36":19021,"_45":8299,"_47":19034},"ar.continuation.eigsDeflated","ar.continuation.eigsDeflated(matvec, n, nev, knownEigenvectors, knownEigenvalues?, options?)","Compute eigenvalues with deflation against known eigenvectors.\r","Compute eigenvalues with deflation against known eigenvectors.\r\n\r\nThis modifies the matrix operator to project out the known eigenvectors,\r\nensuring that the new eigenvalues are orthogonal to the known subspace.",[19022,19024,19025,19027,19030,19033],{"_17":18994,"_19":19023,"_41":6},"- Symmetric matrix operator A*x",{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":19026,"_41":6},"- Number of new eigenvalues to compute",{"_17":19028,"_19":19029,"_41":6},"knownEigenvectors","- Known eigenvectors to deflate",{"_17":19031,"_19":19032,"_41":10},"knownEigenvalues","- Eigenvalues corresponding to known eigenvectors (optional)",{"_17":454,"_19":8285,"_41":10},[],{"_17":19036,"_31":19037,"_33":19038,"_19":19039,"_36":19040,"_45":8299,"_47":19050},"ar.continuation.eigsContinue","ar.continuation.eigsContinue(matvec, n, additionalNev, previousResult, options?)","Continue eigenvalue computation from a previous result.\r","Continue eigenvalue computation from a previous result.\r\n\r\nComputes additional eigenvalues while excluding those already found.",[19041,19042,19043,19046,19049],{"_17":18994,"_19":18953,"_41":6},{"_17":1206,"_19":1207,"_41":6},{"_17":19044,"_19":19045,"_41":6},"additionalNev","- Number of additional eigenvalues to compute",{"_17":19047,"_19":19048,"_41":6},"previousResult","- Result from previous eigs call",{"_17":454,"_19":8285,"_41":10},[],{"_17":19052,"_31":19053,"_33":19054,"_19":19054,"_36":19055,"_45":19062,"_47":19063},"ar.continuation.eignDeflated","ar.continuation.eignDeflated(matvec, n, nev, knownEigenvectors, options?)","Compute non-symmetric eigenvalues with deflation.",[19056,19058,19059,19060,19061],{"_17":18994,"_19":19057,"_41":6},"- Non-symmetric matrix operator A*x",{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":18962,"_41":6},{"_17":19028,"_19":19029,"_41":6},{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19065,"_31":19066,"_33":19067,"_19":19068,"_36":19069,"_45":19062,"_47":19075},"ar.core.eign","ar.core.eign(matvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a real non-symmetric matrix.\r","Compute eigenvalues and eigenvectors of a real non-symmetric matrix.\r\n\r\nUses ARPACK's DNAUPD/DNEUPD routines with the Implicitly Restarted\r\nArnoldi Method. This handles general (non-symmetric) matrices where\r\neigenvalues may be complex.",[19070,19072,19073,19074],{"_17":18994,"_19":19071,"_41":6},"- Function computing y = A*x",{"_17":1206,"_19":18997,"_41":6},{"_17":18923,"_19":18999,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":19077,"_31":19078,"_33":19079,"_19":19080,"_36":19081,"_45":8299,"_47":19088},"ar.core.eigs","ar.core.eigs(matvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a real symmetric matrix.\r","Compute eigenvalues and eigenvectors of a real symmetric matrix.\r\n\r\nUses ARPACK's DSAUPD/DSEUPD routines with the Implicitly Restarted\r\nLanczos Method. This is efficient for large sparse symmetric matrices\r\nwhere only a few eigenvalues are needed.",[19082,19084,19085,19087],{"_17":18994,"_19":19083,"_41":6},"- Function computing y = A*x where A is symmetric",{"_17":1206,"_19":18997,"_41":6},{"_17":18923,"_19":19086,"_41":6},"- Number of eigenvalues to compute (must satisfy 0 < nev < n)",{"_17":454,"_19":8285,"_41":10},[],{"_17":19090,"_31":19091,"_33":19092,"_19":19093,"_36":19094,"_45":19100,"_47":19101},"ar.core.eigsh","ar.core.eigsh(matvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a sparse matrix.\r","Compute eigenvalues and eigenvectors of a sparse matrix.\r\n\r\nThis is the unified API that dispatches to the appropriate solver:\r\n- 'symmetric' (default): Uses Lanczos method (more efficient for symmetric matrices)\r\n- 'nonsymmetric': Uses Arnoldi method (handles non-symmetric matrices, complex eigenvalues)",[19095,19096,19097,19098],{"_17":18994,"_19":19071,"_41":6},{"_17":1206,"_19":18997,"_41":6},{"_17":18923,"_19":18962,"_41":6},{"_17":454,"_19":19099,"_41":10},"- Solver options including problem type","Promise",[],{"_17":19103,"_31":19104,"_33":19105,"_19":19105,"_36":19106,"_45":19110,"_47":19111},"ar.core.isEigsResult","ar.core.isEigsResult(result)","Type guard to check if a result is from the symmetric solver.",[19107],{"_17":19108,"_19":19109,"_41":6},"result","- Result from eigsh","result is EigsResult",[],{"_17":19113,"_31":19114,"_33":19115,"_19":19115,"_36":19116,"_45":19118,"_47":19119},"ar.core.isEignResult","ar.core.isEignResult(result)","Type guard to check if a result is from the non-symmetric solver.",[19117],{"_17":19108,"_19":19109,"_41":6},"result is EignResult",[],{"_17":19121,"_31":19122,"_33":19123,"_19":19124,"_36":19125,"_45":19138,"_47":19139},"ar.dimred.spectralEmbedding","ar.dimred.spectralEmbedding(affinityMatvec, degrees, n, nComponents, options?)","Compute spectral embedding (Laplacian Eigenmaps) for dimensionality reduction.\r","Compute spectral embedding (Laplacian Eigenmaps) for dimensionality reduction.\r\n\r\nProjects data points to a lower-dimensional space by computing the\r\nsmallest eigenvectors of the graph Laplacian of an affinity matrix.",[19126,19129,19132,19134,19137],{"_17":19127,"_19":19128,"_41":6},"affinityMatvec","- Function computing y = W*x where W is the affinity matrix",{"_17":19130,"_19":19131,"_41":6},"degrees","- Degree of each node (row sums of W), or function computing D*x",{"_17":1206,"_19":19133,"_41":6},"- Number of data points",{"_17":19135,"_19":19136,"_41":6},"nComponents","- Number of dimensions in the embedding",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19141,"_31":19142,"_33":19143,"_19":19144,"_36":19145,"_45":19154,"_47":19155},"ar.dimred.truncatedPCA","ar.dimred.truncatedPCA(covarianceMatvec, n, nComponents, options?)","Compute truncated PCA via eigendecomposition of the covariance matrix.\r","Compute truncated PCA via eigendecomposition of the covariance matrix.\r\n\r\nFinds the top principal components by computing the largest eigenvalues\r\nand eigenvectors of X^T * X / (n-1) or a provided covariance matvec.",[19146,19149,19151,19153],{"_17":19147,"_19":19148,"_41":6},"covarianceMatvec","- Function computing y = C*x where C is the covariance matrix",{"_17":1206,"_19":19150,"_41":6},"- Dimensionality (number of features)",{"_17":19135,"_19":19152,"_41":6},"- Number of principal components to compute",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19157,"_31":19158,"_33":19159,"_19":19160,"_36":19161,"_45":19154,"_47":19177},"ar.dimred.truncatedPCAfromData","ar.dimred.truncatedPCAfromData(dataMatvec, dataMatvecT, nSamples, nFeatures, nComponents, options?)","Compute truncated PCA directly from a data matrix via SVD.\r","Compute truncated PCA directly from a data matrix via SVD.\r\n\r\nThis version uses SVD of the centered data matrix X, which is\r\nequivalent to eigendecomposition of the covariance matrix but\r\ncan be more numerically stable.",[19162,19165,19168,19171,19174,19176],{"_17":19163,"_19":19164,"_41":6},"dataMatvec","- Function computing y = X*v (nSamples x nFeatures matrix times nFeatures-vector)",{"_17":19166,"_19":19167,"_41":6},"dataMatvecT","- Function computing y = X^T*v (nFeatures x nSamples matrix times nSamples-vector)",{"_17":19169,"_19":19170,"_41":6},"nSamples","- Number of samples (rows)",{"_17":19172,"_19":19173,"_41":6},"nFeatures","- Number of features (columns)",{"_17":19135,"_19":19175,"_41":6},"- Number of principal components",{"_17":454,"_19":8285,"_41":10},[],{"_17":19179,"_31":19180,"_33":19181,"_19":19182,"_36":19183,"_45":19062,"_47":19194},"ar.generalized.eignNear","ar.generalized.eignNear(matvec, solveShifted, n, nev, sigma, options?)","Find eigenvalues of a non-symmetric matrix nearest to a target value.\r","Find eigenvalues of a non-symmetric matrix nearest to a target value.\r\n\r\nThis is a convenience wrapper for shift-invert mode. You provide a\r\nfunction to solve (A - σI)x = b and this function finds eigenvalues\r\nclosest to σ.\r\n\r\nFor non-symmetric matrices, the shift σ can be complex. When σ is\r\ncomplex, the solver uses the real arithmetic formulation with both\r\nreal and imaginary shift components.",[19184,19185,19187,19189,19190,19192],{"_17":18994,"_19":19071,"_41":6},{"_17":18919,"_19":19186,"_41":6},"- Function solving (A - σI)x = b for real σ,\r\n or the appropriate shifted system for complex σ",{"_17":1206,"_19":19188,"_41":6},"- Dimension of the matrix",{"_17":18923,"_19":18981,"_41":6},{"_17":82,"_19":19191,"_41":6},"- Target value (real number or complex {re, im})",{"_17":454,"_19":19193,"_41":10},"- Additional solver options",[],{"_17":19196,"_31":19197,"_33":19198,"_19":19199,"_36":19200,"_45":8299,"_47":19209},"ar.generalized.eigsNear","ar.generalized.eigsNear(matvec, solveShifted, n, nev, sigma, options?)","Find eigenvalues of a symmetric matrix nearest to a target value.\r","Find eigenvalues of a symmetric matrix nearest to a target value.\r\n\r\nThis is a convenience wrapper for shift-invert mode that handles\r\nthe setup automatically. You provide a function to solve (A - σI)x = b\r\nand this function finds eigenvalues closest to σ.",[19201,19202,19204,19205,19206,19208],{"_17":18994,"_19":19083,"_41":6},{"_17":18919,"_19":19203,"_41":6},"- Function solving (A - σI)x = b, i.e., returns inv(A - σI)*b",{"_17":1206,"_19":19188,"_41":6},{"_17":18923,"_19":18981,"_41":6},{"_17":82,"_19":19207,"_41":6},"- Target value - finds eigenvalues closest to this",{"_17":454,"_19":19193,"_41":10},[],{"_17":19211,"_31":19212,"_33":19213,"_19":19214,"_36":19215,"_45":8299,"_47":19223},"ar.generalized.geigs","ar.generalized.geigs(Amatvec, Bmatvec, n, nev, options?)","Compute eigenvalues and eigenvectors of a generalized eigenvalue problem.\r","Compute eigenvalues and eigenvectors of a generalized eigenvalue problem.\r\n\r\nSolves A*x = λ*B*x where:\r\n- A is a symmetric matrix\r\n- B is a symmetric positive definite matrix",[19216,19217,19219,19221,19222],{"_17":18952,"_19":19071,"_41":6},{"_17":18955,"_19":19218,"_41":6},"- Function computing y = B*x (B must be symmetric positive definite)",{"_17":1206,"_19":19220,"_41":6},"- Dimension of the matrices (A, B are n×n)",{"_17":18923,"_19":18962,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":19225,"_31":19226,"_33":19227,"_19":19228,"_36":19229,"_45":19239,"_47":19240},"ar.graph.laplacianEigs","ar.graph.laplacianEigs(adjacencyMatvec, degrees, n, nev, options?)","Compute eigenvalues of the graph Laplacian for spectral clustering.\r","Compute eigenvalues of the graph Laplacian for spectral clustering.\r\n\r\nThis function computes the smallest eigenvalues of the graph Laplacian,\r\nwhich are used for spectral clustering and graph partitioning.",[19230,19233,19235,19237,19238],{"_17":19231,"_19":19232,"_41":6},"adjacencyMatvec","- Function computing y = A*x where A is the adjacency matrix",{"_17":19130,"_19":19234,"_41":6},"- Degree of each node (row sums of adjacency matrix), or function to compute D*x",{"_17":1206,"_19":19236,"_41":6},"- Number of nodes in the graph",{"_17":18923,"_19":18962,"_41":6},{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19242,"_31":19243,"_33":19244,"_19":19245,"_36":19246,"_45":19253,"_47":19254},"ar.graph.pagerank","ar.graph.pagerank(outlinksMatvec, n, options?)","Compute PageRank scores for a directed graph.\r","Compute PageRank scores for a directed graph.\r\n\r\nUses power iteration to find the dominant eigenvector of the\r\nGoogle matrix G = d*M + (1-d)*v*e^T, where:\r\n- M is the column-stochastic transition matrix\r\n- d is the damping factor\r\n- v is the personalization vector\r\n- e is the all-ones vector",[19247,19250,19251],{"_17":19248,"_19":19249,"_41":6},"outlinksMatvec","- Function computing y = M*x where M is column-stochastic\r\n (columns sum to 1, or 0 for dangling nodes)",{"_17":1206,"_19":19236,"_41":6},{"_17":454,"_19":19252,"_41":10},"- Algorithm options","Promise",[],{"_17":19256,"_31":19257,"_33":19258,"_19":19259,"_36":19260,"_45":19253,"_47":19266},"ar.graph.pagerankEigs","ar.graph.pagerankEigs(outlinksMatvec, n, options?)","Alternative PageRank using ARPACK eigenvalue solver.\r","Alternative PageRank using ARPACK eigenvalue solver.\r\n\r\nFinds the dominant eigenvector of the Google matrix directly.\r\nThis may be more efficient for very large graphs or when high\r\nprecision is needed.",[19261,19263,19265],{"_17":19248,"_19":19262,"_41":6},"- Function computing y = M*x",{"_17":1206,"_19":19264,"_41":6},"- Number of nodes",{"_17":454,"_19":19252,"_41":10},[],{"_17":19268,"_31":19269,"_33":19270,"_19":19271,"_36":19272,"_45":19281,"_47":19282},"ar.linalg.condest","ar.linalg.condest(matvec, matvecT, n, options?)","Estimate the condition number of a matrix.\r","Estimate the condition number of a matrix.\r\n\r\nComputes both the largest and smallest singular values to estimate\r\nthe 2-norm condition number κ(A) = σ_max / σ_min.",[19273,19275,19278,19280],{"_17":18994,"_19":19274,"_41":6},"- Function computing y = A*x (m×n matrix times n-vector)",{"_17":19276,"_19":19277,"_41":6},"matvecT","- Function computing y = A^T*x (n×m matrix times m-vector)",{"_17":1206,"_19":19279,"_41":6},"- Number of columns (for square matrices, n = m)",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19284,"_31":19285,"_33":19286,"_19":19287,"_36":19288,"_45":19296,"_47":19297},"ar.linalg.nuclearNormApprox","ar.linalg.nuclearNormApprox(matvec, matvecT, m, n, k, options?)","Approximate the nuclear norm by summing the k largest singular values.\r","Approximate the nuclear norm by summing the k largest singular values.\r\n\r\nFor matrices where most singular values are small, summing the largest k\r\ngives a good approximation. This is a lower bound on the true nuclear norm.",[19289,19290,19291,19292,19293,19295],{"_17":18994,"_19":19274,"_41":6},{"_17":19276,"_19":19277,"_41":6},{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":4686,"_19":19294,"_41":6},"- Number of singular values to compute",{"_17":454,"_19":8285,"_41":10},"Promise",[],{"_17":19299,"_31":19300,"_33":19301,"_19":19302,"_36":19303,"_45":3784,"_47":19309},"ar.linalg.spectralNorm","ar.linalg.spectralNorm(matvec, matvecT, m, n, options?)","Compute the spectral norm (2-norm) of a matrix.\r","Compute the spectral norm (2-norm) of a matrix.\r\n\r\nThe spectral norm is the largest singular value, which equals\r\nthe square root of the largest eigenvalue of A^T*A.",[19304,19305,19306,19307,19308],{"_17":18994,"_19":19274,"_41":6},{"_17":19276,"_19":19277,"_41":6},{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":19311,"_31":19312,"_33":19313,"_19":19314,"_36":19315,"_45":3784,"_47":19319},"ar.linalg.spectralRadius","ar.linalg.spectralRadius(matvec, n, options?)","Compute the spectral radius of a matrix.\r","Compute the spectral radius of a matrix.\r\n\r\nThe spectral radius is the largest magnitude eigenvalue.",[19316,19317,19318],{"_17":18994,"_19":19071,"_41":6},{"_17":1206,"_19":19188,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":19321,"_31":19322,"_33":19323,"_19":19324,"_36":19325,"_45":19333,"_47":19334},"ar.matfun.expmv","ar.matfun.expmv(matvec, v, t, options?)","Compute y = exp(t*A) * v using Krylov subspace approximation.\r","Compute y = exp(t*A) * v using Krylov subspace approximation.\r\n\r\nThis function computes the action of the matrix exponential on a vector\r\nwithout explicitly forming exp(t*A). This is efficient for large sparse\r\nmatrices where only matrix-vector products are available.",[19326,19327,19329,19332],{"_17":18994,"_19":18953,"_41":6},{"_17":676,"_19":19328,"_41":6},"- Input vector",{"_17":19330,"_19":19331,"_41":6},"t","- Time/scaling parameter",{"_17":454,"_19":8347,"_41":10},"ExpmvResult",[],{"_17":19336,"_31":19337,"_33":19338,"_19":19339,"_36":19340,"_45":19346,"_47":19347},"ar.matfun.expmvMultiple","ar.matfun.expmvMultiple(matvec, v, times, options?)","Compute y = exp(t*A) * v for multiple time points.\r","Compute y = exp(t*A) * v for multiple time points.\r\n\r\nMore efficient than calling expmv multiple times as it reuses\r\nthe Krylov basis.",[19341,19342,19343,19345],{"_17":18994,"_19":18953,"_41":6},{"_17":676,"_19":19328,"_41":6},{"_17":2896,"_19":19344,"_41":6},"- Array of time points",{"_17":454,"_19":8347,"_41":10},"ExpmvResult[]",[],{"_17":19349,"_31":19350,"_33":19351,"_19":19352,"_36":19353,"_45":19358,"_47":19359},"ar.matfun.sqrtmv","ar.matfun.sqrtmv(matvec, v, options?)","Compute y = A^(1/2) * v for symmetric positive definite A.\r","Compute y = A^(1/2) * v for symmetric positive definite A.\r\n\r\nUses a partial eigendecomposition to approximate A^(1/2).\r\nThe approximation is: A^(1/2) ≈ Σ sqrt(λ_i) * v_i * v_i^T",[19354,19356,19357],{"_17":18994,"_19":19355,"_41":6},"- Symmetric positive definite matrix operator A*x",{"_17":676,"_19":19328,"_41":6},{"_17":454,"_19":8347,"_41":10},"Promise",[],{"_17":19361,"_31":19362,"_33":19363,"_19":19364,"_36":19365,"_45":19358,"_47":19369},"ar.matfun.invsqrtmv","ar.matfun.invsqrtmv(matvec, v, options?)","Compute y = A^(-1/2) * v for symmetric positive definite A.\r","Compute y = A^(-1/2) * v for symmetric positive definite A.\r\n\r\nUses a partial eigendecomposition to approximate A^(-1/2).",[19366,19367,19368],{"_17":18994,"_19":19355,"_41":6},{"_17":676,"_19":19328,"_41":6},{"_17":454,"_19":8347,"_41":10},[],{"_17":19371,"_31":19372,"_33":19373,"_19":19374,"_36":19375,"_45":19358,"_47":19381},"ar.matfun.matpowv","ar.matfun.matpowv(matvec, v, p, options?)","Compute y = A^p * v for symmetric positive definite A and any real power p.\r","Compute y = A^p * v for symmetric positive definite A and any real power p.\r\n\r\nGeneralizes sqrtmv (p=0.5) and invsqrtmv (p=-0.5).",[19376,19377,19378,19380],{"_17":18994,"_19":19355,"_41":6},{"_17":676,"_19":19328,"_41":6},{"_17":5212,"_19":19379,"_41":6},"- Power to raise the matrix to",{"_17":454,"_19":8347,"_41":10},[],{"_17":19383,"_31":19384,"_33":19385,"_19":19386,"_36":19387,"_45":19396,"_47":19397},"ar.operators.addMatvec","ar.operators.addMatvec(A, B, alpha?, beta?)","ARWasm - ARPACK WebAssembly Module\r","ARWasm - ARPACK WebAssembly Module\r\n\r\nThis package provides a WebAssembly build of ARPACK (ARnoldi PACKage),\r\na collection of Fortran77 subroutines designed to solve large scale\r\neigenvalue problems.\r\n\r\nARPACK provides routines for:\r\n- Real symmetric eigenvalue problems (dsaupd/dseupd, ssaupd/sseupd)\r\n- Real nonsymmetric eigenvalue problems (dnaupd/dneupd, snaupd/sneupd)\r\n- Complex eigenvalue problems (cnaupd/cneupd, znaupd/zneupd)\r\n\r\n## High-Level API\r\n\r\nFor most use cases, use the high-level functions that handle all the\r\ncomplexity of the reverse communication interface:",[19388,19390,19392,19394],{"_17":1163,"_19":19389,"_41":6},"- First matrix operator",{"_17":1166,"_19":19391,"_41":6},"- Second matrix operator",{"_17":60,"_19":19393,"_41":10},"- Scalar multiplier for A (default 1)",{"_17":118,"_19":19395,"_41":10},"- Scalar multiplier for B (default 1)","MatVecFunction",[],{"_17":19399,"_31":19400,"_33":19401,"_19":19402,"_36":19403,"_45":19396,"_47":19406},"ar.operators.mulMatvec","ar.operators.mulMatvec(A, B)","Create a product operator: y = A * B * x\r","Create a product operator: y = A * B * x\r\n\r\nComputes the composition of two operators. Note: this computes B first,\r\nthen A, matching mathematical notation A*B*x = A*(B*x).",[19404,19405],{"_17":1163,"_19":17479,"_41":6},{"_17":1166,"_19":17481,"_41":6},[],{"_17":19408,"_31":19409,"_33":19410,"_19":19411,"_36":19412,"_45":19396,"_47":19417},"ar.operators.shiftMatvec","ar.operators.shiftMatvec(matvec, sigma)","Create a shifted operator: y = (A - σI) * x\r","Create a shifted operator: y = (A - σI) * x\r\n\r\nUseful for shift-invert mode where you need to work with A - σI.",[19413,19415],{"_17":18994,"_19":19414,"_41":6},"- Matrix operator A",{"_17":82,"_19":19416,"_41":6},"- Shift value σ",[],{"_17":19419,"_31":19420,"_33":19421,"_19":19421,"_36":19422,"_45":19396,"_47":19425},"ar.operators.scaleMatvec","ar.operators.scaleMatvec(matvec, alpha)","Create a scaled operator: y = α * A * x",[19423,19424],{"_17":18994,"_19":19414,"_41":6},{"_17":60,"_19":17511,"_41":6},[],{"_17":19427,"_31":19428,"_33":19429,"_19":19430,"_36":19431,"_45":19396,"_47":19438},"ar.operators.transposeMatvec","ar.operators.transposeMatvec(matvec, m, n)","Create a transpose operator via explicit computation.\r","Create a transpose operator via explicit computation.\r\n\r\nThis builds A^T by probing A with standard basis vectors.\r\nWARNING: This is O(n²) and should only be used for small matrices\r\nor when no other option exists.\r\n\r\nFor large matrices, prefer providing an explicit transpose operator.",[19432,19434,19436],{"_17":18994,"_19":19433,"_41":6},"- Matrix operator A (m x n)",{"_17":630,"_19":19435,"_41":6},"- Number of rows in A",{"_17":1206,"_19":19437,"_41":6},"- Number of columns in A",[],{"_17":19440,"_31":19441,"_33":19442,"_19":19443,"_36":19444,"_45":19396,"_47":19448},"ar.operators.symmetrizeMatvec","ar.operators.symmetrizeMatvec(matvec, matvecT)","Create a symmetrized operator: y = (A + A^T)/2 * x\r","Create a symmetrized operator: y = (A + A^T)/2 * x\r\n\r\nThis makes a non-symmetric operator symmetric. Requires both A and A^T.",[19445,19446],{"_17":18994,"_19":19414,"_41":6},{"_17":19276,"_19":19447,"_41":6},"- Transpose operator A^T",[],{"_17":19450,"_31":19451,"_33":19452,"_19":19452,"_36":19453,"_45":19396,"_47":19456},"ar.operators.identityMatvec","ar.operators.identityMatvec(n)","Create an identity operator: y = x",[19454],{"_17":1206,"_19":19455,"_41":6},"- Dimension",[],{"_17":19458,"_31":19459,"_33":19460,"_19":19460,"_36":19461,"_45":19396,"_47":19463},"ar.operators.negateMatvec","ar.operators.negateMatvec(matvec)","Create a negated operator: y = -A * x",[19462],{"_17":18994,"_19":19414,"_41":6},[],{"_17":19465,"_31":19466,"_33":19467,"_19":19468,"_36":19469,"_45":19396,"_47":19473},"ar.operators.powerMatvec","ar.operators.powerMatvec(matvec, k)","Create a power operator: y = A^k * x\r","Create a power operator: y = A^k * x\r\n\r\nComputes the k-th power of an operator by repeated application.",[19470,19471],{"_17":18994,"_19":19414,"_41":6},{"_17":4686,"_19":19472,"_41":6},"- Power (must be non-negative integer)",[],{"_17":19475,"_31":19476,"_33":19477,"_19":19478,"_36":19479,"_45":19396,"_47":19485},"ar.operators.blockDiagMatvec","ar.operators.blockDiagMatvec(operators, sizes)","Create a block diagonal operator from multiple sub-operators.\r","Create a block diagonal operator from multiple sub-operators.\r\n\r\nGiven operators A₁, A₂, ..., Aₖ, creates:\r\n```\r\n[A₁ 0 0 ]\r\n[ 0 A₂ 0 ]\r\n[ 0 0 A₃ ]\r\n```",[19480,19482],{"_17":17459,"_19":19481,"_41":6},"- Array of matrix operators",{"_17":19483,"_19":19484,"_41":6},"sizes","- Array of dimensions for each operator",[],{"_17":19487,"_31":19488,"_33":19489,"_19":19490,"_36":19491,"_45":19396,"_47":19498},"ar.sparse.bandedMatvec","ar.sparse.bandedMatvec(bands, offsets, n)","Create a matrix-vector product function from a banded matrix.\r","Create a matrix-vector product function from a banded matrix.\r\n\r\nA banded matrix has non-zero entries only on certain diagonals.\r\nEach diagonal is specified by its offset from the main diagonal:\r\n- offset = 0: main diagonal\r\n- offset > 0: super-diagonals (above main)\r\n- offset < 0: sub-diagonals (below main)",[19492,19494,19496],{"_17":17926,"_19":19493,"_41":6},"- Array of diagonal entries, one Float64Array per band",{"_17":287,"_19":19495,"_41":6},"- Offset for each band (0 = main diagonal, positive = super, negative = sub)",{"_17":1206,"_19":19497,"_41":6},"- Matrix dimension (square matrix)",[],{"_17":19500,"_31":19501,"_33":19502,"_19":19503,"_36":19504,"_45":19396,"_47":19508},"ar.sparse.symBandedMatvec","ar.sparse.symBandedMatvec(bands, n)","Create a symmetric banded matrix-vector product function.\r","Create a symmetric banded matrix-vector product function.\r\n\r\nFor symmetric banded matrices, only the upper (or lower) bands need\r\nto be specified. This function mirrors them automatically.",[19505,19507],{"_17":17926,"_19":19506,"_41":6},"- Upper bands (including main diagonal), indexed by offset (0, 1, 2, ...)",{"_17":1206,"_19":1207,"_41":6},[],{"_17":19510,"_31":19511,"_33":19512,"_19":19513,"_36":19514,"_45":19396,"_47":19521},"ar.sparse.toeplitzBandedMatvec","ar.sparse.toeplitzBandedMatvec(bandValues, offsets, n)","Create a Toeplitz banded matrix-vector product function.\r","Create a Toeplitz banded matrix-vector product function.\r\n\r\nFor banded matrices where each diagonal has a constant value.",[19515,19518,19520],{"_17":19516,"_19":19517,"_41":6},"bandValues","- Value for each band",{"_17":287,"_19":19519,"_41":6},"- Offset for each band",{"_17":1206,"_19":1207,"_41":6},[],{"_17":19523,"_31":19524,"_33":19525,"_19":19526,"_36":19527,"_45":19396,"_47":19536},"ar.sparse.cooMatvec","ar.sparse.cooMatvec(rows, cols, values, shape)","Create a matrix-vector product function from COO sparse matrix format.\r","Create a matrix-vector product function from COO sparse matrix format.\r\n\r\nCOO format stores a sparse matrix using three arrays:\r\n- rows: Row indices for each non-zero entry\r\n- cols: Column indices for each non-zero entry\r\n- values: Non-zero values",[19528,19530,19532,19534],{"_17":2401,"_19":19529,"_41":6},"- Row indices array",{"_17":2391,"_19":19531,"_41":6},"- Column indices array",{"_17":560,"_19":19533,"_41":6},"- Non-zero values array",{"_17":8459,"_19":19535,"_41":6},"- Matrix dimensions [m, n] (rows, cols)",[],{"_17":19538,"_31":19539,"_33":19540,"_19":19541,"_36":19542,"_45":19396,"_47":19548},"ar.sparse.cooMatvecT","ar.sparse.cooMatvecT(rows, cols, values, shape)","Create a transpose matrix-vector product function from COO format.\r","Create a transpose matrix-vector product function from COO format.\r\n\r\nComputes y = A^T * x using COO format.",[19543,19544,19545,19546],{"_17":2401,"_19":19529,"_41":6},{"_17":2391,"_19":19531,"_41":6},{"_17":560,"_19":19533,"_41":6},{"_17":8459,"_19":19547,"_41":6},"- Matrix dimensions [m, n]",[],{"_17":19550,"_31":19551,"_33":19552,"_19":19553,"_36":19554,"_45":19396,"_47":19561},"ar.sparse.cscMatvec","ar.sparse.cscMatvec(indptr, indices, data, shape)","Create a matrix-vector product function from CSC sparse matrix format.\r","Create a matrix-vector product function from CSC sparse matrix format.\r\n\r\nCSC format stores a sparse matrix using three arrays:\r\n- indptr: Column pointers (length n+1). indptr[j] to indptr[j+1] gives the\r\n range of indices in data/indices for column j.\r\n- indices: Row indices for each non-zero entry\r\n- data: Non-zero values",[19555,19558,19559,19560],{"_17":19556,"_19":19557,"_41":6},"indptr","- Column pointer array (length n+1)",{"_17":9784,"_19":19529,"_41":6},{"_17":1215,"_19":19533,"_41":6},{"_17":8459,"_19":19535,"_41":6},[],{"_17":19563,"_31":19564,"_33":19565,"_19":19566,"_36":19567,"_45":19396,"_47":19573},"ar.sparse.cscMatvecT","ar.sparse.cscMatvecT(indptr, indices, data, shape)","Create a transpose matrix-vector product function from CSC format.\r","Create a transpose matrix-vector product function from CSC format.\r\n\r\nComputes y = A^T * x efficiently using CSC format.\r\nThis is equivalent to CSR matvec on the original matrix.",[19568,19570,19571,19572],{"_17":19556,"_19":19569,"_41":6},"- Column pointer array",{"_17":9784,"_19":19529,"_41":6},{"_17":1215,"_19":19533,"_41":6},{"_17":8459,"_19":19547,"_41":6},[],{"_17":19575,"_31":19576,"_33":19577,"_19":19578,"_36":19579,"_45":19396,"_47":19585},"ar.sparse.csrMatvec","ar.sparse.csrMatvec(indptr, indices, data, shape)","Create a matrix-vector product function from CSR sparse matrix format.\r","Create a matrix-vector product function from CSR sparse matrix format.\r\n\r\nCSR format stores a sparse matrix using three arrays:\r\n- indptr: Row pointers (length m+1). indptr[i] to indptr[i+1] gives the\r\n range of indices in data/indices for row i.\r\n- indices: Column indices for each non-zero entry\r\n- data: Non-zero values",[19580,19582,19583,19584],{"_17":19556,"_19":19581,"_41":6},"- Row pointer array (length m+1)",{"_17":9784,"_19":19531,"_41":6},{"_17":1215,"_19":19533,"_41":6},{"_17":8459,"_19":19535,"_41":6},[],{"_17":19587,"_31":19588,"_33":19589,"_19":19590,"_36":19591,"_45":19396,"_47":19597},"ar.sparse.csrMatvecT","ar.sparse.csrMatvecT(indptr, indices, data, shape)","Create a transpose matrix-vector product function from CSR format.\r","Create a transpose matrix-vector product function from CSR format.\r\n\r\nComputes y = A^T * x efficiently using CSR format.",[19592,19594,19595,19596],{"_17":19556,"_19":19593,"_41":6},"- Row pointer array",{"_17":9784,"_19":19531,"_41":6},{"_17":1215,"_19":19533,"_41":6},{"_17":8459,"_19":19547,"_41":6},[],{"_17":19599,"_31":19600,"_33":19601,"_19":19602,"_36":19603,"_45":19396,"_47":19612},"ar.sparse.denseMatvec","ar.sparse.denseMatvec(matrix, m, n, rowMajor?)","Create a matrix-vector product function from a dense matrix.\r","Create a matrix-vector product function from a dense matrix.\r\n\r\nThe matrix is stored as a flat Float64Array in either row-major\r\n(C-style) or column-major (Fortran-style) order.",[19604,19607,19608,19609],{"_17":19605,"_19":19606,"_41":6},"matrix","- Flat array containing matrix elements (length m*n)",{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":19610,"_19":19611,"_41":10},"rowMajor","- If true, matrix is row-major (default). If false, column-major.",[],{"_17":19614,"_31":19615,"_33":19616,"_19":19616,"_36":19617,"_45":19396,"_47":19624},"ar.sparse.denseMatvecT","ar.sparse.denseMatvecT(matrix, m, n, rowMajor?)","Create a transpose matrix-vector product function from a dense matrix.",[19618,19620,19621,19622],{"_17":19605,"_19":19619,"_41":6},"- Flat array containing matrix elements",{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":19610,"_19":19623,"_41":10},"- If true, matrix is row-major. If false, column-major.",[],{"_17":19626,"_31":19627,"_33":19628,"_19":19629,"_36":19630,"_45":19396,"_47":19633},"ar.sparse.diagMatvec","ar.sparse.diagMatvec(diagonal)","Create a matrix-vector product function from a diagonal matrix.\r","Create a matrix-vector product function from a diagonal matrix.\r\n\r\nFor a diagonal matrix D with diagonal entries d[i], computes:\r\ny[i] = d[i] * x[i]",[19631],{"_17":17720,"_19":19632,"_41":6},"- Diagonal entries (length n)",[],{"_17":19635,"_31":19636,"_33":19637,"_19":19638,"_36":19639,"_45":19396,"_47":19644},"ar.sparse.diagMatvecInv","ar.sparse.diagMatvecInv(diagonal, tol?)","Create an inverse diagonal matrix-vector product function.\r","Create an inverse diagonal matrix-vector product function.\r\n\r\nComputes y = D^{-1} * x where D is diagonal.\r\nUseful for preconditioning.",[19640,19642],{"_17":17720,"_19":19641,"_41":6},"- Diagonal entries (must be non-zero)",{"_17":470,"_19":19643,"_41":10},"- Tolerance for \"zero\" entries (default 1e-14)",[],{"_17":19646,"_31":19647,"_33":19648,"_19":19649,"_36":19650,"_45":19396,"_47":19653},"ar.sparse.diagMatvecSqrt","ar.sparse.diagMatvecSqrt(diagonal)","Create a sqrt-diagonal matrix-vector product function.\r","Create a sqrt-diagonal matrix-vector product function.\r\n\r\nComputes y = D^{1/2} * x where D is diagonal with non-negative entries.\r\nUseful for symmetric normalization.",[19651],{"_17":17720,"_19":19652,"_41":6},"- Diagonal entries (must be non-negative)",[],{"_17":19655,"_31":19656,"_33":19657,"_19":19658,"_36":19659,"_45":19396,"_47":19663},"ar.sparse.diagMatvecInvSqrt","ar.sparse.diagMatvecInvSqrt(diagonal, tol?)","Create an inverse-sqrt-diagonal matrix-vector product function.\r","Create an inverse-sqrt-diagonal matrix-vector product function.\r\n\r\nComputes y = D^{-1/2} * x where D is diagonal with positive entries.\r\nUseful for symmetric normalization of Laplacians.",[19660,19662],{"_17":17720,"_19":19661,"_41":6},"- Diagonal entries (must be positive)",{"_17":470,"_19":19643,"_41":10},[],{"_17":19665,"_31":19666,"_33":19667,"_19":19668,"_36":19669,"_45":19396,"_47":19676},"ar.sparse.tridiagMatvec","ar.sparse.tridiagMatvec(lower, diag, upper)","Create a matrix-vector product function from a tridiagonal matrix.\r","Create a matrix-vector product function from a tridiagonal matrix.\r\n\r\nA tridiagonal matrix has non-zero entries only on the main diagonal\r\nand the immediately adjacent diagonals:\r\n\r\n```\r\n[d0 u0 0 0 ]\r\n[l0 d1 u1 0 ]\r\n[ 0 l1 d2 u2 ]\r\n[ 0 0 l2 d3 ]\r\n```",[19670,19672,19674],{"_17":4695,"_19":19671,"_41":6},"- Sub-diagonal entries (length n-1)",{"_17":3985,"_19":19673,"_41":6},"- Main diagonal entries (length n)",{"_17":4709,"_19":19675,"_41":6},"- Super-diagonal entries (length n-1)",[],{"_17":19678,"_31":19679,"_33":19680,"_19":19681,"_36":19682,"_45":19396,"_47":19687},"ar.sparse.symTridiagMatvec","ar.sparse.symTridiagMatvec(diag, offdiag)","Create a symmetric tridiagonal matrix-vector product function.\r","Create a symmetric tridiagonal matrix-vector product function.\r\n\r\nFor symmetric tridiagonal matrices where lower = upper.\r\nUses only two arrays instead of three.",[19683,19684],{"_17":3985,"_19":19673,"_41":6},{"_17":19685,"_19":19686,"_41":6},"offdiag","- Off-diagonal entries (length n-1)",[],{"_17":19689,"_31":19690,"_33":19691,"_19":19692,"_36":19693,"_45":19396,"_47":19702},"ar.sparse.toeplitzTridiagMatvec","ar.sparse.toeplitzTridiagMatvec(lower, diagVal, upper, n)","Create a Toeplitz tridiagonal matrix-vector product function.\r","Create a Toeplitz tridiagonal matrix-vector product function.\r\n\r\nFor constant-coefficient tridiagonal matrices where all diagonal\r\nentries are the same.",[19694,19696,19699,19701],{"_17":4695,"_19":19695,"_41":6},"- Sub-diagonal value",{"_17":19697,"_19":19698,"_41":6},"diagVal","- Main diagonal value",{"_17":4709,"_19":19700,"_41":6},"- Super-diagonal value",{"_17":1206,"_19":1207,"_41":6},[],{"_17":19704,"_31":19705,"_33":19706,"_19":19707,"_36":19708,"_45":8323,"_47":19719},"ar.svd.svds","ar.svd.svds(matvec, matvecT, m, n, k, options?)","Compute partial singular value decomposition of a sparse matrix.\r","Compute partial singular value decomposition of a sparse matrix.\r\n\r\nFinds the k largest or smallest singular values and optionally the\r\ncorresponding left and right singular vectors.",[19709,19711,19713,19715,19717,19718],{"_17":18994,"_19":19710,"_41":6},"- Function computing y = A*x (m×n matrix applied to n-vector)",{"_17":19276,"_19":19712,"_41":6},"- Function computing y = A^T*x (n×m matrix applied to m-vector)",{"_17":630,"_19":19714,"_41":6},"- Number of rows in the matrix",{"_17":1206,"_19":19716,"_41":6},"- Number of columns in the matrix",{"_17":4686,"_19":19294,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":19721,"_31":19722,"_33":19723,"_19":19724,"_36":19725,"_45":19733,"_47":19734},"ar.validation.verifyEigs","ar.validation.verifyEigs(matvec, eigenvalues, eigenvectors, options?)","Verify eigenvalue/eigenvector pairs.\r","Verify eigenvalue/eigenvector pairs.\r\n\r\nFor each eigenpair (λ, v), computes the residual ||A*v - λ*v||\r\nand checks orthogonality of eigenvectors.",[19726,19727,19729,19731],{"_17":18994,"_19":19414,"_41":6},{"_17":2414,"_19":19728,"_41":6},"- Computed eigenvalues",{"_17":1178,"_19":19730,"_41":6},"- Computed eigenvectors",{"_17":454,"_19":19732,"_41":10},"- Verification options","VerifyEigsResult",[],{"_17":19736,"_31":19737,"_33":19738,"_19":19739,"_36":19740,"_45":19733,"_47":19751},"ar.validation.verifyEign","ar.validation.verifyEign(matvec, eigenvaluesReal, eigenvaluesImag, eigenvectors, options?)","Verify non-symmetric eigenvalue/eigenvector pairs.\r","Verify non-symmetric eigenvalue/eigenvector pairs.\r\n\r\nFor non-symmetric matrices, eigenvalues may be complex.\r\nThis verifies pairs where eigenvaluesImag[i] != 0 indicates\r\ncomplex conjugate pairs.",[19741,19742,19745,19748,19750],{"_17":18994,"_19":19414,"_41":6},{"_17":19743,"_19":19744,"_41":6},"eigenvaluesReal","- Real parts of eigenvalues",{"_17":19746,"_19":19747,"_41":6},"eigenvaluesImag","- Imaginary parts of eigenvalues",{"_17":1178,"_19":19749,"_41":6},"- Eigenvectors (see EignResult for format)",{"_17":454,"_19":19732,"_41":10},[],{"_17":19753,"_31":19754,"_33":19755,"_19":19756,"_36":19757,"_45":19769,"_47":19770},"ar.validation.verifySvds","ar.validation.verifySvds(matvec, matvecT, U, s, Vt, options?)","Verify singular value decomposition.\r","Verify singular value decomposition.\r\n\r\nChecks that:\r\n- A*v_i ≈ σ_i * u_i\r\n- A^T*u_i ≈ σ_i * v_i\r\n- U vectors are orthonormal\r\n- V vectors are orthonormal",[19758,19759,19761,19763,19765,19768],{"_17":18994,"_19":18953,"_41":6},{"_17":19276,"_19":19760,"_41":6},"- Transpose operator A^T*x",{"_17":5709,"_19":19762,"_41":6},"- Left singular vectors",{"_17":771,"_19":19764,"_41":6},"- Singular values",{"_17":19766,"_19":19767,"_41":6},"Vt","- Right singular vectors (rows)",{"_17":454,"_19":19732,"_41":10},"VerifySvdsResult",[],{"_17":19772,"_31":19773,"_33":19774,"_19":19775,"_36":19776,"_45":19784,"_47":19785},"ar.validation.checkSymmetry","ar.validation.checkSymmetry(matvec, n, nProbes?, tol?)","Check if a matrix is symmetric via random probing.\r","Check if a matrix is symmetric via random probing.\r\n\r\nTests whether x^T*A*y ≈ y^T*A*x for random vectors x, y.\r\nThis is a probabilistic test that can detect asymmetry but\r\ncannot prove symmetry.",[19777,19778,19779,19782],{"_17":18994,"_19":19414,"_41":6},{"_17":1206,"_19":1207,"_41":6},{"_17":19780,"_19":19781,"_41":10},"nProbes","- Number of random probe pairs (default 10)",{"_17":470,"_19":19783,"_41":10},"- Tolerance for asymmetry (default 1e-10)","SymmetryCheckResult",[],{"_17":19787,"_31":19788,"_33":19789,"_19":19790,"_36":19791,"_45":19797,"_47":19798},"ar.validation.checkPositiveDefinite","ar.validation.checkPositiveDefinite(matvec, n, tol?)","Check if a matrix is positive definite.\r","Check if a matrix is positive definite.\r\n\r\nComputes the smallest eigenvalue using eigs and checks if it's positive.\r\nNote: This requires the eigs function to be available.",[19792,19794,19795],{"_17":18994,"_19":19793,"_41":6},"- Matrix operator A (must be symmetric)",{"_17":1206,"_19":1207,"_41":6},{"_17":470,"_19":19796,"_41":10},"- Tolerance for positive eigenvalue (default 0)","Promise",[],{"_17":19800,"_31":19801,"_33":19802,"_19":19803,"_36":19804,"_45":19809,"_47":19810},"ar.validation.checkNormalization","ar.validation.checkNormalization(eigenvectors, tol?)","Check normalization of eigenvectors.\r","Check normalization of eigenvectors.\r\n\r\nVerifies that each eigenvector has unit norm.",[19805,19807],{"_17":1178,"_19":19806,"_41":6},"- Array of eigenvectors",{"_17":470,"_19":19808,"_41":10},"- Tolerance for unit norm (default 1e-10)","{\r\n isNormalized: boolean;\r\n norms: Float64Array;\r\n maxDeviation: number;\r\n}",[],{"_17":19812,"_31":19813,"_33":19814,"_19":1136,"_36":19815,"_45":46,"_47":19818},"ar.configureARPACK","ar.configureARPACK(config)","configureARPACK",[19816],{"_17":3805,"_19":19817,"_41":6},"ARPACKLoadConfig",[],{"_17":19820,"_31":19821,"_33":19822,"_19":19822,"_36":19823,"_45":1387,"_47":19830},"ar.defaultNcv","ar.defaultNcv(n, nev, symmetric)","Calculate default ncv value.",[19824,19825,19827],{"_17":1206,"_19":1207,"_41":6},{"_17":18923,"_19":19826,"_41":6},"- Number of eigenvalues requested",{"_17":19828,"_19":19829,"_41":6},"symmetric","- Whether the problem is symmetric",[],{"_17":19832,"_31":19833,"_33":19834,"_19":19834,"_36":19835,"_45":1387,"_47":19839},"ar.dnaupdWorklSize","ar.dnaupdWorklSize(ncv)","Calculate required workl size for non-symmetric problems (dnaupd).",[19836],{"_17":19837,"_19":19838,"_41":6},"ncv","- Number of Arnoldi vectors",[],{"_17":19841,"_31":19842,"_33":19843,"_19":19843,"_36":19844,"_45":1387,"_47":19846},"ar.dneupdWorkevSize","ar.dneupdWorkevSize(ncv)","Calculate required workev size for non-symmetric extraction (dneupd).",[19845],{"_17":19837,"_19":19838,"_41":6},[],{"_17":19848,"_31":19849,"_33":19850,"_19":19850,"_36":19851,"_45":1387,"_47":19854},"ar.dsaupdWorklSize","ar.dsaupdWorklSize(ncv)","Calculate required workl size for symmetric problems (dsaupd).",[19852],{"_17":19837,"_19":19853,"_41":6},"- Number of Lanczos vectors",[],{"_17":19856,"_31":19857,"_33":19858,"_19":1136,"_36":19859,"_45":19860,"_47":19861},"ar.getARPACKModule","ar.getARPACKModule()","getARPACKModule",[],"ARPACKModule",[],{"_17":19863,"_31":19864,"_33":19865,"_19":19865,"_36":19866,"_45":1793,"_47":19869},"ar.getDnaupdMessage","ar.getDnaupdMessage(info)","Get error message for dnaupd info code.",[19867],{"_17":19868,"_19":1387,"_41":6},"info",[],{"_17":19871,"_31":19872,"_33":19873,"_19":19873,"_36":19874,"_45":1793,"_47":19876},"ar.getDneupdMessage","ar.getDneupdMessage(info)","Get error message for dneupd info code.",[19875],{"_17":19868,"_19":1387,"_41":6},[],{"_17":19878,"_31":19879,"_33":19880,"_19":19880,"_36":19881,"_45":1793,"_47":19883},"ar.getDsaupdMessage","ar.getDsaupdMessage(info)","Get error message for dsaupd info code.",[19882],{"_17":19868,"_19":1387,"_41":6},[],{"_17":19885,"_31":19886,"_33":19887,"_19":19887,"_36":19888,"_45":1793,"_47":19890},"ar.getDseupdMessage","ar.getDseupdMessage(info)","Get error message for dseupd info code.",[19889],{"_17":19868,"_19":1387,"_41":6},[],{"_17":19892,"_31":19893,"_33":19894,"_19":19894,"_36":19895,"_45":1793,"_47":19897},"ar.getZnaupdMessage","ar.getZnaupdMessage(info)","Get error message for znaupd info code.",[19896],{"_17":19868,"_19":1387,"_41":6},[],{"_17":19899,"_31":19900,"_33":19901,"_19":19901,"_36":19902,"_45":1793,"_47":19904},"ar.getZneupdMessage","ar.getZneupdMessage(info)","Get error message for zneupd info code.",[19903],{"_17":19868,"_19":1387,"_41":6},[],{"_17":19906,"_31":19907,"_33":19908,"_19":1136,"_36":19909,"_45":2598,"_47":19910},"ar.isARPACKLoaded","ar.isARPACKLoaded()","isARPACKLoaded",[],[],{"_17":19912,"_31":19913,"_33":19914,"_19":1136,"_36":19915,"_45":19916,"_47":19917},"ar.loadARPACKModule","ar.loadARPACKModule()","loadARPACKModule",[],"Promise",[],{"_17":19919,"_31":19920,"_33":19921,"_19":1136,"_36":19922,"_45":46,"_47":19923},"ar.resetARPACKModule","ar.resetARPACKModule()","resetARPACKModule",[],[],{"_17":19925,"_31":19926,"_33":19927,"_19":19927,"_36":19928,"_45":1387,"_47":19930},"ar.znaupdRworkSize","ar.znaupdRworkSize(ncv)","Calculate required rwork size for complex problems (znaupd).",[19929],{"_17":19837,"_19":19838,"_41":6},[],{"_17":19932,"_31":19933,"_33":19934,"_19":19934,"_36":19935,"_45":1387,"_47":19937},"ar.znaupdWorklSize","ar.znaupdWorklSize(ncv)","Calculate required workl size for complex problems (znaupd).",[19936],{"_17":19837,"_19":19838,"_41":6},[],{"_17":19939,"_31":19940,"_33":19941,"_19":19941,"_36":19942,"_45":1387,"_47":19944},"ar.zneupdWorkevSize","ar.zneupdWorkevSize(ncv)","Calculate required workev size for complex extraction (zneupd).",[19943],{"_17":19837,"_19":19838,"_41":6},[],{"_15":19946,"_17":19947,"_19":19948,"_21":22,"_23":19949,"_25":19950,"_27":19951},"la-generated","LAPACK/BLAS","LAPACK and BLAS linear algebra routines.","🧮","la",[19952,19966,19977,19990,20003,20016,20027,20037,20050,20061,20073,20085,20097,20107,20116,20129,20141,20152,20162,20171,20180,20191,20201,20211,20226,20239,20252,20265,20277,20286,20300,20310,20320,20332,20343,20354,20363,20372,20382,20393,20404,20415,20426,20436,20454,20470,20482,20493,20504,20517,20535,20551,20565,20578,20595,20604,20615,20624,20635,20644,20658,20667,20678,20689,20699,20709,20719,20729,20739,20749,20759,20769,20779,20790,20801,20812,20821,20830,20841,20850,20859,20867,20878,20888,20899,20909,20919,20929,20939,20949,20957,20967,20974,20980,20987,20996,21004,21010],{"_17":19953,"_31":19954,"_33":19955,"_19":19956,"_36":19957,"_45":19964,"_47":19965},"la.blas.her2k","la.blas.her2k(A, B, options?)","Compute Hermitian rank-2k update.\r","Compute Hermitian rank-2k update.\r\n\r\nFor real matrices, this is equivalent to symmetric rank-2k update:\r\nIf trans='N': C = alpha*A*B^T + alpha*B*A^T + beta*C\r\nIf trans='C': C = alpha*A^T*B + alpha*B^T*A + beta*C\r\n\r\nThe result C is Hermitian (symmetric for real matrices).",[19958,19960,19962],{"_17":1163,"_19":19959,"_41":6},"- First input matrix",{"_17":1166,"_19":19961,"_41":6},"- Second input matrix (same dimensions as A)",{"_17":454,"_19":19963,"_41":10},"- Update options","Her2kResult",[],{"_17":19967,"_31":19968,"_33":19969,"_19":19970,"_36":19971,"_45":19975,"_47":19976},"la.blas.herk","la.blas.herk(A, options?)","Compute Hermitian rank-k update C = alpha*A*A^H + beta*C or C = alpha*A^H*A + beta*C.\r","Compute Hermitian rank-k update C = alpha*A*A^H + beta*C or C = alpha*A^H*A + beta*C.\r\n\r\nFor real matrices, this is equivalent to symmetric rank-k update (SYRK).\r\nThe result C is Hermitian (symmetric for real matrices).",[19972,19974],{"_17":1163,"_19":19973,"_41":6},"- Input matrix",{"_17":454,"_19":19963,"_41":10},"HerkResult",[],{"_17":19978,"_31":19979,"_33":19980,"_19":19981,"_36":19982,"_45":19988,"_47":19989},"la.blas.matmul","la.blas.matmul(A, B, options?)","Compute general matrix multiplication C = alpha*op(A)*op(B) + beta*C.\r","Compute general matrix multiplication C = alpha*op(A)*op(B) + beta*C.\r\n\r\nUses DGEMM from BLAS.",[19983,19984,19986],{"_17":1163,"_19":19959,"_41":6},{"_17":1166,"_19":19985,"_41":6},"- Second input matrix",{"_17":454,"_19":19987,"_41":10},"- Multiplication options","MatmulResult",[],{"_17":19991,"_31":19992,"_33":19993,"_19":19994,"_36":19995,"_45":20001,"_47":20002},"la.blas.matmulTriangular","la.blas.matmulTriangular(A, B, options?)","Compute triangular matrix multiplication B = alpha*op(A)*B or B = alpha*B*op(A).\r","Compute triangular matrix multiplication B = alpha*op(A)*B or B = alpha*B*op(A).\r\n\r\nUses DTRMM from BLAS.",[19996,19998,20000],{"_17":1163,"_19":19997,"_41":6},"- Triangular matrix (n × n)",{"_17":1166,"_19":19999,"_41":6},"- General matrix (m × n or n × m depending on side)",{"_17":454,"_19":19987,"_41":10},"MatmulTriangularResult",[],{"_17":20004,"_31":20005,"_33":20006,"_19":20007,"_36":20008,"_45":20014,"_47":20015},"la.blas.solveMatrixTriangular","la.blas.solveMatrixTriangular(A, B, options?)","Solve a triangular matrix system op(A)*X = alpha*B or X*op(A) = alpha*B.\r","Solve a triangular matrix system op(A)*X = alpha*B or X*op(A) = alpha*B.\r\n\r\nUses DTRSM from BLAS.",[20009,20010,20012],{"_17":1163,"_19":19997,"_41":6},{"_17":1166,"_19":20011,"_41":6},"- Right-hand side matrix",{"_17":454,"_19":20013,"_41":10},"- Solve options","SolveMatrixTriangularResult",[],{"_17":20017,"_31":20018,"_33":20019,"_19":20020,"_36":20021,"_45":20025,"_47":20026},"la.blas.syr2k","la.blas.syr2k(A, B, options?)","Compute symmetric rank-2k update.\r","Compute symmetric rank-2k update.\r\n\r\nIf trans='N': C = alpha*A*B^T + alpha*B*A^T + beta*C\r\nIf trans='T': C = alpha*A^T*B + alpha*B^T*A + beta*C\r\n\r\nUses DSYR2K from BLAS. The result C is symmetric.",[20022,20023,20024],{"_17":1163,"_19":19959,"_41":6},{"_17":1166,"_19":19961,"_41":6},{"_17":454,"_19":19963,"_41":10},"Syr2kResult",[],{"_17":20028,"_31":20029,"_33":20030,"_19":20031,"_36":20032,"_45":20035,"_47":20036},"la.blas.syrk","la.blas.syrk(A, options?)","Compute symmetric rank-k update C = alpha*A*A^T + beta*C or C = alpha*A^T*A + beta*C.\r","Compute symmetric rank-k update C = alpha*A*A^T + beta*C or C = alpha*A^T*A + beta*C.\r\n\r\nUses DSYRK from BLAS. The result C is symmetric.",[20033,20034],{"_17":1163,"_19":19973,"_41":6},{"_17":454,"_19":19963,"_41":10},"SyrkResult",[],{"_17":20038,"_31":20039,"_33":20040,"_19":20041,"_36":20042,"_45":20048,"_47":20049},"la.blas.ger","la.blas.ger(x, y, options?)","Compute rank-1 update A = alpha*x*y^T + A.\r","Compute rank-1 update A = alpha*x*y^T + A.\r\n\r\nUses DGER from BLAS.",[20043,20045,20047],{"_17":405,"_19":20044,"_41":6},"- Column vector (length m)",{"_17":2467,"_19":20046,"_41":6},"- Row vector (length n)",{"_17":454,"_19":19963,"_41":10},"GerResult",[],{"_17":20051,"_31":20052,"_33":20053,"_19":20054,"_36":20055,"_45":20059,"_47":20060},"la.blas.her","la.blas.her(x, options?)","Compute Hermitian rank-1 update A = alpha*x*x^H + A.\r","Compute Hermitian rank-1 update A = alpha*x*x^H + A.\r\n\r\nFor real matrices, this is equivalent to symmetric rank-1 update.\r\nThe result A is Hermitian (symmetric for real matrices).",[20056,20058],{"_17":405,"_19":20057,"_41":6},"- Vector (length n)",{"_17":454,"_19":19963,"_41":10},"HerResult",[],{"_17":20062,"_31":20063,"_33":20064,"_19":20065,"_36":20066,"_45":20071,"_47":20072},"la.blas.matvec","la.blas.matvec(A, x, options?)","Compute matrix-vector multiplication y = alpha*op(A)*x + beta*y.\r","Compute matrix-vector multiplication y = alpha*op(A)*x + beta*y.\r\n\r\nUses DGEMV from BLAS.",[20067,20069,20070],{"_17":1163,"_19":20068,"_41":6},"- Input matrix (m × n)",{"_17":405,"_19":19328,"_41":6},{"_17":454,"_19":19987,"_41":10},"MatvecResult",[],{"_17":20074,"_31":20075,"_33":20076,"_19":20077,"_36":20078,"_45":20083,"_47":20084},"la.blas.matvecTriangular","la.blas.matvecTriangular(A, x, options?)","Compute triangular matrix-vector multiplication x = op(A)*x.\r","Compute triangular matrix-vector multiplication x = op(A)*x.\r\n\r\nUses DTRMV from BLAS. The input vector x is overwritten with the result.",[20079,20080,20082],{"_17":1163,"_19":19997,"_41":6},{"_17":405,"_19":20081,"_41":6},"- Input/output vector (length n)",{"_17":454,"_19":19987,"_41":10},"MatvecTriangularResult",[],{"_17":20086,"_31":20087,"_33":20088,"_19":20089,"_36":20090,"_45":20095,"_47":20096},"la.blas.solveVectorTriangular","la.blas.solveVectorTriangular(A, b, options?)","Solve triangular system op(A)*x = b.\r","Solve triangular system op(A)*x = b.\r\n\r\nUses DTRSV from BLAS. The input vector b is overwritten with the solution x.",[20091,20092,20094],{"_17":1163,"_19":19997,"_41":6},{"_17":408,"_19":20093,"_41":6},"- Right-hand side vector (length n)",{"_17":454,"_19":20013,"_41":10},"SolveVectorTriangularResult",[],{"_17":20098,"_31":20099,"_33":20100,"_19":20101,"_36":20102,"_45":20105,"_47":20106},"la.blas.syr","la.blas.syr(x, options?)","Compute symmetric rank-1 update A = alpha*x*x^T + A.\r","Compute symmetric rank-1 update A = alpha*x*x^T + A.\r\n\r\nUses DSYR from BLAS. The result A is symmetric.",[20103,20104],{"_17":405,"_19":20057,"_41":6},{"_17":454,"_19":19963,"_41":10},"SyrResult",[],{"_17":20108,"_31":20109,"_33":20110,"_19":20111,"_36":20112,"_45":20114,"_47":20115},"la.blas.asum","la.blas.asum(x)","LAWasm - LAPACK + BLAS WebAssembly Module\r","LAWasm - LAPACK + BLAS WebAssembly Module\r\n\r\nThis package provides a WebAssembly build of LAPACK (Linear Algebra PACKage)\r\nwith BLAS (Basic Linear Algebra Subprograms) bundled internally.\r\n\r\nLAPACK provides routines for:\r\n- Solving systems of linear equations\r\n- Least squares solutions\r\n- Eigenvalue problems\r\n- Singular value decomposition\r\n- Matrix factorizations (LU, Cholesky, QR, etc.)",[20113],{"_17":405,"_19":19328,"_41":6},"AsumResult",[],{"_17":20117,"_31":20118,"_33":20119,"_19":20120,"_36":20121,"_45":20127,"_47":20128},"la.blas.axpy","la.blas.axpy(alpha, x, y)","Compute y = alpha*x + y.\r","Compute y = alpha*x + y.\r\n\r\nUses DAXPY from BLAS.",[20122,20123,20125],{"_17":60,"_19":17511,"_41":6},{"_17":405,"_19":20124,"_41":6},"- Vector to add",{"_17":2467,"_19":20126,"_41":6},"- Vector to accumulate into","AxpyResult",[],{"_17":20130,"_31":20131,"_33":20132,"_19":20133,"_36":20134,"_45":20139,"_47":20140},"la.blas.copy","la.blas.copy(x, y?)","Copy vector x to y.\r","Copy vector x to y.\r\n\r\nUses DCOPY from BLAS.",[20135,20137],{"_17":405,"_19":20136,"_41":6},"- Source vector",{"_17":2467,"_19":20138,"_41":10},"- Destination vector (optional, created if not provided)","CopyResult",[],{"_17":20142,"_31":20143,"_33":20144,"_19":20145,"_36":20146,"_45":20150,"_47":20151},"la.blas.dot","la.blas.dot(x, y)","Compute dot product x^T * y.\r","Compute dot product x^T * y.\r\n\r\nUses DDOT from BLAS.",[20147,20148],{"_17":405,"_19":18440,"_41":6},{"_17":2467,"_19":20149,"_41":6},"- Second vector (same length as x)","DotResult",[],{"_17":20153,"_31":20154,"_33":20155,"_19":20156,"_36":20157,"_45":20160,"_47":20161},"la.blas.dotc","la.blas.dotc(x, y)","Compute conjugate dot product x^H * y.\r","Compute conjugate dot product x^H * y.\r\n\r\nFor real vectors, this is equivalent to the regular dot product.\r\nFor complex vectors (stored as interleaved real/imag pairs),\r\nthis computes the conjugate dot product.",[20158,20159],{"_17":405,"_19":18440,"_41":6},{"_17":2467,"_19":20149,"_41":6},"DotcResult",[],{"_17":20163,"_31":20164,"_33":20165,"_19":20166,"_36":20167,"_45":20169,"_47":20170},"la.blas.iamax","la.blas.iamax(x)","Find index of element with maximum absolute value.\r","Find index of element with maximum absolute value.\r\n\r\nUses IDAMAX from BLAS. Returns 0-based index.",[20168],{"_17":405,"_19":19328,"_41":6},"IamaxResult",[],{"_17":20172,"_31":20173,"_33":20174,"_19":20175,"_36":20176,"_45":20178,"_47":20179},"la.blas.nrm2","la.blas.nrm2(x)","Compute Euclidean (L2) norm of a vector.\r","Compute Euclidean (L2) norm of a vector.\r\n\r\nUses DNRM2 from BLAS.",[20177],{"_17":405,"_19":19328,"_41":6},"Nrm2Result",[],{"_17":20181,"_31":20182,"_33":20183,"_19":20184,"_36":20185,"_45":20189,"_47":20190},"la.blas.scal","la.blas.scal(alpha, x)","Compute x = alpha*x.\r","Compute x = alpha*x.\r\n\r\nUses DSCAL from BLAS.",[20186,20187],{"_17":60,"_19":17511,"_41":6},{"_17":405,"_19":20188,"_41":6},"- Vector to scale","ScalResult",[],{"_17":20192,"_31":20193,"_33":20194,"_19":20195,"_36":20196,"_45":20199,"_47":20200},"la.blas.swap","la.blas.swap(x, y)","Swap vectors x and y.\r","Swap vectors x and y.\r\n\r\nUses DSWAP from BLAS.",[20197,20198],{"_17":405,"_19":18440,"_41":6},{"_17":2467,"_19":20149,"_41":6},"SwapResult",[],{"_17":20202,"_31":20203,"_33":20204,"_19":20205,"_36":20206,"_45":16730,"_47":20210},"la.eigenvalues.eig","la.eigenvalues.eig(A, options?)","Compute eigenvalues and optionally eigenvectors of a general n×n matrix A.\r","Compute eigenvalues and optionally eigenvectors of a general n×n matrix A.\r\n\r\nFor a general real matrix, eigenvalues may be complex. Complex eigenvalues\r\nappear in conjugate pairs.",[20207,20209],{"_17":1163,"_19":20208,"_41":6},"- Input square matrix (n × n). Can be 2D array (row-major) or 1D array (column-major).",{"_17":454,"_19":8347,"_41":10},[],{"_17":20212,"_31":20213,"_33":20214,"_19":20215,"_36":20216,"_45":20224,"_47":20225},"la.eigenvalues.eigBanded","la.eigenvalues.eigBanded(A, n, kd, options?)","Compute eigenvalues and eigenvectors of a symmetric banded n×n matrix.\r","Compute eigenvalues and eigenvectors of a symmetric banded n×n matrix.\r\n\r\nThe matrix is stored in banded format where:\r\n- A[i][j] represents element (i, j-i+kd) of the original matrix\r\n- kd is the number of super-diagonals (or sub-diagonals)\r\n\r\nFor a symmetric matrix, only the upper or lower triangle needs to be stored.",[20217,20219,20220,20223],{"_17":1163,"_19":20218,"_41":6},"- Banded matrix in LAPACK band storage format",{"_17":1206,"_19":1207,"_41":6},{"_17":20221,"_19":20222,"_41":6},"kd","- Number of super-diagonals (bandwidth - 1)",{"_17":454,"_19":8347,"_41":10},"EigBandedResult",[],{"_17":20227,"_31":20228,"_33":20229,"_19":20230,"_36":20231,"_45":20237,"_47":20238},"la.eigenvalues.eigGeneralized","la.eigenvalues.eigGeneralized(A, B, options?)","Solve the generalized eigenvalue problem Ax = λBx.\r","Solve the generalized eigenvalue problem Ax = λBx.\r\n\r\nComputes eigenvalues λ and eigenvectors x such that A*x = λ*B*x.\r\n\r\nThis implementation requires B to be symmetric positive definite.\r\nIt reduces the problem to standard form using Cholesky factorization:\r\nIf B = L*L^T, then Ax = λBx becomes (L^-1 * A * L^-T) * y = λ * y\r\nwhere x = L^-T * y.",[20232,20234,20236],{"_17":1163,"_19":20233,"_41":6},"- First matrix (n × n)",{"_17":1166,"_19":20235,"_41":6},"- Second matrix (n × n), must be symmetric positive definite",{"_17":454,"_19":8347,"_41":10},"EigGeneralizedResult",[],{"_17":20240,"_31":20241,"_33":20242,"_19":20243,"_36":20244,"_45":20250,"_47":20251},"la.eigenvalues.eigGeneralizedSymmetric","la.eigenvalues.eigGeneralizedSymmetric(A, B, options?)","Solve the symmetric generalized eigenvalue problem.\r","Solve the symmetric generalized eigenvalue problem.\r\n\r\nComputes eigenvalues and eigenvectors of one of three forms:\r\n- itype=1: A*x = λ*B*x\r\n- itype=2: A*B*x = λ*x\r\n- itype=3: B*A*x = λ*x\r\n\r\nwhere A is symmetric and B is symmetric positive definite.\r\nAll eigenvalues are guaranteed to be real.",[20245,20247,20249],{"_17":1163,"_19":20246,"_41":6},"- Symmetric matrix (n × n)",{"_17":1166,"_19":20248,"_41":6},"- Symmetric positive definite matrix (n × n)",{"_17":454,"_19":8347,"_41":10},"EigGeneralizedSymmetricResult",[],{"_17":20253,"_31":20254,"_33":20255,"_19":20256,"_36":20257,"_45":20263,"_47":20264},"la.eigenvalues.eigHermitian","la.eigenvalues.eigHermitian(A, n, options?)","Compute eigenvalues and optionally eigenvectors of a complex Hermitian n×n matrix A.\r","Compute eigenvalues and optionally eigenvectors of a complex Hermitian n×n matrix A.\r\n\r\nFor a Hermitian matrix (A = A^H), all eigenvalues are real and the eigenvectors\r\nform a unitary basis.\r\n\r\nInput format: The matrix A should be provided as interleaved real/imaginary pairs.\r\nFor an n×n matrix, provide 2*n*n values where pairs (A[2k], A[2k+1]) represent\r\nthe real and imaginary parts of complex element k.",[20258,20260,20262],{"_17":1163,"_19":20259,"_41":6},"- Input Hermitian matrix as interleaved complex array.\r\n For 2D array input, each element should be [re, im].\r\n For 1D input, provide interleaved real/imaginary values.",{"_17":1206,"_19":20261,"_41":6},"- Matrix dimension (must be provided for complex matrices)",{"_17":454,"_19":8347,"_41":10},"EigHermitianResult",[],{"_17":20266,"_31":20267,"_33":20268,"_19":20269,"_36":20270,"_45":20275,"_47":20276},"la.eigenvalues.eigSelect","la.eigenvalues.eigSelect(A, options?)","Compute selected eigenvalues and eigenvectors of a real symmetric n×n matrix A.\r","Compute selected eigenvalues and eigenvectors of a real symmetric n×n matrix A.\r\n\r\nUses the Relatively Robust Representations (RRR) algorithm which can efficiently\r\ncompute a subset of eigenvalues.",[20271,20273],{"_17":1163,"_19":20272,"_41":6},"- Input symmetric matrix (n × n). Only the specified triangle is accessed.",{"_17":454,"_19":20274,"_41":10},"- Selection and computation options","EigSelectResult",[],{"_17":20278,"_31":20279,"_33":20280,"_19":20281,"_36":20282,"_45":16738,"_47":20285},"la.eigenvalues.eigSymmetric","la.eigenvalues.eigSymmetric(A, options?)","Compute eigenvalues and optionally eigenvectors of a real symmetric n×n matrix A.\r","Compute eigenvalues and optionally eigenvectors of a real symmetric n×n matrix A.\r\n\r\nFor a symmetric matrix, all eigenvalues are real and the eigenvectors\r\nform an orthonormal basis.",[20283,20284],{"_17":1163,"_19":20272,"_41":6},{"_17":454,"_19":8347,"_41":10},[],{"_17":20287,"_31":20288,"_33":20289,"_19":20290,"_36":20291,"_45":20298,"_47":20299},"la.eigenvalues.eigTridiagonal","la.eigenvalues.eigTridiagonal(d, e, options?)","Compute eigenvalues and eigenvectors of a symmetric tridiagonal matrix.\r","Compute eigenvalues and eigenvectors of a symmetric tridiagonal matrix.\r\n\r\nThe matrix is defined by:\r\n- d: diagonal elements [d0, d1, ..., d(n-1)]\r\n- e: off-diagonal elements [e0, e1, ..., e(n-2)]\r\n\r\nThe matrix T is:\r\n[d0 e0 0 0 ...]\r\n[e0 d1 e1 0 ...]\r\n[0 e1 d2 e2 ...]\r\n[.................]",[20292,20294,20297],{"_17":5512,"_19":20293,"_41":6},"- Diagonal elements (length n)",{"_17":20295,"_19":20296,"_41":6},"e","- Off-diagonal elements (length n-1)",{"_17":454,"_19":8347,"_41":10},"EigTridiagonalResult",[],{"_17":20301,"_31":20302,"_33":20303,"_19":20304,"_36":20305,"_45":20308,"_47":20309},"la.eigenvalues.eigvals","la.eigenvalues.eigvals(A, options?)","Compute only the eigenvalues of a general n×n matrix A.\r","Compute only the eigenvalues of a general n×n matrix A.\r\n\r\nThis is faster than computing the full eigendecomposition when only\r\neigenvalues are needed.",[20306,20307],{"_17":1163,"_19":20208,"_41":6},{"_17":454,"_19":8347,"_41":10},"EigvalsResult",[],{"_17":20311,"_31":20312,"_33":20313,"_19":20314,"_36":20315,"_45":16704,"_47":20319},"la.factorizations.cholesky","la.factorizations.cholesky(A, options?)","Compute the Cholesky factorization of a symmetric positive definite matrix A.\r","Compute the Cholesky factorization of a symmetric positive definite matrix A.\r\n\r\nIf upper=false (default): A = L * L^T where L is lower triangular\r\nIf upper=true: A = U^T * U where U is upper triangular",[20316,20318],{"_17":1163,"_19":20317,"_41":6},"- Symmetric positive definite matrix (n × n).\r\n Only the specified triangle (upper or lower) is referenced.",{"_17":454,"_19":8273,"_41":10},[],{"_17":20321,"_31":20322,"_33":20323,"_19":20324,"_36":20325,"_45":20330,"_47":20331},"la.factorizations.hessenberg","la.factorizations.hessenberg(A, options?)","Reduce a general n×n matrix A to upper Hessenberg form.\r","Reduce a general n×n matrix A to upper Hessenberg form.\r\n\r\nA = Q * H * Q^T\r\n\r\nwhere H is upper Hessenberg (zero below the first subdiagonal)\r\nand Q is orthogonal.\r\n\r\nUpper Hessenberg form is useful as a preprocessing step for\r\neigenvalue computations.",[20326,20328],{"_17":1163,"_19":20327,"_41":6},"- Input square matrix (n × n).",{"_17":454,"_19":20329,"_41":10},"- Reduction options","HessenbergResult",[],{"_17":20333,"_31":20334,"_33":20335,"_19":20336,"_36":20337,"_45":20341,"_47":20342},"la.factorizations.ldl","la.factorizations.ldl(A, options?)","Compute the LDL^T factorization of a symmetric n×n matrix A.\r","Compute the LDL^T factorization of a symmetric n×n matrix A.\r\n\r\nA = L * D * L^T (or A = U * D * U^T if upper=true)\r\n\r\nwhere L (or U) is unit triangular and D is block diagonal with\r\n1×1 and 2×2 blocks.\r\n\r\nThis factorization is useful for symmetric indefinite matrices\r\n(which cannot use Cholesky).\r\n\r\nNote: This is a simplified implementation. For production use with\r\nill-conditioned matrices, the full LAPACK DSYTRF with Bunch-Kaufman\r\npivoting is recommended.",[20338,20340],{"_17":1163,"_19":20339,"_41":6},"- Symmetric matrix (n × n). Only the specified triangle is used.",{"_17":454,"_19":8273,"_41":10},"LDLResult",[],{"_17":20344,"_31":20345,"_33":20346,"_19":20347,"_36":20348,"_45":20352,"_47":20353},"la.factorizations.lq","la.factorizations.lq(A, options?)","Compute the LQ factorization of a general m×n matrix A.\r","Compute the LQ factorization of a general m×n matrix A.\r\n\r\nA = L * Q\r\n\r\nwhere L is lower triangular (m×k) and Q is orthogonal (k×n),\r\nwith k = min(m, n).\r\n\r\nImplementation note: This uses QR of A^T since DGELQF is not exported.\r\nA = L * Q implies A^T = Q^T * L^T, so we compute QR of A^T.",[20349,20351],{"_17":1163,"_19":20350,"_41":6},"- Input matrix (m × n). Can be 2D array (row-major) or 1D array (column-major).",{"_17":454,"_19":8273,"_41":10},"LQResult",[],{"_17":20355,"_31":20356,"_33":20357,"_19":20358,"_36":20359,"_45":16801,"_47":20362},"la.factorizations.lu","la.factorizations.lu(A, options?)","Compute the LU factorization of a general m×n matrix A.\r","Compute the LU factorization of a general m×n matrix A.\r\n\r\nA = P * L * U\r\n\r\nwhere P is a permutation matrix, L is lower triangular with unit diagonal,\r\nand U is upper triangular.",[20360,20361],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":8273,"_41":10},[],{"_17":20364,"_31":20365,"_33":20366,"_19":20367,"_36":20368,"_45":16810,"_47":20371},"la.factorizations.qr","la.factorizations.qr(A, options?)","Compute the QR factorization of a general m×n matrix A.\r","Compute the QR factorization of a general m×n matrix A.\r\n\r\nA = Q * R\r\n\r\nwhere Q is orthogonal (m×m or m×k) and R is upper triangular (m×n or k×n),\r\nwith k = min(m, n).",[20369,20370],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":8273,"_41":10},[],{"_17":20373,"_31":20374,"_33":20375,"_19":20376,"_36":20377,"_45":20380,"_47":20381},"la.factorizations.qrPivoted","la.factorizations.qrPivoted(A, options?)","Compute the QR factorization with column pivoting of a general m×n matrix A.\r","Compute the QR factorization with column pivoting of a general m×n matrix A.\r\n\r\nA * P = Q * R\r\n\r\nwhere P is a permutation matrix, Q is orthogonal, and R is upper triangular\r\nwith diagonal elements of decreasing magnitude.\r\n\r\nThis is useful for rank-revealing factorization: the numerical rank of A\r\ncan be estimated from the diagonal of R.",[20378,20379],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":8273,"_41":10},"QRPivotedResult",[],{"_17":20383,"_31":20384,"_33":20385,"_19":20386,"_36":20387,"_45":20391,"_47":20392},"la.factorizations.schur","la.factorizations.schur(A, options?)","Compute the Schur decomposition of a general n×n matrix A.\r","Compute the Schur decomposition of a general n×n matrix A.\r\n\r\nA = Z * T * Z^T\r\n\r\nwhere T is quasi-upper triangular (real Schur form) and Z is orthogonal.\r\n\r\nThe diagonal of T contains 1×1 blocks (real eigenvalues) and 2×2 blocks\r\n(complex conjugate pairs of eigenvalues).\r\n\r\nNote: This implementation uses DGEEV to compute eigenvalues. The full\r\nSchur decomposition with DGEES would provide the actual quasi-triangular\r\nform, but DGEES is not currently exported.",[20388,20389],{"_17":1163,"_19":20327,"_41":6},{"_17":454,"_19":20390,"_41":10},"- Decomposition options","SchurResult",[],{"_17":20394,"_31":20395,"_33":20396,"_19":20397,"_36":20398,"_45":20402,"_47":20403},"la.inverses.inv","la.inverses.inv(A, options?)","Compute the inverse of a general n×n matrix A.\r","Compute the inverse of a general n×n matrix A.\r\n\r\nUses LU factorization with partial pivoting: A = P*L*U,\r\nthen computes A^(-1) from this factorization.",[20399,20401],{"_17":1163,"_19":20400,"_41":6},"- Input square matrix (n × n)",{"_17":454,"_19":8347,"_41":10},"InvResult",[],{"_17":20405,"_31":20406,"_33":20407,"_19":20408,"_36":20409,"_45":20413,"_47":20414},"la.inverses.invSymmetric","la.inverses.invSymmetric(A, options?)","Compute the inverse of a symmetric positive definite n×n matrix A.\r","Compute the inverse of a symmetric positive definite n×n matrix A.\r\n\r\nUses Cholesky factorization: A = L*L^T (or U^T*U),\r\nthen computes A^(-1) from this factorization.\r\n\r\nThis is more efficient than general matrix inversion when A is known\r\nto be symmetric positive definite.",[20410,20412],{"_17":1163,"_19":20411,"_41":6},"- Input symmetric positive definite matrix (n × n)",{"_17":454,"_19":8347,"_41":10},"InvSymmetricResult",[],{"_17":20416,"_31":20417,"_33":20418,"_19":20419,"_36":20420,"_45":20424,"_47":20425},"la.inverses.invTriangular","la.inverses.invTriangular(A, options?)","Compute the inverse of a triangular n×n matrix A.\r","Compute the inverse of a triangular n×n matrix A.\r\n\r\nFor upper triangular A, the inverse is also upper triangular.\r\nFor lower triangular A, the inverse is also lower triangular.",[20421,20423],{"_17":1163,"_19":20422,"_41":6},"- Input triangular matrix (n × n)",{"_17":454,"_19":8347,"_41":10},"InvTriangularResult",[],{"_17":20427,"_31":20428,"_33":20429,"_19":20430,"_36":20431,"_45":20434,"_47":20435},"la.inverses.pinv","la.inverses.pinv(A, options?)","Compute the Moore-Penrose pseudoinverse of an m×n matrix A.\r","Compute the Moore-Penrose pseudoinverse of an m×n matrix A.\r\n\r\nThe pseudoinverse A^+ satisfies:\r\n- A * A^+ * A = A\r\n- A^+ * A * A^+ = A^+\r\n- (A * A^+)^T = A * A^+\r\n- (A^+ * A)^T = A^+ * A\r\n\r\nFor full-rank matrices:\r\n- If m >= n (overdetermined): A^+ = (A^T*A)^(-1) * A^T\r\n- If m < n (underdetermined): A^+ = A^T * (A*A^T)^(-1)\r\n\r\nThis implementation uses SVD: A = U * S * V^T => A^+ = V * S^+ * U^T\r\nwhere S^+ is the pseudoinverse of the diagonal singular value matrix.",[20432,20433],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":8347,"_41":10},"PinvResult",[],{"_17":20437,"_31":20438,"_33":20439,"_19":20440,"_36":20441,"_45":20452,"_47":20453},"la.leastSquares.constrainedLstSq","la.leastSquares.constrainedLstSq(A, b, C, d, _options?)","Solve an equality-constrained least squares problem.\r","Solve an equality-constrained least squares problem.\r\n\r\nminimize ||Ax - b||_2 subject to Cx = d\r\n\r\nThis is useful when you have hard constraints that must be satisfied exactly,\r\nalong with a least squares objective.\r\n\r\nRequirements:\r\n- C must have full row rank (p <= n)\r\n- The system Cx = d must be consistent",[20442,20444,20446,20448,20450],{"_17":1163,"_19":20443,"_41":6},"- Objective matrix (m × n)",{"_17":408,"_19":20445,"_41":6},"- Objective vector (m)",{"_17":5734,"_19":20447,"_41":6},"- Constraint matrix (p × n)",{"_17":5512,"_19":20449,"_41":6},"- Constraint vector (p)",{"_17":8334,"_19":20451,"_41":10},"ConstrainedLstSqOptions","ConstrainedLstSqResult",[],{"_17":20455,"_31":20456,"_33":20457,"_19":20458,"_36":20459,"_45":20468,"_47":20469},"la.leastSquares.generalizedLstSq","la.leastSquares.generalizedLstSq(A, B, d, _options?)","Solve a generalized least squares problem.\r","Solve a generalized least squares problem.\r\n\r\nminimize ||y||_2 subject to Ax + By = d\r\n\r\nThis is also known as the Gauss-Markov linear model problem.\r\nIt arises when fitting a model y = Ax with correlated errors,\r\nwhere the error covariance is proportional to B*B^T.\r\n\r\nRequirements:\r\n- [A B] must have full row rank (p = n + m)\r\n- m >= p - n (enough degrees of freedom)",[20460,20462,20464,20466],{"_17":1163,"_19":20461,"_41":6},"- Design matrix for x (p × n)",{"_17":1166,"_19":20463,"_41":6},"- Design matrix for y (p × m)",{"_17":5512,"_19":20465,"_41":6},"- Target vector (p)",{"_17":8334,"_19":20467,"_41":10},"GeneralizedLstSqOptions","GeneralizedLstSqResult",[],{"_17":20471,"_31":20472,"_33":20473,"_19":20474,"_36":20475,"_45":20480,"_47":20481},"la.leastSquares.lstsq","la.leastSquares.lstsq(A, b, options?)","Solve a least squares problem using QR factorization.\r","Solve a least squares problem using QR factorization.\r\n\r\nFor overdetermined systems (m >= n): minimize ||Ax - b||_2\r\nFor underdetermined systems (m < n): find minimum norm solution to Ax = b\r\n\r\nThis function assumes A has full rank. For rank-deficient matrices,\r\nuse lstsqSVD or lstsqGelsy instead.",[20476,20477,20479],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":20478,"_41":6},"- Right-hand side vector/matrix (m × nrhs)",{"_17":454,"_19":8347,"_41":10},"LstSqResult",[],{"_17":20483,"_31":20484,"_33":20485,"_19":20486,"_36":20487,"_45":20491,"_47":20492},"la.leastSquares.lstsqGelsy","la.leastSquares.lstsqGelsy(A, b, options?)","Solve a least squares problem using QR with column pivoting.\r","Solve a least squares problem using QR with column pivoting.\r\n\r\nComputes the minimum-norm solution to: minimize ||Ax - b||_2\r\nusing a complete orthogonal factorization of A.\r\n\r\nThis method is generally faster than SVD-based methods for rank-deficient problems.",[20488,20489,20490],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":20478,"_41":6},{"_17":454,"_19":8347,"_41":10},"LstSqGelsyResult",[],{"_17":20494,"_31":20495,"_33":20496,"_19":20497,"_36":20498,"_45":20502,"_47":20503},"la.leastSquares.lstsqSVD","la.leastSquares.lstsqSVD(A, b, options?)","Solve a least squares problem using SVD.\r","Solve a least squares problem using SVD.\r\n\r\nComputes the minimum-norm solution to: minimize ||Ax - b||_2\r\n\r\nThis method is safe for rank-deficient matrices. Singular values\r\nbelow rcond * max(s) are treated as zero.",[20499,20500,20501],{"_17":1163,"_19":17612,"_41":6},{"_17":408,"_19":20478,"_41":6},{"_17":454,"_19":8347,"_41":10},"LstSqSVDResult",[],{"_17":20505,"_31":20506,"_33":20507,"_19":20508,"_36":20509,"_45":20515,"_47":20516},"la.linearSolvers.solve","la.linearSolvers.solve(A, b, options?)","Solve a system of linear equations Ax = b for a general matrix A.\r","Solve a system of linear equations Ax = b for a general matrix A.\r\n\r\nUses LU decomposition with partial pivoting (DGESV).",[20510,20512,20514],{"_17":1163,"_19":20511,"_41":6},"- Coefficient matrix (n × n). Can be 2D array (row-major) or 1D array (column-major).",{"_17":408,"_19":20513,"_41":6},"- Right-hand side vector or matrix (n × nrhs).",{"_17":454,"_19":8285,"_41":10},"SolveResult",[],{"_17":20518,"_31":20519,"_33":20520,"_19":20521,"_36":20522,"_45":20515,"_47":20534},"la.linearSolvers.solveBanded","la.linearSolvers.solveBanded(AB, b, n, kl, ku)","Solve a banded system Ax = b where A is a general banded matrix.\r","Solve a banded system Ax = b where A is a general banded matrix.\r\n\r\nA banded matrix has non-zero elements only within kl diagonals below\r\nand ku diagonals above the main diagonal.\r\n\r\nThe banded matrix is stored in band storage format:\r\n- Row i of the band array contains diagonal (i - kl)\r\n- The band array has (2*kl + ku + 1) rows and n columns\r\n\r\nNote: This function converts the banded format to dense and uses\r\nthe general solver. For large sparse banded systems, consider using\r\nspecialized routines.",[20523,20525,20527,20528,20531],{"_17":20524,"_19":20218,"_41":6},"AB",{"_17":408,"_19":20526,"_41":6},"- Right-hand side vector or matrix",{"_17":1206,"_19":1207,"_41":6},{"_17":20529,"_19":20530,"_41":6},"kl","- Number of sub-diagonals",{"_17":20532,"_19":20533,"_41":6},"ku","- Number of super-diagonals",[],{"_17":20536,"_31":20537,"_33":20538,"_19":20539,"_36":20540,"_45":20549,"_47":20550},"la.linearSolvers.solveHermitian","la.linearSolvers.solveHermitian(A, b, n, options?)","Solve a complex Hermitian positive definite system Ax = b.\r","Solve a complex Hermitian positive definite system Ax = b.\r\n\r\nUses complex Cholesky decomposition (ZPOSV).\r\n\r\nComplex values are stored as interleaved real/imaginary pairs:\r\n[re0, im0, re1, im1, ...]",[20541,20543,20545,20547],{"_17":1163,"_19":20542,"_41":6},"- Hermitian positive definite matrix in interleaved complex format.\r\n Size should be 2 * n * n where n is the matrix dimension.",{"_17":408,"_19":20544,"_41":6},"- Right-hand side in interleaved complex format.",{"_17":1206,"_19":20546,"_41":6},"- Matrix dimension (number of rows/columns).",{"_17":454,"_19":20548,"_41":10},"- Solver options.","SolveComplexResult",[],{"_17":20552,"_31":20553,"_33":20554,"_19":20555,"_36":20556,"_45":20563,"_47":20564},"la.linearSolvers.solveSymmetric","la.linearSolvers.solveSymmetric(A, b, options?)","Solve a symmetric positive definite system Ax = b.\r","Solve a symmetric positive definite system Ax = b.\r\n\r\nUses Cholesky decomposition (DPOSV) which is more efficient than LU\r\nfor symmetric positive definite matrices.",[20557,20559,20561],{"_17":1163,"_19":20558,"_41":6},"- Symmetric positive definite matrix (n × n). Only the upper or lower\r\n triangle is referenced based on the `upper` option.",{"_17":408,"_19":20560,"_41":6},"- Right-hand side vector or matrix.",{"_17":454,"_19":20562,"_41":10},"- Solver options including which triangle to use.","SolveSymmetricResult",[],{"_17":20566,"_31":20567,"_33":20568,"_19":20569,"_36":20570,"_45":20576,"_47":20577},"la.linearSolvers.solveTriangular","la.linearSolvers.solveTriangular(A, b, options?)","Solve a triangular system Ax = b where A is upper or lower triangular.\r","Solve a triangular system Ax = b where A is upper or lower triangular.\r\n\r\nUses DTRTRS for efficient triangular solve without factorization.",[20571,20573,20574],{"_17":1163,"_19":20572,"_41":6},"- Triangular coefficient matrix (n × n).",{"_17":408,"_19":20560,"_41":6},{"_17":454,"_19":20575,"_41":10},"- Solver options including triangle type and transpose mode.","SolveTriangularResult",[],{"_17":20579,"_31":20580,"_33":20581,"_19":20582,"_36":20583,"_45":20593,"_47":20594},"la.linearSolvers.solveTridiagonal","la.linearSolvers.solveTridiagonal(dl, d, du, b)","Solve a tridiagonal system Ax = b where A is tridiagonal.\r","Solve a tridiagonal system Ax = b where A is tridiagonal.\r\n\r\nA tridiagonal matrix has non-zero elements only on the main diagonal\r\nand the diagonals immediately above and below it.\r\n\r\nUses the Thomas algorithm (tridiagonal matrix algorithm) for efficient O(n) solution.",[20584,20587,20589,20592],{"_17":20585,"_19":20586,"_41":6},"dl","- Sub-diagonal elements (length n-1)",{"_17":5512,"_19":20588,"_41":6},"- Main diagonal elements (length n)",{"_17":20590,"_19":20591,"_41":6},"du","- Super-diagonal elements (length n-1)",{"_17":408,"_19":20526,"_41":6},"SolveTridiagonalResult",[],{"_17":20596,"_31":20597,"_33":20598,"_19":20599,"_36":20600,"_45":20602,"_47":20603},"la.matrixFunctions.expm","la.matrixFunctions.expm(A)","Compute the matrix exponential e^A.\r","Compute the matrix exponential e^A.\r\n\r\nUses the scaling and squaring method with Padé approximation.\r\nThis is a pure TypeScript implementation.",[20601],{"_17":1163,"_19":20400,"_41":6},"ExpmResult",[],{"_17":20605,"_31":20606,"_33":20607,"_19":20608,"_36":20609,"_45":20613,"_47":20614},"la.matrixFunctions.funm","la.matrixFunctions.funm(A, f)","Compute a general matrix function f(A).\r","Compute a general matrix function f(A).\r\n\r\nComputes f(A) where f is a scalar function, using eigendecomposition.\r\nFor a matrix A = V * D * V^(-1) where D is diagonal,\r\nf(A) = V * f(D) * V^(-1) where f(D) applies f to each diagonal element.",[20610,20611],{"_17":1163,"_19":20400,"_41":6},{"_17":7414,"_19":20612,"_41":6},"- Scalar function to apply","FunmResult",[],{"_17":20616,"_31":20617,"_33":20618,"_19":20619,"_36":20620,"_45":20622,"_47":20623},"la.matrixFunctions.logm","la.matrixFunctions.logm(A)","Compute the principal matrix logarithm log(A).\r","Compute the principal matrix logarithm log(A).\r\n\r\nUses the inverse scaling and squaring method.\r\nThe matrix A must have no eigenvalues on the closed negative real axis.",[20621],{"_17":1163,"_19":20400,"_41":6},"LogmResult",[],{"_17":20625,"_31":20626,"_33":20627,"_19":20628,"_36":20629,"_45":20633,"_47":20634},"la.matrixFunctions.powm","la.matrixFunctions.powm(A, p)","Compute matrix power A^p.\r","Compute matrix power A^p.\r\n\r\nFor integer p >= 0: uses binary exponentiation.\r\nFor integer p < 0: computes inverse then uses binary exponentiation.\r\nFor non-integer p: uses A^p = expm(p * logm(A)).",[20630,20631],{"_17":1163,"_19":20400,"_41":6},{"_17":5212,"_19":20632,"_41":6},"- Power (integer or real)","PowmResult",[],{"_17":20636,"_31":20637,"_33":20638,"_19":20639,"_36":20640,"_45":20642,"_47":20643},"la.matrixFunctions.sqrtm","la.matrixFunctions.sqrtm(A)","Compute the principal matrix square root.\r","Compute the principal matrix square root.\r\n\r\nFinds S such that S*S = A, where S has eigenvalues with positive real parts.\r\nUses the Denman-Beavers iteration.",[20641],{"_17":1163,"_19":20400,"_41":6},"SqrtmResult",[],{"_17":20645,"_31":20646,"_33":20647,"_19":20648,"_36":20649,"_45":20656,"_47":20657},"la.matrixFunctions.csd","la.matrixFunctions.csd(X, p, q)","Compute the Cosine-Sine Decomposition of a partitioned unitary matrix.\r","Compute the Cosine-Sine Decomposition of a partitioned unitary matrix.\r\n\r\nGiven a unitary matrix X partitioned as:\r\n X = [ X11 X12 ] where X11 is p×q\r\n [ X21 X22 ]\r\n\r\nThe CSD computes:\r\n X11 = U1 * C * V1'\r\n X21 = U2 * S * V1'\r\n X12 = -U1 * S * V2'\r\n X22 = U2 * C * V2'\r\n\r\nwhere C = diag(cos(theta)) and S = diag(sin(theta)).\r\n\r\nThis is a simplified implementation using SVD of X11.",[20650,20652,20654],{"_17":4157,"_19":20651,"_41":6},"- Input unitary matrix (m × m)",{"_17":5212,"_19":20653,"_41":6},"- Row partition size",{"_17":12842,"_19":20655,"_41":6},"- Column partition size","CSDResult",[],{"_17":20659,"_31":20660,"_33":20661,"_19":20662,"_36":20663,"_45":20665,"_47":20666},"la.matrixFunctions.polarDecomposition","la.matrixFunctions.polarDecomposition(A)","Compute the polar decomposition A = U*P.\r","Compute the polar decomposition A = U*P.\r\n\r\nU is unitary (orthogonal for real matrices) and P is positive semidefinite.\r\nUses SVD: if A = W*S*Vt, then U = W*Vt and P = V*S*Vt.",[20664],{"_17":1163,"_19":20068,"_41":6},"PolarDecompositionResult",[],{"_17":20668,"_31":20669,"_33":20670,"_19":20671,"_36":20672,"_45":20676,"_47":20677},"la.matrixFunctions.rrqr","la.matrixFunctions.rrqr(A, options?)","Compute rank-revealing QR decomposition with column pivoting.\r","Compute rank-revealing QR decomposition with column pivoting.\r\n\r\nComputes A*P = Q*R where P is a permutation matrix chosen to\r\nreveal the numerical rank of A.\r\n\r\nUses DGEQP3 from LAPACK.",[20673,20674],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":20675,"_41":10},"- RRQR options","RRQRResult",[],{"_17":20679,"_31":20680,"_33":20681,"_19":20682,"_36":20683,"_45":20687,"_47":20688},"la.matrixFunctions.choleskyHermitian","la.matrixFunctions.choleskyHermitian(A, options?)","Compute Cholesky factorization of a Hermitian positive definite matrix.\r","Compute Cholesky factorization of a Hermitian positive definite matrix.\r\n\r\nFor real matrices, this is equivalent to standard Cholesky factorization.\r\nFor complex Hermitian matrices, A = L*L^H or A = U^H*U.\r\n\r\nUses DPOTRF from LAPACK (for real matrices).",[20684,20686],{"_17":1163,"_19":20685,"_41":6},"- Input Hermitian positive definite matrix (n × n)",{"_17":454,"_19":8273,"_41":10},"CholeskyHermitianResult",[],{"_17":20690,"_31":20691,"_33":20692,"_19":20693,"_36":20694,"_45":20697,"_47":20698},"la.norms.cond","la.norms.cond(A, options?)","Compute the condition number of a matrix.\r","Compute the condition number of a matrix.\r\n\r\nThe condition number κ(A) = ||A|| * ||A^(-1)||\r\n\r\nFor ord=2, this is the ratio of largest to smallest singular value.\r\nFor ord=1 or 'inf', uses LU factorization and DGECON.",[20695,20696],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"CondResult",[],{"_17":20700,"_31":20701,"_33":20702,"_19":20703,"_36":20704,"_45":20707,"_47":20708},"la.norms.condEst","la.norms.condEst(A, options?)","Compute a fast estimate of the condition number.\r","Compute a fast estimate of the condition number.\r\n\r\nUses LU factorization (DGETRF) followed by condition estimation (DGECON).\r\nThis is faster than computing the exact condition number via SVD.",[20705,20706],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"CondEstResult",[],{"_17":20710,"_31":20711,"_33":20712,"_19":20713,"_36":20714,"_45":20717,"_47":20718},"la.norms.det","la.norms.det(A, options?)","Compute the determinant of a square matrix.\r","Compute the determinant of a square matrix.\r\n\r\nUses LU factorization: A = P*L*U, then det(A) = det(P) * det(L) * det(U)\r\nSince L has unit diagonal, det(L) = 1.\r\ndet(U) = product of diagonal elements.\r\ndet(P) = (-1)^(number of row interchanges).\r\n\r\nWARNING: For large matrices, the determinant can overflow or underflow.\r\nUse logdet() or slogdet() for numerically stable computation.",[20715,20716],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"DetResult",[],{"_17":20720,"_31":20721,"_33":20722,"_19":20723,"_36":20724,"_45":20727,"_47":20728},"la.norms.logdet","la.norms.logdet(A, options?)","Compute the natural logarithm of the absolute value of the determinant.\r","Compute the natural logarithm of the absolute value of the determinant.\r\n\r\nThis is numerically more stable than computing det() for large matrices\r\nor matrices with very large/small determinants.\r\n\r\nlog|det(A)| = sum of log|diagonal elements of U from LU factorization|",[20725,20726],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"LogDetResult",[],{"_17":20730,"_31":20731,"_33":20732,"_19":20732,"_36":20733,"_45":20737,"_47":20738},"la.norms.norm","la.norms.norm(A, options?)","Compute a matrix norm.",[20734,20735],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":20736,"_41":10},"- Norm options","NormResult",[],{"_17":20740,"_31":20741,"_33":20742,"_19":20743,"_36":20744,"_45":20747,"_47":20748},"la.norms.rank","la.norms.rank(A, options?)","Compute the numerical rank of a matrix.\r","Compute the numerical rank of a matrix.\r\n\r\nThe rank is computed as the number of singular values greater than\r\na tolerance threshold. By default, the tolerance is:\r\n tol = max(m, n) * eps * max(singular values)\r\n\r\nwhere eps is the machine epsilon (~2.22e-16 for double precision).",[20745,20746],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":8347,"_41":10},"RankResult",[],{"_17":20750,"_31":20751,"_33":20752,"_19":20753,"_36":20754,"_45":20757,"_47":20758},"la.norms.rcond","la.norms.rcond(A, options?)","Compute the reciprocal of the condition number of a matrix.\r","Compute the reciprocal of the condition number of a matrix.\r\n\r\nThe reciprocal condition number rcond = 1/κ(A) = 1/(||A|| * ||A^(-1)||)\r\n\r\nA small rcond (e.g., < machine_epsilon * n) indicates an ill-conditioned\r\nor nearly singular matrix.\r\n\r\nUses LU factorization (DGETRF) followed by DGECON.",[20755,20756],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"RcondResult",[],{"_17":20760,"_31":20761,"_33":20762,"_19":20763,"_36":20764,"_45":20767,"_47":20768},"la.norms.slogdet","la.norms.slogdet(A, options?)","Compute the sign and natural logarithm of the absolute value of the determinant.\r","Compute the sign and natural logarithm of the absolute value of the determinant.\r\n\r\nReturns (sign, logabsdet) such that det(A) = sign * exp(logabsdet).\r\n\r\nThis is the most numerically stable way to work with determinants,\r\nespecially for large matrices or matrices with very large/small determinants.",[20765,20766],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":8347,"_41":10},"SlogDetResult",[],{"_17":20770,"_31":20771,"_33":20772,"_19":20773,"_36":20774,"_45":16854,"_47":20778},"la.svdModule.svd","la.svdModule.svd(A, options?)","Compute the Singular Value Decomposition of a general m×n matrix A.\r","Compute the Singular Value Decomposition of a general m×n matrix A.\r\n\r\nA = U * S * V^T\r\n\r\nwhere U is m×m (or m×k) orthogonal, S is a diagonal matrix with singular values,\r\nand V is n×n (or k×n) orthogonal, with k = min(m, n).",[20775,20776],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":20777,"_41":10},"- SVD options",[],{"_17":20780,"_31":20781,"_33":20782,"_19":20783,"_36":20784,"_45":16854,"_47":20789},"la.svdModule.svdCompact","la.svdModule.svdCompact(A, algorithm?)","Compute the compact (economy-size) SVD of a general m×n matrix A.\r","Compute the compact (economy-size) SVD of a general m×n matrix A.\r\n\r\nA = U * S * V^T\r\n\r\nThis is equivalent to `svd(A, { mode: 'reduced' })` but with a simpler interface.\r\n\r\nFor an m×n matrix with k = min(m, n):\r\n- U is m×k\r\n- S is k×k diagonal (returned as vector s of length k)\r\n- Vt is k×n",[20785,20786],{"_17":1163,"_19":20350,"_41":6},{"_17":20787,"_19":20788,"_41":10},"algorithm","- Which algorithm to use: 'gesvd' (more accurate) or 'gesdd' (faster)",[],{"_17":20791,"_31":20792,"_33":20793,"_19":20794,"_36":20795,"_45":20799,"_47":20800},"la.svdModule.svdRank","la.svdModule.svdRank(A, options?)","Estimate the numerical rank of a matrix using SVD.\r","Estimate the numerical rank of a matrix using SVD.\r\n\r\nThe rank is estimated by counting the number of singular values above\r\na tolerance threshold. This is the most reliable method for determining\r\nnumerical rank.",[20796,20797],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":20798,"_41":10},"- Options including tolerance","SVDRankResult",[],{"_17":20802,"_31":20803,"_33":20804,"_19":20805,"_36":20806,"_45":20810,"_47":20811},"la.svdModule.svdvals","la.svdModule.svdvals(A, options?)","Compute only the singular values of a general m×n matrix A.\r","Compute only the singular values of a general m×n matrix A.\r\n\r\nThis is faster than computing the full SVD when only singular values are needed.",[20807,20808],{"_17":1163,"_19":20350,"_41":6},{"_17":454,"_19":20809,"_41":10},"- Options","SVDValsResult",[],{"_17":20813,"_31":20814,"_33":20815,"_19":20816,"_36":20817,"_45":20819,"_47":20820},"la.utilities.balance","la.utilities.balance(A)","Balance a matrix to improve eigenvalue computation.\r","Balance a matrix to improve eigenvalue computation.\r\n\r\nBalancing uses diagonal similarity transformations to make the rows\r\nand columns of the matrix as close in norm as possible. This can\r\nimprove the accuracy of eigenvalue computations.\r\n\r\nThis is a pure TypeScript implementation of matrix balancing.",[20818],{"_17":1163,"_19":20400,"_41":6},"BalanceResult",[],{"_17":20822,"_31":20823,"_33":20824,"_19":20825,"_36":20826,"_45":20828,"_47":20829},"la.utilities.conjugate","la.utilities.conjugate(A)","Compute the complex conjugate of a matrix.\r","Compute the complex conjugate of a matrix.\r\n\r\nFor real matrices, this returns a copy of the matrix.\r\nFor complex matrices (stored as interleaved real/imag pairs),\r\nthis negates the imaginary parts.",[20827],{"_17":1163,"_19":20068,"_41":6},"ConjugateResult",[],{"_17":20831,"_31":20832,"_33":20833,"_19":20834,"_36":20835,"_45":20839,"_47":20840},"la.utilities.diag","la.utilities.diag(A, k?)","Extract the diagonal from a matrix, or create a diagonal matrix from a vector.\r","Extract the diagonal from a matrix, or create a diagonal matrix from a vector.\r\n\r\nIf input is a matrix (2D), extracts the diagonal elements.\r\nIf input is a vector (1D), creates a diagonal matrix.",[20836,20838],{"_17":1163,"_19":20837,"_41":6},"- Input matrix or vector",{"_17":4686,"_19":17973,"_41":10},"DiagResult",[],{"_17":20842,"_31":20843,"_33":20844,"_19":20845,"_36":20846,"_45":20848,"_47":20849},"la.utilities.hermitian","la.utilities.hermitian(A)","Compute the conjugate transpose (Hermitian transpose) of a matrix.\r","Compute the conjugate transpose (Hermitian transpose) of a matrix.\r\n\r\nFor real matrices, this is the same as the regular transpose.\r\nFor complex matrices, this transposes and conjugates.",[20847],{"_17":1163,"_19":20068,"_41":6},"HermitianResult",[],{"_17":20851,"_31":20852,"_33":20853,"_19":20854,"_36":20855,"_45":20857,"_47":20858},"la.utilities.trace","la.utilities.trace(A)","Compute the trace of a matrix (sum of diagonal elements).\r","Compute the trace of a matrix (sum of diagonal elements).\r\n\r\nThe trace is only defined for square matrices.",[20856],{"_17":1163,"_19":20400,"_41":6},"TraceResult",[],{"_17":20860,"_31":20861,"_33":20862,"_19":20862,"_36":20863,"_45":20865,"_47":20866},"la.utilities.transpose","la.utilities.transpose(A)","Compute the transpose of a matrix.",[20864],{"_17":1163,"_19":20068,"_41":6},"TransposeResult",[],{"_17":20868,"_31":20869,"_33":20870,"_19":20871,"_36":20872,"_45":20876,"_47":20877},"la.utilities.tril","la.utilities.tril(A, options?)","Extract the lower triangular part of a matrix.\r","Extract the lower triangular part of a matrix.\r\n\r\nReturns a matrix with elements above the k-th diagonal zeroed.",[20873,20874],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":20875,"_41":10},"- Extraction options","TrilResult",[],{"_17":20879,"_31":20880,"_33":20881,"_19":20882,"_36":20883,"_45":20886,"_47":20887},"la.utilities.triu","la.utilities.triu(A, options?)","Extract the upper triangular part of a matrix.\r","Extract the upper triangular part of a matrix.\r\n\r\nReturns a matrix with elements below the k-th diagonal zeroed.",[20884,20885],{"_17":1163,"_19":20068,"_41":6},{"_17":454,"_19":20875,"_41":10},"TriuResult",[],{"_17":20889,"_31":20890,"_33":20891,"_19":20892,"_36":20893,"_45":20897,"_47":20898},"la.utilities.isHermitian","la.utilities.isHermitian(A, options?)","Test if a matrix is Hermitian (A = A^H).\r","Test if a matrix is Hermitian (A = A^H).\r\n\r\nA matrix is Hermitian if A[i,j] = conj(A[j,i]) for all i,j.\r\nFor real matrices, this is equivalent to being symmetric.",[20894,20895],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":20896,"_41":10},"- Test options","IsHermitianResult",[],{"_17":20900,"_31":20901,"_33":20902,"_19":20903,"_36":20904,"_45":20907,"_47":20908},"la.utilities.isOrthogonal","la.utilities.isOrthogonal(A, options?)","Test if a matrix is orthogonal (Q^T * Q = I).\r","Test if a matrix is orthogonal (Q^T * Q = I).\r\n\r\nAn orthogonal matrix has orthonormal columns and rows.\r\nQ^T * Q = Q * Q^T = I, and det(Q) = ±1.",[20905,20906],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":20896,"_41":10},"IsOrthogonalResult",[],{"_17":20910,"_31":20911,"_33":20912,"_19":20913,"_36":20914,"_45":20917,"_47":20918},"la.utilities.isPositiveDefinite","la.utilities.isPositiveDefinite(A)","Test if a matrix is positive definite.\r","Test if a matrix is positive definite.\r\n\r\nA symmetric matrix is positive definite if all its eigenvalues are positive,\r\nor equivalently, if Cholesky factorization succeeds.",[20915],{"_17":1163,"_19":20916,"_41":6},"- Input square symmetric matrix (n × n)","IsPositiveDefiniteResult",[],{"_17":20920,"_31":20921,"_33":20922,"_19":20923,"_36":20924,"_45":20927,"_47":20928},"la.utilities.isSingular","la.utilities.isSingular(A, options?)","Test if a matrix is singular (non-invertible).\r","Test if a matrix is singular (non-invertible).\r\n\r\nA matrix is singular if its determinant is zero, or equivalently,\r\nif it has a zero singular value.",[20925,20926],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":20896,"_41":10},"IsSingularResult",[],{"_17":20930,"_31":20931,"_33":20932,"_19":20933,"_36":20934,"_45":20937,"_47":20938},"la.utilities.isSymmetric","la.utilities.isSymmetric(A, options?)","Test if a matrix is symmetric (A = A^T).\r","Test if a matrix is symmetric (A = A^T).\r\n\r\nA matrix is symmetric if A[i,j] = A[j,i] for all i,j.",[20935,20936],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":20896,"_41":10},"IsSymmetricResult",[],{"_17":20940,"_31":20941,"_33":20942,"_19":20943,"_36":20944,"_45":20947,"_47":20948},"la.utilities.isUnitary","la.utilities.isUnitary(A, options?)","Test if a matrix is unitary (Q^H * Q = I).\r","Test if a matrix is unitary (Q^H * Q = I).\r\n\r\nA unitary matrix has orthonormal columns and rows under the Hermitian inner product.\r\nFor real matrices, this is equivalent to being orthogonal.",[20945,20946],{"_17":1163,"_19":20400,"_41":6},{"_17":454,"_19":20896,"_41":10},"IsUnitaryResult",[],{"_17":20950,"_31":20951,"_33":20952,"_19":1136,"_36":20953,"_45":46,"_47":20956},"la.configureLAPACK","la.configureLAPACK(config)","configureLAPACK",[20954],{"_17":3805,"_19":20955,"_41":6},"LAPACKLoadConfig",[],{"_17":20958,"_31":20959,"_33":20960,"_19":20960,"_36":20961,"_45":506,"_47":20966},"la.fromColumnMajor","la.fromColumnMajor(data, m, n)","Convert a column-major 1D array to row-major 2D array.",[20962,20964,20965],{"_17":1215,"_19":20963,"_41":6},"- Column-major 1D array",{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},[],{"_17":20968,"_31":20969,"_33":20970,"_19":1136,"_36":20971,"_45":20972,"_47":20973},"la.getLAPACKModule","la.getLAPACKModule()","getLAPACKModule",[],"LAPACKModule",[],{"_17":20975,"_31":20976,"_33":20977,"_19":1136,"_36":20978,"_45":2598,"_47":20979},"la.isLAPACKLoaded","la.isLAPACKLoaded()","isLAPACKLoaded",[],[],{"_17":20981,"_31":20982,"_33":20983,"_19":1136,"_36":20984,"_45":20985,"_47":20986},"la.loadLAPACKModule","la.loadLAPACKModule()","loadLAPACKModule",[],"Promise",[],{"_17":20988,"_31":20989,"_33":20990,"_19":20991,"_36":20992,"_45":1130,"_47":20995},"la.prepareMatrix","la.prepareMatrix(matrix)","Prepare a matrix for LAPACK: convert to column-major Float64Array.\r","Prepare a matrix for LAPACK: convert to column-major Float64Array.\r\nHandles both 2D arrays (row-major) and 1D arrays (assumed column-major).",[20993],{"_17":19605,"_19":20994,"_41":6},"- Input matrix (2D row-major or 1D column-major)",[],{"_17":20997,"_31":20998,"_33":20999,"_19":20999,"_36":21000,"_45":1130,"_47":21003},"la.prepareVector","la.prepareVector(vector)","Prepare a vector for LAPACK.",[21001],{"_17":21002,"_19":19328,"_41":6},"vector",[],{"_17":21005,"_31":21006,"_33":21007,"_19":1136,"_36":21008,"_45":46,"_47":21009},"la.resetLAPACKModule","la.resetLAPACKModule()","resetLAPACKModule",[],[],{"_17":21011,"_31":21012,"_33":21013,"_19":21014,"_36":21015,"_45":1130,"_47":21018},"la.toColumnMajor","la.toColumnMajor(matrix)","Convert a row-major 2D array to column-major 1D array (Fortran order).\r","Convert a row-major 2D array to column-major 1D array (Fortran order).\r\nLAPACK expects column-major ordering.",[21016],{"_17":19605,"_19":21017,"_41":6},"- Row-major 2D array [row][col]",[],{"_15":21020,"_17":21021,"_19":21022,"_21":22,"_23":21023,"_25":21024,"_27":21025},"slu-generated","Sparse Direct Solver (SuperLU)","SuperLU sparse direct solver.","⚡","slu",[21026,21038,21053,21070,21082,21098,21106,21118,21124,21133,21141,21148,21158,21169,21183,21192,21201,21213,21224,21235,21243,21252,21259,21268,21276,21286,21296,21304,21313,21325,21333,21340,21347,21361,21372,21381,21391,21400,21409,21418,21427,21435,21443,21450,21457,21465,21472,21482,21490,21501,21510,21520,21526,21535,21545,21560,21571,21581,21591,21602,21612,21621,21629,21642,21660,21676,21692,21701,21710,21717,21726,21739,21749,21757,21765,21772,21783,21791,21799,21807,21815,21822,21833,21841,21850,21861,21871,21880,21893,21903,21913,21921,21930,21940,21952,21962,21971,21985,21994,22003,22018,22030,22044,22056,22066,22076,22086,22097,22109,22123,22135,22147,22158,22171,22181,22192,22202,22212,22226,22233,22240,22248,22256],{"_17":21027,"_31":21028,"_33":21029,"_19":21030,"_36":21031,"_45":21036,"_47":21037},"slu.analysis.computeMatrixNorm","slu.analysis.computeMatrixNorm(A, normType?)","Compute the norm of a sparse matrix.\r","Compute the norm of a sparse matrix.\r\n\r\nSupported norms:\r\n- **one**: 1-norm (maximum column sum of absolute values)\r\n- **infinity**: ∞-norm (maximum row sum of absolute values)\r\n- **frobenius**: Frobenius norm (sqrt of sum of squared elements)\r\n- **max**: Max norm (maximum absolute element)",[21032,21034],{"_17":1163,"_19":21033,"_41":6},"- Sparse matrix in CSC format",{"_17":1469,"_19":21035,"_41":10},"- Type of norm to compute","MatrixNormResult",[],{"_17":21039,"_31":21040,"_33":21041,"_19":21042,"_36":21043,"_45":21051,"_47":21052},"slu.analysis.estimateConditionNumber","slu.analysis.estimateConditionNumber(lu, normType?, matrixNorm?)","Estimate the condition number of a matrix using its LU factorization.\r","Estimate the condition number of a matrix using its LU factorization.\r\n\r\nThe condition number κ(A) = ||A|| * ||A^{-1}|| measures how sensitive\r\nthe solution of Ax = b is to perturbations in A and b. A large condition\r\nnumber indicates an ill-conditioned matrix where small changes in input\r\ncan cause large changes in output.\r\n\r\nThis function uses the SuperLU dgscon routine to estimate the reciprocal\r\ncondition number efficiently without computing A^{-1} explicitly.",[21044,21046,21048],{"_17":5115,"_19":21045,"_41":6},"- LU factorization from sparseLU()",{"_17":1469,"_19":21047,"_41":10},"- Norm type for the estimate",{"_17":21049,"_19":21050,"_41":10},"matrixNorm","- Original matrix norm ||A|| (optional, will compute if not provided)","ConditionNumberResult",[],{"_17":21054,"_31":21055,"_33":21056,"_19":21057,"_36":21058,"_45":21068,"_47":21069},"slu.analysis.iterativelyRefine","slu.analysis.iterativelyRefine(A, lu, b, x, options?)","Improve the accuracy of a computed solution using iterative refinement.\r","Improve the accuracy of a computed solution using iterative refinement.\r\n\r\nIterative refinement works by computing the residual r = b - A*x, solving\r\nfor a correction d from A*d = r, and updating x := x + d. This process\r\ncan significantly improve accuracy when the initial solution has small\r\nrelative errors.\r\n\r\nThis implementation uses the pre-computed LU factorization to solve the\r\ncorrection equations efficiently.",[21059,21061,21063,21064,21066],{"_17":1163,"_19":21060,"_41":6},"- Original sparse matrix in CSC format",{"_17":5115,"_19":21062,"_41":6},"- Pre-computed LU factorization",{"_17":408,"_19":2031,"_41":6},{"_17":405,"_19":21065,"_41":6},"- Initial solution to refine (will be modified in place)",{"_17":454,"_19":21067,"_41":10},"- Refinement options","RefinementResult",[],{"_17":21071,"_31":21072,"_33":21073,"_19":21074,"_36":21075,"_45":21080,"_47":21081},"slu.analysis.getEliminationTree","slu.analysis.getEliminationTree(A, columnPermutation?)","Compute the elimination tree for a sparse matrix.\r","Compute the elimination tree for a sparse matrix.\r\n\r\nThe elimination tree describes the structure of the LU factorization.\r\nNode i is the parent of node j if the first off-diagonal nonzero in\r\ncolumn j of L is in row i. The tree structure determines:\r\n- Dependencies between columns during factorization\r\n- Potential for parallelism\r\n- Fill-in pattern",[21076,21077],{"_17":1163,"_19":21033,"_41":6},{"_17":21078,"_19":21079,"_41":10},"columnPermutation","- Optional column permutation","EliminationTreeResult",[],{"_17":21083,"_31":21084,"_33":21085,"_19":21086,"_36":21087,"_45":21096,"_47":21097},"slu.analysis.getEliminationTreeStatistics","slu.analysis.getEliminationTreeStatistics(etree, A, _columnPermutation?)","Compute statistics about the elimination tree.\r","Compute statistics about the elimination tree.\r\n\r\nAnalyzes the elimination tree structure to provide insights about\r\nthe factorization, including tree height, supernode count, and\r\nrough fill-in estimates.",[21088,21091,21093],{"_17":21089,"_19":21090,"_41":6},"etree","- Elimination tree from getEliminationTree",{"_17":1163,"_19":21092,"_41":6},"- Original sparse matrix",{"_17":21094,"_19":21095,"_41":10},"_columnPermutation","IntArray","EliminationTreeStatistics",[],{"_17":21099,"_31":21100,"_33":21101,"_19":21102,"_36":21103,"_45":1387,"_47":21105},"slu.analysis.getFlopsEstimate","slu.analysis.getFlopsEstimate(A)","Estimate floating point operations for LU factorization.\r","Estimate floating point operations for LU factorization.\r\n\r\nProvides a rough estimate of the number of floating point operations\r\nrequired to factorize the matrix. Useful for comparing ordering\r\nstrategies and predicting factorization time.",[21104],{"_17":1163,"_19":21033,"_41":6},[],{"_17":21107,"_31":21108,"_33":21109,"_19":21110,"_36":21111,"_45":21116,"_47":21117},"slu.analysis.predictFillIn","slu.analysis.predictFillIn(A, perm)","Predict fill-in for LU factorization.\r","Predict fill-in for LU factorization.\r\n\r\nComputes column counts for L and row counts for U, which determine\r\nthe fill-in pattern without performing numerical factorization.\r\nThis is useful for memory allocation and comparing ordering strategies.",[21112,21113],{"_17":1163,"_19":21033,"_41":6},{"_17":21114,"_19":21115,"_41":6},"perm","- Column permutation","FillInPrediction",[],{"_17":21119,"_31":21120,"_33":21121,"_19":21121,"_36":21122,"_45":46,"_47":21123},"slu.core.clearSolveHistory","slu.core.clearSolveHistory()","Clear the solve history.",[],[],{"_17":21125,"_31":21126,"_33":21127,"_19":21128,"_36":21129,"_45":46,"_47":21132},"slu.core.enableDetailedLogging","slu.core.enableDetailedLogging(level?)","Enable or disable detailed logging.\r","Enable or disable detailed logging.\r\n\r\nControls the verbosity of diagnostic output from solve operations.\r\n\r\nLogging levels:\r\n- 0: Off (default)\r\n- 1: Basic (errors and warnings only)\r\n- 2: Detailed (includes timing and statistics)\r\n- 3: Verbose (includes internal operations)",[21130],{"_17":2062,"_19":21131,"_41":10},"- Logging level (0-3)",[],{"_17":21134,"_31":21135,"_33":21136,"_19":21137,"_36":21138,"_45":21139,"_47":21140},"slu.core.getLastSolveStatistics","slu.core.getLastSolveStatistics()","Get statistics from the last solve operation.\r","Get statistics from the last solve operation.\r\n\r\nReturns timing and other statistics from the most recent solve.\r\nThis is useful for performance monitoring and benchmarking.",[],"SolveStatistics | null",[],{"_17":21142,"_31":21143,"_33":21144,"_19":21144,"_36":21145,"_45":21146,"_47":21147},"slu.core.getLoggingLevel","slu.core.getLoggingLevel()","Get the current logging level.",[],"LogLevel",[],{"_17":21149,"_31":21150,"_33":21151,"_19":21152,"_36":21153,"_45":21156,"_47":21157},"slu.core.getSolveHistory","slu.core.getSolveHistory(limit?)","Get the solve history.\r","Get the solve history.\r\n\r\nReturns a record of recent solve operations for debugging\r\nand performance analysis.",[21154],{"_17":18828,"_19":21155,"_41":10},"- Maximum number of records to return","SolveRecord[]",[],{"_17":21159,"_31":21160,"_33":21161,"_19":21162,"_36":21163,"_45":21167,"_47":21168},"slu.core.getErrorMessage","slu.core.getErrorMessage(errorCode)","Get a human-readable error message for a SuperLU error code.\r","Get a human-readable error message for a SuperLU error code.\r\n\r\nSuperLU returns integer error codes from its routines. This function\r\ntranslates them into descriptive messages and provides suggestions\r\nfor resolution.\r\n\r\nError codes:\r\n- 0: Success\r\n- > 0: U[i,i] = 0, matrix is singular at column i\r\n- < 0: Invalid argument or internal error",[21164],{"_17":21165,"_19":21166,"_41":6},"errorCode","- Error code from SuperLU","SuperLUError",[],{"_17":21170,"_31":21171,"_33":21172,"_19":21173,"_36":21174,"_45":1387,"_47":21182},"slu.core.allocateDoubles","slu.core.allocateDoubles(module, values, size?)","# SuperLUWasm\r","# SuperLUWasm\r\n\r\nWebAssembly bindings for SuperLU, a library for the direct solution of\r\nlarge, sparse, nonsymmetric systems of linear equations.\r\n\r\n## Overview\r\n\r\nSuperLU uses LU factorization with partial pivoting and triangular\r\nsolves to compute the solution to sparse linear systems Ax = b.\r\nKey features include:\r\n\r\n- **Sparse LU Factorization**: Efficient factorization of sparse matrices\r\n- **Multiple Precisions**: Single (float32), double (float64), and complex variants\r\n- **Fill-Reducing Orderings**: Column permutations to minimize fill-in\r\n- **Numerical Stability**: Row permutations and equilibration\r\n- **Iterative Refinement**: Improve solution accuracy\r\n- **ILU Preconditioning**: Incomplete LU for iterative solvers\r\n\r\n## Quick Start\r\n\r\n```typescript\r\nimport { loadSuperLUModule, solveSparseCSC } from 'superluwasm';\r\n\r\n// 1. Load the WASM module (do this once at startup)\r\nawait loadSuperLUModule();\r\n\r\n// 2. Create a sparse matrix in CSC format\r\nconst A = {\r\n m: 3, n: 3,\r\n values: new Float64Array([4, 1, 1, 3, 2, 5]),\r\n rowIndices: new Int32Array([0, 1, 1, 2, 0, 2]),\r\n colPointers: new Int32Array([0, 2, 4, 6]),\r\n dtype: 'float64' as const\r\n};\r\n\r\n// 3. Solve Ax = b\r\nconst b = new Float64Array([1, 2, 3]);\r\nconst { x, statistics } = solveSparseCSC(A, b);\r\n\r\nconsole.log('Solution:', x);\r\nconsole.log('Time:', statistics.totalTime, 'ms');\r\n```\r\n\r\n## Matrix Formats\r\n\r\nSuperLU uses compressed sparse formats:\r\n\r\n- **CSC (Compressed Sparse Column)**: Native format, most efficient\r\n- **CSR (Compressed Sparse Row)**: Supported via automatic conversion\r\n\r\n## High-Level API\r\n\r\n### Solvers\r\n- - Solve Ax=b with CSC matrix\r\n- - Solve Ax=b with CSR matrix\r\n- - Solve A^T x = b\r\n- - Solve A^H x = b (complex)\r\n- - Full control over all options\r\n\r\n### Triangular Solvers\r\n- - Solve with precomputed LU factors\r\n- - Transpose solve with LU\r\n- - Direct triangular solve (CSC)\r\n- - Direct triangular solve (CSR)\r\n\r\n### Factorization\r\n- - Compute LU factorization\r\n- - Compute incomplete LU for preconditioning\r\n\r\n### Module Loading\r\n- - Initialize the WASM module\r\n- - Get the loaded module\r\n- - Check if loaded\r\n- - Configure WASM location",[21175,21178,21180],{"_17":21176,"_19":21177,"_41":6},"module","- SuperLU WASM module",{"_17":560,"_19":21179,"_41":6},"- Initial values, or null for uninitialized allocation",{"_17":1865,"_19":21181,"_41":10},"- Size to allocate (defaults to values.length)",[],{"_17":21184,"_31":21185,"_33":21186,"_19":21186,"_36":21187,"_45":1387,"_47":21191},"slu.core.allocateFloats","slu.core.allocateFloats(module, values, size?)","Allocate a Float32Array in WASM memory and optionally initialize with values.",[21188,21189,21190],{"_17":21176,"_19":21177,"_41":6},{"_17":560,"_19":21179,"_41":6},{"_17":1865,"_19":21181,"_41":10},[],{"_17":21193,"_31":21194,"_33":21195,"_19":21195,"_36":21196,"_45":1387,"_47":21200},"slu.core.allocateInts","slu.core.allocateInts(module, values, size?)","Allocate an Int32Array in WASM memory and optionally initialize with values.",[21197,21198,21199],{"_17":21176,"_19":21177,"_41":6},{"_17":560,"_19":21179,"_41":6},{"_17":1865,"_19":21181,"_41":10},[],{"_17":21202,"_31":21203,"_33":21204,"_19":21204,"_36":21205,"_45":1387,"_47":21212},"slu.core.allocateValues","slu.core.allocateValues(module, values, dtype, size?)","Allocate values based on data type.",[21206,21207,21209,21211],{"_17":21176,"_19":21177,"_41":6},{"_17":560,"_19":21208,"_41":6},"- Initial values",{"_17":9115,"_19":21210,"_41":6},"- Data type",{"_17":1865,"_19":1387,"_41":10},[],{"_17":21214,"_31":21215,"_33":21216,"_19":21216,"_36":21217,"_45":46,"_47":21223},"slu.core.checkSuperLUError","slu.core.checkSuperLUError(info, routine)","Check SuperLU return code and throw if error.",[21218,21220],{"_17":19868,"_19":21219,"_41":6},"- Info code from SuperLU routine",{"_17":21221,"_19":21222,"_41":6},"routine","- Name of the routine",[],{"_17":21225,"_31":21226,"_33":21227,"_19":21228,"_36":21229,"_45":46,"_47":21234},"slu.core.freeAll","slu.core.freeAll(module, ptrs)","Free multiple pointers at once.\r","Free multiple pointers at once.\r\nSafely handles zero/null pointers (skips them).",[21230,21231],{"_17":21176,"_19":21177,"_41":6},{"_17":21232,"_19":21233,"_41":6},"ptrs","- Array of pointers to free",[],{"_17":21236,"_31":21237,"_33":21238,"_19":21238,"_36":21239,"_45":1387,"_47":21242},"slu.core.getElementSize","slu.core.getElementSize(dtype)","Get element size in bytes for a data type.",[21240],{"_17":9115,"_19":21241,"_41":6},"DataType",[],{"_17":21244,"_31":21245,"_33":21246,"_19":21246,"_36":21247,"_45":1793,"_47":21251},"slu.core.getSuperLUErrorMessage","slu.core.getSuperLUErrorMessage(info, routine?)","Get error message for a SuperLU info code.",[21248,21249],{"_17":19868,"_19":21219,"_41":6},{"_17":21221,"_19":21250,"_41":10},"- Name of the routine (for context)",[],{"_17":21253,"_31":21254,"_33":21255,"_19":21255,"_36":21256,"_45":2598,"_47":21258},"slu.core.isComplexType","slu.core.isComplexType(dtype)","Check if a data type is complex.",[21257],{"_17":9115,"_19":21241,"_41":6},[],{"_17":21260,"_31":21261,"_33":21262,"_19":21262,"_36":21263,"_45":1387,"_47":21267},"slu.core.readByte","slu.core.readByte(module, ptr)","Read a single byte/char from WASM memory.",[21264,21265],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},"- Pointer to read from",[],{"_17":21269,"_31":21270,"_33":21271,"_19":21271,"_36":21272,"_45":1387,"_47":21275},"slu.core.readDouble","slu.core.readDouble(module, ptr)","Read a single double from WASM memory.",[21273,21274],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},[],{"_17":21277,"_31":21278,"_33":21279,"_19":21279,"_36":21280,"_45":1130,"_47":21285},"slu.core.readDoubles","slu.core.readDoubles(module, ptr, length)","Read doubles from WASM memory.",[21281,21282,21283],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},{"_17":2841,"_19":21284,"_41":6},"- Number of elements to read",[],{"_17":21287,"_31":21288,"_33":21289,"_19":21289,"_36":21290,"_45":21294,"_47":21295},"slu.core.readFloats","slu.core.readFloats(module, ptr, length)","Read floats from WASM memory.",[21291,21292,21293],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},{"_17":2841,"_19":21284,"_41":6},"Float32Array",[],{"_17":21297,"_31":21298,"_33":21299,"_19":21299,"_36":21300,"_45":1387,"_47":21303},"slu.core.readInt","slu.core.readInt(module, ptr)","Read a single integer from WASM memory.",[21301,21302],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},[],{"_17":21305,"_31":21306,"_33":21307,"_19":21307,"_36":21308,"_45":422,"_47":21312},"slu.core.readInts","slu.core.readInts(module, ptr, length)","Read integers from WASM memory.",[21309,21310,21311],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},{"_17":2841,"_19":21284,"_41":6},[],{"_17":21314,"_31":21315,"_33":21316,"_19":21316,"_36":21317,"_45":21323,"_47":21324},"slu.core.readValues","slu.core.readValues(module, ptr, length, dtype)","Read values based on data type.",[21318,21319,21320,21322],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21266,"_41":6},{"_17":2841,"_19":21321,"_41":6},"- Number of elements",{"_17":9115,"_19":21210,"_41":6},"Float64Array | Float32Array",[],{"_17":21326,"_31":21327,"_33":21328,"_19":21328,"_36":21329,"_45":21294,"_47":21332},"slu.core.toFloat32Array","slu.core.toFloat32Array(arr)","Convert a JavaScript array to Float32Array.",[21330],{"_17":9283,"_19":21331,"_41":6},"RealArray",[],{"_17":21334,"_31":21335,"_33":21336,"_19":21336,"_36":21337,"_45":1130,"_47":21339},"slu.core.toFloat64Array","slu.core.toFloat64Array(arr)","Convert a JavaScript array to Float64Array.",[21338],{"_17":9283,"_19":21331,"_41":6},[],{"_17":21341,"_31":21342,"_33":21343,"_19":21343,"_36":21344,"_45":422,"_47":21346},"slu.core.toInt32Array","slu.core.toInt32Array(arr)","Convert a JavaScript array to Int32Array.",[21345],{"_17":9283,"_19":21095,"_41":6},[],{"_17":21348,"_31":21349,"_33":21350,"_19":21351,"_36":21352,"_45":21359,"_47":21360},"slu.core.withAllocations","slu.core.withAllocations(module, allocations, fn)","RAII-style resource management.\r","RAII-style resource management.\r\nExecutes a function with allocated resources and ensures cleanup.",[21353,21354,21357],{"_17":21176,"_19":21177,"_41":6},{"_17":21355,"_19":21356,"_41":6},"allocations","- Object mapping names to allocation functions",{"_17":578,"_19":21358,"_41":6},"- Function to execute with allocated pointers","Promise",[],{"_17":21362,"_31":21363,"_33":21364,"_19":21364,"_36":21365,"_45":46,"_47":21371},"slu.core.writeByte","slu.core.writeByte(module, ptr, value)","Write a single byte to WASM memory.",[21366,21367,21369],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},"- Pointer to write to",{"_17":514,"_19":21370,"_41":6},"- Value to write",[],{"_17":21373,"_31":21374,"_33":21375,"_19":21375,"_36":21376,"_45":46,"_47":21380},"slu.core.writeDouble","slu.core.writeDouble(module, ptr, value)","Write a single double to WASM memory.",[21377,21378,21379],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},{"_17":514,"_19":21370,"_41":6},[],{"_17":21382,"_31":21383,"_33":21384,"_19":21384,"_36":21385,"_45":46,"_47":21390},"slu.core.writeDoubles","slu.core.writeDoubles(module, ptr, values)","Write doubles to WASM memory.",[21386,21387,21388],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},{"_17":560,"_19":21389,"_41":6},"- Values to write",[],{"_17":21392,"_31":21393,"_33":21394,"_19":21394,"_36":21395,"_45":46,"_47":21399},"slu.core.writeFloats","slu.core.writeFloats(module, ptr, values)","Write floats to WASM memory.",[21396,21397,21398],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},{"_17":560,"_19":21389,"_41":6},[],{"_17":21401,"_31":21402,"_33":21403,"_19":21403,"_36":21404,"_45":46,"_47":21408},"slu.core.writeInt","slu.core.writeInt(module, ptr, value)","Write a single integer to WASM memory.",[21405,21406,21407],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},{"_17":514,"_19":21370,"_41":6},[],{"_17":21410,"_31":21411,"_33":21412,"_19":21412,"_36":21413,"_45":46,"_47":21417},"slu.core.writeInts","slu.core.writeInts(module, ptr, values)","Write integers to WASM memory.",[21414,21415,21416],{"_17":21176,"_19":21177,"_41":6},{"_17":310,"_19":21368,"_41":6},{"_17":560,"_19":21389,"_41":6},[],{"_17":21419,"_31":21420,"_33":21421,"_19":21422,"_36":21423,"_45":46,"_47":21426},"slu.core.configureSuperLU","slu.core.configureSuperLU(config)","Configure SuperLU WASM module loading options.\r","Configure SuperLU WASM module loading options.\r\n\r\nCall this function BEFORE calling to customize\r\nwhere the WASM files are loaded from. This is useful for:\r\n- Loading from a CDN instead of bundled files\r\n- Using a custom-built WASM module\r\n- Deploying to environments with specific asset requirements\r\n\r\n**Important**: Configuration cannot be changed after the module starts loading.\r\nIf you need to change configuration, call first.",[21424],{"_17":3805,"_19":21425,"_41":6},"- Configuration options specifying WASM file locations",[],{"_17":21428,"_31":21429,"_33":21430,"_19":21431,"_36":21432,"_45":21433,"_47":21434},"slu.core.getSuperLUConfig","slu.core.getSuperLUConfig()","Get the current SuperLU loading configuration.\r","Get the current SuperLU loading configuration.\r\n\r\nReturns a readonly copy of the current configuration. Useful for:\r\n- Debugging loading issues\r\n- Verifying configuration was applied correctly\r\n- Logging the WASM URLs being used",[],"Readonly",[],{"_17":21436,"_31":21437,"_33":21438,"_19":21439,"_36":21440,"_45":21441,"_47":21442},"slu.core.getSuperLUModule","slu.core.getSuperLUModule()","Get the loaded SuperLU WASM module synchronously.\r","Get the loaded SuperLU WASM module synchronously.\r\n\r\nUse this function when you know the module has already been loaded\r\n(i.e., after successfully awaiting ).\r\nThis is useful in synchronous code paths where you can't use await.\r\n\r\n**Important**: This function throws if the module hasn't been loaded yet.\r\nAlways ensure has completed before calling this.",[],"SuperLUModule",[],{"_17":21444,"_31":21445,"_33":21446,"_19":21447,"_36":21448,"_45":2598,"_47":21449},"slu.core.isSuperLULoaded","slu.core.isSuperLULoaded()","Check if the SuperLU WASM module has been fully loaded.\r","Check if the SuperLU WASM module has been fully loaded.\r\n\r\nReturns `true` only after has successfully completed.\r\nReturns `false` if:\r\n- The module has never been loaded\r\n- Loading is still in progress\r\n- The module was reset via \r\n\r\nUse this to safely check before calling .",[],[],{"_17":21451,"_31":21452,"_33":21453,"_19":21454,"_36":21455,"_45":2598,"_47":21456},"slu.core.isSuperLULoading","slu.core.isSuperLULoading()","Check if the SuperLU WASM module is currently loading.\r","Check if the SuperLU WASM module is currently loading.\r\n\r\nReturns `true` if has been called but hasn't\r\ncompleted yet. Useful for showing loading indicators or preventing\r\nduplicate load attempts.",[],[],{"_17":21458,"_31":21459,"_33":21460,"_19":21461,"_36":21462,"_45":21463,"_47":21464},"slu.core.loadSuperLUModule","slu.core.loadSuperLUModule()","Load and initialize the SuperLU WASM module.\r","Load and initialize the SuperLU WASM module.\r\n\r\nThis is the main entry point for using SuperLU. Call this function once\r\nduring your application's initialization to load the WebAssembly module.\r\nSubsequent calls return the same module instance (idempotent).\r\n\r\nThe function automatically detects the runtime environment (Node.js or browser)\r\nand uses the appropriate loading strategy. In browsers, you can customize\r\nthe WASM file location using before calling this.\r\n\r\n**Performance**: Loading is async and may take a few hundred milliseconds\r\ndepending on network conditions and WASM file size (~1-2MB). Consider\r\nloading during application startup or showing a loading indicator.",[],"Promise",[],{"_17":21466,"_31":21467,"_33":21468,"_19":21469,"_36":21470,"_45":46,"_47":21471},"slu.core.resetSuperLUModule","slu.core.resetSuperLUModule()","Reset the SuperLU module state completely.\r","Reset the SuperLU module state completely.\r\n\r\nThis function:\r\n1. Clears the cached module instance\r\n2. Cancels any in-progress loading\r\n3. Resets all configuration to defaults\r\n\r\nAfter calling this, you can reconfigure and reload the module.\r\nThis is useful for:\r\n- Testing (reset between test cases)\r\n- Switching to a different WASM build\r\n- Recovering from errors\r\n\r\n**Warning**: Any existing references to the old module will become invalid.\r\nEnsure no code is still using the module before calling this.",[],[],{"_17":21473,"_31":21474,"_33":21475,"_19":21476,"_36":21477,"_45":21480,"_47":21481},"slu.core.allocateWorkspace","slu.core.allocateWorkspace(size)","Allocate a workspace buffer in WASM memory.\r","Allocate a workspace buffer in WASM memory.\r\n\r\nThis allows pre-allocating workspace for factorization operations,\r\nwhich can reduce allocation overhead when performing many operations.",[21478],{"_17":1865,"_19":21479,"_41":6},"- Size in bytes to allocate","WorkspaceAllocation",[],{"_17":21483,"_31":21484,"_33":21485,"_19":21485,"_36":21486,"_45":46,"_47":21489},"slu.core.deallocateWorkspace","slu.core.deallocateWorkspace(ptr)","Deallocate a previously allocated workspace.",[21487],{"_17":310,"_19":21488,"_41":6},"- WASM pointer from allocateWorkspace",[],{"_17":21491,"_31":21492,"_33":21493,"_19":21494,"_36":21495,"_45":21499,"_47":21500},"slu.core.estimateMemoryRequired","slu.core.estimateMemoryRequired(A, _options?)","Estimate memory required for LU factorization.\r","Estimate memory required for LU factorization.\r\n\r\nProvides a rough estimate of memory that will be needed to\r\nfactorize a matrix. This is useful for checking if factorization\r\nwill fit in available memory before attempting it.\r\n\r\nNote: This is a heuristic estimate. Actual memory usage depends\r\non the matrix structure and ordering strategy.",[21496,21497],{"_17":1163,"_19":8319,"_41":6},{"_17":8334,"_19":21498,"_41":10},"LUFactorizationOptions","MemoryEstimate",[],{"_17":21502,"_31":21503,"_33":21504,"_19":21505,"_36":21506,"_45":46,"_47":21509},"slu.core.freeFactorization","slu.core.freeFactorization(lu)","Free memory used by an LU factorization.\r","Free memory used by an LU factorization.\r\n\r\nThis is equivalent to calling lu.dispose() but provided as a\r\nstandalone function for consistency with the API.",[21507],{"_17":5115,"_19":21508,"_41":6},"- LU factorization to free",[],{"_17":21511,"_31":21512,"_33":21513,"_19":21514,"_36":21515,"_45":21518,"_47":21519},"slu.core.getMemoryUsage","slu.core.getMemoryUsage(lu)","Get memory usage of LU factors.\r","Get memory usage of LU factors.\r\n\r\nReturns the memory consumed by the L and U factors from a\r\nfactorization. This is useful for monitoring memory usage\r\nin applications that perform many factorizations.",[21516],{"_17":5115,"_19":21517,"_41":6},"- LU factorization","MemoryUsage",[],{"_17":21521,"_31":21522,"_33":21523,"_19":21523,"_36":21524,"_45":1387,"_47":21525},"slu.core.getWorkspaceSize","slu.core.getWorkspaceSize()","Get the current global workspace size limit.",[],[],{"_17":21527,"_31":21528,"_33":21529,"_19":21530,"_36":21531,"_45":21533,"_47":21534},"slu.core.queryFactorStatistics","slu.core.queryFactorStatistics(lu)","Query statistics about a completed factorization.\r","Query statistics about a completed factorization.\r\n\r\nReturns detailed information about the factorization including\r\nnonzero counts, fill-in ratio, and estimated operation count.",[21532],{"_17":5115,"_19":21517,"_41":6},"FactorStatistics",[],{"_17":21536,"_31":21537,"_33":21538,"_19":21539,"_36":21540,"_45":46,"_47":21544},"slu.core.setWorkspaceSize","slu.core.setWorkspaceSize(bytes)","Set the global workspace size limit.\r","Set the global workspace size limit.\r\n\r\nThis sets a soft limit on the workspace that SuperLU can use.\r\nThe actual behavior depends on the SuperLU implementation.",[21541],{"_17":21542,"_19":21543,"_41":6},"bytes","- Maximum workspace size in bytes (0 for unlimited)",[],{"_17":21546,"_31":21547,"_33":21548,"_19":21549,"_36":21550,"_45":21558,"_47":21559},"slu.equilibration.applyEquilibrationScaling","slu.equilibration.applyEquilibrationScaling(A, rowScale, columnScale)","Apply equilibration scaling to a sparse matrix.\r","Apply equilibration scaling to a sparse matrix.\r\n\r\nComputes the scaled matrix: A_scaled = R * A * C\r\nwhere R = diag(rowScale) and C = diag(columnScale).",[21551,21552,21555],{"_17":1163,"_19":21060,"_41":6},{"_17":21553,"_19":21554,"_41":6},"rowScale","- Row scaling factors",{"_17":21556,"_19":21557,"_41":6},"columnScale","- Column scaling factors","SparseMatrixCSC",[],{"_17":21561,"_31":21562,"_33":21563,"_19":21564,"_36":21565,"_45":21569,"_47":21570},"slu.equilibration.computeEquilibrationScaling","slu.equilibration.computeEquilibrationScaling(A, options?)","Compute equilibration scaling factors for a sparse matrix.\r","Compute equilibration scaling factors for a sparse matrix.\r\n\r\nThis function computes row and column scaling factors that, when applied,\r\nwill make the matrix better conditioned for LU factorization. The scaling\r\nis computed so that:\r\n- Row scaling makes max |A_{ij}| in each row ≈ 1\r\n- Column scaling makes max |A_{ij}| in each column ≈ 1\r\n\r\nThe returned factors can be used with applyEquilibrationScaling and\r\nundoEquilibrationScaling to transform the system.",[21566,21567],{"_17":1163,"_19":21033,"_41":6},{"_17":454,"_19":21568,"_41":10},"- Equilibration options","EquilibrationScaling",[],{"_17":21572,"_31":21573,"_33":21574,"_19":21575,"_36":21576,"_45":1130,"_47":21580},"slu.equilibration.scaleRightHandSide","slu.equilibration.scaleRightHandSide(b, rowScale)","Scale the right-hand side vector for equilibration.\r","Scale the right-hand side vector for equilibration.\r\n\r\nWhen solving R*A*C * y = R*b, the RHS must be scaled by R.",[21577,21579],{"_17":408,"_19":21578,"_41":6},"- Original right-hand side vector",{"_17":21553,"_19":21554,"_41":6},[],{"_17":21582,"_31":21583,"_33":21584,"_19":21585,"_36":21586,"_45":1130,"_47":21590},"slu.equilibration.undoEquilibrationScaling","slu.equilibration.undoEquilibrationScaling(x, columnScale)","Undo equilibration scaling on the solution vector.\r","Undo equilibration scaling on the solution vector.\r\n\r\nAfter solving the scaled system R*A*C * y = R*b, the original solution\r\nis recovered as x = C * y.",[21587,21589],{"_17":405,"_19":21588,"_41":6},"- Solution of the scaled system",{"_17":21556,"_19":21557,"_41":6},[],{"_17":21592,"_31":21593,"_33":21594,"_19":21595,"_36":21596,"_45":21600,"_47":21601},"slu.factorization.sparseILU","slu.factorization.sparseILU(A, options?)","Compute an Incomplete LU (ILU) factorization.\r","Compute an Incomplete LU (ILU) factorization.\r\n\r\nILU factorization produces approximate L and U factors by dropping\r\nelements during factorization. The resulting factors are sparser\r\nand cheaper to apply, making them useful as preconditioners for\r\niterative solvers like GMRES, BiCGSTAB, etc.\r\n\r\nThe factorization satisfies: Pr * A * Pc ≈ L * U",[21597,21598],{"_17":1163,"_19":21033,"_41":6},{"_17":454,"_19":21599,"_41":10},"- ILU factorization options","ILUFactorization",[],{"_17":21603,"_31":21604,"_33":21605,"_19":21606,"_36":21607,"_45":21610,"_47":21611},"slu.factorization.sparseLU","slu.factorization.sparseLU(A, options?)","Compute the LU factorization of a sparse matrix.\r","Compute the LU factorization of a sparse matrix.\r\n\r\nComputes the factorization Pr * A * Pc = L * U where:\r\n- L is unit lower triangular (stored in SuperLU's supernode format)\r\n- U is upper triangular (stored in compressed column format)\r\n- Pr is the row permutation matrix\r\n- Pc is the column permutation matrix\r\n\r\nThe factorization can be reused to solve multiple systems with the\r\nsame matrix but different right-hand sides.",[21608,21609],{"_17":1163,"_19":21033,"_41":6},{"_17":454,"_19":8273,"_41":10},"LUFactorization",[],{"_17":21613,"_31":21614,"_33":21615,"_19":21615,"_36":21616,"_45":21558,"_47":21620},"slu.matrix.cooToCSC","slu.matrix.cooToCSC(coo)","Convert COO format to CSC format.",[21617],{"_17":21618,"_19":21619,"_41":6},"coo","- COO sparse matrix",[],{"_17":21622,"_31":21623,"_33":21624,"_19":21624,"_36":21625,"_45":21627,"_47":21628},"slu.matrix.cooToCSR","slu.matrix.cooToCSR(coo)","Convert COO format to CSR format.",[21626],{"_17":21618,"_19":21619,"_41":6},"SparseMatrixCSR",[],{"_17":21630,"_31":21631,"_33":21632,"_19":21633,"_36":21634,"_45":1140,"_47":21641},"slu.matrix.createDenseMatrix","slu.matrix.createDenseMatrix(data, m, n, rowMajor?)","Create a dense matrix.\r","Create a dense matrix.\r\n\r\nDense matrices store all elements, including zeros. The data is stored\r\nin column-major order by default (Fortran-style), which is efficient\r\nfor most linear algebra operations.",[21635,21637,21638,21639],{"_17":1215,"_19":21636,"_41":6},"- Matrix data",{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":19610,"_19":21640,"_41":10},"- If true, data is in row-major order (default: false)",[],{"_17":21643,"_31":21644,"_33":21645,"_19":21646,"_36":21647,"_45":21658,"_47":21659},"slu.matrix.createSparseCOO","slu.matrix.createSparseCOO(m, n, rows, cols, values, dtype?)","Create a sparse matrix in Coordinate (COO) format.\r","Create a sparse matrix in Coordinate (COO) format.\r\n\r\nCOO format (also called triplet format) stores each nonzero as a\r\n(row, column, value) triplet. This format is convenient for\r\nconstructing matrices incrementally but less efficient for arithmetic.",[21648,21649,21650,21652,21654,21656],{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":2401,"_19":21651,"_41":6},"- Row indices for each nonzero",{"_17":2391,"_19":21653,"_41":6},"- Column indices for each nonzero",{"_17":560,"_19":21655,"_41":6},"- Nonzero values",{"_17":9115,"_19":21657,"_41":10},"- Data type (default: 'float64')","SparseMatrixCOO",[],{"_17":21661,"_31":21662,"_33":21663,"_19":21664,"_36":21665,"_45":21558,"_47":21675},"slu.matrix.createSparseCSC","slu.matrix.createSparseCSC(m, n, rowIndices, colPointers, values, dtype?)","Create a sparse matrix in Compressed Sparse Column (CSC) format.\r","Create a sparse matrix in Compressed Sparse Column (CSC) format.\r\n\r\nCSC format stores the matrix column by column:\r\n- `colPointers[j]` to `colPointers[j+1]-1` are indices into values/rowIndices for column j\r\n- `rowIndices[k]` is the row of the k-th nonzero\r\n- `values[k]` is the value of the k-th nonzero",[21666,21667,21668,21670,21673,21674],{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":17737,"_19":21669,"_41":6},"- Row index for each nonzero",{"_17":21671,"_19":21672,"_41":6},"colPointers","- Column pointers (length n+1)",{"_17":560,"_19":21655,"_41":6},{"_17":9115,"_19":21657,"_41":10},[],{"_17":21677,"_31":21678,"_33":21679,"_19":21680,"_36":21681,"_45":21627,"_47":21691},"slu.matrix.createSparseCSR","slu.matrix.createSparseCSR(m, n, colIndices, rowPointers, values, dtype?)","Create a sparse matrix in Compressed Sparse Row (CSR) format.\r","Create a sparse matrix in Compressed Sparse Row (CSR) format.\r\n\r\nCSR format stores the matrix row by row:\r\n- `rowPointers[i]` to `rowPointers[i+1]-1` are indices into values/colIndices for row i\r\n- `colIndices[k]` is the column of the k-th nonzero\r\n- `values[k]` is the value of the k-th nonzero",[21682,21683,21684,21686,21689,21690],{"_17":630,"_19":652,"_41":6},{"_17":1206,"_19":1189,"_41":6},{"_17":17740,"_19":21685,"_41":6},"- Column index for each nonzero",{"_17":21687,"_19":21688,"_41":6},"rowPointers","- Row pointers (length m+1)",{"_17":560,"_19":21655,"_41":6},{"_17":9115,"_19":21657,"_41":10},[],{"_17":21693,"_31":21694,"_33":21695,"_19":21695,"_36":21696,"_45":21558,"_47":21700},"slu.matrix.createSparseDiagonal","slu.matrix.createSparseDiagonal(diag, dtype?)","Create a sparse diagonal matrix in CSC format.",[21697,21699],{"_17":3985,"_19":21698,"_41":6},"- Diagonal elements",{"_17":9115,"_19":21657,"_41":10},[],{"_17":21702,"_31":21703,"_33":21704,"_19":21704,"_36":21705,"_45":21558,"_47":21709},"slu.matrix.createSparseIdentity","slu.matrix.createSparseIdentity(n, dtype?)","Create a sparse identity matrix in CSC format.",[21706,21708],{"_17":1206,"_19":21707,"_41":6},"- Size of the identity matrix",{"_17":9115,"_19":21657,"_41":10},[],{"_17":21711,"_31":21712,"_33":21713,"_19":21713,"_36":21714,"_45":21627,"_47":21716},"slu.matrix.convertCSCtoCSR","slu.matrix.convertCSCtoCSR(A)","Convert a CSC matrix to CSR format.",[21715],{"_17":1163,"_19":21033,"_41":6},[],{"_17":21718,"_31":21719,"_33":21720,"_19":21721,"_36":21722,"_45":21558,"_47":21725},"slu.matrix.convertCSRtoCSC","slu.matrix.convertCSRtoCSC(A)","Convert a CSR matrix to CSC format.\r","Convert a CSR matrix to CSC format.\r\n\r\nCSR (Compressed Sparse Row) stores the matrix row by row, while\r\nCSC (Compressed Sparse Column) stores it column by column. CSC is\r\nSuperLU's native format, so this conversion is useful for preparing\r\nmatrices for solving.",[21723],{"_17":1163,"_19":21724,"_41":6},"- Sparse matrix in CSR format",[],{"_17":21727,"_31":21728,"_33":21729,"_19":21729,"_36":21730,"_45":239,"_47":21738},"slu.matrix.denseToSparse","slu.matrix.denseToSparse(dense, format?, tolerance?)","Convert a dense matrix to sparse format.",[21731,21734,21736],{"_17":21732,"_19":21733,"_41":6},"dense","- Dense matrix",{"_17":4865,"_19":21735,"_41":10},"- Output format ('csc' or 'csr')",{"_17":17888,"_19":21737,"_41":10},"- Values with |v| < tolerance are treated as zero",[],{"_17":21740,"_31":21741,"_33":21742,"_19":21743,"_36":21744,"_45":21558,"_47":21748},"slu.matrix.denseToSparseCSC","slu.matrix.denseToSparseCSC(dense, tolerance?)","Convert a dense matrix to sparse CSC format.\r","Convert a dense matrix to sparse CSC format.\r\n\r\nElements with absolute value below the tolerance are treated as zero.",[21745,21746],{"_17":21732,"_19":21733,"_41":6},{"_17":17888,"_19":21747,"_41":10},"- Values with |v| < tolerance are treated as zero (default: 0)",[],{"_17":21750,"_31":21751,"_33":21752,"_19":21752,"_36":21753,"_45":21627,"_47":21756},"slu.matrix.denseToSparseCSR","slu.matrix.denseToSparseCSR(dense, tolerance?)","Convert a dense matrix to sparse CSR format.",[21754,21755],{"_17":21732,"_19":21733,"_41":6},{"_17":17888,"_19":21747,"_41":10},[],{"_17":21758,"_31":21759,"_33":21760,"_19":21761,"_36":21762,"_45":21558,"_47":21764},"slu.matrix.getTransposeCSC","slu.matrix.getTransposeCSC(A)","Compute the transpose of a CSC matrix.\r","Compute the transpose of a CSC matrix.\r\n\r\nThe transpose of a CSC matrix is efficiently computed by interpreting\r\nthe CSC structure as CSR and then converting. This is more efficient\r\nthan explicitly transposing each element.",[21763],{"_17":1163,"_19":21033,"_41":6},[],{"_17":21766,"_31":21767,"_33":21768,"_19":21768,"_36":21769,"_45":21627,"_47":21771},"slu.matrix.getTransposeCSR","slu.matrix.getTransposeCSR(A)","Compute the transpose of a CSR matrix.",[21770],{"_17":1163,"_19":21724,"_41":6},[],{"_17":21773,"_31":21774,"_33":21775,"_19":21776,"_36":21777,"_45":1140,"_47":21782},"slu.matrix.sparseToDense","slu.matrix.sparseToDense(matrix, rowMajor?)","Convert a sparse matrix to a dense array.\r","Convert a sparse matrix to a dense array.\r\n\r\nWarning: This can consume a lot of memory for large matrices.\r\nUse only when the matrix is small enough to fit in memory as dense.",[21778,21780],{"_17":19605,"_19":21779,"_41":6},"- Sparse matrix in any format",{"_17":19610,"_19":21781,"_41":10},"- If true, return row-major array (default: false, column-major)",[],{"_17":21784,"_31":21785,"_33":21786,"_19":21786,"_36":21787,"_45":21658,"_47":21790},"slu.matrix.toCOO","slu.matrix.toCOO(matrix)","Convert any sparse matrix format to COO (coordinate) format.",[21788],{"_17":19605,"_19":21789,"_41":6},"- Sparse matrix in any supported format",[],{"_17":21792,"_31":21793,"_33":21794,"_19":21795,"_36":21796,"_45":21558,"_47":21798},"slu.matrix.toCSC","slu.matrix.toCSC(matrix)","Convert any sparse matrix format to CSC format.\r","Convert any sparse matrix format to CSC format.\r\n\r\nIf the matrix is already in CSC format, returns a copy.",[21797],{"_17":19605,"_19":21789,"_41":6},[],{"_17":21800,"_31":21801,"_33":21802,"_19":21803,"_36":21804,"_45":21627,"_47":21806},"slu.matrix.toCSR","slu.matrix.toCSR(matrix)","Convert any sparse matrix format to CSR format.\r","Convert any sparse matrix format to CSR format.\r\n\r\nIf the matrix is already in CSR format, returns a copy.",[21805],{"_17":19605,"_19":21789,"_41":6},[],{"_17":21808,"_31":21809,"_33":21810,"_19":21810,"_36":21811,"_45":239,"_47":21814},"slu.matrix.copySparseMatrix","slu.matrix.copySparseMatrix(A)","Create a deep copy of a sparse matrix.",[21812],{"_17":1163,"_19":21813,"_41":6},"- Sparse matrix to copy",[],{"_17":21816,"_31":21817,"_33":21818,"_19":21818,"_36":21819,"_45":1130,"_47":21821},"slu.matrix.getDiagonal","slu.matrix.getDiagonal(A)","Get the diagonal elements of a sparse matrix.",[21820],{"_17":1163,"_19":8319,"_41":6},[],{"_17":21823,"_31":21824,"_33":21825,"_19":21825,"_36":21826,"_45":21831,"_47":21832},"slu.matrix.getMatrixNonzeros","slu.matrix.getMatrixNonzeros(A, maxEntries?)","Get information about the nonzero elements of a matrix.",[21827,21828],{"_17":1163,"_19":8319,"_41":6},{"_17":21829,"_19":21830,"_41":10},"maxEntries","- Maximum number of entries to list (default: all)","NonzeroInfo",[],{"_17":21834,"_31":21835,"_33":21836,"_19":21836,"_36":21837,"_45":21839,"_47":21840},"slu.matrix.getMatrixStatistics","slu.matrix.getMatrixStatistics(A)","Compute statistics about a sparse matrix.",[21838],{"_17":1163,"_19":8319,"_41":6},"MatrixStatistics",[],{"_17":21842,"_31":21843,"_33":21844,"_19":21845,"_36":21846,"_45":21848,"_47":21849},"slu.matrix.getSparsityPattern","slu.matrix.getSparsityPattern(A)","Extract the sparsity pattern (nonzero locations) of a matrix.\r","Extract the sparsity pattern (nonzero locations) of a matrix.\r\n\r\nReturns the row and column indices of all nonzeros, which can be\r\nused for visualization (e.g., spy plots).",[21847],{"_17":1163,"_19":8319,"_41":6},"SparsityPattern",[],{"_17":21851,"_31":21852,"_33":21853,"_19":21854,"_36":21855,"_45":21859,"_47":21860},"slu.matrix.getSupernodeStructure","slu.matrix.getSupernodeStructure(A, perm?)","Analyze supernode structure of a matrix.\r","Analyze supernode structure of a matrix.\r\n\r\nSupernodes are groups of consecutive columns that have the same\r\nnonzero pattern below the diagonal. They enable efficient use of\r\nBLAS-3 operations during factorization.\r\n\r\nThis is a simplified analysis based on column structure similarity.",[21856,21857],{"_17":1163,"_19":21033,"_41":6},{"_17":21114,"_19":21858,"_41":10},"- Column permutation (optional)","SupernodeStructure",[],{"_17":21862,"_31":21863,"_33":21864,"_19":21865,"_36":21866,"_45":46,"_47":21870},"slu.matrix.scaleMatrixCols","slu.matrix.scaleMatrixCols(A, scale)","Scale the columns of a sparse matrix in-place.\r","Scale the columns of a sparse matrix in-place.\r\n\r\nComputes A = A * diag(scale)",[21867,21869],{"_17":1163,"_19":21868,"_41":6},"- Sparse matrix (modified in-place)",{"_17":3661,"_19":21557,"_41":6},[],{"_17":21872,"_31":21873,"_33":21874,"_19":21875,"_36":21876,"_45":46,"_47":21879},"slu.matrix.scaleMatrixRows","slu.matrix.scaleMatrixRows(A, scale)","Scale the rows of a sparse matrix in-place.\r","Scale the rows of a sparse matrix in-place.\r\n\r\nComputes A = diag(scale) * A",[21877,21878],{"_17":1163,"_19":21868,"_41":6},{"_17":3661,"_19":21554,"_41":6},[],{"_17":21881,"_31":21882,"_33":21883,"_19":21884,"_36":21885,"_45":21891,"_47":21892},"slu.matrix.checkFactorization","slu.matrix.checkFactorization(_A, _lu, _tolerance?)","Verify that a factorization satisfies PAQ ≈ LU.\r","Verify that a factorization satisfies PAQ ≈ LU.\r\n\r\nComputes ||PAQ - LU|| and checks if it's small relative to ||A||.\r\n\r\nNote: This is an expensive operation that reconstructs the full\r\nfactored matrix. Use only for verification purposes.",[21886,21887,21889],{"_17":17536,"_19":21558,"_41":6},{"_17":21888,"_19":21610,"_41":6},"_lu",{"_17":21890,"_19":1387,"_41":10},"_tolerance","FactorizationCheckResult",[],{"_17":21894,"_31":21895,"_33":21896,"_19":21896,"_36":21897,"_45":21901,"_47":21902},"slu.matrix.detectMatrixProperties","slu.matrix.detectMatrixProperties(A, tolerance?)","Detect various properties of a sparse matrix.",[21898,21899],{"_17":1163,"_19":8319,"_41":6},{"_17":17888,"_19":21900,"_41":10},"- Tolerance for numerical comparisons (default: 1e-14)","MatrixProperties",[],{"_17":21904,"_31":21905,"_33":21906,"_19":21907,"_36":21908,"_45":2598,"_47":21912},"slu.matrix.isHermitianSparse","slu.matrix.isHermitianSparse(A, tolerance?)","Check if a sparse matrix is Hermitian (A = A^H) within tolerance.\r","Check if a sparse matrix is Hermitian (A = A^H) within tolerance.\r\n\r\nFor real matrices, this is equivalent to checking symmetry.\r\nFor complex matrices, checks A[i,j] = conj(A[j,i]).\r\n\r\nNote: This implementation only handles real matrices (same as symmetric).",[21909,21910],{"_17":1163,"_19":8319,"_41":6},{"_17":17888,"_19":21911,"_41":10},"- Tolerance for value comparison (default: 1e-14)",[],{"_17":21914,"_31":21915,"_33":21916,"_19":21917,"_36":21918,"_45":2598,"_47":21920},"slu.matrix.isPositiveDefiniteSparse","slu.matrix.isPositiveDefiniteSparse(A)","Check if a sparse matrix appears to be positive definite.\r","Check if a sparse matrix appears to be positive definite.\r\n\r\nThis performs heuristic checks:\r\n- Matrix must be symmetric\r\n- All diagonal elements must be positive\r\n- Diagonal dominance check (sufficient but not necessary)\r\n\r\nNote: This does not guarantee positive definiteness. For a definitive\r\ncheck, attempt Cholesky factorization.",[21919],{"_17":1163,"_19":8319,"_41":6},[],{"_17":21922,"_31":21923,"_33":21924,"_19":21925,"_36":21926,"_45":2598,"_47":21929},"slu.matrix.isSymmetricSparse","slu.matrix.isSymmetricSparse(A, tolerance?)","Check if a sparse matrix is symmetric (A = A^T) within tolerance.\r","Check if a sparse matrix is symmetric (A = A^T) within tolerance.\r\n\r\nFor a matrix to be symmetric:\r\n- It must be square\r\n- A[i,j] = A[j,i] for all i,j",[21927,21928],{"_17":1163,"_19":8319,"_41":6},{"_17":17888,"_19":21911,"_41":10},[],{"_17":21931,"_31":21932,"_33":21933,"_19":21934,"_36":21935,"_45":21938,"_47":21939},"slu.matrix.validateSparseMatrix","slu.matrix.validateSparseMatrix(A)","Validate a sparse matrix for format consistency.\r","Validate a sparse matrix for format consistency.\r\n\r\nChecks for:\r\n- Correct array lengths\r\n- Valid index ranges\r\n- Sorted indices within rows/columns\r\n- No duplicate entries\r\n- Consistent data types",[21936],{"_17":1163,"_19":21937,"_41":6},"- Sparse matrix to validate","ValidationResult",[],{"_17":21941,"_31":21942,"_33":21943,"_19":21944,"_36":21945,"_45":21950,"_47":21951},"slu.permutation.computeColumnPermutation","slu.permutation.computeColumnPermutation(A, strategy?)","Compute a column permutation for fill-in reduction.\r","Compute a column permutation for fill-in reduction.\r\n\r\nColumn permutations reorder the columns of the matrix to reduce fill-in\r\nduring LU factorization. Different strategies trade off between computation\r\ntime and fill-in reduction quality:\r\n\r\n- **natural**: No reordering (identity permutation)\r\n- **mmd_ata**: Minimum degree on A^T * A\r\n- **mmd_at_plus_a**: Minimum degree on A^T + A\r\n- **colamd**: Column approximate minimum degree (recommended for most cases)\r\n- **metis**: METIS nested dissection (best for very large matrices)",[21946,21947],{"_17":1163,"_19":21033,"_41":6},{"_17":21948,"_19":21949,"_41":10},"strategy","- Permutation strategy","ColumnPermutationResult",[],{"_17":21953,"_31":21954,"_33":21955,"_19":21956,"_36":21957,"_45":21960,"_47":21961},"slu.permutation.computeRowPermutation","slu.permutation.computeRowPermutation(A, strategy?)","Compute a row permutation for numerical stability.\r","Compute a row permutation for numerical stability.\r\n\r\nRow permutations reorder the rows to improve numerical stability during\r\nLU factorization by placing large elements on the diagonal:\r\n\r\n- **none**: No row permutation (identity)\r\n- **large_diag_mc64**: MC64 algorithm for large diagonal (recommended)\r\n- **large_diag_awpm**: Approximate weight perfect matching\r\n\r\nNote: Row permutation is typically computed during factorization.\r\nThis function provides a way to compute it separately.",[21958,21959],{"_17":1163,"_19":21033,"_41":6},{"_17":21948,"_19":21949,"_41":10},"RowPermutationResult",[],{"_17":21963,"_31":21964,"_33":21965,"_19":21966,"_36":21967,"_45":422,"_47":21970},"slu.permutation.invertPermutation","slu.permutation.invertPermutation(perm)","Compute the inverse of a permutation.\r","Compute the inverse of a permutation.\r\n\r\nGiven a permutation P where P[i] = j means element i maps to position j,\r\ncomputes the inverse permutation P^{-1} where P^{-1}[j] = i.",[21968],{"_17":21114,"_19":21969,"_41":6},"- Permutation array",[],{"_17":21972,"_31":21973,"_33":21974,"_19":21975,"_36":21976,"_45":21558,"_47":21984},"slu.permutation.permuteSparseMatrix","slu.permutation.permuteSparseMatrix(A, rowPerm, colPerm)","Apply row and column permutations to a sparse matrix.\r","Apply row and column permutations to a sparse matrix.\r\n\r\nComputes P * A * Q where P is the row permutation matrix and Q is the\r\ncolumn permutation matrix. The result is a new sparse matrix with\r\nreordered rows and columns.",[21977,21978,21981],{"_17":1163,"_19":21033,"_41":6},{"_17":21979,"_19":21980,"_41":6},"rowPerm","- Row permutation (or null for identity)",{"_17":21982,"_19":21983,"_41":6},"colPerm","- Column permutation (or null for identity)",[],{"_17":21986,"_31":21987,"_33":21988,"_19":21989,"_36":21990,"_45":1130,"_47":21993},"slu.permutation.permuteVector","slu.permutation.permuteVector(x, perm)","Apply a permutation to a vector.\r","Apply a permutation to a vector.\r\n\r\nComputes y = P * x where P is a permutation matrix.\r\ny[perm[i]] = x[i] for all i.",[21991,21992],{"_17":405,"_19":19328,"_41":6},{"_17":21114,"_19":21969,"_41":6},[],{"_17":21995,"_31":21996,"_33":21997,"_19":21998,"_36":21999,"_45":1130,"_47":22002},"slu.permutation.permuteVectorInverse","slu.permutation.permuteVectorInverse(x, perm)","Apply inverse permutation to a vector.\r","Apply inverse permutation to a vector.\r\n\r\nComputes y = P^{-1} * x where P is a permutation matrix.\r\ny[i] = x[perm[i]] for all i.",[22000,22001],{"_17":405,"_19":19328,"_41":6},{"_17":21114,"_19":21969,"_41":6},[],{"_17":22004,"_31":22005,"_33":22006,"_19":22007,"_36":22008,"_45":22016,"_47":22017},"slu.solvers.solveMultipleRHS","slu.solvers.solveMultipleRHS(A, B, nrhs, options?)","Solve a sparse linear system AX = B with multiple right-hand sides.\r","Solve a sparse linear system AX = B with multiple right-hand sides.\r\n\r\nThis function efficiently solves for multiple right-hand sides at once,\r\nwhich is more efficient than calling solveSparseCSC multiple times when\r\nthe matrix A is the same for all systems.",[22009,22010,22012,22015],{"_17":1163,"_19":21033,"_41":6},{"_17":1166,"_19":22011,"_41":6},"- Right-hand side matrix (column-major, m x nrhs)",{"_17":22013,"_19":22014,"_41":6},"nrhs","- Number of right-hand sides (columns in B)",{"_17":454,"_19":8285,"_41":10},"BatchSolveResult",[],{"_17":22019,"_31":22020,"_33":22021,"_19":22022,"_36":22023,"_45":22028,"_47":22029},"slu.solvers.solveReusedFactorization","slu.solvers.solveReusedFactorization(lu, b, options?)","Solve a sparse linear system using a pre-computed LU factorization.\r","Solve a sparse linear system using a pre-computed LU factorization.\r\n\r\nThis function is useful when you need to solve multiple systems with the\r\nsame matrix A but different right-hand sides. By reusing the factorization,\r\nyou avoid the expensive factorization step for subsequent solves.",[22024,22026,22027],{"_17":5115,"_19":22025,"_41":6},"- Pre-computed LU factorization from sparseLU()",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":20013,"_41":10},"ReusedFactorizationResult",[],{"_17":22031,"_31":22032,"_33":22033,"_19":22034,"_36":22035,"_45":22042,"_47":22043},"slu.solvers.solveWithDeflation","slu.solvers.solveWithDeflation(A, b, deflationVectors, options?)","Solve a sparse linear system using deflation.\r","Solve a sparse linear system using deflation.\r\n\r\nDeflation is a technique that projects out certain directions (typically\r\neigenvectors or approximate solutions) to improve the conditioning of\r\nthe system. This can be beneficial when:\r\n- The matrix has a few very small eigenvalues\r\n- You have approximate null space vectors\r\n- You want to accelerate convergence near singular systems\r\n\r\nThe deflation vectors W define a subspace. The solver computes:\r\n1. The coarse grid correction: W * (W^T A W)^(-1) * W^T * b\r\n2. The orthogonal complement solution\r\n3. Combines them for the full solution",[22036,22037,22038,22041],{"_17":1163,"_19":21033,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":22039,"_19":22040,"_41":6},"deflationVectors","- Array of deflation vectors (columns of W)",{"_17":454,"_19":8285,"_41":10},"DeflationResult",[],{"_17":22045,"_31":22046,"_33":22047,"_19":22048,"_36":22049,"_45":20515,"_47":22055},"slu.solvers.solveSparseConjugateTranspose","slu.solvers.solveSparseConjugateTranspose(A, b, options?)","Solve A^H x = b (conjugate transpose) where A is complex.\r","Solve A^H x = b (conjugate transpose) where A is complex.\r\n\r\nSolves the system with the Hermitian (conjugate) transpose of A.\r\nOnly meaningful for complex matrices; for real matrices, this is\r\nequivalent to `solveSparseTranspose`.",[22050,22052,22054],{"_17":1163,"_19":22051,"_41":6},"- Sparse complex matrix in CSC format",{"_17":408,"_19":22053,"_41":6},"- Right-hand side vector (complex, interleaved)",{"_17":454,"_19":8285,"_41":10},[],{"_17":22057,"_31":22058,"_33":22059,"_19":22060,"_36":22061,"_45":20515,"_47":22065},"slu.solvers.solveSparseCSC","slu.solvers.solveSparseCSC(A, b, options?)","Solve a sparse linear system Ax = b where A is in CSC format.\r","Solve a sparse linear system Ax = b where A is in CSC format.\r\n\r\nUses SuperLU's simple driver (dgssv/sgssv) which performs:\r\n1. Column permutation for fill reduction\r\n2. Row permutation for numerical stability\r\n3. LU factorization: Pr * A * Pc = L * U\r\n4. Triangular solves to compute x",[22062,22063,22064],{"_17":1163,"_19":21033,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":22067,"_31":22068,"_33":22069,"_19":22070,"_36":22071,"_45":20515,"_47":22075},"slu.solvers.solveSparseCSR","slu.solvers.solveSparseCSR(A, b, options?)","Solve a sparse linear system Ax = b where A is in CSR format.\r","Solve a sparse linear system Ax = b where A is in CSR format.\r\n\r\nThe CSR matrix is internally converted to CSC format (which is\r\nSuperLU's native format) before solving. For best performance\r\nwith repeated solves, consider pre-converting to CSC.",[22072,22073,22074],{"_17":1163,"_19":21724,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":22077,"_31":22078,"_33":22079,"_19":22080,"_36":22081,"_45":20515,"_47":22085},"slu.solvers.solveSparseTranspose","slu.solvers.solveSparseTranspose(A, b, options?)","Solve A^T x = b (transpose system) where A is in CSC format.\r","Solve A^T x = b (transpose system) where A is in CSC format.\r\n\r\nSolves the system with the transpose of A. Useful when you have\r\nA but need to solve with its transpose without explicitly computing it.",[22082,22083,22084],{"_17":1163,"_19":21033,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":22087,"_31":22088,"_33":22089,"_19":22090,"_36":22091,"_45":20515,"_47":22096},"slu.solvers.solveSparseExpert","slu.solvers.solveSparseExpert(A, b, options?)","Expert sparse solver with full control over all SuperLU options.\r","Expert sparse solver with full control over all SuperLU options.\r\n\r\nThis is the most flexible solver interface, providing access to:\r\n- Equilibration (row/column scaling) for numerical stability\r\n- Condition number estimation\r\n- Iterative refinement for improved accuracy\r\n- Forward and backward error bounds\r\n- Reuse of factorization for multiple right-hand sides",[22092,22093,22094],{"_17":1163,"_19":21033,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":22095,"_41":10},"- Expert solver options",[],{"_17":22098,"_31":22099,"_33":22100,"_19":22101,"_36":22102,"_45":17633,"_47":22108},"slu.solvers.solveLeastSquaresSparse","slu.solvers.solveLeastSquaresSparse(A, b, options?)","Solve a sparse least squares problem min ||Ax - b||_2.\r","Solve a sparse least squares problem min ||Ax - b||_2.\r\n\r\nFor overdetermined systems (m > n), this finds the solution x that\r\nminimizes the 2-norm of the residual. The solver uses the normal\r\nequations approach: A^T A x = A^T b.\r\n\r\nFor square or underdetermined systems, consider using solveSparseCSC\r\ndirectly instead.",[22103,22105,22107],{"_17":1163,"_19":22104,"_41":6},"- Sparse matrix in CSC format (m x n, m >= n)",{"_17":408,"_19":22106,"_41":6},"- Right-hand side vector (length m)",{"_17":454,"_19":8285,"_41":10},[],{"_17":22110,"_31":22111,"_33":22112,"_19":22113,"_36":22114,"_45":22121,"_47":22122},"slu.solvers.solveWithIterativeRefinement","slu.solvers.solveWithIterativeRefinement(A, lu, b, x, options?)","Solve a sparse linear system with iterative refinement.\r","Solve a sparse linear system with iterative refinement.\r\n\r\nThis is a convenience function that combines triangular solve with\r\niterative refinement. It takes pre-computed L, U factors and permutations,\r\ncomputes an initial solution, and refines it.\r\n\r\nThis function is useful when you have already factored the matrix and\r\nwant to solve with high accuracy.",[22115,22116,22117,22118,22120],{"_17":1163,"_19":21060,"_41":6},{"_17":5115,"_19":21062,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":405,"_19":22119,"_41":6},"- Initial solution (from a previous solve)",{"_17":454,"_19":21067,"_41":10},"RefinedSolveResult",[],{"_17":22124,"_31":22125,"_33":22126,"_19":22127,"_36":22128,"_45":22133,"_47":22134},"slu.solvers.solveShiftedSystem","slu.solvers.solveShiftedSystem(A, shift, b, options?)","Solve a shifted linear system (A - σI)x = b.\r","Solve a shifted linear system (A - σI)x = b.\r\n\r\nThis is commonly used in shift-invert eigenvalue methods where we need\r\nto solve (A - σI)x = b for various right-hand sides b. The shift σ is\r\nchosen close to a target eigenvalue.\r\n\r\nFor efficiency when solving multiple systems with the same shift,\r\nyou can save and reuse the factorization.",[22129,22130,22131,22132],{"_17":1163,"_19":21033,"_41":6},{"_17":13766,"_19":19416,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},"ShiftedSolveResult",[],{"_17":22136,"_31":22137,"_33":22138,"_19":22139,"_36":22140,"_45":20515,"_47":22146},"slu.solvers.solveHermitianSparse","slu.solvers.solveHermitianSparse(A, b, options?)","Solve a Hermitian sparse linear system Ax = b.\r","Solve a Hermitian sparse linear system Ax = b.\r\n\r\nThis solver is for complex Hermitian matrices where A = A^H (conjugate\r\ntranspose). Currently, this is implemented as a wrapper around the\r\nsymmetric solver since SuperLU's complex support handles conjugation.\r\n\r\nNote: For real matrices, this is equivalent to solveSymmetricSparse.",[22141,22143,22145],{"_17":1163,"_19":22142,"_41":6},"- Hermitian sparse matrix in CSC format",{"_17":408,"_19":22144,"_41":6},"- Right-hand side vector (complex, interleaved format)",{"_17":454,"_19":8285,"_41":10},[],{"_17":22148,"_31":22149,"_33":22150,"_19":22151,"_36":22152,"_45":20515,"_47":22157},"slu.solvers.solveSymmetricSparse","slu.solvers.solveSymmetricSparse(A, b, options?)","Solve a symmetric sparse linear system Ax = b.\r","Solve a symmetric sparse linear system Ax = b.\r\n\r\nThis solver is optimized for symmetric matrices where only one triangle\r\n(lower or upper) is stored. The solver automatically symmetrizes the\r\nmatrix before solving.\r\n\r\nFor general symmetric matrices, this uses a column permutation strategy\r\noptimized for symmetric structure (MMD on A^T + A).",[22153,22155,22156],{"_17":1163,"_19":22154,"_41":6},"- Symmetric sparse matrix in CSC format (stored as triangle)",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":8285,"_41":10},[],{"_17":22159,"_31":22160,"_33":22161,"_19":22162,"_36":22163,"_45":22169,"_47":22170},"slu.solvers.solveTriangularCSC","slu.solvers.solveTriangularCSC(T, b, options?)","Solve a triangular system Tx = b where T is a sparse triangular CSC matrix.\r","Solve a triangular system Tx = b where T is a sparse triangular CSC matrix.\r\n\r\nThis directly solves with a triangular matrix without computing an\r\nLU factorization. Useful when you already have a triangular matrix\r\n(e.g., from a Cholesky factorization or as part of an iterative solver).",[22164,22166,22167],{"_17":14859,"_19":22165,"_41":6},"- Sparse triangular matrix in CSC format",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":22168,"_41":10},"- Triangular solve options","TriangularSolveResult",[],{"_17":22172,"_31":22173,"_33":22174,"_19":22174,"_36":22175,"_45":22169,"_47":22180},"slu.solvers.solveTriangularCSR","slu.solvers.solveTriangularCSR(T, b, options?)","Solve a triangular system Tx = b where T is a sparse triangular CSR matrix.",[22176,22178,22179],{"_17":14859,"_19":22177,"_41":6},"- Sparse triangular matrix in CSR format",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":22168,"_41":10},[],{"_17":22182,"_31":22183,"_33":22184,"_19":22185,"_36":22186,"_45":22169,"_47":22191},"slu.solvers.solveTriangularLU","slu.solvers.solveTriangularLU(lu, b, options?)","Solve Ax = b using precomputed LU factors.\r","Solve Ax = b using precomputed LU factors.\r\n\r\nGiven LU factors from `sparseLU`, solves the system:\r\nPr * A * Pc = L * U\r\n=> A * x = b\r\n=> Pc^T * U^{-1} * L^{-1} * Pr * b = x\r\n\r\nThis is much faster than `solveSparseCSC` when solving multiple\r\nsystems with the same matrix, as the expensive factorization is reused.",[22187,22189,22190],{"_17":5115,"_19":22188,"_41":6},"- LU factorization from sparseLU",{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":20013,"_41":10},[],{"_17":22193,"_31":22194,"_33":22195,"_19":22196,"_36":22197,"_45":22169,"_47":22201},"slu.solvers.solveTriangularLUConjugateTranspose","slu.solvers.solveTriangularLUConjugateTranspose(lu, b, options?)","Solve A^H x = b using precomputed LU factors (complex matrices).\r","Solve A^H x = b using precomputed LU factors (complex matrices).\r\n\r\nSolves with the Hermitian (conjugate transpose) of A.\r\nFor real matrices, this is equivalent to `solveTriangularLUTranspose`.",[22198,22199,22200],{"_17":5115,"_19":22188,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":20013,"_41":10},[],{"_17":22203,"_31":22204,"_33":22205,"_19":22206,"_36":22207,"_45":22169,"_47":22211},"slu.solvers.solveTriangularLUTranspose","slu.solvers.solveTriangularLUTranspose(lu, b, options?)","Solve A^T x = b using precomputed LU factors.\r","Solve A^T x = b using precomputed LU factors.\r\n\r\nSolves the transposed system without recomputing the factorization.",[22208,22209,22210],{"_17":5115,"_19":22188,"_41":6},{"_17":408,"_19":2031,"_41":6},{"_17":454,"_19":20013,"_41":10},[],{"_17":22213,"_31":22214,"_33":22215,"_19":22216,"_36":22217,"_45":22224,"_47":22225},"slu.testing.createTestMatrix","slu.testing.createTestMatrix(type, n, options?)","Create a standard test matrix.\r","Create a standard test matrix.\r\n\r\nGenerates matrices commonly used for testing and benchmarking\r\nsparse linear solvers. Each matrix type has known properties\r\nthat make it useful for specific tests.\r\n\r\nAvailable matrix types:\r\n- `'tridiagonal'`: Tridiagonal matrix (bandwidth 1)\r\n- `'laplacian_2d'`: 2D Laplacian / 5-point stencil\r\n- `'laplacian_3d'`: 3D Laplacian / 7-point stencil\r\n- `'random'`: Random dense matrix (diagonally dominant)\r\n- `'sparse_random'`: Random sparse matrix\r\n- `'poisson'`: Poisson problem matrix\r\n- `'diagonal'`: Random diagonal matrix\r\n- `'identity'`: Identity matrix\r\n- `'hilbert'`: Hilbert matrix (ill-conditioned)\r\n- `'lehmer'`: Lehmer matrix (positive definite)",[22218,22220,22222],{"_17":2172,"_19":22219,"_41":6},"- Type of test matrix to create",{"_17":1206,"_19":22221,"_41":6},"- Matrix size (n x n)",{"_17":454,"_19":22223,"_41":10},"- Generation options","TestMatrixResult",[],{"_17":22227,"_31":22228,"_33":22229,"_19":22229,"_36":22230,"_45":22231,"_47":22232},"slu.testing.getTestMatrixTypes","slu.testing.getTestMatrixTypes()","Get a list of available test matrix types with descriptions.",[],"{\r\n type: TestMatrixType;\r\n description: string;\r\n}[]",[],{"_17":22234,"_31":22235,"_33":22236,"_19":22236,"_36":22237,"_45":1387,"_47":22239},"slu.getNnz","slu.getNnz(matrix)","Get the number of nonzeros in a sparse matrix.",[22238],{"_17":19605,"_19":239,"_41":6},[],{"_17":22241,"_31":22242,"_33":22243,"_19":22243,"_36":22244,"_45":21241,"_47":22247},"slu.inferDataType","slu.inferDataType(arr)","Infer the data type from an array.",[22245],{"_17":9283,"_19":22246,"_41":6},"RealArray | ComplexArray",[],{"_17":22249,"_31":22250,"_33":22251,"_19":22251,"_36":22252,"_45":22254,"_47":22255},"slu.isSparseMatrixCSC","slu.isSparseMatrixCSC(matrix)","Check if a sparse matrix is in CSC format.",[22253],{"_17":19605,"_19":239,"_41":6},"matrix is SparseMatrixCSC",[],{"_17":22257,"_31":22258,"_33":22259,"_19":22259,"_36":22260,"_45":22262,"_47":22263},"slu.isSparseMatrixCSR","slu.isSparseMatrixCSR(matrix)","Check if a sparse matrix is in CSR format.",[22261],{"_17":19605,"_19":239,"_41":6},"matrix is SparseMatrixCSR",[],{"_15":22265,"_17":22266,"_19":22267,"_21":22,"_23":22268,"_25":22269,"_27":22270},"xsf-generated","Special Functions","Special mathematical functions (Bessel, Gamma, Error functions, etc.).","ƒ","xsf",[22271,22279,22286,22294,22301,22308,22316,22322,22329,22337,22344,22351,22359,22366,22373,22381,22389,22397,22405,22412,22419,22426,22433,22440,22447,22454,22461,22469,22477,22485,22493,22500,22507,22514,22521,22527,22534,22541,22548,22556,22563,22570,22577,22586,22594,22603,22610,22617,22625,22633,22641,22649,22657,22665,22673,22683,22690,22697,22704,22713,22721,22729,22740,22749,22758,22767,22776,22784,22792,22800,22812,22821,22830,22840,22849,22858,22865,22872,22880,22888,22900,22908,22915,22921,22928],{"_17":22272,"_31":22273,"_33":22274,"_19":1136,"_36":22275,"_45":1130,"_47":22278},"xsf.analysisFns.zeta","xsf.analysisFns.zeta(x)","zeta",[22276],{"_17":405,"_19":22277,"_41":6},"ArrayInput",[],{"_17":22280,"_31":22281,"_33":22282,"_19":1136,"_36":22283,"_45":1130,"_47":22285},"xsf.analysisFns.zetac","xsf.analysisFns.zetac(x)","zetac",[22284],{"_17":405,"_19":22277,"_41":6},[],{"_17":22287,"_31":22288,"_33":22289,"_19":1136,"_36":22290,"_45":1130,"_47":22293},"xsf.analysisFns.lambertw","xsf.analysisFns.lambertw(x, k?)","lambertw",[22291,22292],{"_17":405,"_19":22277,"_41":6},{"_17":4686,"_19":1387,"_41":10},[],{"_17":22295,"_31":22296,"_33":22297,"_19":1136,"_36":22298,"_45":1130,"_47":22300},"xsf.besselFns.j0","xsf.besselFns.j0(x)","j0",[22299],{"_17":405,"_19":22277,"_41":6},[],{"_17":22302,"_31":22303,"_33":22304,"_19":1136,"_36":22305,"_45":1130,"_47":22307},"xsf.besselFns.j1","xsf.besselFns.j1(x)","j1",[22306],{"_17":405,"_19":22277,"_41":6},[],{"_17":22309,"_31":22310,"_33":22311,"_19":1136,"_36":22312,"_45":1130,"_47":22315},"xsf.besselFns.jv","xsf.besselFns.jv(v, x)","jv",[22313,22314],{"_17":676,"_19":22277,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22317,"_31":22318,"_33":14938,"_19":1136,"_36":22319,"_45":1130,"_47":22321},"xsf.besselFns.y0","xsf.besselFns.y0(x)",[22320],{"_17":405,"_19":22277,"_41":6},[],{"_17":22323,"_31":22324,"_33":22325,"_19":1136,"_36":22326,"_45":1130,"_47":22328},"xsf.besselFns.y1","xsf.besselFns.y1(x)","y1",[22327],{"_17":405,"_19":22277,"_41":6},[],{"_17":22330,"_31":22331,"_33":22332,"_19":1136,"_36":22333,"_45":1130,"_47":22336},"xsf.besselFns.yv","xsf.besselFns.yv(v, x)","yv",[22334,22335],{"_17":676,"_19":22277,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22338,"_31":22339,"_33":22340,"_19":1136,"_36":22341,"_45":1130,"_47":22343},"xsf.besselFns.i0","xsf.besselFns.i0(x)","i0",[22342],{"_17":405,"_19":22277,"_41":6},[],{"_17":22345,"_31":22346,"_33":22347,"_19":1136,"_36":22348,"_45":1130,"_47":22350},"xsf.besselFns.i1","xsf.besselFns.i1(x)","i1",[22349],{"_17":405,"_19":22277,"_41":6},[],{"_17":22352,"_31":22353,"_33":22354,"_19":1136,"_36":22355,"_45":1130,"_47":22358},"xsf.besselFns.iv","xsf.besselFns.iv(v, x)","iv",[22356,22357],{"_17":676,"_19":22277,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22360,"_31":22361,"_33":22362,"_19":1136,"_36":22363,"_45":1130,"_47":22365},"xsf.besselFns.k0","xsf.besselFns.k0(x)","k0",[22364],{"_17":405,"_19":22277,"_41":6},[],{"_17":22367,"_31":22368,"_33":22369,"_19":1136,"_36":22370,"_45":1130,"_47":22372},"xsf.besselFns.k1","xsf.besselFns.k1(x)","k1",[22371],{"_17":405,"_19":22277,"_41":6},[],{"_17":22374,"_31":22375,"_33":22376,"_19":1136,"_36":22377,"_45":1130,"_47":22380},"xsf.besselFns.sphericalJn","xsf.besselFns.sphericalJn(n, x)","sphericalJn",[22378,22379],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22382,"_31":22383,"_33":22384,"_19":1136,"_36":22385,"_45":1130,"_47":22388},"xsf.besselFns.sphericalYn","xsf.besselFns.sphericalYn(n, x)","sphericalYn",[22386,22387],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22390,"_31":22391,"_33":22392,"_19":1136,"_36":22393,"_45":1130,"_47":22396},"xsf.besselFns.sphericalIn","xsf.besselFns.sphericalIn(n, x)","sphericalIn",[22394,22395],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22398,"_31":22399,"_33":22400,"_19":1136,"_36":22401,"_45":1130,"_47":22404},"xsf.besselFns.sphericalKn","xsf.besselFns.sphericalKn(n, x)","sphericalKn",[22402,22403],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22406,"_31":22407,"_33":22408,"_19":1136,"_36":22409,"_45":1130,"_47":22411},"xsf.besselFns.ber","xsf.besselFns.ber(x)","ber",[22410],{"_17":405,"_19":22277,"_41":6},[],{"_17":22413,"_31":22414,"_33":22415,"_19":1136,"_36":22416,"_45":1130,"_47":22418},"xsf.besselFns.bei","xsf.besselFns.bei(x)","bei",[22417],{"_17":405,"_19":22277,"_41":6},[],{"_17":22420,"_31":22421,"_33":22422,"_19":1136,"_36":22423,"_45":1130,"_47":22425},"xsf.besselFns.ker","xsf.besselFns.ker(x)","ker",[22424],{"_17":405,"_19":22277,"_41":6},[],{"_17":22427,"_31":22428,"_33":22429,"_19":1136,"_36":22430,"_45":1130,"_47":22432},"xsf.besselFns.kei","xsf.besselFns.kei(x)","kei",[22431],{"_17":405,"_19":22277,"_41":6},[],{"_17":22434,"_31":22435,"_33":22436,"_19":1136,"_36":22437,"_45":1130,"_47":22439},"xsf.besselFns.berp","xsf.besselFns.berp(x)","berp",[22438],{"_17":405,"_19":22277,"_41":6},[],{"_17":22441,"_31":22442,"_33":22443,"_19":1136,"_36":22444,"_45":1130,"_47":22446},"xsf.besselFns.beip","xsf.besselFns.beip(x)","beip",[22445],{"_17":405,"_19":22277,"_41":6},[],{"_17":22448,"_31":22449,"_33":22450,"_19":1136,"_36":22451,"_45":1130,"_47":22453},"xsf.besselFns.kerp","xsf.besselFns.kerp(x)","kerp",[22452],{"_17":405,"_19":22277,"_41":6},[],{"_17":22455,"_31":22456,"_33":22457,"_19":1136,"_36":22458,"_45":1130,"_47":22460},"xsf.besselFns.keip","xsf.besselFns.keip(x)","keip",[22459],{"_17":405,"_19":22277,"_41":6},[],{"_17":22462,"_31":22463,"_33":22464,"_19":1136,"_36":22465,"_45":1130,"_47":22468},"xsf.combinatoricsFns.binom","xsf.combinatoricsFns.binom(n, k)","binom",[22466,22467],{"_17":1206,"_19":22277,"_41":6},{"_17":4686,"_19":22277,"_41":6},[],{"_17":22470,"_31":22471,"_33":22472,"_19":1136,"_36":22473,"_45":1130,"_47":22476},"xsf.combinatoricsFns.binomExact","xsf.combinatoricsFns.binomExact(n, k)","binomExact",[22474,22475],{"_17":1206,"_19":22277,"_41":6},{"_17":4686,"_19":22277,"_41":6},[],{"_17":22478,"_31":22479,"_33":22480,"_19":1136,"_36":22481,"_45":1130,"_47":22484},"xsf.combinatoricsFns.poch","xsf.combinatoricsFns.poch(x, m)","poch",[22482,22483],{"_17":405,"_19":22277,"_41":6},{"_17":630,"_19":22277,"_41":6},[],{"_17":22486,"_31":22487,"_33":22488,"_19":1136,"_36":22489,"_45":1130,"_47":22492},"xsf.combinatoricsFns.permExact","xsf.combinatoricsFns.permExact(n, k)","permExact",[22490,22491],{"_17":1206,"_19":22277,"_41":6},{"_17":4686,"_19":22277,"_41":6},[],{"_17":22494,"_31":22495,"_33":22496,"_19":1136,"_36":22497,"_45":1130,"_47":22499},"xsf.errorFns.erf","xsf.errorFns.erf(x)","erf",[22498],{"_17":405,"_19":22277,"_41":6},[],{"_17":22501,"_31":22502,"_33":22503,"_19":1136,"_36":22504,"_45":1130,"_47":22506},"xsf.errorFns.erfc","xsf.errorFns.erfc(x)","erfc",[22505],{"_17":405,"_19":22277,"_41":6},[],{"_17":22508,"_31":22509,"_33":22510,"_19":1136,"_36":22511,"_45":1130,"_47":22513},"xsf.errorFns.erfcx","xsf.errorFns.erfcx(x)","erfcx",[22512],{"_17":405,"_19":22277,"_41":6},[],{"_17":22515,"_31":22516,"_33":22517,"_19":1136,"_36":22518,"_45":1130,"_47":22520},"xsf.errorFns.erfi","xsf.errorFns.erfi(x)","erfi",[22519],{"_17":405,"_19":22277,"_41":6},[],{"_17":22522,"_31":22523,"_33":3444,"_19":1136,"_36":22524,"_45":1130,"_47":22526},"xsf.gammaFns.gamma","xsf.gammaFns.gamma(x)",[22525],{"_17":405,"_19":22277,"_41":6},[],{"_17":22528,"_31":22529,"_33":22530,"_19":1136,"_36":22531,"_45":1130,"_47":22533},"xsf.gammaFns.gammaln","xsf.gammaFns.gammaln(x)","gammaln",[22532],{"_17":405,"_19":22277,"_41":6},[],{"_17":22535,"_31":22536,"_33":22537,"_19":1136,"_36":22538,"_45":1130,"_47":22540},"xsf.gammaFns.rgamma","xsf.gammaFns.rgamma(x)","rgamma",[22539],{"_17":405,"_19":22277,"_41":6},[],{"_17":22542,"_31":22543,"_33":118,"_19":1136,"_36":22544,"_45":1130,"_47":22547},"xsf.gammaFns.beta","xsf.gammaFns.beta(a, b)",[22545,22546],{"_17":664,"_19":22277,"_41":6},{"_17":408,"_19":22277,"_41":6},[],{"_17":22549,"_31":22550,"_33":22551,"_19":1136,"_36":22552,"_45":1130,"_47":22555},"xsf.gammaFns.betaln","xsf.gammaFns.betaln(a, b)","betaln",[22553,22554],{"_17":664,"_19":22277,"_41":6},{"_17":408,"_19":22277,"_41":6},[],{"_17":22557,"_31":22558,"_33":22559,"_19":1136,"_36":22560,"_45":1130,"_47":22562},"xsf.gammaFns.digamma","xsf.gammaFns.digamma(x)","digamma",[22561],{"_17":405,"_19":22277,"_41":6},[],{"_17":22564,"_31":22565,"_33":22566,"_19":1136,"_36":22567,"_45":1130,"_47":22569},"xsf.integralFns.ellipk","xsf.integralFns.ellipk(m)","ellipk",[22568],{"_17":630,"_19":22277,"_41":6},[],{"_17":22571,"_31":22572,"_33":22573,"_19":1136,"_36":22574,"_45":1130,"_47":22576},"xsf.integralFns.ellipe","xsf.integralFns.ellipe(m)","ellipe",[22575],{"_17":630,"_19":22277,"_41":6},[],{"_17":22578,"_31":22579,"_33":22580,"_19":1136,"_36":22581,"_45":1130,"_47":22585},"xsf.integralFns.ellipkinc","xsf.integralFns.ellipkinc(phi, m)","ellipkinc",[22582,22584],{"_17":22583,"_19":22277,"_41":6},"phi",{"_17":630,"_19":22277,"_41":6},[],{"_17":22587,"_31":22588,"_33":22589,"_19":1136,"_36":22590,"_45":1130,"_47":22593},"xsf.integralFns.ellipeinc","xsf.integralFns.ellipeinc(phi, m)","ellipeinc",[22591,22592],{"_17":22583,"_19":22277,"_41":6},{"_17":630,"_19":22277,"_41":6},[],{"_17":22595,"_31":22596,"_33":22597,"_19":1136,"_36":22598,"_45":22601,"_47":22602},"xsf.integralFns.ellipj","xsf.integralFns.ellipj(u, m)","ellipj",[22599,22600],{"_17":6452,"_19":22277,"_41":6},{"_17":630,"_19":22277,"_41":6},"EllipjArrayResult",[],{"_17":22604,"_31":22605,"_33":22606,"_19":1136,"_36":22607,"_45":1130,"_47":22609},"xsf.integralFns.exp1","xsf.integralFns.exp1(x)","exp1",[22608],{"_17":405,"_19":22277,"_41":6},[],{"_17":22611,"_31":22612,"_33":22613,"_19":1136,"_36":22614,"_45":1130,"_47":22616},"xsf.integralFns.expi","xsf.integralFns.expi(x)","expi",[22615],{"_17":405,"_19":22277,"_41":6},[],{"_17":22618,"_31":22619,"_33":22620,"_19":1136,"_36":22621,"_45":22623,"_47":22624},"xsf.integralFns.fresnel","xsf.integralFns.fresnel(x)","fresnel",[22622],{"_17":405,"_19":22277,"_41":6},"FresnelArrayResult",[],{"_17":22626,"_31":22627,"_33":22628,"_19":1136,"_36":22629,"_45":22631,"_47":22632},"xsf.integralFns.sici","xsf.integralFns.sici(x)","sici",[22630],{"_17":405,"_19":22277,"_41":6},"SiCiArrayResult",[],{"_17":22634,"_31":22635,"_33":22636,"_19":1136,"_36":22637,"_45":22639,"_47":22640},"xsf.integralFns.shichi","xsf.integralFns.shichi(x)","shichi",[22638],{"_17":405,"_19":22277,"_41":6},"ShiChiArrayResult",[],{"_17":22642,"_31":22643,"_33":22644,"_19":1136,"_36":22645,"_45":22647,"_47":22648},"xsf.specialFns.airy","xsf.specialFns.airy(x)","airy",[22646],{"_17":405,"_19":22277,"_41":6},"AiryArrayResult",[],{"_17":22650,"_31":22651,"_33":22652,"_19":1136,"_36":22653,"_45":1130,"_47":22656},"xsf.specialFns.struveH","xsf.specialFns.struveH(v, x)","struveH",[22654,22655],{"_17":676,"_19":22277,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22658,"_31":22659,"_33":22660,"_19":1136,"_36":22661,"_45":1130,"_47":22664},"xsf.specialFns.struveL","xsf.specialFns.struveL(v, x)","struveL",[22662,22663],{"_17":676,"_19":22277,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22666,"_31":22667,"_33":22668,"_19":1136,"_36":22669,"_45":1130,"_47":22672},"xsf.specialFns.legendreP","xsf.specialFns.legendreP(n, x)","legendreP",[22670,22671],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22674,"_31":22675,"_33":22676,"_19":1136,"_36":22677,"_45":1130,"_47":22682},"xsf.specialFns.hyp2f1","xsf.specialFns.hyp2f1(a, b, c, x)","hyp2f1",[22678,22679,22680,22681],{"_17":664,"_19":1387,"_41":6},{"_17":408,"_19":1387,"_41":6},{"_17":713,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22684,"_31":22685,"_33":22686,"_19":1136,"_36":22687,"_45":1130,"_47":22689},"xsf.statsFns.ndtr","xsf.statsFns.ndtr(x)","ndtr",[22688],{"_17":405,"_19":22277,"_41":6},[],{"_17":22691,"_31":22692,"_33":22693,"_19":1136,"_36":22694,"_45":1130,"_47":22696},"xsf.statsFns.ndtri","xsf.statsFns.ndtri(p)","ndtri",[22695],{"_17":5212,"_19":22277,"_41":6},[],{"_17":22698,"_31":22699,"_33":22700,"_19":1136,"_36":22701,"_45":1130,"_47":22703},"xsf.statsFns.logNdtr","xsf.statsFns.logNdtr(x)","logNdtr",[22702],{"_17":405,"_19":22277,"_41":6},[],{"_17":22705,"_31":22706,"_33":22707,"_19":1136,"_36":22708,"_45":1130,"_47":22712},"xsf.statsFns.chdtr","xsf.statsFns.chdtr(df, x)","chdtr",[22709,22711],{"_17":22710,"_19":1387,"_41":6},"df",{"_17":405,"_19":22277,"_41":6},[],{"_17":22714,"_31":22715,"_33":22716,"_19":1136,"_36":22717,"_45":1130,"_47":22720},"xsf.statsFns.chdtrc","xsf.statsFns.chdtrc(df, x)","chdtrc",[22718,22719],{"_17":22710,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22722,"_31":22723,"_33":22724,"_19":1136,"_36":22725,"_45":1130,"_47":22728},"xsf.statsFns.chdtri","xsf.statsFns.chdtri(df, p)","chdtri",[22726,22727],{"_17":22710,"_19":1387,"_41":6},{"_17":5212,"_19":22277,"_41":6},[],{"_17":22730,"_31":22731,"_33":22732,"_19":1136,"_36":22733,"_45":1130,"_47":22739},"xsf.statsFns.fdtr","xsf.statsFns.fdtr(dfn, dfd, x)","fdtr",[22734,22736,22738],{"_17":22735,"_19":1387,"_41":6},"dfn",{"_17":22737,"_19":1387,"_41":6},"dfd",{"_17":405,"_19":22277,"_41":6},[],{"_17":22741,"_31":22742,"_33":22743,"_19":1136,"_36":22744,"_45":1130,"_47":22748},"xsf.statsFns.fdtrc","xsf.statsFns.fdtrc(dfn, dfd, x)","fdtrc",[22745,22746,22747],{"_17":22735,"_19":1387,"_41":6},{"_17":22737,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22750,"_31":22751,"_33":22752,"_19":1136,"_36":22753,"_45":1130,"_47":22757},"xsf.statsFns.fdtri","xsf.statsFns.fdtri(dfn, dfd, p)","fdtri",[22754,22755,22756],{"_17":22735,"_19":1387,"_41":6},{"_17":22737,"_19":1387,"_41":6},{"_17":5212,"_19":22277,"_41":6},[],{"_17":22759,"_31":22760,"_33":22761,"_19":1136,"_36":22762,"_45":1130,"_47":22766},"xsf.statsFns.gdtr","xsf.statsFns.gdtr(a, b, x)","gdtr",[22763,22764,22765],{"_17":664,"_19":1387,"_41":6},{"_17":408,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22768,"_31":22769,"_33":22770,"_19":1136,"_36":22771,"_45":1130,"_47":22775},"xsf.statsFns.gdtrc","xsf.statsFns.gdtrc(a, b, x)","gdtrc",[22772,22773,22774],{"_17":664,"_19":1387,"_41":6},{"_17":408,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22777,"_31":22778,"_33":22779,"_19":1136,"_36":22780,"_45":1130,"_47":22783},"xsf.statsFns.pdtr","xsf.statsFns.pdtr(k, m)","pdtr",[22781,22782],{"_17":4686,"_19":22277,"_41":6},{"_17":630,"_19":1387,"_41":6},[],{"_17":22785,"_31":22786,"_33":22787,"_19":1136,"_36":22788,"_45":1130,"_47":22791},"xsf.statsFns.pdtrc","xsf.statsFns.pdtrc(k, m)","pdtrc",[22789,22790],{"_17":4686,"_19":22277,"_41":6},{"_17":630,"_19":1387,"_41":6},[],{"_17":22793,"_31":22794,"_33":22795,"_19":22795,"_36":22796,"_45":1387,"_47":22799},"xsf.statsFns.pdtri","xsf.statsFns.pdtri(k, p)","Poisson distribution inverse CDF.",[22797,22798],{"_17":4686,"_19":1387,"_41":6},{"_17":5212,"_19":1387,"_41":6},[],{"_17":22801,"_31":22802,"_33":22803,"_19":22803,"_36":22804,"_45":1387,"_47":22811},"xsf.statsFns.bdtr","xsf.statsFns.bdtr(k, n, p)","Binomial distribution CDF.",[22805,22807,22809],{"_17":4686,"_19":22806,"_41":6},"- Number of successes",{"_17":1206,"_19":22808,"_41":6},"- Number of trials",{"_17":5212,"_19":22810,"_41":6},"- Probability of success",[],{"_17":22813,"_31":22814,"_33":22815,"_19":22815,"_36":22816,"_45":1387,"_47":22820},"xsf.statsFns.bdtrc","xsf.statsFns.bdtrc(k, n, p)","Binomial distribution survival function.",[22817,22818,22819],{"_17":4686,"_19":1387,"_41":6},{"_17":1206,"_19":1387,"_41":6},{"_17":5212,"_19":1387,"_41":6},[],{"_17":22822,"_31":22823,"_33":22824,"_19":22824,"_36":22825,"_45":1387,"_47":22829},"xsf.statsFns.bdtri","xsf.statsFns.bdtri(k, n, y)","Binomial distribution inverse CDF.",[22826,22827,22828],{"_17":4686,"_19":1387,"_41":6},{"_17":1206,"_19":1387,"_41":6},{"_17":2467,"_19":1387,"_41":6},[],{"_17":22831,"_31":22832,"_33":22833,"_19":22833,"_36":22834,"_45":1387,"_47":22839},"xsf.statsFns.nbdtr","xsf.statsFns.nbdtr(k, n, p)","Negative binomial distribution CDF.",[22835,22837,22838],{"_17":4686,"_19":22836,"_41":6},"- Number of failures",{"_17":1206,"_19":22806,"_41":6},{"_17":5212,"_19":22810,"_41":6},[],{"_17":22841,"_31":22842,"_33":22843,"_19":22843,"_36":22844,"_45":1387,"_47":22848},"xsf.statsFns.nbdtrc","xsf.statsFns.nbdtrc(k, n, p)","Negative binomial distribution survival function.",[22845,22846,22847],{"_17":4686,"_19":1387,"_41":6},{"_17":1206,"_19":1387,"_41":6},{"_17":5212,"_19":1387,"_41":6},[],{"_17":22850,"_31":22851,"_33":22852,"_19":22852,"_36":22853,"_45":1387,"_47":22857},"xsf.statsFns.nbdtri","xsf.statsFns.nbdtri(k, n, p)","Negative binomial distribution inverse CDF.",[22854,22855,22856],{"_17":4686,"_19":1387,"_41":6},{"_17":1206,"_19":1387,"_41":6},{"_17":5212,"_19":1387,"_41":6},[],{"_17":22859,"_31":22860,"_33":22861,"_19":1136,"_36":22862,"_45":1130,"_47":22864},"xsf.statsFns.kolmogorov","xsf.statsFns.kolmogorov(x)","kolmogorov",[22863],{"_17":405,"_19":22277,"_41":6},[],{"_17":22866,"_31":22867,"_33":22868,"_19":1136,"_36":22869,"_45":1130,"_47":22871},"xsf.statsFns.kolmogi","xsf.statsFns.kolmogi(p)","kolmogi",[22870],{"_17":5212,"_19":22277,"_41":6},[],{"_17":22873,"_31":22874,"_33":22875,"_19":1136,"_36":22876,"_45":1130,"_47":22879},"xsf.statsFns.smirnov","xsf.statsFns.smirnov(n, x)","smirnov",[22877,22878],{"_17":1206,"_19":1387,"_41":6},{"_17":405,"_19":22277,"_41":6},[],{"_17":22881,"_31":22882,"_33":22883,"_19":1136,"_36":22884,"_45":1130,"_47":22887},"xsf.statsFns.smirnovi","xsf.statsFns.smirnovi(n, p)","smirnovi",[22885,22886],{"_17":1206,"_19":1387,"_41":6},{"_17":5212,"_19":22277,"_41":6},[],{"_17":22889,"_31":22890,"_33":22891,"_19":22892,"_36":22893,"_45":1387,"_47":22899},"xsf.statsFns.owensT","xsf.statsFns.owensT(h, a)","Owen's T function.\r","Owen's T function.\r\n\r\nT(h, a) = (1/2π) ∫₀^a exp(-h²(1+x²)/2) / (1+x²) dx\r\n\r\nUseful for computing bivariate normal probabilities.",[22894,22897],{"_17":22895,"_19":22896,"_41":6},"h","- First parameter",{"_17":664,"_19":22898,"_41":6},"- Second parameter",[],{"_17":22901,"_31":22902,"_33":22903,"_19":1136,"_36":22904,"_45":46,"_47":22907},"xsf.configureXSF","xsf.configureXSF(config)","configureXSF",[22905],{"_17":3805,"_19":22906,"_41":6},"XSFLoadConfig",[],{"_17":22909,"_31":22910,"_33":22911,"_19":1136,"_36":22912,"_45":22913,"_47":22914},"xsf.getXSFModule","xsf.getXSFModule()","getXSFModule",[],"XSFModule",[],{"_17":22916,"_31":22917,"_33":22918,"_19":1136,"_36":22919,"_45":2598,"_47":22920},"xsf.isXSFLoaded","xsf.isXSFLoaded()","isXSFLoaded",[],[],{"_17":22922,"_31":22923,"_33":22924,"_19":1136,"_36":22925,"_45":22926,"_47":22927},"xsf.loadXSFModule","xsf.loadXSFModule()","loadXSFModule",[],"Promise",[],{"_17":22929,"_31":22930,"_33":22931,"_19":1136,"_36":22932,"_45":46,"_47":22933},"xsf.resetXSFModule","xsf.resetXSFModule()","resetXSFModule",[],[],"actionData","errors"]