Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Solution of Nonlinear Least-Square Problems on a Multiprocessor
Authors: Coleman, Thomas F.
Plassmann, Paul
Keywords: computer science
technical report
Issue Date: Jun-1988
Publisher: Cornell University
Abstract: In 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.
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
88-923.pdf1.68 MBAdobe PDFView/Open
88-923.ps458.28 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.


© 2014 Cornell University Library Contact Us