Variable projection methods for approximate (greatest) common divisor computations (Q2357371): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Common factor estimation and two applications in signal processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blind image deconvolution via fast approximate GCD / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of approximate polynomial GCDs and an extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subdivision method for computing nearest gcd with certification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical greatest common divisor of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Differentiation of Pseudo-Inverses and Nonlinear Least Squares Problems Whose Variables Separate / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common factor detection and estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid method for computing the nearest singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest singular univariate polynomials with given root multiplicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate gcds of polynomials and sparse SOS relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low-rank approximation and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured total least norm and approximate GCDs of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved non-linear method for the computation of a structured low rank approximation of the Sylvester resultant matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization Approach to Structured Low-Rank Approximation with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software for weighted structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratically convergent algorithm for structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solutions in Structured Low-Rank Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Low-Rank Approximation with Missing Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5491447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on a Grassmann manifold with application to system identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3096060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix pencil methodologies for computing the greatest common divisor of polynomials: hybrid algorithms and their performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Spectra of Hermitian Block Toeplitz Matrices and Preconditioning Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124106 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frequency domain system identification with missing data / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ERES method for computing the approximate GCD of several polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods for Toeplitz-like matrices and operators / rank
 
Normal rank

Revision as of 22:49, 13 July 2024

scientific article
Language Label Description Also known as
English
Variable projection methods for approximate (greatest) common divisor computations
scientific article

    Statements

    Variable projection methods for approximate (greatest) common divisor computations (English)
    0 references
    0 references
    0 references
    13 June 2017
    0 references
    structured low-rank approximation
    0 references
    variable projection
    0 references
    mosaic Hankel matrices
    0 references
    least squares problem
    0 references
    weighted 2-norm
    0 references
    approximate common divisor problem
    0 references
    linear complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references