Analogs of recurrent Newton formulas

DOI10.3103/S1066369X09100053zbMath1188.65072OpenAlexW2105459280MaRDI QIDQ736173

Alexey A. Kytmanov

Publication date: 27 October 2009

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x09100053

zbMATH Keywords

systems of nonlinear equationsmethods of elimination of unknownsrecurrent Newton formulas

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05)

Related Items (9)

On a Formula for Calculating the Resultant of Two Entire Functions ⋮ Unnamed Item ⋮ An algorithm for calculating power sums of roots for a class of systems of nonlinear equations ⋮ Algorithm for constructing an analog of Plan's formula ⋮ Algorithm for constructing an analogue of the Binet formula ⋮ Residue integrals and Waring’s formulas for algebraic or even transcendental systems ⋮ Finding residue integrals for systems of non-algebraic equations in \(\mathbb C^n\) ⋮ An algorithm for constructing the resultant of two entire functions ⋮ On finding residue integrals for a class of systems of non-algebraic equations

Cites Work

• Unnamed Item
• Properties of m-types in stable theories
• Computer algebra of polynomials: A modified method of eliminating unknowns
• Application of computer algebra systems in a modified method of the elimination of unknowns.

This page was built for publication: Analogs of recurrent Newton formulas