Parallel algorithms for solving systems of nonlinear equations

DOI10.1016/0898-1221(81)90083-3zbMath0471.65031OpenAlexW2065532663MaRDI QIDQ1157670

S. H. Smith

Publication date: 1981

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(81)90083-3

zbMATH Keywords

parallel algorithmssecant methodsunconstrained optimization problemsNewton's methodsconvergence and orders

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10)

Related Items

A parallel subgradient projections method for the convex feasibility problem, A parallel root-finding algorithm, Parallel variable metric algorithms for unconstrained optimization, Parallel quasi-Newton techniques with applications to shooting methods, Partially updated switching-method for systems of nonlinear equations, Vectorization of conjugate-gradient methods for large-scale minimization in meteorology

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel methods for solving equations
• An approach to nonlinear programming
• The Secant method for simultaneous nonlinear equations
• A scheme for determining stepsizes for unconstrained optimization methods
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A Globally Converging Secant Method with Applications to Boundary Value Problems
• A Nongradient and Parallel Algorithm for Unconstrained Minimization
• A Survey of Parallelism in Numerical Analysis
• A KDF9 ALGOL list-processing scheme
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations
• A modified algorithm for the simultaneous extraction of polynomial roots