Optimal scaling parameters for sparse grid discretizations.

DOI10.1002/NLA.1939MaRDI QIDQ2948091zbMATH OpenOpenAlexFDO

Authors Michael Griebel, A. Hullmann, Peter Oswald

Publication date 29 September 2015

Published in Numerical Linear Algebra with Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nla.1939

zbMATH Keywords

algorithmsconvergencescalingsubspace correctionadditive Schwarz preconditioneroptimal conditioningsparse grid systems

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Recommendations

• scientific article; zbMATH DE number 5587346
• Multilevel algorithms for finite difference discretizations on sparse grids
• On additive Schwarz preconditioners for sparse grid discretizations
• Sparse grids
• Optimized general sparse grid approximation spaces for operator equations

Cites work

• scientific article; zbMATH DE number 653220 (Why is no real title available?)
• scientific article; zbMATH DE number 777426 (Why is no real title available?)
• A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
• Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences
• Dimension-adaptive tensor-product quadrature
• Extrapolation, combination, and sparse grid techniques for elliptic boundary value problems
• Fast matrix-vector multiplication in the sparse-grid Galerkin method
• Greedy and randomized versions of the multiplicative Schwarz method
• Iterative Methods by Space Decomposition and Subspace Correction
• Mathematical problems for the next century
• Multilevel Algorithms Considered as Iterative Methods on Semidefinite Systems
• On additive Schwarz preconditioners for sparse grid discretizations
• On the abstract theory of additive and multiplicative Schwarz algorithms
• On the construction of sparse tensor product spaces
• Optimized general sparse grid approximation spaces for operator equations
• Parallel Multilevel Preconditioners
• Scalable frames
• Semidefinite Programming
• Sparse grids
• Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning
• Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems
• The Solution of Multidimensional Real Helmholtz Equations on Sparse Grids
• The combination technique and some generalisations
• The method of alternating projections and the method of subspace corrections in Hilbert space
• Variable additive preconditioning procedures

Cited in

(8)

• A Multigrid Method for Adaptive Sparse Grids
• Polynomials with bounds and numerical approximation
• Stable splittings of Hilbert spaces of functions of infinitely many variables
• Greedy and randomized versions of the multiplicative Schwarz method
• Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
• The exponent of discrepancy of sparse grids is at least 2. 1933
• Subspace correction methods in algebraic multi-level frames
• On the dispersion of sparse grids

This page was built for publication: Optimal scaling parameters for sparse grid discretizations.

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