Computing the nearest singular univariate polynomials with given root multiplicities (Q385010): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4232504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearest multivariate system with given root multiplicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial with a given zero, revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial with a given zero, and similar problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Polynomial Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / 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: Nearest singular polynomials / rank
 
Normal rank

Latest revision as of 02:26, 7 July 2024

scientific article
Language Label Description Also known as
English
Computing the nearest singular univariate polynomials with given root multiplicities
scientific article

    Statements

    Computing the nearest singular univariate polynomials with given root multiplicities (English)
    0 references
    0 references
    0 references
    29 November 2013
    0 references
    multiplicity structure
    0 references
    nearest singular polynomial
    0 references
    multiple roots
    0 references

    Identifiers

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