Turn on suggestions

Auto-suggest helps you quickly narrow down your search results by suggesting possible matches as you type.

Showing results for

- Intel Community
- Software Development SDKs and Libraries
- Intel® oneAPI Math Kernel Library & Intel® Math Kernel Library
- Algorithms: cgels vs. manual implementation

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

Cody_H_

Beginner

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

06-20-2013
08:19 AM

35 Views

Algorithms: cgels vs. manual implementation

I'm currently working on a project that uses a linear least squares approach to calculate weights for 'n' packets of data. After embedding and testing both the manual and cgels routines I found the manual version to calculate the answer ~57% more quickly for 'n' packets.

The manual version involves many inverses, conjugations, and normlization (all done with the MKL libraries) so I assumed it wouldn't be as quick as the cgels routine. What could be causing this loss in efficiency? My first ideas were constant reallocation memory and error checking, but I'd rather get a second opinion before I finalize the project.

Example:

Applying weights to 750 packets of data in real time (20 seconds). When using the manual routine, the time elapsed is ~11.026 seconds. When using the cgels routine the time is ~17.312 seconds, putting the computation time (+~5 seconds) over the 20 second time interval.

Thank you for your time. Any feedback is appreciated.

Link Copied

1 Reply

SKost

Valued Contributor II

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

06-20-2013
06:10 PM

35 Views

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