Parallel implementations of Broyden's method (Q1184707)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Parallel implementations of Broyden's method |
scientific article; zbMATH DE number 34910
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel implementations of Broyden's method |
scientific article; zbMATH DE number 34910 |
Statements
Parallel implementations of Broyden's method (English)
0 references
28 June 1992
0 references
This paper considers the problem of solving nonlinear systems of equations \(F(x)=0\), where \(F: \mathbb{R}^n\to \mathbb{R}^n\), \(F\) is differentiable and \(n\) is large. One of the most effective ways of solving the equations is \textit{C. G. Broyden's} ``good'' method [Math. Comput. 19, 577--593 (1965; Zbl 0131.13905)]. When the number of equations and unknowns is very large, memoryless implementation of this method are frequently used. The paper analyzes one of this implementations, and shows that calculations may be organized in such a way that parallelism can be exploited.
0 references
nonlinear system
0 references
Broyden's method
0 references
parallelism
0 references
0.9414595
0 references
0 references
0.9220538
0 references
0 references
0.9086972
0 references
0 references
0.90299106
0 references
0.90149635
0 references
0.8997531
0 references