efficiently solving least squares problems iteratively

efficiently solving least squares problems iteratively

I'm performing an iterative routine, where at each iteration I am solving a least squares problem using ?gels. At each iteration step I update a column of the matrix A, which will ulitmately converge, as will the solution vector b.

My question is this: Because at each iteration the solution vector b is changing only very little, is it possible to solve this more efficiently than repeatedly calling ?gels (perhaps by calling some of the routines that ?gels itself calls), since I know that I am often very close to the solution?

Thank you,

Tracy

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

Search the Web for "QR-update" and see if there is something there that you can put to use in your application.

>>...since I know that I am often very close to the solution...

Could you provide more information on that?

Leave a Comment

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