An improved multigrid algorithm for n-irregular meshes with subspace correction smoother.
Eugenio AulisaSara CalandriniGiacomo CapodaglioPublished in: Comput. Math. Appl. (2018)
Keyphrases
- preprocessing
- learning algorithm
- experimental evaluation
- worst case
- computational complexity
- multiresolution
- dynamic programming
- computational cost
- detection algorithm
- high accuracy
- input data
- optimization algorithm
- multiscale
- cost function
- delaunay triangulation
- objective function
- recognition algorithm
- times faster
- matching algorithm
- clustering method
- np hard
- significant improvement
- k means
- segmentation algorithm
- computationally efficient
- decision trees
- neural network
- subspace clustering
- search space