Pages that link to "Item:Q4870625"

The following pages link to Total Least Norm Formulation and Solution for Structured Problems (Q4870625):

Displaying 34 items.

• Polynomial computations for blind image deconvolution (Q281962) (← links)
• Computing the radius of controllability for state space systems (Q414570) (← links)
• The computation of multiple roots of a polynomial (Q425345) (← links)
• Structured total least squares approach for efficient frequency estimation (Q551663) (← links)
• High-performance numerical algorithms and software for structured total least squares (Q556259) (← links)
• A parameter estimation method for model analysis (Q854450) (← links)
• A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
• Solving polynomial systems via symbolic-numeric reduction to geometric involutive form (Q1006657) (← links)
• Robust counterparts of errors-in-variables problems (Q1020910) (← links)
• Solving total least-squares problems in information retrieval (Q1587280) (← links)
• Total least norm solution for linear structured EIV model (Q1735401) (← links)
• Efficient implementation of a structured total least squares based speech compression method (Q1874673) (← links)
• A regularized structured total least squares algorithm for high-resolution image reconstruction (Q1888338) (← links)
• Implementation of the regularized structured total least squares algorithms for blind image deblurring (Q1888346) (← links)
• Multiple delays estimation for chirp signals using structured total least squares (Q1888349) (← links)
• A novel dictionary learning method based on total least squares approach with application in high dimensional biological data (Q2051573) (← links)
• Semi-blind image deblurring by a proximal alternating minimization method with convergence guarantees (Q2177872) (← links)
• Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms (Q2253087) (← links)
• Computing lower rank approximations of matrix polynomials (Q2284958) (← links)
• Robustness of a discrete dynamical process with a given set of attainability (Q2391514) (← links)
• A structure-preserving matrix method for the deconvolution of two Bernstein basis polynomials (Q2396283) (← links)
• Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
• A method for structured linear total least norm on blind deconvolution problem (Q2574332) (← links)
• Solution of the linear regression problem using matrix correction methods in the \(l_1\) metric (Q2630003) (← links)
• Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach (Q2656632) (← links)
• An alternating semiproximal method for nonconvex regularized structured total least squares problems (Q2818270) (← links)
• The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
• (Q4530418) (← links)
• (Q4714342) (← links)
• Accurate solution of polynomial equations using Macaulay resultant matrices (Q4821046) (← links)
• A Convex Relaxation to Compute the Nearest Structured Rank Deficient Matrix (Q4994436) (← links)
• The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
• An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
• Regularized and structured tensor total least squares methods with applications (Q6614698) (← links)