batchlas::ops::gesvd Namespace Reference

Functions

candidates()

template<class T>

auto batchlas::ops::gesvd::candidates ( )

constexpr

Every compiled choice, in tie-break order (§6.3): native first, vendor last.

Definition at line 22 of file choice.hh.

Types

GesvdChoice

using batchlas::ops::gesvd::GesvdChoice = std::variant<Jacobi, Cta, Blocked, Vendor>

natives need a GPU; cta, blocked: complex only if Hermitian

Definition at line 19 of file choice.hh.

Variables

spec

select::OpSpec batchlas::ops::gesvd::spec {Op::gesvd, select::Lib::solver}

inlineconstexpr

last resort (§5.5): blocked, vendor

Definition at line 24 of file choice.hh.

key_names

std::array<std::string_view, 4> batchlas::ops::gesvd::key_names {"herm:exact", "vec:exact", "m:log:1.5", "n:log:1.5"}

inlineconstexpr

Keys: herm N|L|U and vec none|all|thin (from the CANONICAL jobs) exact; m, n log weight 1.5.

Definition at line 27 of file choice.hh.

grid_mn

std::array<int, 15> batchlas::ops::gesvd::grid_mn {1, 2, 4, 8, 16, 24, 32, 33, 48, 64, 65, 128, 256, 512, 1024}

inlineconstexpr

Both sides of every driver ceiling (32 cta, 64 jacobi) plus a coarse log grid, as tuned/README.md's transcriber.

Definition at line 30 of file choice.hh.

grid_herm

std::array<std::string_view, 3> batchlas::ops::gesvd::grid_herm {"N", "L", "U"}

inlineconstexpr

Definition at line 31 of file choice.hh.

grid_vec

std::array<std::string_view, 3> batchlas::ops::gesvd::grid_vec {"none", "all", "thin"}

inlineconstexpr

Definition at line 32 of file choice.hh.

Classes
struct	Jacobi
	gesvdj_cta: one-sided Jacobi, max(m, n) <= 64, not Hermitian More...
struct	Cta
	gesvd_cta: normal equations + syev_cta, max(m, n) <= 32, not thin More...
struct	Blocked
	gesvd_blocked: bidiagonalisation + bdsdc, or syev_blocked (Lower) More...
struct	Vendor
	backend::gesvd_vendor; needs the solver library More...