Loading...
Searching...
No Matches
aigenlib.hpp
Go to the documentation of this file.
153Matrix solve_symmetric(const Matrix& system, const Matrix& right, SolveMethod* method = nullptr);
208double expected_reduction(const Matrix& covariance, const std::vector<bool>& mask, const Sensor& sensor);
226void condition(Matrix& covariance, Vector* mean, const Sensor& sensor, const Vector* measurement);
std::size_t cols() const noexcept
Column count.
Definition aigenlib.cpp:241
Matrix & operator=(const Matrix &other)
Deep assignment with strong exception guarantee.
Definition aigenlib.cpp:223
std::size_t size() const noexcept
Allocated scalar count.
Definition aigenlib.cpp:242
double * row_data(std::size_t row)
Borrow a row.
Definition aigenlib.cpp:251
double trace() const
Sum a square matrix's diagonal.
Definition aigenlib.cpp:262
bool finite() const noexcept
Validate all stored scalars.
Definition aigenlib.cpp:259
Definition aigenlib.cpp:42
Vector observe(const Sensor &sensor, const Vector &field)
Average field values through a sensor.
Definition aigenlib.cpp:376
Matrix matern32(const std::vector< Point > &positions, double sigma2, double lengthscale)
Construct a symmetric Matern-3/2 covariance over supplied positions.
Definition aigenlib.cpp:324
double expected_reduction(const Matrix &covariance, const std::vector< bool > &mask, const Sensor &sensor)
Sum the masked posterior diagonal reduction without modifying belief.
Definition aigenlib.cpp:388
Matrix project(const Sensor &sensor, const Matrix &covariance)
Project covariance through sparse averaging rows: B = H P.
Definition aigenlib.cpp:342
std::vector< double > Vector
Owning scalar vector; size validation belongs to the consuming operation.
Definition aigenlib.hpp:37
Matrix solve_symmetric(const Matrix &system, const Matrix &right, SolveMethod *method)
Solve a finite symmetric system with multiple right-hand sides.
Definition aigenlib.cpp:269
constexpr double pseudoinverse_relative_cutoff
Relative spectral cutoff shared with the Eigen reference implementation.
Definition aigenlib.hpp:35
SolveMethod
Factorization selected for a solve.
Definition aigenlib.hpp:135
@ cholesky
Positive-definite triangular factorization.
Definition aigenlib.hpp:136
@ pseudoinverse
Signed spectral inverse with null-mode truncation.
Definition aigenlib.hpp:137
void condition(Matrix &covariance, Vector *mean, const Sensor &sensor, const Vector *measurement)
Condition a GP in place with optional measurement assimilation.
Definition aigenlib.cpp:409
constexpr std::size_t max_extent
Maximum matrix extent, matching the current dense GP grid ceiling.
Definition aigenlib.hpp:33
Matrix innovation(const Sensor &sensor, const Matrix &projected)
Construct innovation covariance S = H P H^T + R from B = H P.
Definition aigenlib.cpp:359
std::array< double, 3 > coordinates
East, north, altitude.
Definition aigenlib.hpp:44
bool finite() const noexcept
Check every coordinate.
Definition aigenlib.cpp:197
Point(double east=0.0, double north=0.0, double altitude=0.0)
Construct a point.
Definition aigenlib.cpp:187
double norm() const noexcept
Euclidean length.
Definition aigenlib.cpp:196
Vector variances
Finite nonnegative independent noise variances.
Definition aigenlib.hpp:163
std::vector< std::vector< int > > rows
Cell indices in each measurement.
Definition aigenlib.hpp:162