Overdetermined Weierstrass iteration and the nearest consistent system (Q476879): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: MultRoot / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57438842 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055130031 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.5086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast and numerically stable Euclidean-like algorithm for detecting relatively prime numerical polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are two numerical polynomials relatively prime? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design, analysis, and implementation of a multiprecision polynomial rootfinder / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232507 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of a specified root of a polynomial system of equations using eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for zero-dimensional polynomial systems using duality / 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: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton's method for overdetermined systems of equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate GCD of several univariate polynomials with small degree perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic and numeric methods for exploiting structure in constructing resultant matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to method for the simultaneous computation of all zeros of generalized polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate polynomial GCD: small degree and small height perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4781238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Global Newton Iteration Over Archimedean and Non-Archimedean Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detection and validation of clusters of polynomial zeros / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid rational function approximation and its accuracy analysis / 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: Q3447170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Gesamtschrittverfahren zur Berechnung der Nullstellen von Polynomen / 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: Solving algebraic systems using matrix computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the isolated roots by matrix methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4502650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate polynomials, duality, and structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations between roots and coefficients, interpolation and application to system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized normal forms and polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable normal forms for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of rational functions and the nearest GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a Polynomial Equation: Some History and Recent Progress / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250166 / 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: Nearest multivariate system with given root multiplicities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial systems via symbolic-numeric reduction to geometric involutive form / 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: A multivariate Weierstrass iterative rootfinder / 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: Q4008406 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-gcd computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nearest polynomial with a zero in a given domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227333 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3156429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Polynomial Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low rank approximations of the sylvester resultant matrix for approximate GCDS of Bernstein basis polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix / 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: 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: The calculation of the degree of an approximate greatest common divisor of two polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of systems of algebraic equations and linear maps on residue class rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4660677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing multiple roots of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A numerical elimination method for polynomial computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximate GCD of inexact polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE 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 08:53, 9 July 2024

scientific article
Language Label Description Also known as
English
Overdetermined Weierstrass iteration and the nearest consistent system
scientific article

    Statements

    Overdetermined Weierstrass iteration and the nearest consistent system (English)
    0 references
    0 references
    0 references
    0 references
    2 December 2014
    0 references
    approximate GCD
    0 references
    overdetermined systems
    0 references
    nearest consistent system
    0 references
    Weierstrass-Durand-Kerner method
    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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers