# 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:

- (Middletown, DE)
- (Albuquerque, NM)

- Publication Date:

- Research Org.:
- Los Alamos National Laboratory (LANL), Los Alamos, NM

- Sponsoring Org.:
- USDOE

- OSTI Identifier:
- 953741

- Patent Number(s):
- 7,451,173

- Application Number:
- uS patent application 10/938,444

- Assignee:
- Sandia Corporation (Albuquerque, NM) SNL-A

- 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.
doi:. 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 = {Tue Nov 11 00:00:00 EST 2008},

month = {Tue Nov 11 00:00:00 EST 2008}

}

Save to My Library

You must Sign In or Create an Account in order to save documents to your library.