One block of bidiagonal_divide's tree: the bidiagonal it decomposes (its own copies scaled by a power of two, or its parent's), the two halves it splits into, and its decomposition once solved.
More...
#include <svd.hpp>
|
| const double * | d {} |
| | The diagonal it is solved on.
|
| |
| const double * | e {} |
| | The superdiagonal it is solved on.
|
| |
| std::size_t | n {} |
| | Its rows.
|
| |
| std::size_t | extra {} |
| | Its columns past its rows, 0 or 1.
|
| |
| int | exponent {0} |
| | The power of two it is scaled down by.
|
| |
| buffer< double > | scaled_d {} |
| | The scaled diagonal, when exponent is not 0.
|
| |
| buffer< double > | scaled_e {} |
| | The scaled superdiagonal, when exponent is not 0.
|
| |
| std::size_t | k {0} |
| | The row it splits at; 0 for a leaf.
|
| |
| std::size_t | first {} |
| | The block above row k.
|
| |
| std::size_t | second {} |
| | The block below row k.
|
| |
| std::size_t | depth {} |
| | Its distance from the root.
|
| |
| buffer< double > | sigma {} |
| | Its singular values, ascending.
|
| |
| buffer< double > | u {} |
| | Its left singular vectors, as columns.
|
| |
| buffer< double > | v {} |
| | Its right singular vectors, as columns.
|
| |
One block of bidiagonal_divide's tree: the bidiagonal it decomposes (its own copies scaled by a power of two, or its parent's), the two halves it splits into, and its decomposition once solved.
Definition at line 1219 of file svd.hpp.
The diagonal it is solved on.
Definition at line 1221 of file svd.hpp.
◆ depth
| std::size_t numerical::detail::bidiagonal_node::depth {} |
Its distance from the root.
Definition at line 1231 of file svd.hpp.
The superdiagonal it is solved on.
Definition at line 1222 of file svd.hpp.
◆ exponent
| int numerical::detail::bidiagonal_node::exponent {0} |
The power of two it is scaled down by.
Definition at line 1225 of file svd.hpp.
◆ extra
| std::size_t numerical::detail::bidiagonal_node::extra {} |
Its columns past its rows, 0 or 1.
Definition at line 1224 of file svd.hpp.
◆ first
| std::size_t numerical::detail::bidiagonal_node::first {} |
The block above row k.
Definition at line 1229 of file svd.hpp.
| std::size_t numerical::detail::bidiagonal_node::k {0} |
The row it splits at; 0 for a leaf.
Definition at line 1228 of file svd.hpp.
| std::size_t numerical::detail::bidiagonal_node::n {} |
◆ scaled_d
| buffer<double> numerical::detail::bidiagonal_node::scaled_d {} |
The scaled diagonal, when exponent is not 0.
Definition at line 1226 of file svd.hpp.
◆ scaled_e
| buffer<double> numerical::detail::bidiagonal_node::scaled_e {} |
The scaled superdiagonal, when exponent is not 0.
Definition at line 1227 of file svd.hpp.
◆ second
| std::size_t numerical::detail::bidiagonal_node::second {} |
The block below row k.
Definition at line 1230 of file svd.hpp.
◆ sigma
Its singular values, ascending.
Definition at line 1232 of file svd.hpp.
Its left singular vectors, as columns.
Definition at line 1233 of file svd.hpp.
Its right singular vectors, as columns.
Definition at line 1234 of file svd.hpp.
The documentation for this struct was generated from the following file: