Parallel algorithms for solving systems of nonlinear equations

DOI10.1016/0898-1221(81)90083-3MaRDI QIDQ1157670zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3584893 (Why is no real title available?)
• scientific article; zbMATH DE number 3281235 (Why is no real title available?)
• scientific article; zbMATH DE number 3381785 (Why is no real title available?)
• scientific article; zbMATH DE number 3407464 (Why is no real title available?)
• scientific article; zbMATH DE number 3187178 (Why is no real title available?)
• scientific article; zbMATH DE number 3195683 (Why is no real title available?)
• A Globally Converging Secant Method with Applications to Boundary Value Problems
• A KDF9 ALGOL list-processing scheme
• A Nongradient and Parallel Algorithm for Unconstrained Minimization
• A Survey of Parallel Algorithms in Numerical Linear Algebra
• A Survey of Parallelism in Numerical Analysis
• A modified algorithm for the simultaneous extraction of polynomial roots
• A scheme for determining stepsizes for unconstrained optimization methods
• An approach to nonlinear programming
• Parallel methods for solving equations
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations
• The Secant method for simultaneous nonlinear equations

Cited in

(6)

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

This page was built for publication: Parallel algorithms for solving systems of nonlinear equations

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