Search results

Create the page "Routines" on this wiki! See also the search results found.

• Conto.cin
  [[Category:Routines]]
  13 KB (2,858 words) - 06:59, 1 December 2018
• Ado.cin
  [[Category:routines]] */
  1 KB (191 words) - 14:24, 20 June 2013
• SuperFactorial
  The preliminary versions of the routines can be uploaded upon request; the final version will appear after to check
  18 KB (2,278 words) - 00:03, 29 February 2024
• Complex map
  ...Such a routine seems to be for orders of magnitude faster than the similar routines in [[Mathematica]] or [[Maple (software)|Maple]]; in addition, at the simil
  2 KB (254 words) - 06:59, 1 December 2018
• Fafo.cin
  [[Category:Routines]]
  1 KB (238 words) - 14:33, 20 June 2013
• Filog.cin
  // through the [[Tania function]]; the routines for the Tania are also supplied. [[Category:Routines]]
  2 KB (258 words) - 10:19, 20 July 2020
• Acosc1.cin
  // '''Acosc1.cin''' is set of routines for evaluation [[acosc1]], whih is first branch of function [[ArcCosc]] beh
  3 KB (436 words) - 18:47, 30 July 2019
• Zcosft2.cin
  ...transformation of more complicated objects can be performed with the same routines,
  2 KB (385 words) - 18:47, 30 July 2019
• Facp.cin
  ...dopble routine for evaluation of derivative of [[Factorial]] function. The routines required are copypasted below
  3 KB (353 words) - 15:01, 20 June 2013
• C++
  There are two graphical routines specific for [[TORI]].
  4 KB (608 words) - 15:01, 20 June 2013
• ArcTra
  arctra4 be routines implement the
  10 KB (1,442 words) - 18:47, 30 July 2019
• GSL
  ...tem directories and to guess the correct way to compile codes with the GSL routines. ...be modified in order to make executable module from the code with the GSL routines.
  6 KB (975 words) - 18:47, 30 July 2019
• Superlogarithm
  ...call them simply [[tet]] and [[ate]], in the similar way, as the names of routines for elementary functions coincide with the names of these functions.
  1 KB (173 words) - 19:31, 30 July 2019
• Iterate of exponential
  ...efficient (fast and precise) algorithm for the evaluation is supplied with routines [[fsexp.cin]] and [[cslog.cin]].
  7 KB (1,161 words) - 18:43, 30 July 2019
• Arcsin.cin
  ...ent implementation, than to search for the appropriate compiler with these routines. [[User:T|T]] ([[User talk:T|talk]]) 14:02, 4 December 2013 (JST) ...aps; but the lost of precision is not so good for the numerical testing of routines for [[iteration]] of [[sin]], see articles [[SuSin]] and [[AuSin]].
  4 KB (488 words) - 06:58, 1 December 2018
• AuNem
  In the figures, the routines are used that provide of order of 14 significant figures, that greatly exce
  9 KB (1,441 words) - 18:45, 30 July 2019
• CosFT
  suggest the implementation through routines
  3 KB (468 words) - 18:47, 30 July 2019
• Eigendecomposition
  Thomas Hahn. Routines for the diagonalization of complex matrices. 9 Aug 11 . (2011 ?) ( Both in
  4 KB (518 words) - 18:46, 30 July 2019
• Lof
  ...re invited to plot the [[complex map]] shown in figure at right, using the routines implemented in Mathematica, and see, will it be better or faster (to progra
  3 KB (478 words) - 18:43, 30 July 2019
• Scft.cin
  // [[Scft.cin]] is set of routines used to evaluate the [[SFT]] and [[SFT]], discrete implementations of [[Cos ...he routines are adopted to the double precision versions from the original routines by the [[Numerical recipes in C]]
  6 KB (764 words) - 07:05, 1 December 2018

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