A globally convergent parallel algorithm for zeros of polynomial systems

DOI10.1016/0362-546X(89)90017-5MaRDI QIDQ3484271zbMATH OpenFDO

Authors Alexander P. Morgan, Layne T. Watson

Publication date 1989

Published in Nonlinear Analysis: Theory, Methods & Applications (Search for Journal in Brave)

zbMATH Keywords

global convergenceparallel computationhomotopy methodzeros of polynomial systems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Recommendations

• The granularity of parallel homotopy algorithms for polynomial systems of equations
• Parallel Homotopy Algorithms to Solve Polynomial Systems
• Algorithm 857
• Homotopy continuation method for solving systems of nonlinear and polynomial equations
• Numerically determining solutions of systems of polynomial equations

Cites work

• scientific article; zbMATH DE number 3843061 (Why is no real title available?)
• scientific article; zbMATH DE number 3930245 (Why is no real title available?)
• scientific article; zbMATH DE number 3954267 (Why is no real title available?)
• scientific article; zbMATH DE number 50337 (Why is no real title available?)
• scientific article; zbMATH DE number 3541848 (Why is no real title available?)
• A Nonlinear Parallel Algorithm with Application to the Stefan Problem
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A globally convergent algorithm for computing fixed points of C^2 maps
• A homotopy for solving polynomial systems
• A parallel algorithm for simple roots of polynomials
• A transformation to avoid solutions at infinity for polynomial systems
• Algorithm 502: Dependence of Solution of Nonlinear Systems on a Parameter [C5]
• Algorithm 555: Chow-Yorke Algorithm for Fixed Points or Zeros of C ² Maps [C5]
• Algorithm 652
• Finding Zeroes of Maps: Homotopy Methods That are Constructive With Probability One
• Handbook series linear algebra. Linear least squares solutions by Householder transformations
• Parallel Algorithms for Nonlinear Problems
• Simplicial and Continuation Methods for Approximating Fixed Points and Solutions to Systems of Equations

Cited in

(11)

• The granularity of parallel homotopy algorithms for polynomial systems of equations
• PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems
• scientific article; zbMATH DE number 3976212 (Why is no real title available?)
• Algorithm 652
• Finding all steady state solutions of chemical kinetic models
• scientific article; zbMATH DE number 4064369 (Why is no real title available?)
• scientific article; zbMATH DE number 6454113 (Why is no real title available?)
• Parallel iterative algorithms for the simultaneous determination of all zeros of a triangular polynomial
• Fast algorithms for zero-dimensional polynomial systems using duality
• Solving systems of polynomial equations by bounded and real homotopy
• scientific article; zbMATH DE number 2232802 (Why is no real title available?)

Describes a project that uses

Uses Software

• HOMPACK
• PITCON

This page was built for publication: A globally convergent parallel algorithm for zeros of polynomial systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484271)