A fast algorithm for the recursive calculation of dominant singular subspaces (Q932707): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.cam.2006.12.032
+Normal rank
@@ Property / OpenAlex ID @@
+W2013169943
@@ Property / OpenAlex ID: W2013169943 / rank @@
+Normal rank
@@ Property / cites work @@
+Recursive Calculation of Dominant Singular Subspaces
+Normal rank
@@ Property / cites work @@
+Q3359644
@@ Property / cites work: Q3359644 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the eigenvectors of a class of structured matrices
+Normal rank
@@ Property / cites work @@
+A note on the recursive calculation of dominant singular subspaces
+Normal rank
@@ Property / cites work @@
+Two-way bidiagonalization scheme for downdating the singular-value decomposition
+Normal rank
@@ Property / cites work @@
+Q4495094
@@ Property / cites work: Q4495094 / rank @@
+Normal rank
@@ Property / cites work @@
+Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values
+Normal rank
@@ Property / cites work @@
+Parallel tri- and bi-diagonalization of bordered bidiagonal matrices
+Normal rank
@@ Property / cites work @@
+An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values
+Normal rank