메뉴 건너뛰기




Volumn 3994 LNCS - IV, Issue , 2006, Pages 541-549

Optimal checkpointing for time-stepping procedures in ADOL-C

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER PROGRAMMING; DATA STORAGE EQUIPMENT; LARGE SCALE SYSTEMS; OPTIMIZATION; ORDINARY DIFFERENTIAL EQUATIONS; PROBLEM SOLVING;

EID: 33746637990     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758549_75     Document Type: Conference Paper
Times cited : (14)

References (12)
  • 2
    • 0026858844 scopus 로고
    • Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation
    • Griewank, A.: Achieving logarithmic growth of temporal and spatial complexity in reverse automatic differentiation. Optim. Methods Softw., 1 (1992) 35-54.
    • (1992) Optim. Methods Softw. , vol.1 , pp. 35-54
    • Griewank, A.1
  • 3
    • 0003319841 scopus 로고    scopus 로고
    • Evaluating derivatives: Principles and techniques of algorithmic differentiation
    • Philadelphia
    • Griewank, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Appl. Math. SIAM, Philadelphia, 2000.
    • (2000) Frontiers in Appl. Math. SIAM , vol.19
    • Griewank, A.1
  • 4
    • 0030168036 scopus 로고    scopus 로고
    • ADOL-C: A package for the automatic differentiation of algorithms written in C/C++
    • Griewank, A., Juedes, D., Utke. J.: ADOL-C: A package for the automatic differentiation of algorithms written in C/C++. ACM Trans. Math. Software, 22 (1996) 131-167.
    • (1996) ACM Trans. Math. Software , vol.22 , pp. 131-167
    • Griewank, A.1    Juedes, D.2    Utke, J.3
  • 5
    • 0010666451 scopus 로고    scopus 로고
    • Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation
    • Griewank, A., Walther, A.: Revolve: An implementation of checkpointing for the reverse or adjoint mode of computational differentiation. ACM Trans. Math. Software, 26 (2000) 19-45.
    • (2000) ACM Trans. Math. Software , vol.26 , pp. 19-45
    • Griewank, A.1    Walther, A.2
  • 6
    • 0346276907 scopus 로고    scopus 로고
    • Parametric sensitivities for optimal control problems using automatic differentiation
    • R. Griesse, A. Walther.: Parametric sensitivities for optimal control problems using automatic differentiation. Optimal Control Applications and Methods, Vol. 24, pp. 297-314 (2003).
    • (2003) Optimal Control Applications and Methods , vol.24 , pp. 297-314
    • Griesse, R.1    Walther, A.2
  • 7
    • 29744450914 scopus 로고    scopus 로고
    • A-Revolve: An adaptive memory and run-time-reduced procedure for calculating adjoints; with an application to the instationary Navier-Stokes system
    • Hinze, M., Sternberg, J.: A-Revolve: An adaptive memory and run-time-reduced procedure for calculating adjoints; with an application to the instationary Navier-Stokes system. Optim. Methods Softw., 20 (2005) 645-663.
    • (2005) Optim. Methods Softw. , vol.20 , pp. 645-663
    • Hinze, M.1    Sternberg, J.2
  • 8
    • 34248178802 scopus 로고    scopus 로고
    • Tapenade 2.1 user's guide
    • INRIA
    • Hascoët, L., Pascual, V.: Tapenade 2.1 user's guide. Tech. rep. 300, INRIA, 2004.
    • (2004) Tech. Rep. , vol.300
    • Hascoët, L.1    Pascual, V.2
  • 10
    • 0345758019 scopus 로고    scopus 로고
    • A Fortran 77 preprocessor for reverse mode automatic differentiation with recursive checkpointing
    • Kubota, K.: A Fortran 77 preprocessor for reverse mode automatic differentiation with recursive checkpointing. Optim. Methods Softw., 10 (1998) 319-335.
    • (1998) Optim. Methods Softw. , vol.10 , pp. 319-335
    • Kubota, K.1
  • 11
    • 14344261667 scopus 로고    scopus 로고
    • Control flow reversal for adjoint code generation
    • IEEE Computer Society
    • Naumann, U., Utke, J., Lyons, A., Fagan, M.: Control Flow Reversal for Adjoint Code Generation. Proceed. of SCAM 2004, IEEE Computer Society (2004) 55-64.
    • (2004) Proceed. of SCAM 2004 , pp. 55-64
    • Naumann, U.1    Utke, J.2    Lyons, A.3    Fagan, M.4
  • 12
    • 32344447481 scopus 로고    scopus 로고
    • Advantages of binomial checkpointing for memory-reduced adjoint calculations
    • Feistauer, M., et al., (eds.): Numerical mathematics and advanced applications, Springer
    • Walther, A., Griewank, A.: Advantages of binomial checkpointing for memory-reduced adjoint calculations. In: Feistauer, M., et al., (eds.): Numerical mathematics and advanced applications, Proc. ENUMATH 2003, Springer (2004) 834-843.
    • (2004) Proc. ENUMATH 2003 , pp. 834-843
    • Walther, A.1    Griewank, A.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.