QuickTopic (SM) free message boards QuickTopic (SM) free message boards
Skip to Messages
  Sign In to access your topic list  |New Topic |My Topics|Profile
Upgrade to Pro   Customize, show pictures, add an intro, and more:   QuickTopic Pro...and check out QuickThreadSM
Topic: Direct Methods for Sparse Least Squares Problems
Views: 1029, Unique: 448 
Subscribers: 0
What's
this?
Printer-Friendly Page
Subscribe to get & post, or stop messages by email Subscribe
All messages    << 7-8  6-6 of 8  1-5 >>
About these ads
Who | When
Messagessort recent-top   
Post a new message
 
Manmohan Chandraker  6
11-30-2004 12:36 PM ET (US)
For special cases, one can surely think of a series of transformations to change the column ordering individually. But such transformations would not be orthogonal and full rank. The advantage of a permutation matrix is that it is trivially full rank (its columns are basis vectors) and orthogonal. Thus, we only consider entire column and row orderings, not for individual elements.
RSS link What's this?
All messages    << 7-8  6-6 of 8  1-5 >>
QuickTopicSM message boards
Over 200,000 topics served
Learn more Frequently asked questions  Acknowledgements
What they're saying about QuickTopic
 Questions, comments, or suggestions? Contact Us
Read our use policy before beginning. We value your privacy; please read our privacy statement.
Copyright ©1999-2008 Internicity Inc. All rights reserved.