Pages that link to "Item:Q1095586"
From MaRDI portal
The following pages link to An efficient and reliable algorithm for computing the singular subspace of a matrix, associated with its smallest singular values (Q1095586):
Displaying 13 items.
- Partial total least squares algorithm (Q751180) (← links)
- A fast algorithm for the recursive calculation of dominant singular subspaces (Q932707) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- On the computation of the rank of block bidiagonal Toeplitz matrices (Q1012505) (← links)
- The partial total least squares algorithm (Q1098234) (← links)
- Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values (Q1176528) (← links)
- An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition (Q1208058) (← links)
- Iterative computation of the smallest singular value and the corresponding singular vectors of a matrix. (Q1406278) (← links)
- A hybrid method for computing the intersection and tangency points of plane curves (Q2250221) (← links)
- Partial singular value decomposition algorithm (Q2641073) (← links)
- Clusters in Markov chains via singular vectors of Laplacian matrices (Q2680586) (← links)
- Numerical and Symbolical Methods for the GCD of Several Polynomials (Q2913160) (← links)
- The Weierstrass Canonical Form of a Regular Matrix Pencil: Numerical Issues and Computational Techniques (Q3615673) (← links)
