A Lipschitz Matrix for Parameter Reduction in Computational Science

DOI10.1137/20M1364850MaRDI QIDQ4997385zbMATH OpenFDO

Authors Jeffrey M. Hokanson, P. Constantine

Publication date 29 June 2021

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

Full work available at URL https://arxiv.org/abs/1906.00105

zbMATH Keywords

uncertainty quantificationridge functiondesign of computer experimentsinformation-based complexityparameter reductionLipschitz matrix

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Analysis of algorithms and problem complexity (68Q25) Special properties of functions of several variables, Hölder conditions, etc. (26B35) Computer science (68-XX)

Recommendations

• Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments
• Parametric optimization for the Lipschitz function
• Symmetry results for decay solutions of elliptic systems in the whole space
• Adaptive sampling with a Lipschitz criterion for accurate metamodeling
• scientific article; zbMATH DE number 4045000

Cites work

• scientific article; zbMATH DE number 192986 (Why is no real title available?)
• scientific article; zbMATH DE number 193625 (Why is no real title available?)
• scientific article; zbMATH DE number 1246413 (Why is no real title available?)
• scientific article; zbMATH DE number 757674 (Why is no real title available?)
• scientific article; zbMATH DE number 757681 (Why is no real title available?)
• scientific article; zbMATH DE number 6125590 (Why is no real title available?)
• A near-stationary subspace for ridge approximation
• ARPACK Users' Guide
• Active subspaces. Emerging ideas for dimension reduction in parameter studies
• An Algorithm for Minimax Approximation in the Nonlinear Case
• Coffee-house designs
• Coordination and Geometric Optimization via Distributed Dynamical Systems
• Data-driven polynomial ridge approximation using variable projection
• Estimating Computational Noise
• Gaussian processes for machine learning.
• Global sensitivity analysis: The primer
• Inverse regression for ridge recovery: a data-driven approach for parameter reduction in computer experiments
• Manifold learning for parameter reduction
• Mini-minimax uncertainty quantification for emulators
• Minimax and maximin space-filling designs: some properties and methods for construction
• Minimax models in the theory of numerical methods. Transl. from the 1989 Russian orig. by Olga Chuyan
• Ridge functions
• The University of Florida sparse matrix collection
• The design and analysis of computer experiments.
• The p-center location problem in an area
• The quickhull algorithm for convex hulls

Cited in

(1)

• Tracking control for the nonlinear complex dynamical network assisted with outgoing links dynamics

Describes a project that uses

Uses Software

• Virtual library
• SparseMatrix
• Qhull
• CVXOPT
• ARPACK

This page was built for publication: A Lipschitz Matrix for Parameter Reduction in Computational Science

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