Chapter of Book
Reducing Computational Costs in the Basic Perturbation Lemma
Author/s | Real Jurado, Pedro
Berciano Alcaraz, Ainhoa Jiménez Rodríguez, María José |
Department | Universidad de Sevilla. Departamento de Matemática Aplicada I |
Publication Date | 2006 |
Deposit Date | 2015-11-11 |
Published in |
|
Abstract | 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 ... 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. 1 |
Files | Size | Format | View | Description |
---|---|---|---|---|
Reducing computational costs.pdf | 490.3Kb | [PDF] | View/ | |