Partial singular value decomposition algorithm (Q2641073): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Improved Algorithm for Computing the Singular Value Decomposition / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The partial total least squares algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Basic Linear Algebra Subprograms for Fortran Usage / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3932291 / rank | |||
Normal rank | |||
Latest revision as of 13:45, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Partial singular value decomposition algorithm |
scientific article |
Statements
Partial singular value decomposition algorithm (English)
0 references
1990
0 references
This is library description for a partial singular value decomposition algorithm. It computes the left/right singular subspaces corresponding to the smallest singular values below a user-defined limit. Supplied are: Calling sequence and parameters, short method description, references and an example.
0 references
total least squares
0 references
null space
0 references
library description
0 references
partial singular value decomposition algorithm
0 references
left/right singular subspaces
0 references
