Eugene V. Zima
- S. A. Abramov. The summation of rational functions. ?Z. Vy?cisl. Mat. i Mat. Fiz., 11:1071--1075, 1971.Google Scholar
- G. Boole. A Treatise on the Calculus of Finite Differences. Cambridge Library Collection. Cambridge University Press, Cambridge, 2009. Reprint of the 1860 original.Google ScholarCross Ref
- A. Bostan, F. Chyzak, B. Salvy, and T. Cluzeau. Low complexity algorithms for linear recurrences. In Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, ISSAC'06, pages 31--38, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- Euler. Foundations of Differential Calculus. Springer-Verlag, New York, 2000. Translated from the Latin by John D. Blanton.Google Scholar
- J. Gerhard. Modular Algorithms in Symbolic Summation and Symbolic Integration, volume 3218 of Lecture Notes in Computer Science. Springer, 2004. Google ScholarDigital Library
- J. Gerhard, M. Giesbrecht, A. Storjohann, and E. V. Zima. Shiftless decomposition and polynomialtime rational summation. In Proceedings of the 2003 International Symposium on Symbolic and Algebraic Computation, pages 119--126 (electronic), New York, 2003. ACM. Google ScholarDigital Library
- R. W. Gosper, Jr. Indefinite hypergeometric sums in MACSYMA. In Proceedings of the 1977 MACSYMA Users' Conference, pages 237--251, 1977.Google Scholar
- R. W. Gosper, Jr. Decision procedure for indefinite hypergeometric summation. Proc. Nat. Acad. Sci. U.S.A., 75(1):40--42, 1978.Google ScholarCross Ref
- M. Karr. Summation in finite terms. Journal of the Association for Computing Machinery, 28(2):305--350, 1981. Google ScholarDigital Library
- J. C. Lafon. Summation in finite terms. In B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht, editors, Computer algebra. Symbolic and algebraic computation, pages 71--77. Springer, Vienna, 1983.Google Scholar
- Y.-K. Man. On computing closed forms for indefinite summations. Journal of Symbolic Computation, 16(4):355--376, Oct. 1993. Google ScholarDigital Library
- R. Moenck. On computing closed forms for summations. In Proceedings of the 1977 MACSYMA Users' Conference, pages 225--236, 1977.Google Scholar
- E. V. Zima. Simplification and optimization transformations of chains of recurrences. In Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, ISSAC '95, pages 42--50, New York, NY, USA, 1995. ACM. Google ScholarDigital Library
- E. V. Zima. Accelerating indefinite summation: Simple classes of summands. Mathematics in Computer Science, 7(4):455--472, 2013.Google ScholarCross Ref
Index Terms
- Direct Indefinite Summation
Recommendations
Preconditioning Highly Indefinite and Nonsymmetric Matrices
Standard preconditioners, like incomplete factorizations, perform well when the coefficient matrix is diagonally dominant, but often fail on general sparse matrices. We experiment with nonsymmetric permutations and scalings aimed at placing large entries ...
A Sparse Symmetric Indefinite Direct Solver for GPU Architectures
In recent years, there has been considerable interest in the potential for graphics processing units (GPUs) to speed up the performance of sparse direct linear solvers. Efforts have focused on symmetric positive-definite systems for which no pivoting is ...
Solving Hermitian positive definite systems using indefinite incomplete factorizations
Incomplete LDL^* factorizations sometimes produce an indefinite preconditioner even when the input matrix is Hermitian positive definite. The two most popular iterative solvers for symmetric systems, CG and MINRES, cannot use such preconditioners; they ...
Comments