Partitionability of Implicit Least Squares Model Fitting Problems

Abstract

Non-linear least squares model fitting problems differ from general optimization problems due to the special structure of the least squares normal equations. In simple least squares problems, that structure algorithmic simplification can be achieved. More general least squares problems can often be made partitionable by proper parameter manipulations. In this report, sufficient partitionability conditions are derived and parameter manipulations are discussed for the achievement of partitionability.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1981
Accession Number
ADA101356

Entities

People

  • Aivars Celmins

Organizations

  • Ballistic Research Laboratory

Tags

Communities of Interest

  • Air Platforms
  • Biomedical
  • Counter WMD
  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Accuracy
  • Algorithms
  • Chemistry
  • Coefficients
  • Commerce
  • Computational Science
  • Computer Programs
  • Computer Science
  • Curve Fitting
  • Data Analysis
  • Equations
  • Inequalities
  • Numbers
  • Space Sciences
  • Standards
  • Surveys
  • Universities

Readers

  • Linear Algebra
  • Regression Analysis.
  • Systems Analysis and Design