Showing results for

- Intel Community
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library & Intel® Math Kernel Library
- How to perform economy size bidiagonalization?

- Subscribe to RSS Feed
- Mark Topic as New
- Mark Topic as Read
- Float this Topic for Current User
- Bookmark
- Subscribe
- Mute
- Printer Friendly Page

Highlighted
##

sth4nth

Beginner

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-11-2012
06:39 AM

7 Views

How to perform economy size bidiagonalization?

Could some help me on this:

I want to perform economy size bidiagonalization of a m x n matrix A (m<n), such that A=QBP' where B is a bidiagonal matrix of size m x m, and Q, P are orthogonal matrices.

Currently, I use following two functions to do the job, from which I can get the factorization A=USV' where S is bidiagonal matrix of size m x n.

dgebrd(&m,&n,x,&m,d,e,tauq,taup,work,&lwork,&info);

dorgbr(&qp,&m,&m,&n,x,&m,tauq,work,&lwork,&info);

I can truncate the matrix S and V to get correct B and P. However this is not optimal in term of speed. From my test, this method is even slower than performing a economy SVD. How can I speed up my function so that I can directly get the economy size result? Thanks in advance.

1 Reply

Highlighted
##

To get B, dgebrd returns the diagonal elements and the subdiagonal elements of B in d and e, respectively.
To get P^{T}, call dorgbr('P', m, n, m, x ... ).
You can improve the performance of dgebrd and dorgbr by supplying workspace arrays to them. For information on using workspace arrays to improve performance, please see the "Application Notes" in the reference manual page for dgebrd.

Zhang_Z_Intel

Employee

- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Email to a Friend
- Report Inappropriate Content

10-15-2012
05:22 PM

7 Views

For more complete information about compiler optimizations, see our Optimization Notice.