Intraprocedural Adjoint Code Generated by the Differentiation-Enabled NAGWare Fortran Compiler

No abstract is available for this paper.

• Publication year

  2006

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers
  DOI 10.4203/ccp.84.112
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Automatic differentiation : applications, theory, and implementations

  2006cited by this paper
• Computing Adjoints with the NAGWare Fortran 95 Compiler

  2006cited by this paper
• Efficient reversal of the intraprocedural flow of control in adjoint computations

  2006cited by this paper
• A differentiation-enabled Fortran 95 compiler

  2005cited by this paper
• TBR Analysis in Reverse-Mode Automatic Differentiation

  2003cited by this paper
• Towards differentiation-enabled Fortran 95 compiler technology

  2003cited by this paper
• Evaluating derivatives - principles and techniques of algorithmic differentiation, Second Edition

  2000cited by this paper
• Advanced Compiler Design and Implementation

  1997cited by this paper
• Handbook of global optimization

  1995cited by this paper
• Numerical Toolbox for Verified Computing I

  1993cited by this paper
• The MINPACK-2 test problem collection (preliminary version)

  1991cited by this paper
• Estimation of Sparse Jacobian Matrices

  1983cited by this paper
• Generalized descent for global optimization

  1981influential reference

• Hard.

  2020cites this paper
• Symbolic vs . Algorithmic Differentiation of GSL Integration Routines

  2015cites this paper
• MontiArc - Architectural Modeling of Interactive Distributed and Cyber-Physical Systems

  2014cites this paper
• An Operational Semantics for Activity Diagrams using SMV

  2014cites this paper
• Algorithmic Differentiation of Numerical Methods : Second-Order Tangent and Adjoint Solvers for Systems of Parametrized Nonlinear Equations

  2014cites this paper
• New Algorithms for Optimal Online Checkpointing

  2010cites this paper
• Static Termination Analysis for Prolog Using Term Rewriting and SAT Solving

  2010cites this paper
• Model checking of software for microcontrollers

  2010cites this paper
• Computing Maximum Reachability Probabilities in Markovian Timed Automata

  2010cites this paper
• Preemptive Scheduling of Equal-Length Jobs in Polynomial Time

  2010cites this paper
• Automated Termination Analysis of Java Bytecode by Term Rewriting

  2010cites this paper
• Design patterns for safety-critical embedded systems

  2010cites this paper
• The Longest Path Problem Is Polynomial on Interval Graphs

  2009cites this paper
• Model based construction of embedded and real-time software: a methodology for small devices

  2009cites this paper
• Quantitative Model Checking of Continuous-Time Markov Chains Against Timed Automata Specifications

  2009cites this paper
• DAG reversal is NP-complete

  2009cites this paper
• Compositional Abstraction for Stochastic Systems

  2009cites this paper
• Empirical Evaluations of Safety-Critical Embedded Systems

  2008cites this paper
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains

  2008cites this paper
• Fast Convergence of Routing Games with Splittable Flows

  2008cites this paper
• Abstraction for Stochastic Systems by Erlang's Method of Stages

  2008cites this paper
• Optimization with Partial Differential Equations

  2008cites this paper
• An Automata Theoretic Approach to the Theory of Rational Tree Relations

  2008cites this paper
• Adjoints for Time-Dependent Optimal Control

  2008cites this paper
• Comparing recent network simulators : A performance evaluation study

  2008cites this paper
• The DP framework for proving termination of term rewriting

  2007cites this paper
• Unranked Tree Automata with Sibling Equalities and Disequalities

  2007cites this paper
• Counterexamples in Probabilistic Model Checking

  2007cites this paper
• Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning

  2007cites this paper
• Achieving Highly Reliable Embedded Software: An Empirical Evaluation of Different Approaches

  2007cites this paper
• Verifying Concurrent List-Manipulating Programs by LTL Model Checking

  2007cites this paper
• On Optimal DAG Reversal

  2007cites this paper
• Temporal assertions for sequential and concurrent programs

  2007cites this paper
• MeDUSA-MethoD for UML 2-based Design of Embedded Software Applications

  2007cites this paper
• coJIVE: A System to Support Collaborative Jazz Improvisation

  2007cites this paper
• A Probabilistic Justification of the Combining Calculus under the Uniform Scheduler Assumption

  2007cites this paper
• Automatic first- and second-order adjoints for truncated Newton

  2007cites this paper
• Uncoordinated Two-Sided Markets

  2007cites this paper
• On syntax-directed adjoint fortran code

  2007cites this paper
• Second-order adjoints by source code manipulation of numerical programs

  2007cites this paper
• The DP framework for proving termination of term rewriting

  2007cites this paper
• Toward Low Static Memory Jacobian Accumulation

  2006cites this paper
• Divide-and-Color

  2006cites this paper
• Report of the GI Work Group "Requirements Management Tools for Product Line Engineering"

  2006cites this paper
• Scrolling Through Time: Improving Interfaces for Searching and Navigating Continuous Audio Timelines

  2006cites this paper
• Utilizing optical sensors from mice for new input devices

  2006cites this paper
• Selexels: a Conceptual Framework for Pointing Devices with Low Expressiveness

  2006cites this paper