Sergei A. Abramov
- Abr89a.S. A. Abramov (1989): Problems of computer algebra involved in the search for polynomial solutions of linear differential and difference equations, Moscow Univ. Comput. Math. and Cybernet., no. 3, 63-68.Google Scholar
- Abr89b.S. A. Abramov (1989): Rational solutions of linear difference and differential equations with polynomial coefficients, USSR Comput. Maths. Math. Phys., vol. 29, 7-12. Google ScholarDigital Library
- Abr95.S.A. Abramov (1995): Rational solutions of linear difference and q-difference equations with polynomial coefficients, these proceedings. Google ScholarDigital Library
- Abr&Kva91.S. A. Abramov, K. Yu. Kvashenko (1991): Fast algorithm to search for the rational solutions of linear differential equations, Proc. ISSAC '91,267-270. Google ScholarDigital Library
- Abr&Pet95.S. A. Abramov, M. Petkov~ek (1995): Finding all q-hypergeometric solutions of q-difference equations, Proc. FPSA C '95, in press. Google ScholarDigital Library
- Bach&al94.O. Bachmann, P. Wang, E. V. Zima (1994): Chains of Recurrences - a method to expedite the evaluation of closed-form functions, Proc. ISSA C 'g4, 242- 249. Google ScholarDigital Library
- Bro&Pet94.M. Bronstein, M. Petkovgek (1994): On Ore rings, linear operators and factorisation, Programmirovanie 20, N.1, 27-45 (also Research Report 200, Informatik, ETH Ziirich).Google Scholar
- Gos78.R. W. Gosper, Jr. (1978): Decision procedure for indefinite hypergeometric summation, Proc. Natl. Acad. Sci. USA 75, 40-42.Google ScholarCross Ref
- Pet92.M. Petkov~ek (1992): Hypergeometric solutions of linear recurrences with polynomial coefficients, J. Symb. Comp. 14, 243-264. Google ScholarDigital Library
- Sin91.M. F. Singer (1991): Liouvillian solutions of linear differential equations with Liouvillian coefficients, J. Symb. Comp., vol. 11, 251-273. Google ScholarDigital Library
- Zei91.D. Zeilberger (1991): The method of creative telescoping, J. Symb. Comput. 11, 195-204. Google ScholarDigital Library
- Zima84.E. V. Zima (1984): Automatic Construction of Systems of Recurrence Relations, USSR Comput. Maths. Math. Phys., vol. 24, 193-197. Google ScholarDigital Library
Index Terms
On polynomial solutions of linear operator equations
Recommendations
Legendre polynomial solutions of high-order linear Fredholm integro-differential equations
In this study, a Legendre collocation matrix method is presented to solve high-order Linear Fredholm integro-differential equations under the mixed conditions in terms of Legendre polynomials. The proposed method converts the equation and conditions to ...
An efficient solution for Cauchy-likesystems of linear equations
Using the displacement approach and transformation of vectors, the complexity ofsolving strongly nonsingular Cauchy-like systems of linear equations [email protected][email protected]@? will be improved off a factor of log n from the known algorithms of the recursive triangular ...
Bidiagonalization of Matrices and Solution of Linear Equations
An algorithm given by Golub and Kahan [2] for reducing a general matrix to bidiagonal form is shown to be very important for large sparse matrices. The singular values of the matrix are those of the bidiagonal form, and these can be easily computed. The ...
Comments