build_first_coarse_grid_candidate.h File Reference

Definition of build_first_coarse_grid_candidate function. More...

#include <limits>
#include <optional>
#include "num_collect/base/index_type.h"
#include "num_collect/linear/impl/amg/node_connection_list.h"
#include "num_collect/linear/impl/amg/node_layer.h"
#include "num_collect/util/vector.h"

Include dependency graph for build_first_coarse_grid_candidate.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Namespaces
namespace	num_collect
	Namespace of num_collect source codes.
namespace	num_collect::linear
	Namespace of solvers of linear equations.
namespace	num_collect::linear::impl
	Namespace of internal implementations.
namespace	num_collect::linear::impl::amg
	Namespace of internal implementations of algebraic multigrid method [24].

Functions
template<typename StorageIndex >
auto	num_collect::linear::impl::amg::build_first_coarse_grid_candidate (const node_connection_list< StorageIndex > &connections, const node_connection_list< StorageIndex > &transposed_connections) -> util::vector< node_layer >
	Build the first candidate of a coarse grid.
template<typename StorageIndex >
auto	num_collect::linear::impl::amg::compute_node_scores (const node_connection_list< StorageIndex > &transposed_connections) -> util::vector< StorageIndex >
	Compute the first scores of nodes.
template<typename StorageIndex >
auto	num_collect::linear::impl::amg::find_max_score_index (const util::vector< StorageIndex > &scores, const util::vector< node_layer > &classification) -> std::optional< index_type >
	Find the index of the maximum score among unclassified nodes.

Detailed Description

Definition of build_first_coarse_grid_candidate function.

Definition in file build_first_coarse_grid_candidate.h.