Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP

Details Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP

2007-07-31

arxiv.org/abs/0707.4651v1

Computer Science

Mathematical Software

5 pages

Scientific paper

This brief paper: (1) Discusses strategies to generate random test cases that can be used to extensively test any Linear Distance Program (LDP) software. (2) Gives three numerical examples of input cases generated by this strategy that cause problems in the Lawson and Hanson LDP module. (3) Proposes, as a standard matter of acceptable implementation procedures, that (unless it is done internally in the software itself, but, in general, this seems to be much rarer than one would expect) all users should test the returned output from any LDP module for self-consistency since it incurs only a small amount of added computational overhead and it is not hard to do.

Affiliated with

Also associated with

No associations

Rating

Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-223161