Related papers: Formal factorization of higher order irregular lin…

In this paper, we present a new algorithm and an experimental implementation for factoring elements in the polynomial n'th Weyl algebra, the polynomial n'th shift algebra, and ZZ^n-graded polynomials in the n'th q-Weyl algebra. The most…

We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…

We study linear difference equations with variable coefficients in a ring using a new nonlinear method. In a ring with identity, if the homogeneous part of the linear equation has a solution in the unit group of the ring (i.e., a unitary…

The point-splitting regularization technique for composite operators is discussed in connection with anomaly calculation. We present a pedagogical and self-contained review of the topic with an emphasis on the technical details. We also…

For linear operators which factor with suitable assumptions concerning commutativity of the factors, we introduce several notions of a decomposition. When any of these hold then questions of null space and range are subordinated to the same…

We study strictly hyperbolic partial differential operators of second order with non-smooth coefficients. After modelling them as semiclassical Colombeau equations of log-type we provide a factorization procedure on some…

This paper is devoted to the factorization of multivariate polynomials into products of linear forms, a problem which has applications to differential algebra, to the resolution of systems of polynomial equations and to Waring decomposition…

In this paper, which is a follow-up of our first paper "Normal forms for ordinary differential operators, I", we extend the theory of normal forms for non-commuting operators, and obtain as an application a commutativity criterion for…

In recent years many efforts have been devoted to finding bidiagonal factorizations of nonsingular totally positive matrices, since their accurate computation allows to numerically solve several important algebraic problems with great…

This paper addresses an investigation on a factorization method for difference equations. It is proved that some classes of second order linear difference operators, acting in Hilbert spaces, can be factorized using a pair of mutually…

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

In this paper we investigate factorizations of polynomials over the ring of dual quaternions into linear factors. While earlier results assume that the norm polynomial is real ("motion polynomials"), we only require the absence of real…

We consider algorithms for the factorization of linear partial differential operators. We introduce several new theoretical notions in order to simplify such considerations. We define an obstacle and a ring of obstacles to factorizations.…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

Functional iterations such as Newton's are a popular tool for polynomial root-finding. We consider realistic situation where some (e.g., better-conditioned) roots have already been approximated and where further computations is directed to…

We study conditions under which a partial differential operator of arbitrary order $n$ in two variables or ordinary linear differential operator admits a factorization with a first-order factor on the left. The factorization process…

We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years…

This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…