This is the mail archive of the gsl-discuss@sourceware.org mailing list for the GSL project.


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]
Other format: [Raw text]

transpose copy at end of cholesky_decomp


I am wondering, why does the routine gsl_linalg_cholesky_decomp(gsl_matrix*A)
include nested for loops at the end that transpose-copy the lower triangle of A
into the upper triangle of A?  

Could the library expose another routine in which the post-processing is at
least optional?

gsl_linalg_cholesky_decomp_lower(gsl_matrix*A) for example?

-- 
james bergstra
http://www-etud.iro.umontreal.ca/~bergstrj


Index Nav: [Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav: [Date Prev] [Date Next] [Thread Prev] [Thread Next]