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

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

Link Copied

2 Replies

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

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

**I am often very close to the solution**... Could you provide more information on that?

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