Re: How to measure converage rate for least square problem?
From: Mike Deskevich (mikedeskevich_at_gmail.com)
Date: 10/19/04
- Previous message: Brian Parker: "graph arboricity or matroid partitioning code needed"
- In reply to: Kangyuan: "How to measure converage rate for least square problem?"
- Next in thread: Peter Spellucci: "Re: How to measure converage rate for least square problem?"
- Messages sorted by: [ date ] [ thread ]
Date: 18 Oct 2004 19:59:02 -0700
how about the derivative of ||Ax-B||^2 wrt each iteration. that way
you can see how much closer you're getting with each step
- Previous message: Brian Parker: "graph arboricity or matroid partitioning code needed"
- In reply to: Kangyuan: "How to measure converage rate for least square problem?"
- Next in thread: Peter Spellucci: "Re: How to measure converage rate for least square problem?"
- Messages sorted by: [ date ] [ thread ]
