Fast combinatorial algorithm for the solution of linearly constrained least squares problems
US7451173B1 · kind B1 · utility
24Cited by
3References
20Claims
0Family size
Assignee
Inventors
Key dates
| Filing date | Sep 9, 2004 |
| Grant date | Nov 11, 2008 |
| Priority date | — |
| Expiry date | Nov 11, 2026 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F17/11
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.