Structured Total Least Norm for Nonlinear Problems
From MaRDI portal
Recommendations
Cited in
(21)- Structured total least squares and \(L_ 2\) approximation problems
- Signal identification using a least L₁ norm algorithm
- Total least norm solution for linear structured EIV model
- The Sylvester and Bézout resultant matrices for blind image deconvolution
- Exponential modeling with unknown model order using structured nonlinear total least norm
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain
- Computing lower rank approximations of matrix polynomials
- A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials
- A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
- An alternating semiproximal method for nonconvex regularized structured total least squares problems
- Polynomial computations for blind image deconvolution
- A quadratically convergent algorithm for structured low-rank approximation
- The Sylvester Resultant Matrix and Image Deblurring
- The computation of multiple roots of a polynomial
- scientific article; zbMATH DE number 1058095 (Why is no real title available?)
- Signal identification using a modify structured nonlinear total least norm algorithm
- Structured low-rank approximation for nonlinear matrices
- Computationally efficient selection criterion of initial equation in STLN-based structured low-rank approximation
- A Geometry-Adaptive Regularized Newton-Type Method for Manifold-Affine Intersection Problems
- A parameter estimation method for model analysis
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix
This page was built for publication: Structured Total Least Norm for Nonlinear Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243490)
