- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hello,
I would like to know the flop count of the function dormqr for some given parameters but I don't know where to find this information.
Likewise I would like to know the effective flop count for other functions such as dlarfp.
Can anyone advice?
TIA
Best regards,
Giovanni
I would like to know the flop count of the function dormqr for some given parameters but I don't know where to find this information.
Likewise I would like to know the effective flop count for other functions such as dlarfp.
Can anyone advice?
TIA
Best regards,
Giovanni
Link Copied
4 Replies
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
The flop count expressions ( expressions) for many linear algebra algorithms may be found in Matrix Computations by Golub and van Loan.
ISBN-13: 978-0801854149
ISBN-13: 978-0801854149
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
dormqr from Intel MKL is a qualitative compilation of the source code dormqr (fortran, C) from package LAPACK. This package is accessible. dormqr has auxiliary value: where you use it?
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content
Hello mecej4,
I have the book and I know the theoretical complexities, however, the effective complexity of LAPACK functions that MKL provides is of course not there :) this is not really a simple matrix multiplication because it has to implicitly recover the Q first and apply it automagically to some matrix or vector. This is not covered in that book. Likewise the darfl type of functions that generate one column reflector to annihilate the non zero elements of a new column is not easy to find out unless you are a LAPACK Fortran guru.
It is impossible to know if e.g. some updates are improving the situation if I have no idea what flop count every MKL function I call has.
TIA,
Best regards,
Giovanni
I have the book and I know the theoretical complexities, however, the effective complexity of LAPACK functions that MKL provides is of course not there :) this is not really a simple matrix multiplication because it has to implicitly recover the Q first and apply it automagically to some matrix or vector. This is not covered in that book. Likewise the darfl type of functions that generate one column reflector to annihilate the non zero elements of a new column is not easy to find out unless you are a LAPACK Fortran guru.
It is impossible to know if e.g. some updates are improving the situation if I have no idea what flop count every MKL function I call has.
TIA,
Best regards,
Giovanni
- Mark as New
- Bookmark
- Subscribe
- Mute
- Subscribe to RSS Feed
- Permalink
- Report Inappropriate Content

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