"Fast Library for Number Theory"의 두 판 사이의 차이

수학노트
둘러보기로 가기 검색하러 가기
(→‎노트: 새 문단)
 
(→‎메타데이터: 새 문단)
22번째 줄: 22번째 줄:
 
===소스===
 
===소스===
 
  <references />
 
  <references />
 +
 +
== 메타데이터 ==
 +
 +
===위키데이터===
 +
* ID :  [https://www.wikidata.org/wiki/Q5436959 Q5436959]

2020년 12월 26일 (토) 04:27 판

노트

위키데이터

말뭉치

  1. FLINT also has the aim of providing support for multicore and multiprocessor computer architectures, though we do not yet provide this facility.[1]
  2. FLINT is currently maintained by William Hart of Warwick University in the UK.[1]
  3. FLINT 2 and following should compile on any machine with GCC and a standard GNU toolchain, however it is specially optimized for x86 (32 and 64 bit) machines.[1]
  4. As of version 2.0 FLINT required GCC version 2.96 or later, MPIR 2.1.1 or later and MPFR 3.0.0 or later.[1]
  5. SageMath is an open source mathematics system based on Python, allowing to run R functions, but also providing access to systems like Maxima, GAP, FLINT, and many more math programs.[2]
  6. We discuss FLINT (Fast Library for Number Theory), a library to support computations in number theory, including highly optimised routines for polynomial arithmetic and linear algebra in exact rings.[3]
  7. FLINT started life as a pure C, threadsafe, fast version of NTL.[4]
  8. As a result of our experiences, we outlined the following goals for the FLINT project, which remain its goals today.[4]
  9. Already a recursive implementation of the FLINT FFT gave a 30% speed up.[4]
  10. Since the release of FLINT 2 we have been using an integer format (fmpz) which takes a single machine word to hold a small integer.[4]
  11. FLINT was licensed GPL v2+ up to and including version 2.5.[5]
  12. In addition, FLINT provides various low-level routines for fast arithmetic.[5]
  13. FLINT is written in ANSI C and runs on many platforms (including Linux, Mac OS X and Windows on common hardware configurations), but is currently mostly optimised for x86 and x86-64 CPUs.[5]
  14. FLINT has been used for large scale computations in number theory research (for example: A Trillion Triangles), and is also suited as a general-purpose backend for computer algebra systems.[5]
  15. At this stage FLINT consists mainly of fast integer and polynomial arithmetic and linear algebra.[6]
  16. In the future it is planned that FLINT will contain algorithms for algebraic number theory and other number theoretic functionality.[6]

소스

메타데이터

위키데이터