The combination technique and some generalisations

DOI10.1016/j.laa.2006.07.014zbMath1109.65052OpenAlexW2010452605MaRDI QIDQ860989

Markus Hegland, Jochen Garcke, Vivien J. Challis

Publication date: 9 January 2007

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.07.014

zbMATH Keywords

numerical experimentssparse gridshigh-dimensional approximationlinear combination of projections

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05)

Related Items (27)

Multi-index Monte Carlo: when sparsity meets sampling ⋮ A multiscale sparse grid finite element method for a two-dimensional singularly perturbed reaction-diffusion problem ⋮ Two-scale sparse finite element approximations ⋮ Applications of CS decomposition in linear combinations of two orthogonal projectors ⋮ A gentle guide to the basics of two projections theory ⋮ A Multigrid Method for Adaptive Sparse Grids ⋮ IGA-based multi-index stochastic collocation for random PDEs on arbitrary domains ⋮ Matrices \(A\) such that \(AA^\dagger-A^\dagger A\) are nonsingular ⋮ Optimal scaling parameters for sparse grid discretizations ⋮ A short proof of a matrix decomposition with applications ⋮ Second Moment Analysis for Robin Boundary Value Problems on Random Domains ⋮ On the algebraic construction of sparse multilevel approximations of elliptic tensor product problems ⋮ High-dimensional approximation with kernel-based multilevel methods on sparse grids ⋮ Two-scale finite element discretizations for nonlinear eigenvalue problems in quantum physics ⋮ AMFR-W Numerical Methods for Solving High-Dimensional SABR/LIBOR PDE Models ⋮ Multivariate polynomial interpolation on lower sets ⋮ Multi-index stochastic collocation convergence rates for random PDEs with parametric regularity ⋮ An introduction to the analysis and implementation of sparse grid finite element methods ⋮ Characterization of discontinuities in high-dimensional stochastic problems on adaptive sparse grids ⋮ Spatially adaptive sparse grids for high-dimensional data-driven problems ⋮ Fitting multidimensional data using gradient penalties and the sparse grid combination technique ⋮ On relationships between two linear subspaces and two orthogonal projectors ⋮ Multi-index stochastic collocation for random PDEs ⋮ A sparse-grid isogeometric solver ⋮ On linear combinations of generalized involutive matrices ⋮ Fault Tolerant Computation with the Sparse Grid Combination Technique ⋮ Opticom and the Iterative Combination Technique for Convex Minimisation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the multi-level splitting of finite element spaces
• Numerical integration using sparse grids
• The rate of convergence for the method of alternating projections. II
• Dimension-adaptive tensor-product quadrature
• Multidimensional smoothing using hyperbolic interpolatory wavelets
• Idempotency of linear combinations of two idempotent matrices
• Idempotency of linear combinations of three idempotent matrices, two of which are disjoint
• Sparse grids
• On Certain Inequalities and Characteristic Value Problems for Analytic Functions and For Functions of Two Variables
• Data mining with sparse grids

This page was built for publication: The combination technique and some generalisations