Polytope division method: a scalable sampling method for problems with high-dimensional parameters

DOI10.1137/24M1704506MaRDI QIDQ6900198zbMATH OpenFDO

Authors Evie Nielen, Oliver Tse, Karen Veroy

Publication date 13 November 2025

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/24M1704506

zbMATH Keywords

configuration optimization problemgreedy sampling methodhigh-dimensional parameter setspolytope division method

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20) Numerical approximation and computational geometry (primarily algorithms) (65D99) Numerical optimization and variational techniques (65K10) Numerical methods for partial differential equations, boundary value problems (65N99)

Cites work

• ``Natural norm a posteriori error estimators for reduced basis approximations
• A generalized empirical interpolation method: application of reduced basis techniques to data assimilation
• A new selection operator for the discrete empirical interpolation method -- improved a priori error bound and extensions
• A posteriori error bounds for the empirical interpolation method
• A review of Monte Carlo and quasi-Monte Carlo sampling techniques
• A survey of projection-based model reduction methods for parametric dynamical systems
• A training set and multiple bases generation approach for parameterized model reduction based on adaptive grids in parameter space
• A weighted empirical interpolation method: a priori convergence analysis and applications
• Active subspace methods in theory and practice: applications to kriging surfaces
• Active subspaces. Emerging ideas for dimension reduction in parameter studies
• Adaptive greedy algorithms based on parameter-domain decomposition and reconstruction for the reduced basis method
• An `empirical interpolation' method: Application to efficient reduced-basis discretization of partial differential equations
• An algorithm for fast optimal Latin hypercube design of experiments
• Certified reduced basis methods and output bounds for the harmonic Maxwell's equations
• Efficient greedy algorithms for high-dimensional parameter spaces with applications to empirical interpolation and reduced basis methods
• Greedy Sampling Using Nonlinear Optimization
• scientific article; zbMATH DE number 1215244 (Why is no real title available?)
• scientific article; zbMATH DE number 3804333 (Why is no real title available?)
• scientific article; zbMATH DE number 2223421 (Why is no real title available?)
• Monte Carlo sampling methods using Markov chains and their applications
• Offline-enhanced reduced basis method through adaptive construction of the surrogate training set
• On the stability of the reduced basis method for Stokes equations in parametrized domains
• Parameter multi-domain `hp' empirical interpolation
• Reduced basis approximation and \textit{a posteriori} error estimation for stress intensity factors
• Reduced basis approximation and a posteriori error estimation for affinely parametrized elliptic coercive partial differential equations. Application to transport and continuum mechanics.
• Reduced basis approximation and error bounds for potential flows in parametrized geometries
• Reduced Basis Error Bound Computation of Parameter-Dependent Navier–Stokes Equations by the Natural Norm Approach
• Reduced Basis Greedy Selection Using Random Training Sets
• Reduced basis method for parametrized elliptic optimal control problems
• Reduced basis methods: from low-rank matrices to low-rank tensors

Cited in

(1)

• Inconsistency removal of reduced bases in parametric model order reduction by matrix interpolation using adaptive sampling and clustering

This page was built for publication: Polytope division method: a scalable sampling method for problems with high-dimensional parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6900198)