Research reports

Exhaustive search for higher-order Kronrod-Patterson Extensions

by R. Bourquin

(Report number 2015-11)

Abstract
Gauss points are not nested and for this reason one searches for quadrature rules with nested points and similar efficiency. A well studied source of candidates are the Kronrod-Patterson extensions. Under suitable conditions it is possible to build towers of nested rules. We investigate this topic further and give a detailed description of the algorithms used for constructing such iterative extensions. Our new implementation combines several important ideas spread out in theoretical research papers. We apply the resulting algorithms to the classical orthogonal polynomials and build sparse high-dimensional quadrature rules for each class.

Keywords: High-dimensional Quadrature, Kronrod Rule, Patterson Extension, Smolyak, Orthogonal Polynomial

BibTeX
@Techreport{B15_601,
  author = {R. Bourquin},
  title = {Exhaustive search for higher-order Kronrod-Patterson Extensions},
  institution = {Seminar for Applied Mathematics, ETH Z{\"u}rich},
  number = {2015-11},
  address = {Switzerland},
  url = {https://www.sam.math.ethz.ch/sam_reports/reports_final/reports2015/2015-11.pdf },
  year = {2015}
}

Disclaimer
© Copyright for documents on this server remains with the authors. Copies of these documents made by electronic or mechanical means including information storage and retrieval systems, may only be employed for personal use. The administrators respectfully request that authors inform them when any paper is published to avoid copyright infringement. Note that unauthorised copying of copyright material is illegal and may lead to prosecution. Neither the administrators nor the Seminar for Applied Mathematics (SAM) accept any liability in this respect. The most recent version of a SAM report may differ in formatting and style from published journal version. Do reference the published version if possible (see SAM Publications).

JavaScript has been disabled in your browser