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
316 High Performance Programming for Soft Computing
3. The orthogonal vector should be normalized,
(15.3.24)
4. In the j
th
step, the vector (15.3.25) is found,
(15.3.25)
Therefore, the Gram-Schmidt process allows us to construct the
orthonormal set which spans a k-dimensional subspace
in
.
For arbitrary , and , the linear operator A provides a
map if (15.3.26) is satisfi ed.
121 2
(| |) | | ,Acxc cAxcAy+= +
(15.3.26)
For the orthonormal basis and the arbitrary vector in ,
where , using the linear operator implies that,
(15.3.27)
The Hermitian conjugate of the linear operator for the
arbitrary vectors
, is defi ned
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