Reducing Computational Costs in the Basic Perturbation Lemma

Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high computational costs. In this paper, we propose a general strategy in order to reduce the complexity in some important formulas (those following a specific pattern) obtained by this algorithm. Then, we show two examples of application of this methodology.

• Type: Conference
• Year: 2006
• Where: CASC
• Authors: Ainhoa Berciano, María José Jiménez, Pedro Real
• Keywords: Basic Perturbation Lemma, CASC 2006, Homological Perturbation Theory, Mathematics, Well-known General Method