Skip to Main Content
High Performance Programming for Soft Computing
book

High Performance Programming for Soft Computing

by Oscar Montiel Ross, Roberto Sepulveda
February 2014
Intermediate to advanced content levelIntermediate to advanced
376 pages
11h 49m
English
CRC Press
Content preview from High Performance Programming for Soft Computing
120 High Performance Programming for Soft Computing
Therefore, after setting , the search direction s can be represented
as
(5.2.33)
where
D
is the length of the parallel component . The value
D
is found
multiplying both sides of Eq. (5.2.33) by
. (5.2.34)
Solving Eq. (5.2.34) for
D
ij
. (5.2.35)
Therefore, the main drawback of the conjugate Gram-Schmidt method
is that all the old search vectors must be stored to construct each new one,
affecting directly the computational cost of the algorithm (Jorge Nocedal
2006).
5.2.4 Linear conjugate gradient method
To overcome the problem of the computational cost of the Gram-Schmidt
conjugation but still ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Soft Computing and Its Applications, Volume One

Soft Computing and Its Applications, Volume One

Kumar S. Ray
Point-Based Graphics

Point-Based Graphics

Markus Gross, Hanspeter Pfister

Publisher Resources

ISBN: 9781466586017