Nearest common root of a set of polynomials: a structured singular value approach (Q2332430): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Nicos Karcanias / rank
Normal rank
 
Property / author
 
Property / author: Nicos Karcanias / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Mu Analysis and Synthesis Toolbox / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2972657769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix pencil based numerical method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest common root of polynomials, approximate greatest common divisor and the structured singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3606313 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD and its application to ill-conditioned algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greatest common divisor via generalized Sylvester and Bezout matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Resultant Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariance properties, and characterization of the greatest common divisor of a set of polynomials / 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: Resultant properties of gcd of many polynomials and a factorization representation of gcd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal factorisation of polynomials and computational issues. / 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: Q4227320 / 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: Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grassmann invariants, almost zeros and the determinantal zero, pole assignment problems of linear multivariable systems / 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: Approximate zero polynomials of polynomial matrices and linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient conditions for zero assignment by constant squaring down / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complex structured singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of the mixed μ problem and its bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of μ calculation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On structured singular values of reciprocal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Gap Between the Complex Structured Singular Value and Its Convex Upper Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured singular values and stability analysis of uncertain polynomials. II: A missing link / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured singular values and stability analysis of uncertain polynomials. I: The generalized \(\mu\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Novel Iterative Method To Approximate Structured Singular Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996569 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of all eigenvalues of a symmetric matrix / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:15, 20 July 2024

scientific article
Language Label Description Also known as
English
Nearest common root of a set of polynomials: a structured singular value approach
scientific article

    Statements

    Nearest common root of a set of polynomials: a structured singular value approach (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2019
    0 references
    structured singular value
    0 references
    Sylvester resultant matrix
    0 references
    approximate GCD
    0 references
    distance to singularity
    0 references
    almost common root
    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