A Comparison of Subdivision Strategies for Verified Multi-Dimensional Gaussian Quadrature

Bruno Lang ()
Additional contact information
Bruno Lang: Aachen University of Technology, Computing Center

A chapter in Developments in Reliable Computing, 1999, pp 67-75 from Springer

Abstract: Abstract This paper compares several strategies for subdividing the domain in verified multidimensional Gaussian quadrature. Subdivision may be used in two places in the quadrature algorithm. First, subdividing the box can reduce the over-estimation of the partial derivatives’ ranges, which are needed to bound the approximation error. Second, if the required error bound cannot be met with the whole domain then the box is split into subboxes, and the quadrature algorithm is recursively applied to these. Both variants of subdivision are considered in this paper.

Keywords: Verified Gaussian quadrature; subdivision strategies (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_6

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

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

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 ().