A short note on standard parallel multigrid algorithms for 3D problems
Copyright policy )A short note on standard parallel multigrid algorithms for 3D problems
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Cologne Germany
vector computation, time complexity, Analysis of algorithms and problem complexity, smoothing, Parallel numerical computation, Numerical solution of discretized equations for boundary value problems involving PDEs, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs, multiprocessor efficiency, Boundary value problems for second-order elliptic equations, lane relaxation, parallel computation, parallel multigrid algorithms
vector computation, time complexity, Analysis of algorithms and problem complexity, smoothing, Parallel numerical computation, Numerical solution of discretized equations for boundary value problems involving PDEs, Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs, multiprocessor efficiency, Boundary value problems for second-order elliptic equations, lane relaxation, parallel computation, parallel multigrid algorithms
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!