Search results

• ApCoCoA-1:CharP.GBasisF64
  <short_description>Computing a Groebner Basis of a given ideal in <tt>F_64</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
  3 KB (378 words) - 09:55, 7 October 2020
• CoCoA:Syz
  In the first two forms this function computes the syzygy module of a list of polynomials or vectors. In the last form this function returns the
  2 KB (258 words) - 10:02, 24 October 2007
• CoCoA:GBasisTimeout
  <short_description>compute a Groebner basis with a timeout</short_description> ERROR: Time expired: use $gb.Complete to complete the computation
  1 KB (162 words) - 10:02, 24 October 2007
• CoCoA:Res
  to be that of I or N, respectively. <tt>Res</tt> only works in the homogeneous context, and the coefficient ring
  1 KB (220 words) - 10:02, 24 October 2007
• ApCoCoA-1:CharP.LAAlgorithm
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...nction does not find any zero. In this case the trivial solution is given. To solve linear systems naive Gaußian elimination is used.
  3 KB (402 words) - 09:56, 7 October 2020
• ApCoCoA-1:Weyl.WGB
  <short_description>Computes the Groebner basis of an ideal <tt>I</tt> in Weyl algebra <tt>A_n</tt>.</short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
  5 KB (749 words) - 10:38, 7 October 2020
• ApCoCoA-1:CharP.MBBasisF2
  <short_description>Computes a Border Basis of a given ideal over <tt>F_2</tt>. </short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
  4 KB (536 words) - 09:56, 7 October 2020
• ApCoCoA-1:CharP.IMBBasisF2
  <short_description>Computes a Border Basis of a given ideal over <tt>F_2</tt>. </short_description> ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them.
  4 KB (655 words) - 09:55, 7 October 2020
• ApCoCoA-1:CharP.XLSolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
  5 KB (694 words) - 09:57, 7 October 2020
• ApCoCoA-1:MatlabToolbox
  = Introduction = ...polynomials, ideals and modules are added to provide an intuitive approach to the algebraic nature of the functions.
  7 KB (1,071 words) - 12:02, 13 September 2019
• ApCoCoA-1:CharP.MXLSolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
  6 KB (899 words) - 09:56, 7 October 2020
• ApCoCoA-1:CharP.NLASolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...n. In sparse case it uses <ref>ApCoCoA-1:Slinalg.SEF|Slinalg.SEF</ref> and in dense case it uses <ref>ApCoCoA-1:LinAlg.EF|LinAlg.EF</ref>.
  7 KB (905 words) - 09:57, 7 October 2020
• ApCoCoA-1:CharP.MNLASolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...s will be displayed to the screen after reaching the maximum degree bound. In fact Mutant NLA-Algorithm is the NLA-Algorithm with mutant strategy. It use
  8 KB (1,077 words) - 09:56, 7 October 2020
• ApCoCoA-1:CharP.IMXLSolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...find any zero. In this case a massage for non-uniqueness will be displayed to the screen after reaching the maximum degree bound.
  8 KB (1,094 words) - 09:56, 7 October 2020
• ApCoCoA-1:CharP.IMNLASolve
  ...<em>ApCoCoAServer</em>. You will have to start the ApCoCoAServer in order to use it/them. ...s will be displayed to the screen after reaching the maximum degree bound. In fact Improved Mutant NLA-Algorithm is the NLA-Algorithm with improved mutan
  8 KB (1,140 words) - 09:56, 7 October 2020

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)