High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets

New numerical algorithms are devised for high-order, efficient quadrature in domains arising from the intersection of a hyperrectangle and a manifold implicitly defined by level sets. By casting the manifold locally as the graph of a function (implicitly evaluated through a recurrence relation for t...

Full description

Bibliographic Details
Other Authors: Khanmohamadi, Omid (authoraut)
Format: Others
Language:English
English
Published: Florida State University
Subjects:
Online Access:http://purl.flvc.org/fsu/fd/FSU_SUMMER2017_Khanmohamadi_fsu_0071E_14013
id ndltd-fsu.edu-oai-fsu.digital.flvc.org-fsu_552320
record_format oai_dc
spelling ndltd-fsu.edu-oai-fsu.digital.flvc.org-fsu_5523202019-09-28T03:07:46Z High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets Khanmohamadi, Omid (authoraut) Sussman, Mark (professor directing dissertation) Plewa, Tomasz (university representative) Moore, M. Nicholas J. (Matthew Nicholas J.) (committee member) Ökten, Giray (committee member) Florida State University (degree granting institution) College of Arts and Sciences (degree granting college) Department of Mathematics (degree granting departmentdgg) Text text doctoral thesis Florida State University English eng 1 online resource (108 pages) computer application/pdf New numerical algorithms are devised for high-order, efficient quadrature in domains arising from the intersection of a hyperrectangle and a manifold implicitly defined by level sets. By casting the manifold locally as the graph of a function (implicitly evaluated through a recurrence relation for the zero level set), a recursion stack is set up in which the interface and integrand information of a single dimension after another will be treated. Efficient means for the resulting dimension reduction process are developed, including maps for identifying lower-dimensional hyperrectangle facets, algorithms for minimal coordinate-flip vertex traversal, which, together with our multilinear-form-based derivative approximation algorithms, are used for checking a proposed integration direction on a facet, as well as algorithms for detecting interface-free sub-hyperrectangles. The multidimensional quadrature nodes generated by this method are inside their respective domains (hence, the method does not require any extension of the integrand) and the quadrature weights inherit any positivity of the underlying single-dimensional quadrature method, if present. The accuracy and efficiency of the method are demonstrated through convergence and timing studies for test cases in spaces of up to seven dimensions. The strengths and weaknesses of the method in high dimensional spaces are discussed. A Dissertation submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy. Summer Semester 2017. July 17, 2017. approximate integration, C, C++ implementation, cubature quadrature, implicit manifold, level set, recursive dimension reduction algorithm Includes bibliographical references. Mark Sussman, Professor Directing Dissertation; Tomasz Plewa, University Representative; Nick Moore, Committee Member; Giray Okten, Committee Member. Applied mathematics FSU_SUMMER2017_Khanmohamadi_fsu_0071E_14013 http://purl.flvc.org/fsu/fd/FSU_SUMMER2017_Khanmohamadi_fsu_0071E_14013 http://diginole.lib.fsu.edu/islandora/object/fsu%3A552320/datastream/TN/view/High-Order%2C%20Efficient%2C%20Numerical%20Algorithms%20for%20Integration%20in%20Manifolds%20Implicitly%20Defined%20by%20Level%20Sets.jpg
collection NDLTD
language English
English
format Others
sources NDLTD
topic Applied mathematics
spellingShingle Applied mathematics
High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
description New numerical algorithms are devised for high-order, efficient quadrature in domains arising from the intersection of a hyperrectangle and a manifold implicitly defined by level sets. By casting the manifold locally as the graph of a function (implicitly evaluated through a recurrence relation for the zero level set), a recursion stack is set up in which the interface and integrand information of a single dimension after another will be treated. Efficient means for the resulting dimension reduction process are developed, including maps for identifying lower-dimensional hyperrectangle facets, algorithms for minimal coordinate-flip vertex traversal, which, together with our multilinear-form-based derivative approximation algorithms, are used for checking a proposed integration direction on a facet, as well as algorithms for detecting interface-free sub-hyperrectangles. The multidimensional quadrature nodes generated by this method are inside their respective domains (hence, the method does not require any extension of the integrand) and the quadrature weights inherit any positivity of the underlying single-dimensional quadrature method, if present. The accuracy and efficiency of the method are demonstrated through convergence and timing studies for test cases in spaces of up to seven dimensions. The strengths and weaknesses of the method in high dimensional spaces are discussed. === A Dissertation submitted to the Department of Mathematics in partial fulfillment of the requirements for the degree of Doctor of Philosophy. === Summer Semester 2017. === July 17, 2017. === approximate integration, C, C++ implementation, cubature quadrature, implicit manifold, level set, recursive dimension reduction algorithm === Includes bibliographical references. === Mark Sussman, Professor Directing Dissertation; Tomasz Plewa, University Representative; Nick Moore, Committee Member; Giray Okten, Committee Member.
author2 Khanmohamadi, Omid (authoraut)
author_facet Khanmohamadi, Omid (authoraut)
title High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
title_short High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
title_full High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
title_fullStr High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
title_full_unstemmed High-Order, Efficient, Numerical Algorithms for Integration in Manifolds Implicitly Defined by Level Sets
title_sort high-order, efficient, numerical algorithms for integration in manifolds implicitly defined by level sets
publisher Florida State University
url http://purl.flvc.org/fsu/fd/FSU_SUMMER2017_Khanmohamadi_fsu_0071E_14013
_version_ 1719258881302986752