dpptrf performance

dpptrf performance


We are currently developping an application that needs to solve a linear systems of equations.

As the matrix A is a symmetric positive definite matrix, we call the dpotrf and dpotrs methods,butwhen the size of the matrix is too big (order 15.000 and more), we use the packed form of the matrix (dpptrf and then dpptrs methods are called).

However, when we measure the performances, we are observing thatfor big matrices, the packed method is fours time slower than the non packed method .

Does anybody have an idea on how to improve the performnce when using the packed methods?



2 posts / 0 new
Last post
For more complete information about compiler optimizations, see our Optimization Notice.

Hi, Daniel.

Working on the packed matrix is by defaultslower than on unpacked. If you have enough memory to keep the matrix unpacked, it'sgood idea to apply DPOTRF/DPOTRS instead of DPPTRF/DPPTRS.


Leave a Comment

Please sign in to add a comment. Not a member? Join today