ACM

Communications of the ACM

Home/Magazine Archive/March 1974 (Vol. 17, No. 3)/Efficient implementation of a variable projection.../Abstract

Efficient implementation of a variable projection algorithm for nonlinear least squares problems

By Fred T. Krogh
Communications of the ACM, March 1974, Vol. 17 No. 3, Pages 167-169
10.1145/360860.360914
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

Nonlinear least squares problems frequently arise for which the variables to be solved for can be separated into a linear and a nonlinear part. A variable projection algorithm has been developed recently which is designed to take advantage of the structure of a problem whose variables separate in this way. This paper gives a slightly more efficient and slightly more general version of this algorithm than has appeared earlier.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.