English
Related papers

Related papers: \'Equations aux q-diff\'erences lin\'eaires: facto…

200 papers

The compensated quotient-difference (Compqd) algorithm is proposed along with some applications. The main motivation is based on the fact that the standard quotient-difference (qd) algorithm can be numerically unstable. The Compqd algorithm…

Numerical Analysis · Mathematics 2017-02-20 Peibing Du , Roberto Barrio , Hao Jiang , Lizhi Cheng

We present an algorithm to compute the number of solutions of the (constrained) number partitioning problem. A concrete implementation of the algorithm on an Ising-type quantum computer is given.

Quantum Physics · Physics 2009-11-06 H. De Raedt , K. Michielsen , K. De Raedt , S. Miyashita

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…

Symbolic Computation · Computer Science 2014-04-02 Mark Giesbrecht , Albert Heinle , Viktor Levandovskyy

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…

Symbolic Computation · Computer Science 2021-02-15 Mark Giesbrecht , Hui Huang , George Labahn , Eugene Zima

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…

Symbolic Computation · Computer Science 2008-01-10 S. P. Tsarev

The fractional q-calculus is the q-extension of the ordinary fractional calculus and dates back to early 20-th century. The theory of q-calculus operators are used in various areas of science such as ordinary fractional calculus, optimal…

Complex Variables · Mathematics 2018-06-25 Jay M. Jahangiri

Amongst the most remarkable successes of quantum computation are Shor's efficient quantum algorithms for the computational tasks of integer factorisation and the evaluation of discrete logarithms. In this article we review the essential…

Quantum Physics · Physics 2016-11-18 Richard Jozsa

In this paper, we present a new numerical method to solve fractional differential equations. Given a fractional derivative of arbitrary real order, we present an approximation formula for the fractional operator that involves integer-order…

Numerical Analysis · Mathematics 2015-12-16 Ricardo Almeida , Nuno R. O. Bastos

Triangular factorizations are an important tool for solving integral equations and partial differential equations with hierarchical matrices ($\mathcal{H}$-matrices). Experiments show that using an $\mathcal{H}$-matrix LR factorization to…

Numerical Analysis · Mathematics 2019-05-28 Steffen Börm

We present an algorithm that determines the Galois group of linear difference equations with rational function coefficients.

Symbolic Computation · Computer Science 2015-03-10 Ruyong Feng

Factorization of polynomials is one of the foundations of symbolic computation. Its applications arise in numerous branches of mathematics and other sciences. However, the present advanced programming languages such as C++ and J++, do not…

Algebraic Geometry · Mathematics 2010-08-24 Yong Feng , Wenyuan Wu , Jingzhong Zhang

In this short paper, we show how to deduce several types of generating functions from Srivastava {\it et al} [Appl. Set-Valued Anal. Optim. {\bf 1} (2019), pp. 187-201.] by the method of $q$-difference equations. Moreover, we build…

Classical Analysis and ODEs · Mathematics 2020-09-14 Sama Arjika

In this study, a recursive solution technique in conjunction with generalized integrating factors is presented and applied to address first and second order linear differential equations. This approach demonstrates practical utility in…

Mathematical Physics · Physics 2025-03-03 Everardo Rivera-Oliva

A special Infeld-Hall factorization is given for the Askey-Wilson second order q-difference operator. It is then shown how to deducd a generalization of the corresponding Askey-Wilson polynomials.

Classical Analysis and ODEs · Mathematics 2016-09-07 Gaspard Bangerezako

We present an algorithm for computing a holonomic system for a definite integral of a holonomic function over a domain defined by polynomial inequalities. If the integrand satisfies a holonomic difference-differential system including…

Symbolic Computation · Computer Science 2016-04-05 Toshinori Oaku

The authors proposed a general way to find particular solutions for overdetermined systems of PDEs previously, where the number of equations is greater than the number of unknown functions. In this paper, we propose an algorithm for finding…

Symbolic Computation · Computer Science 2019-12-30 Maxim Zaytsev , V'yacheslav Akkerman

Just as knowing some roots of a polynomial allows one to factor it, a well-known result provides a factorization of any scalar differential operator given a set of linearly independent functions in its kernel. This note provides a…

Rings and Algebras · Mathematics 2015-09-18 Alex Kasman

The relations between solutions of the three types of totally linear partial differential equations of first order are presented. The approach is based on factorization of a non-homogeneous first order differential operator to products…

Functional Analysis · Mathematics 2007-05-23 C. Viazminsky

We present two algorithms for computing hypergeometric solutions of second order linear differential operators with rational function coefficients. Our first algorithm searches for solutions of the form \[ \exp(\int r \,…

Symbolic Computation · Computer Science 2016-06-07 Erdal Imamoglu , Mark van Hoeij

This paper describes the classification of analytic $q$-difference equations. The difference Galois groups are computed. A tentative description of the universal difference Galois group is given.

Commutative Algebra · Mathematics 2007-05-23 Marius van der Put