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

Simple item page
dc.creatorRufty, Alan
dc.date2007-07-31
dc.date.accessioned2026-07-07T08:21:22Z
dc.date.available2026-07-07T08:21:22Z
dc.descriptionThis 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.
dc.description5 pages
dc.identifierhttps://arxiv.org/abs/0707.4651
dc.identifierhttp://arxiv.org/abs/0707.4651
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/135336
dc.subjectMathematical Software
dc.subjectG.4.x; D.2.5
dc.titleComments on the Reliability of Lawson and Hanson's Linear Distance Programming Algorithm: Subroutine LDP
dc.typetext

Files

Collections

arXiv