Mostrar el registro sencillo del ítem
Capítulo de Libro
Reducing Computational Costs in the Basic Perturbation Lemma
dc.creator | Real Jurado, Pedro | |
dc.creator | Berciano Alcaraz, Ainhoa | |
dc.creator | Jiménez Rodríguez, María José | |
dc.date.accessioned | 2015-11-11T08:50:12Z | |
dc.date.available | 2015-11-11T08:50:12Z | |
dc.date.issued | 2006 | |
dc.identifier.uri | http://hdl.handle.net/11441/30567 | |
dc.description.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 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 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.relation.ispartof | Computer algebra in scientific computing (CASC 2006), Lecture Notes in Computer Science, Vol. 4194, p. 33-48 | es |
dc.rights | Atribución-NoComercial-CompartirIgual 4.0 Internacional | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | * |
dc.title | Reducing Computational Costs in the Basic Perturbation Lemma | es |
dc.type | info:eu-repo/semantics/bookPart | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Matemática Aplicada I | es |
dc.identifier.doi | http://dx.doi.org/10.1007/11870814_3 | es |
dc.identifier.idus | https://idus.us.es/xmlui/handle/11441/30567 |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Reducing computational costs.pdf | 490.3Kb | [PDF] | Ver/ | |