[P]arallel [Hi]gh-order [Li]brary for [P]DEs
Latest
Parallel High-Order Library for PDEs through hp-adaptive Discontinuous Galerkin methods
|
Nearest neighbors. More...
#include <nearest_neighbors.h>
Public Member Functions | |
NearestNeighbors () | |
Constructor. | |
void | update_snapshots (const MatrixXd &snapshot_parameters, dealii::LinearAlgebra::distributed::Vector< double > snapshot) |
Add snapshot. | |
MatrixXd | kPairwiseNearestNeighborsMidpoint () |
Find midpoint of all snapshot locations. | |
MatrixXd | kNearestNeighborsMidpoint (const RowVectorXd &point) |
Given a point, returns midpoint between point and k nearest snapshots, where k is 1+num_parameters. | |
dealii::LinearAlgebra::distributed::Vector< double > | nearestNeighborMidpointSolution (const RowVectorXd &point) |
Public Attributes | |
MatrixXd | snapshot_params |
Snapshot parameters. | |
MatrixXd | scaled_snapshot_params |
Scaled snapshot parameters. | |
MinMaxScaler | scaler |
Scaler. | |
std::vector< dealii::LinearAlgebra::distributed::Vector< double > > | snapshots |
Vector containing all snapshots. | |
Nearest neighbors.
Definition at line 15 of file nearest_neighbors.h.