Neumann-Neumann decomposition plus mass lumping enables fast sampling of Gaussian random fields on metric graphs while preserving theoretical convergence rates of the underlying finite-element scheme.
Springer Berlin Heidelberg (2005)
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
math.NA 2verdicts
UNVERDICTED 2representative citing papers
A local multilevel preconditioned Jacobi-Davidson solver for singular elliptic eigenvalue problems on adaptive meshes achieves O(N) complexity and uniform convergence independent of mesh level and coefficient discontinuities.
citing papers explorer
-
Efficient generation of Gaussian random fields on metric graphs via domain decomposition and mass matrix lumping
Neumann-Neumann decomposition plus mass lumping enables fast sampling of Gaussian random fields on metric graphs while preserving theoretical convergence rates of the underlying finite-element scheme.
-
Local Multilevel Preconditioned Jacobi-Davidson Method for Elliptic Eigenvalue Problems on Adaptive Meshes
A local multilevel preconditioned Jacobi-Davidson solver for singular elliptic eigenvalue problems on adaptive meshes achieves O(N) complexity and uniform convergence independent of mesh level and coefficient discontinuities.