Expression Concepts in Scientific Computing

Michael Lerch ()
Additional contact information
Michael Lerch: Universität Würzburg, Lehrstuhl Informatik II

A chapter in Developments in Reliable Computing, 1999, pp 119-130 from Springer

Abstract: Abstract Most programming languages apply an eager expression evaluation strategy. In Scientific Computing this is not sufficient in many cases. In this paper we show the design of an expressive, efficient, context sensitive and extendable expression concept which allows the implementation of arbitrary evaluation strategies. We apply this mechanism to the automatic computation of sharp enclosures of the range of an arithmetical expression using the mean value form. This also involves a new implementation of an automatic differentiation facility using C++ and the expression template technique [14]. We show that our solution is significantly more efficient than traditional approaches.

Keywords: Scientific Computing; Parse Tree; Automatic Differentiation; Arithmetical Expression; Function Template (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-017-1247-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9789401712477

DOI: 10.1007/978-94-017-1247-7_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().