scientific article
From MaRDI portal
Publication:3444931
zbMath1120.68092MaRDI QIDQ3444931
Publication date: 5 June 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear systemspattern recognitioneigenvaluestextbooksingular valuesdata miningleast squares problemsmatrix decompositionsQR algorithms
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Iterative numerical methods for linear systems (65F10) Packaged methods for numerical algorithms (65Y15) Orthogonalization in numerical linear algebra (65F25) Computing methodologies for text processing; mathematical typography (68U15)
Related Items (66)
Exact penalization for cardinality and rank-constrained optimization problems via partial regularization ⋮ Convergence of a second order Markov chain ⋮ Sparsest factor analysis for clustering variables: a matrix decomposition approach ⋮ On extremum properties of orthogonal quotients matrices ⋮ Unnamed Item ⋮ Extension of Moore–Penrose inverse of tensor via Einstein product ⋮ Unnamed Item ⋮ Exact low-rank matrix completion from sparsely corrupted entries via adaptive outlier pursuit ⋮ Tensor-train decomposition for image recognition ⋮ Guarantees of Riemannian optimization for low rank matrix completion ⋮ Subspace learning for unsupervised feature selection via matrix factorization ⋮ Approximation of rank function and its application to the nearest low-rank correlation matrix ⋮ An alternating minimization method for matrix completion problems ⋮ Computing Low-Rank Approximations of Large-Scale Matrices with the Tensor Network Randomized SVD ⋮ Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation ⋮ Implicit steepest descent algorithm for optimization with orthogonality constraints ⋮ Krylov-type methods for tensor computations.I ⋮ Solution set bounds for LCPs over tensor spaces ⋮ Generalized bilateral inverses of tensors via Einstein product with applications to singular tensor equations ⋮ Matrix completion with column outliers and sparse noise ⋮ Hybrid iterative refined restarted Lanczos bidiagonalization methods ⋮ Low-rank incremental methods for computing dominant singular subspaces ⋮ Pass-efficient truncated UTV for low-rank approximations ⋮ Eigenvalue analyses on the memoryless Davidon-Fletcher-Powell method based on a spectral secant equation ⋮ Explicit deflation in Golub-Kahan-Lanczos bidiagonalization methods ⋮ A Learnable Group-Tube Transform Induced Tensor Nuclear Norm and Its Application for Tensor Completion ⋮ Detecting low-rank clusters via random sampling ⋮ On computing HITS ExpertRank via lumping the hub matrix ⋮ Low rank matrix completion by alternating steepest descent methods ⋮ Solving a low-rank factorization model for matrix completion by a nonlinear successive over-relaxation algorithm ⋮ The MM alternative to EM ⋮ Accelerated low rank matrix approximate algorithms for matrix completion ⋮ Practical acceleration for computing the HITS expertrank vectors ⋮ Predictor relative importance and matching regression parameters ⋮ A singular value thresholding with diagonal-update algorithm for low-rank matrix completion ⋮ A gradient based iterative solutions for Sylvester tensor equations ⋮ The Drazin inverse of an even-order tensor and its application to singular tensor equations ⋮ The two-stage iteration algorithms based on the shortest distance for low-rank matrix completion ⋮ SVD based initialization: A head start for nonnegative matrix factorization ⋮ Self-adjoint fourth order differential operators with eigenvalue parameter dependent and periodic boundary conditions ⋮ PCA and SVD with nonnegative loadings ⋮ Matrix rank and inertia formulas in the analysis of general linear models ⋮ Factor analysis of ordinal data via decomposition of matrices with grades ⋮ Interval tensors and their application in solving multi-linear systems of equations ⋮ A singular value decomposition algorithm based on solving hyperplane constrained nonlinear systems ⋮ Toeplitz matrix completion via smoothing augmented Lagrange multiplier algorithm ⋮ Efficient methods for grouping vectors into low-rank clusters ⋮ Weighted Moore-Penrose inverses and fundamental theorem of even-order tensors with Einstein product ⋮ Numerical study on Moore-Penrose inverse of tensors via Einstein product ⋮ Fundamental conditions on the sampling pattern for union of low-rank subspaces retrieval ⋮ MANOVA, LDA, and FA criteria in clusters parameter estimation ⋮ Least Angle Regression and LASSO for Large Datasets ⋮ Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition ⋮ Magic square spectra ⋮ Guarantees of Riemannian Optimization for Low Rank Matrix Recovery ⋮ Unnamed Item ⋮ A new method based on the manifold-alternative approximating for low-rank matrix completion ⋮ Triangular decomposition of CP factors of a third-order tensor with application to solving nonlinear systems of equations ⋮ A semi-smoothing augmented Lagrange multiplier algorithm for low-rank Toeplitz matrix completion ⋮ Efficient proximal mapping computation for low-rank inducing norms ⋮ Spanning tree packing number and eigenvalues of graphs with given girth ⋮ An alternating minimization method for robust principal component analysis ⋮ A Krylov-Schur-like method for computing the best rank-\((r_1,r_2,r_3)\) approximation of large and sparse tensors ⋮ Semi-sparse PCA ⋮ A low-rank tensor-based algorithm for face recognition ⋮ Unnamed Item
Uses Software
This page was built for publication:
