메뉴 건너뛰기




Volumn 15, Issue 3, 1999, Pages 360-384

Where does smoothness count the most for two-point boundary-value problems?

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0010784589     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1999.0510     Document Type: Article
Times cited : (2)

References (9)
  • 8
    • 0030511596 scopus 로고    scopus 로고
    • The complexity of definite elliptic problems with noisy data
    • Werschulz A. G. The complexity of definite elliptic problems with noisy data. J. Complexity. 12:1996;440-473.
    • (1996) J. Complexity , vol.12 , pp. 440-473
    • Werschulz, A.G.1
  • 9
    • 0039469978 scopus 로고    scopus 로고
    • The complexity of indefinite elliptic problems with noisy data
    • Werschulz A. G. The complexity of indefinite elliptic problems with noisy data. J. Complexity. 13:1996;457-479.
    • (1996) J. Complexity , vol.13 , pp. 457-479
    • Werschulz, A.G.1


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