Skip to main content
SpringerLink
Log in

Combinatorial Computation with Automatic Differentiation

  • Conference paper
Advances in Automatic Differentiation

Part of the book series: Lecture Notes in Computational Science and Engineering ((LNCSE,volume 64))

Summary

Giving some numerical methods for combinatorial computation by means of automatic differentiation, this paper reports the effectiveness of the technique of automatic differentiation in the field of combinatorial computation or discrete computation.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.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. Bücker, H.M., Corliss, G.F., Hovland, P.D., Naumann, U., Norris, B. (eds.): Automatic Differentiation: Applications, Theory, and Implementations, Lecture Notes in Computational Science and Engineering, vol. 50. Springer, New York (2006)

    MATH  Google Scholar 

  2. Corliss, G., Faure, C., Griewank, A., Hascoët, L., Naumann, U. (eds.): Automatic Differentiation of Algorithms: From Simulation to Optimization, Computer and Information Science. Springer, New York (2002)

    MATH  Google Scholar 

  3. Knuth, D.E.: The art of computer programming, 3rd ed., vol. 2. Addison-Wesley, Reading, Massachusetts, London (1998)

    Google Scholar 

  4. Kubota, K.: Computation of matrix permanent with automatic differentiation, Lecture Notes in Computational Science and Engineering, vol. 50, pp. 67–76. Springer, New York (2005)

    Google Scholar 

  5. Valiant, L.G.: The complexity of computing the permanent. Theoretical computer science 8, 189–201 (1979)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chuo University, Kasuga 1-13-27, Bunkyo-ku, Tokyo, 113-8551, Japan

    Koichi Kubota

Authors
  1. Koichi Kubota
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Scientific Computing, RWTH Aachen University, 52056, Aachen, Germany

    Christian H. Bischof  & H. Martin Bücker  & 

  2. Mathematics and Computer Science Division, Argonne National Laboratory, 9700 S Cass Ave, Argonne, IL, 60439, USA

    Paul Hovland  & Jean Utke  & 

  3. Software and Tools for Computational Engineering, RWTH Aachen University, 52056, Aachen, Germany

    Uwe Naumann

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kubota, K. (2008). Combinatorial Computation with Automatic Differentiation. In: Bischof, C.H., Bücker, H.M., Hovland, P., Naumann, U., Utke, J. (eds) Advances in Automatic Differentiation. Lecture Notes in Computational Science and Engineering, vol 64. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68942-3_28

Download citation

Publish with us

Policies and ethics

Search

Navigation