Find link

language:

jump to random article

Find link is a tool written by Edward Betts.

searching for Low-rank approximation 13 found (31 total)

alternate case: low-rank approximation

Russian Geometric Kernel (412 words) [view diff] exact match in snippet view article find links to article

First Full-Featured Version". ledas.com. Gatilov, S. (2014). "Using low-rank approximation of the Jacobian matrix in the Newton-Raphson method to solve certain
Interpolative decomposition (376 words) [view diff] exact match in snippet view article find links to article
Rokhlin, V., & Tygert, M. (2007). Randomized algorithms for the low-rank approximation of matrices. Proceedings of the National Academy of Sciences, 104(51)
Christiaan Heij (593 words) [view diff] exact match in snippet view article find links to article
Mathematics Genealogy Project Markovsky, Ivan (2008). "Structured low-rank approximation and its applications". Automatica. 44 (4): 891–909. doi:10.1016/j
Non-uniform discrete Fourier transform (2,447 words) [view diff] exact match in snippet view article find links to article
based on oversampling and interpolation, min-max interpolation, and low-rank approximation. In general, NUFFTs leverage the FFT by converting the nonuniform
Daniel Kressner (601 words) [view diff] exact match in snippet view article find links to article
linear eigenvalue problems, nonlinear eigenvalue problems, and low-rank approximation techniques for matrix problems. He has been awarded a second Leslie
Basis pursuit denoising (598 words) [view diff] exact match in snippet view article find links to article
"Forward Backward Algorithm". Archived from the original on February 16, 2014. A list of BPDN solvers at the sparse- and low-rank approximation wiki.
Euclidean distance matrix (2,440 words) [view diff] no match in snippet view article find links to article
distances can then be found by semidefinite approximation (and low rank approximation, if desired) using linear algebraic tools such as singular value
K-means clustering (7,754 words) [view diff] no match in snippet view article find links to article
Madalina (2014). "Dimensionality reduction for k-means clustering and low rank approximation (Appendix B)". arXiv:1410.6801 [cs.DS]. Little, Max A.; Jones, Nick
Support vector machine (9,068 words) [view diff] exact match in snippet view article find links to article
avoid solving a linear system involving the large kernel matrix, a low-rank approximation to the matrix is often used in the kernel trick. Another common
Asoke K. Nandi (1,041 words) [view diff] exact match in snippet view article find links to article
2018.2796074, vol. 26, no. 5, pp. 3027-3041, 2018. F Cong et al., "Low-rank approximation based non-negative multi-way array decomposition of event-related
LU decomposition (8,625 words) [view diff] no match in snippet view article find links to article
{\displaystyle A=LU} is a Crout decomposition. It is possible to find a low rank approximation to an LU decomposition using a randomized algorithm. Given an input
Tensor rank decomposition (6,308 words) [view diff] case mismatch in snippet view article find links to article
Lim, L. (2008). "Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem". SIAM Journal on Matrix Analysis and Applications. 30 (3):
Kernel embedding of distributions (9,762 words) [view diff] exact match in snippet view article find links to article
Gram matrix may be computationally demanding. Through use of a low-rank approximation of the Gram matrix (such as the incomplete Cholesky factorization)