Guanqun Ma, David Lenz, Tom Peterka, Hanqi Guo, Bei Wang
{"title":"Critical Point Extraction from Multivariate Functional Approximation","authors":"Guanqun Ma, David Lenz, Tom Peterka, Hanqi Guo, Bei Wang","doi":"arxiv-2408.13193","DOIUrl":null,"url":null,"abstract":"Advances in high-performance computing require new ways to represent\nlarge-scale scientific data to support data storage, data transfers, and data\nanalysis within scientific workflows. Multivariate functional approximation\n(MFA) has recently emerged as a new continuous meshless representation that\napproximates raw discrete data with a set of piecewise smooth functions. An MFA\nmodel of data thus offers a compact representation and supports high-order\nevaluation of values and derivatives anywhere in the domain. In this paper, we\npresent CPE-MFA, the first critical point extraction framework designed for MFA\nmodels of large-scale, high-dimensional data. CPE-MFA extracts critical points\ndirectly from an MFA model without the need for discretization or resampling.\nThis is the first step toward enabling continuous implicit models such as MFA\nto support topological data analysis at scale.","PeriodicalId":501570,"journal":{"name":"arXiv - CS - Computational Geometry","volume":"271 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Computational Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.13193","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Advances in high-performance computing require new ways to represent
large-scale scientific data to support data storage, data transfers, and data
analysis within scientific workflows. Multivariate functional approximation
(MFA) has recently emerged as a new continuous meshless representation that
approximates raw discrete data with a set of piecewise smooth functions. An MFA
model of data thus offers a compact representation and supports high-order
evaluation of values and derivatives anywhere in the domain. In this paper, we
present CPE-MFA, the first critical point extraction framework designed for MFA
models of large-scale, high-dimensional data. CPE-MFA extracts critical points
directly from an MFA model without the need for discretization or resampling.
This is the first step toward enabling continuous implicit models such as MFA
to support topological data analysis at scale.