Buy Advances in Automatic Differentiation by Christian H. Bischof
close menu
Bookswagon
search
My Account
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)
Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)

Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)


     0     
5
4
3
2
1



Available


X
About the Book

The Fifth International Conference on Automatic Differentiation held from August 11 to 15, 2008 in Bonn, Germany, is the most recent one in a series that began in Breckenridge, USA, in 1991 and continued in Santa Fe, USA, in 1996, Nice, France, in 2000 and Chicago, USA, in 2004. The 31 papers included in these proceedings re?ect the state of the art in automatic differentiation (AD) with respect to theory, applications, and tool development. Overall, 53 authors from institutions in 9 countries contributed, demonstrating the worldwide acceptance of AD technology in computational science. Recently it was shown that the problem underlying AD is indeed NP-hard, f- mally proving the inherently challenging nature of this technology. So, most likely, no deterministic "silver bullet" polynomial algorithm can be devised that delivers optimum performance for general codes. In this context, the exploitation of doma- speci?c structural information is a driving issue in advancing practical AD tool and algorithm development. This trend is prominently re?ected in many of the pub- cations in this volume, not only in a better understanding of the interplay of AD and certain mathematical paradigms, but in particular in the use of hierarchical AD approaches that judiciously employ general AD techniques in application-speci?c - gorithmic harnesses. In this context, the understanding of structures such as sparsity of derivatives, or generalizations of this concept like scarcity, plays a critical role, in particular for higher derivative computations.

Table of Contents:
Reverse Automatic Differentiation of Linear Multistep Methods.- Call Tree Reversal is NP-Complete.- On Formal Certification of AD Transformations.- Collected Matrix Derivative Results for Forward and Reverse Mode Algorithmic Differentiation.- A Modification of Weeks’ Method for Numerical Inversion of the Laplace Transform in the Real Case Based on Automatic Differentiation.- A Low Rank Approach to Automatic Differentiation.- Algorithmic Differentiation of Implicit Functions and Optimal Values.- Using Programming Language Theory to Make Automatic Differentiation Sound and Efficient.- A Polynomial-Time Algorithm for Detecting Directed Axial Symmetry in Hessian Computational Graphs.- On the Practical Exploitation of Scarsity.- Design and Implementation of a Context-Sensitive, Flow-Sensitive Activity Analysis Algorithm for Automatic Differentiation.- Efficient Higher-Order Derivatives of the Hypergeometric Function.- The Diamant Approach for an Efficient Automatic Differentiation of the Asymptotic Numerical Method.- Tangent-on-Tangent vs. Tangent-on-Reverse for Second Differentiation of Constrained Functionals.- Parallel Reverse Mode Automatic Differentiation for OpenMP Programs with ADOL-C.- Adjoints for Time-Dependent Optimal Control.- Development and First Applications of TAC++.- TAPENADE for C.- Coping with a Variable Number of Arguments when Transforming MATLAB Programs.- Code Optimization Techniques in Source Transformations for Interpreted Languages.- Automatic Sensitivity Analysis of DAE-systems Generated from Equation-Based Modeling Languages.- Index Determination in DAEs Using the Library indexdet and the ADOL-C Package for Algorithmic Differentiation.- Automatic Differentiation for GPU-Accelerated 2D/3D Registration.- Robust Aircraft Conceptual Design UsingAutomatic Differentiation in Matlab.- Toward Modular Multigrid Design Optimisation.- Large Electrical Power Systems Optimization Using Automatic Differentiation.- On the Application of Automatic Differentiation to the Likelihood Function for Dynamic General Equilibrium Models.- Combinatorial Computation with Automatic Differentiation.- Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: A Case Study in a Simulated Moving Bed Process.- Structure-Exploiting Automatic Differentiation of Finite Element Discretizations.- Large-Scale Transient Sensitivity Analysis of a Radiation-Damaged Bipolar Junction Transistor via Automatic Differentiation.


Best Sellers


Product Details
  • ISBN-13: 9783540689355
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 368
  • Returnable: N
  • Width: 155 mm
  • ISBN-10: 3540689354
  • Publisher Date: 21 Jul 2008
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Series Title: 64 Lecture Notes in Computational Science and Engineering


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Advances in Automatic Differentiation: (64 Lecture Notes in Computational Science and Engineering)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!