Allocation Strategies for High Fidelity Models in the Multifidelity Regime
From MaRDI portal
Publication:5228354
DOI10.1137/17M1144714zbMath1418.65059arXiv1812.11601OpenAlexW2962784284WikidataQ128310697 ScholiaQ128310697MaRDI QIDQ5228354
Robert M. Kirby, Ross T. Whitaker, Daniel Perry, Akil C. Narayan
Publication date: 12 August 2019
Published in: SIAM/ASA Journal on Uncertainty Quantification (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.11601
Related Items
Multifidelity modeling for physics-informed neural networks (PINNs), Coarse-proxy reduced basis methods for integral equations, Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
Uses Software
Cites Work
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- CUR matrix decompositions for improved data analysis
- Efficient topology optimization in MATLAB using 88 lines of code
- Topology optimization in aircraft and aerospace structures design
- Practical error bounds for a non-intrusive bi-fidelity approach to parametric/stochastic model reduction
- Nektar++: an open-source spectral/\(hp\) element framework
- Column subset selection is NP-complete
- Numerical methods for solving linear least squares problems
- Optimal Model Management for Multifidelity Monte Carlo Estimation
- A Stochastic Collocation Algorithm with Multifidelity Models
- Computational Aspects of Stochastic Collocation with Multifidelity Models
- Some Applications of the Rank Revealing QR Factorization
- Input Sparsity Time Low-rank Approximation via Ridge Leverage Score Sampling
- Nonlinear information fusion algorithms for data-efficient multi-fidelity modelling
- Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
- Convergence Acceleration for Time-Dependent Parametric Multifidelity Models
- On the Compression of Low Rank Matrices
- Model Selection and Estimation in Regression with Grouped Variables
- Near-Optimal Column-Based Matrix Reconstruction
- Supersensitivity due to uncertain boundary conditions
- A fast unified algorithm for solving group-lasso penalize learning problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
