Power Sum Method and the Approximative Solution of Algebraic Equations

From MaRDI portal

Revision as of 03:32, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4045513

Jump to:navigation, search

DOI10.2307/2005483zbMath0293.65027OpenAlexW4239927412MaRDI QIDQ4045513

No author found.

Publication date: 1975

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2005483

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)

Related Items (5)

Algebraic complexity of computing polynomial zeros ⋮ Sequential and parallel complexity of approximate evaluation of polynomial zeros ⋮ Optimal and nearly optimal algorithms for approximating polynomial zeros ⋮ On the latent roots of \(\lambda\)matrices ⋮ A new proximity test for polynomial zeros

This page was built for publication: Power Sum Method and the Approximative Solution of Algebraic Equations

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4045513&oldid=17770574"