메뉴 건너뛰기




Volumn , Issue , 2002, Pages 123-130

Sparsity issues in the computation of Jacobian matrices

Author keywords

Merging; Partition; Sparse jacobians; Substitution methods

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS; DIFFERENTIAL EQUATIONS; DIFFERENTIATION (CALCULUS); DIGITAL ARITHMETIC; FORTRAN (PROGRAMMING LANGUAGE); HEURISTIC METHODS; MATRIX ALGEBRA; OPTIMIZATION;

EID: 0036045865     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780522     Document Type: Conference Paper
Times cited : (9)

References (25)
  • 14
    • 0005390079 scopus 로고    scopus 로고
    • Detecting Jacobian sparsity patterns by Bayesian probing
    • Preprint IOKOMO-04-2000, Technical University of Dresden; Submitted to Math. Progr.
    • (2000)
    • Griewank, A.1    Mitev, C.2
  • 15
    • 28244464920 scopus 로고    scopus 로고
    • Reducing the number of AD passes for computing a sparse Jacobian matrix
    • In Corliss et al. [6], chapter 31
    • Hossain, S.1    Steihaug, T.2
  • 19
  • 24
    • 0005430474 scopus 로고    scopus 로고
    • Graph coloring and the estimation of sparse Jacobian matrices with segmented columns
    • Technical Report 72, Department of Informatics, University of Bergen
    • (1997)
    • Steihaug, T.1    Hossain, A.S.2
  • 25
    • 0005430475 scopus 로고    scopus 로고
    • The MathWorks. Matlab 5.3.1
    • (2000)


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