#include <memory_resource>
#include <tuple>
#include <nk/value/value.hpp>

Go to the source code of this file.

Functions
Value	nk::linalg::chol (const Value &A, std::pmr::memory_resource *mr=nullptr)
	Cholesky factorisation (R = chol(A)).
std::tuple< Value, Value, Value >	nk::linalg::lu_decompose (const Value &A, std::pmr::memory_resource *mr=nullptr)
	LU with partial pivoting ([L, U, P] = lu_decompose(A)).
Value	nk::linalg::lu_combined (const Value &A, std::pmr::memory_resource *mr=nullptr)
	Combined L+U output (LU = lu(A) single-output form).
std::tuple< Value, Value >	nk::linalg::qr_decompose (const Value &A, std::pmr::memory_resource *mr=nullptr)
	QR via Householder reflections ([Q, R] = qr_decompose(A)).
Value	nk::linalg::qr_R_only (const Value &A, std::pmr::memory_resource *mr=nullptr)
	R-only QR output (R = qr(A) single-output form).
std::tuple< Value, Value, Value >	nk::linalg::svd_decompose (const Value &A, std::pmr::memory_resource *mr=nullptr)
	Singular value decomposition ([U, S, V] = svd_decompose(A)).
Value	nk::linalg::svd_values (const Value &A, std::pmr::memory_resource *mr=nullptr)
	Singular values only (s = svd(A) single-output form).
std::tuple< Value, Value >	nk::linalg::qrupdate (const Value &Q, const Value &R, const Value &u, const Value &v, std::pmr::memory_resource *mr=nullptr)
	Rank-1 QR update ([Q1, R1] = qrupdate(Q, R, u, v)).
std::tuple< Value, Value >	nk::linalg::qrinsert (const Value &Q, const Value &R, std::size_t k_1based, const Value &x, std::pmr::memory_resource *mr=nullptr)
	Insert column into QR ([Q1, R1] = qrinsert(Q, R, k, x)).
std::tuple< Value, Value >	nk::linalg::qrdelete (const Value &Q, const Value &R, std::size_t k_1based, std::pmr::memory_resource *mr=nullptr)
	Delete column from QR ([Q1, R1] = qrdelete(Q, R, k)).
Value	nk::linalg::cholupdate (const Value &R, const Value &x, int sign=1, std::pmr::memory_resource *mr=nullptr)
	Rank-1 Cholesky update / downdate (R1 = cholupdate(R, x[, sign])).

Functions