Low-rank approximation. Algorithms, implementation, applications
From MaRDI portal
Recommendations
Cited in
(35)- Convex low rank approximation
- Optimal approximation with exponential sums by a maximum likelihood modification of Prony's method
- Low-rank and sparse matrices fitting algorithm for low-rank representation
- Modifications of Prony's method for the recovery and sparse approximation with generalized exponential sums
- On the comparison of LES data-driven reduced order approaches for hydroacoustic analysis
- On the behavior of autonomous Wiener systems
- Blind deconvolution of covariance matrix inverses for autoregressive processes
- Structured low-rank approximation and its applications
- Exact solutions in low-rank approximation with zeros
- On low rank approximation of linear operators in p-norms and some algorithms
- Algorithms and Literate Programs for Weighted Low-Rank Approximation with Missing Data
- Nonlinearly structured low-rank approximation
- Real-Valued, Low Rank, Circulant Approximation
- Low-Rank PSD Approximation in Input-Sparsity Time
- A convex relaxation to compute the nearest structured rank deficient matrix
- A hybrid penalty method for a class of optimization problems with multiple rank constraints
- A PTAS for ℓp-Low Rank Approximation
- A Convex Approach to Superresolution and Regularization of Lines in Images
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials
- Accurate and fast matrix factorization for low-rank learning.
- Structured low-rank approximation for nonlinear matrices
- Low rank approximation. Algorithms, implementation, applications
- MIMO system identification using common denominator and numerators with known degrees
- Finite-data nonparametric frequency response evaluation without leakage
- Particularities and commonalities of singular spectrum analysis as a method of time series analysis and signal processing
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation
- An inexact regularized proximal Newton method without line search
- Implementation improvements and extensions of an ODE-based algorithm for structured low-rank approximation
- The most powerful unfalsified linear parameter-varying model
- Bayesian analysis for varying coefficient autoregressive models
- Solving matrix nearness problems via Hamiltonian systems, matrix factorization, and optimization
- Balanced Fibonacci word rectangles, and beyond
- Relaxed NewtonSLRA for approximate GCD
- Left vs, right representations for solving weighted low-rank approximation problems
This page was built for publication: Low-rank approximation. Algorithms, implementation, applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1795645)
