Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 5168246 (Why is no real title available?)
- scientific article; zbMATH DE number 3367052 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A gradient system approach for Hankel structured low-rank approximation
- A quadratically convergent algorithm for structured low-rank approximation
- Factorization approach to structured low-rank approximation with applications
- Fast and stable modification of the Gauss–Newton method for low‐rank signal estimation
- Hankel low-rank approximation and completion in time series analysis and forecasting: a brief review
- Low rank approximation of a Hankel matrix by structured total least norm
- Signal enhancement-a composite property mapping algorithm
- Structured Total Least Norm for Nonlinear Problems
- Structured low-rank approximation: optimization on matrix manifold approach
- Structured total least norm and approximate GCDs of inexact polynomials
- Total Least Norm Formulation and Solution for Structured Problems
- Toward the best algorithm for approximate GCD of univariate polynomials
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials
- Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
- Variable projection methods for approximate (greatest) common divisor computations
This page was built for publication: Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6972791)
