The granularity of parallel homotopy algorithms for polynomial systems of equations (Q4733310): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PITCON / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981465026 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126245760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook series linear algebra. Linear least squares solutions by Householder transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel algorithm for simple roots of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Parallel Algorithms in Numerical Linear Algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5] / rank
 
Normal rank
Property / cites work
 
Property / cites work: A transformation to avoid solutions at infinity for polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A homotopy for solving polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of <i>C</i> <sup>2</sup> Maps [C5] / rank
 
Normal rank
Property / cites work
 
Property / cites work: A globally convergent algorithm for computing fixed points of \(C^2\) maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Nonlinear Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Parallel Algorithm with Application to the Stefan Problem / rank
 
Normal rank

Latest revision as of 11:08, 20 June 2024

scientific article; zbMATH DE number 4119505
Language Label Description Also known as
English
The granularity of parallel homotopy algorithms for polynomial systems of equations
scientific article; zbMATH DE number 4119505

    Statements

    The granularity of parallel homotopy algorithms for polynomial systems of equations (English)
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    polynomial systems
    0 references
    homotopy methods
    0 references
    parallel computing
    0 references
    continuation methods
    0 references
    0 references
    0 references

    Identifiers