Skip to main content

Reducing Computational Costs in the Basic Perturbation Lemma

  • Conference paper
Computer Algebra in Scientific Computing (CASC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4194))

Included in the following conference series:

  • 595 Accesses

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.

Partially supported by the PAICYT research project FQM-296 and the UPV–EHU project 00127.310-E-15916.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Álvarez, V., Armario, A., Real, P., Silva, B.: HPT and computability of Hochschild and cyclic homologies of commutative DGA–algebras. In: Conference on Secondary Calculus and Cohomological Physics, EMIS Electronic Proceedings, Moscow (1997), http://www.emis.de/proceedings

  2. Brown, R.: The twisted Eilenberg-Zilber theorem, Celebrazioni Archimedae del Secolo XX, Simposio di Topologia, pp. 34–37 (1967)

    Google Scholar 

  3. Burghelea, D., Vigué Poirrier, M.: Cyclic homology of commutative algebras I, Algebraic Topology Rational Homotopy. Lecture Notes in Mathematics, vol. 1318, pp. 51–72 (1986)

    Google Scholar 

  4. C.H.A.T.A. group. Computing “small” 1–homological models for Commutative Differential Graded Algebras. In: Proc. Third Workshop on Computer Algebra in Scientific Computing, pp. 87–100. Springer, Heidelberg (2000)

    Google Scholar 

  5. Cartan, H., Eilenberg, S.: Homological Algebra. Princeton Univ. Press, Princeton (1956)

    MATH  Google Scholar 

  6. Eilenberg, S., MacLane, S.: On the groups H(π,n), I. Annals of Math. 58, 55–106 (1953)

    Article  MathSciNet  Google Scholar 

  7. Eilenberg, S., MacLane, S.: On the groups H(π,n), II. Annals of Math. 60, 49–139 (1954)

    Article  MathSciNet  Google Scholar 

  8. Gugenheim, V.K.A.M.: On the chain complex of a fibration. Illinois J. Math. 3, 398–414 (1972)

    MathSciNet  Google Scholar 

  9. Gugenheim, V.K.A.M.: On Chen’s iterated integrals. Illinois J. Math., 703–715 (1977)

    Google Scholar 

  10. Gugenheim, V.K.A.M., Lambe, L.: Perturbation theory in Differential Homological Algebra, I. Illinois J. Math. 33, 56–582 (1989)

    MathSciNet  Google Scholar 

  11. Gugenheim, V.K.A.M., Lambe, L., Stasheff, J.: Perturbation theory in differential homological algebra, II. Illinois J. Math. 35(3), 357–373 (1991)

    MATH  MathSciNet  Google Scholar 

  12. Gugenheim, V.K.A.M., Stasheff, J.: On perturbations and A  ∞ –structures. Bull. Soc. Math. Belg. 38, 237–246 (1986)

    MATH  MathSciNet  Google Scholar 

  13. Huebschmann, J., Kadeishvili, T.: Small models for chain algebras. Math. Zeit. 207, 245–280 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  14. Jiménez, M.J., Real, P.: “Coalgebra” structures on 1–homological models for commutative differential graded algebras. In: Proc. Fourth Workshop on Computer Algebra in Scientific Computing, pp. 347–361. Springer, Heidelberg (2001)

    Google Scholar 

  15. Lambe, L.A., Stasheff, J.: Applications of perturbation theory to iterated fibrations. Manuscripta Math. 58, 363–376 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  16. MacLane, S.: Homology, Classics in Mathematics. Springer, Berlin (1995); Reprint of the 1975 edition

    Google Scholar 

  17. Real, P.: Homological perturbation theory and associativity. Homology, Homotopy and Applications 2(5), 51–88 (2000)

    MATH  MathSciNet  Google Scholar 

  18. Shih, W.: Homologie des espaces fibrés. Inst. Hautes Etudes Sci. 13, 93–176 (1962)

    MATH  Google Scholar 

  19. Weibel, C.A.: An introduction to Homological Algebra. Cambridge studies in advanced mathematics, vol. 38. Cambridge University Press, Cambridge (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berciano, A., Jiménez, M.J., Real, P. (2006). Reducing Computational Costs in the Basic Perturbation Lemma. In: Ganzha, V.G., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2006. Lecture Notes in Computer Science, vol 4194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11870814_3

Download citation

  • DOI: https://doi.org/10.1007/11870814_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45182-2

  • Online ISBN: 978-3-540-45195-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics