Solving a sparse system using linear algebra (Q491257): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5333460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3806684 / 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: Generalised characteristic polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4279509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subdivision-based algorithm for the sparse resultant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4226951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5200148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The many aspects of counting lattice points in polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multihomogeneous resultant formulae by means of complexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving polynomial equations. Foundations, algorithms, and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to the solution of polynomial systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of sparse elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2738480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient incremental algorithms for the sparse resultant and the mixed volume / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrices in elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Toric Varieties. (AM-131) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4293510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically Fast Triangularization of Matrices over Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4143433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Faddeev-Leverrier's method for the computation of the characteristic polynomial of a matrix and of eigenvectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Le formalisme du résultant. (The formalism of resultant) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chow polytopes and general resultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Résolution des systèmes d'équations algébriques / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to find a maximum of a multilinear map over a product of spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4321539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2002 update of the supplementary bibliography on roots of polynomials / 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 all solutions to polynomial systems using homotopy continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234194 / 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: Multivariate polynomials, duality, and structured matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast enclosure of matrix eigenvalues and singular values via rounding mode controlled computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for floating-point interval matrix multiplication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Product formulas for resultants and Chow forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient isolation of polynomial's real roots. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and parallel interval arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational error bounds for multiple or nearly multiple eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On eigenvector bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse effective Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error bounds for computed eigenvalues and eigenvectors. II / rank
 
Normal rank

Revision as of 16:07, 10 July 2024

scientific article
Language Label Description Also known as
English
Solving a sparse system using linear algebra
scientific article

    Statements

    Solving a sparse system using linear algebra (English)
    0 references
    0 references
    24 August 2015
    0 references
    multiplication matrix
    0 references
    eigenvector
    0 references
    sparse system
    0 references
    toric varieties
    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

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