Show simple item record

dc.contributor.authorColeman, Thomas F.en_US
dc.contributor.authorPlassmann, Paulen_US
dc.date.accessioned2007-04-23T17:33:22Z
dc.date.available2007-04-23T17:33:22Z
dc.date.issued1988-06en_US
dc.identifier.citationhttp://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR88-923en_US
dc.identifier.urihttps://hdl.handle.net/1813/6763
dc.description.abstractIn this paper we describe algorithms for solving nonlinear least-squares problems on a message-passing multiprocessor. We demonstrate new parallel algorithms, including an efficient parallel algorithm for determining the Levenberg-Marquardt parameter and a new row-oriented QR factorization algorithm. Experimental results obtained on an Intel iPSC hypercube are presented and compared with sequential MINPACK code executed on a single processor. These experimental results show that essentially full efficiency is obtained for problems where the row size is sufficiently larger than the number of processors. These algorithms have the advantage of involving only simple data movements and consequently are not constrained to the hypercube architecture.en_US
dc.format.extent1715524 bytes
dc.format.extent469278 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/postscript
dc.language.isoen_USen_US
dc.publisherCornell Universityen_US
dc.subjectcomputer scienceen_US
dc.subjecttechnical reporten_US
dc.titleSolution of Nonlinear Least-Square Problems on a Multiprocessoren_US
dc.typetechnical reporten_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Statistics