Efficient evaluation of the full-rank QDR decomposition is established. A method and algorithm for efficient symbolic computation of A (2) T,S inverses of a given rational ...

The package "Pauli" is designed to represent square matrices in the basis of Pauli matrices and their higher-rank generalizations. Its basic function is to translate between ...

A measure of the writhing of a curve is introduced and is used to extend the Călugăreanu decomposition for closed curves, as well as the polar decomposition ...

Our objects of study are the real solution sets ofÊ2-variable polynomial equations with floating point Mathematica machine numbers as coefficients. ÊWe work primarily in ...

We provide a Mathematica code for decomposing strongly correlated quantum states described by a first-quantized, analytical wave function into many-body Fock states. Within ...

The efficient expansions by classical orthogonal polynomials is a well known and hard solving problem for applied mathematics. At first sight there is no problem as ...

For the investigation of higher order Feynman integrals, potentially with tensor structure, it is highly desirable to have numerical methods and automated tools for ...

The notebook contains the implementation of four functions PiecewiseIntegrate, PiecewiseSum, NPiecewiseIntegrate, NPiecewiseSum. They are intended for working with piecewise ...

Adomian polynomials (AP’s) are expressed in terms of new objects called reduced polynomials (RP’s). These new objects, which carry two subscripts, are independent of the ...

An algorithm for computing {2, 3}, {2, 4}, {1, 2, 3}, {1, 2, 4}-inverses and the Moore–Penrose inverse of a given rational matrix A is established. Classes A{2, 3}s and ...