Related papers: A Triangular Decomposition Algorithm for Different…
We continue to investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation. In an earlier article we had introduced the distinction between periodic and…
An efficient decoding algorithm named `divided decoder' is proposed in this paper. Divided decoding can be combined with any decoder using QR-decomposition and offers different pairs of performance and complexity. Divided decoding provides…
The general decomposition theory of exponential operators is briefly reviewed. A general scheme to construct independent determining equations for the relevant decomposition parameters is proposed using Lyndon words. Explicit formulas of…
We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…
In this note we shall introduce a simple, effective numerical method for solving partial differential equations for scalar and vector-valued data defined on surfaces. Even though we shall follow the traditional way to approximate the…
The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials of a given degree and exhibit explicit decompositions into…
We provide, in a 474 pages study, a comprehensive and self-contained treatment of Resultant Theory for a homogeneous system of polynomials with several variables (as many variables as of polynomials). In a non classical way, we use the…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
We present a package to perform partial fraction decompositions of multivariate rational functions. The algorithm allows to systematically avoid spurious denominator factors and is capable of producing unique results also when being applied…
Effective computation of resultants is a central problem in elimination theory and polynomial system solving. Commonly, we compute the resultant as a quotient of determinants of matrices and we say that there exists a determinantal formula…
Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…
The modular decomposition is a technique that applies but is not restricted to graphs. The notion of module naturally appears in the proofs of many graph theoretical theorems. Computing the modular decomposition tree is an important…
New families of fourth-order composition methods for the numerical integration of initial value problems defined by ordinary differential equations are proposed. They are designed when the problem can be separated into three parts in such a…
We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
Differential resultant formulas are defined, for a system $\mathcal{P}$ of $n$ ordinary Laurent differential polynomials in $n-1$ differential variables. These are determinants of coefficient matrices of an extended system of polynomials…
We show constructively that, under certain regularity assumptions, any system of coupled linear differential equations with variable coefficients can be tridiagonalized by a time-dependent Lanczos-like method. The proof we present formally…