We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
This is an example of C++ code of Clifford algebra calculations with the GiNaC computer algebra system. This code makes both symbolic and numeric computations. It was used to produ...
The purpose of this paper is to present four basic methods for ional separate modular static analysis of programs by abstract interpretation: simpli cation-based separate analysis;...
Abstract. D.V. Chudnovsky and G.V. Chudnovsky [CH] introduced a generalization of the FrobeniusStickelberger determinantal identity involving elliptic functions that generalize the...