DESERT
3.5.1
Loading...
Searching...
No Matches
least_squares.h
Go to the documentation of this file.
1
//
2
// Copyright (c) 2022 Regents of the SIGNET lab, University of Padova.
3
// All rights reserved.
4
//
5
// Redistribution and use in source and binary forms, with or without
6
// modification, are permitted provided that the following conditions
7
// are met:
8
// 1. Redistributions of source code must retain the above copyright
9
// notice, this list of conditions and the following disclaimer.
10
// 2. Redistributions in binary form must reproduce the above copyright
11
// notice, this list of conditions and the following disclaimer in the
12
// documentation and/or other materials provided with the distribution.
13
// 3. Neither the name of the University of Padova (SIGNET lab) nor the
14
// names of its contributors may be used to endorse or promote products
15
// derived from this software without specific prior written permission.
16
//
17
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
19
// TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
20
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
21
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
22
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
23
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
24
// OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25
// WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
26
// OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
27
// ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
//
29
30
31
#ifndef UWTOKENBUS_RANGH
32
#define UWTOKENBUS_RANGH
33
34
#include <vector>
35
36
namespace
LSSQ
37
{
38
enum
LeastSqResult
{
OK
= 0,
TIMEOUT
= 1,
ERROR
= 2};
48
LeastSqResult
nnLeastSquares
(std::vector<std::vector<double>> a,std::vector<double> b,std::vector<double> &x,
double
* resid =
nullptr
);
49
50
}
51
#endif
LSSQ
Definition
least_squares.h:37
LSSQ::LeastSqResult
LeastSqResult
Definition
least_squares.h:38
LSSQ::OK
@ OK
Definition
least_squares.h:38
LSSQ::ERROR
@ ERROR
Definition
least_squares.h:38
LSSQ::TIMEOUT
@ TIMEOUT
Definition
least_squares.h:38
LSSQ::nnLeastSquares
LeastSqResult nnLeastSquares(std::vector< std::vector< double > > a, std::vector< double > b, std::vector< double > &x, double *resid=nullptr)
Least Squares Linear Regressor solves the least squares problem A * X = B, X>=0.
Definition
least_squares.cpp:115
DESERT_Framework
DESERT
ranging
uwranging_tokenbus
least_squares.h
Generated by
1.9.8