Computational complexity of a piecewise linear homotopy algorithm (Q3321342): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Homotopies for computation of fixed points on unbounded regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3893221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of complementary pivot methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Paths Generated by Fixed Point Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fundamental theorem of algebra and complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of piecewise-linear homotopy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new variable dimension algorithm for the fixed point problem / rank
 
Normal rank

Latest revision as of 12:31, 14 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of a piecewise linear homotopy algorithm
scientific article

    Statements

    Computational complexity of a piecewise linear homotopy algorithm (English)
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    average behavior
    0 references
    worst case behavior
    0 references
    arithmetic complexity
    0 references
    simplicial homotopy algorithm
    0 references
    large sparse nonlinear systems
    0 references