Difference between revisions of "ApCoCoA-1:Num.ProjectAVI"
From ApCoCoAWiki
m (fixed links to namespace ApCoCoA) |
m (insert version info) |
||
| Line 1: | Line 1: | ||
| − | <command> | + | {{Version|1}} |
| + | <command> | ||
<title>Num.ProjectAVI</title> | <title>Num.ProjectAVI</title> | ||
<short_description>Computes the least squares solution of the general problem <tt>Ax=b</tt>, where <tt>x</tt> are coefficients of an order ideal.</short_description> | <short_description>Computes the least squares solution of the general problem <tt>Ax=b</tt>, where <tt>x</tt> are coefficients of an order ideal.</short_description> | ||
Revision as of 10:29, 7 October 2020
| This article is about a function from ApCoCoA-1. |
Num.ProjectAVI
Computes the least squares solution of the general problem Ax=b, where x are coefficients of an order ideal.
Syntax
Num.ProjectAVI(Mat:MAT, Vec:MAT, OI:LIST):POLY
Description
Please note: The function(s) explained on this page is/are using the ApCoCoAServer. You will have to start the ApCoCoAServer in order to use it/them.
This command computes the least squares solution of the general problem Ax=b, if there is no exact solution. The solution x has to be interpreted as the coefficients of the terms in the order ideal.
@param Mat Matrix A
@param Vec Vector B as a matrix.
@param OI Order Ideal
@return The least squares solution of Ax=b interpreted as coefficients of OI.
Example
Dec(Num.ProjectAVI([[1,1],[0,1],[1,1]],[[0],[1],[0]],[x,y]),2); -- CoCoAServer: computing Cpu Time = 0 ------------------------------- [<quotes>-0.99 x +1 y </quotes>] -------------------------------
See also
