skip to main content
DOE Patents title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems

Abstract

A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.

Inventors:
 [1];  [2]
  1. Middletown, DE
  2. Albuquerque, NM
Issue Date:
Research Org.:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Org.:
USDOE
OSTI Identifier:
953741
Patent Number(s):
7451173
Application Number:
uS patent application 10/938,444
Assignee:
Sandia Corporation (Albuquerque, NM)
Patent Classifications (CPCs):
G - PHYSICS G06 - COMPUTING G06F - ELECTRIC DIGITAL DATA PROCESSING
DOE Contract Number:  
AC04-94AL85000
Resource Type:
Patent
Country of Publication:
United States
Language:
English

Citation Formats

Van Benthem, Mark H, and Keenan, Michael R. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems. United States: N. p., 2008. Web.
Van Benthem, Mark H, & Keenan, Michael R. Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems. United States.
Van Benthem, Mark H, and Keenan, Michael R. Tue . "Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems". United States. https://www.osti.gov/servlets/purl/953741.
@article{osti_953741,
title = {Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems},
author = {Van Benthem, Mark H and Keenan, Michael R},
abstractNote = {A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = {2008},
month = {11}
}

Patent:

Save / Share:

Works referenced in this record:

Application of equality constraints on variables during alternating least squares procedures
journal, January 2002


Rapid Analysis of Raman Image Data Using Two-Way Multivariate Curve Resolution
journal, June 1998


Simultaneous analysis of several spectroscopic titrations with self-modelling curve resolution
journal, March 1993