Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs

DOI10.1016/j.jcp.2020.109326zbMath1435.65166arXiv1812.04387OpenAlexW3008455412MaRDI QIDQ778295

Qifeng Liao, Kejun Tang

Publication date: 2 July 2020

Published in: Journal of Computational Physics (Search for Journal in Brave)

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

zbMATH Keywords

model reductionPDEsuncertainty quantificationtensor recovery

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) PDEs with randomness, stochastic partial differential equations (35R60)

Uses Software

• IFISS

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• Tensor Decompositions and Applications
• A weighted \(\ell_1\)-minimization approach for sparse polynomial chaos expansions
• A non-adapted sparse approximation of PDEs with stochastic inputs
• Kernel principal component analysis for stochastic input model generation
• The multi-element probabilistic collocation method (ME-PCM): Error analysis and applications
• A survey of cross-validation procedures for model selection
• An adaptive hierarchical sparse grid collocation algorithm for the solution of stochastic differential equations
• Bayesian emulation of complex multi-output and dynamic computer models
• Manifold learning for the emulation of spatial fields from computational models
• Generalized principal component analysis
• On the global and linear convergence of the generalized alternating direction method of multipliers
• A gradient enhanced \(\ell_{1}\)-minimization for sparse approximation of polynomial chaos expansions
• Riemannian Optimization for High-Dimensional Tensor Completion
• Finite Elements and Fast Iterative Solvers
• A Stochastic Collocation Algorithm with Multifidelity Models
• Stochastic Collocation Methods on Unstructured Grids in High Dimensions via Interpolation
• Tensor completion and low-n-rank tensor recovery via convex optimization
• Constructing Surrogate Models of Complex Systems with Enhanced Sparsity: Quantifying the Influence of Conformational Uncertainty in Biomolecular Solvation
• Block-diagonal preconditioning for spectral stochastic finite-element systems
• On Generating Orthogonal Polynomials
• A Multilinear Singular Value Decomposition
• The Wiener--Askey Polynomial Chaos for Stochastic Differential Equations
• IFISS: A Computational Laboratory for Investigating Incompressible Flow Problems
• A Generalized Sampling and Preconditioning Scheme for Sparse Approximation of Polynomial Chaos Expansions
• Variance-Based Global Sensitivity Analysis via Sparse-Grid Interpolation and Cubature
• STOCHASTIC COLLOCATION ALGORITHMS USING l1-MINIMIZATION
• High-Order Collocation Methods for Differential Equations with Random Inputs
• A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data

This page was built for publication: Rank adaptive tensor recovery based model reduction for partial differential equations with high-dimensional random inputs