Optimal scaling parameters for sparse grid discretizations
Publication:2948091
DOI10.1002/nla.1939zbMath1349.65557MaRDI QIDQ2948091
Michael Griebel, Peter Oswald, Alexander Hullmann
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
algorithms; convergence; scaling; additive Schwarz preconditioner; subspace correction; optimal conditioning; sparse grid systems
65N55: Multigrid methods; domain decomposition for boundary value problems involving PDEs
65N12: Stability and convergence of numerical methods for boundary value problems involving PDEs
65F35: Numerical computation of matrix norms, conditioning, scaling
65N50: Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65N06: Finite difference methods for boundary value problems involving PDEs
65N22: Numerical solution of discretized equations for boundary value problems involving PDEs
65F08: Preconditioners for iterative methods
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Greedy and randomized versions of the multiplicative Schwarz method
- Fast matrix-vector multiplication in the sparse-grid Galerkin method
- The combination technique and some generalisations
- Adaptive sparse grid multilevel methods for elliptic PDEs based on finite differences
- Variable additive preconditioning procedures
- On additive Schwarz preconditioners for sparse grid discretizations
- Dimension-adaptive tensor-product quadrature
- Mathematical problems for the next century
- Extrapolation, combination, and sparse grid techniques for elliptic boundary value problems
- On the abstract theory of additive and multiplicative Schwarz algorithms
- Tensor product type subspace splittings and multilevel iterative methods for anisotropic problems
- Scalable frames
- A note on the complexity of solving Poisson's equation for spaces of bounded mixed derivatives
- Convergence of the Two-Point Function of the Stationary TASEP
- Optimized general sparse grid approximation spaces for operator equations
- Parallel Multilevel Preconditioners
- Steepest Descent and Conjugate Gradient Methods with Variable Preconditioning
- Iterative Methods by Space Decomposition and Subspace Correction
- Multilevel Algorithms Considered as Iterative Methods on Semidefinite Systems
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Semidefinite Programming
- The Solution of Multidimensional Real Helmholtz Equations on Sparse Grids
- On the construction of sparse tensor product spaces
- Sparse grids