메뉴 건너뛰기




Volumn 2006, Issue , 2006, Pages 93-100

Implementation techniques for fast polynomial arithmetic in a high-level programming environment

Author keywords

Aldor; Axiom; High performance; Polynomials

Indexed keywords

ALGEBRA; ALGORITHMS; CODES (SYMBOLS); COMPUTER PROGRAMMING; HIGH LEVEL LANGUAGES; THEOREM PROVING;

EID: 33748973914     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1145768.1145789     Document Type: Conference Paper
Times cited : (13)

References (29)
  • 2
    • 0025997771 scopus 로고
    • Using Strassen's algorithm to accelerate the solution of linear systems
    • D. H. Bailey, K. Lee, and H. D. Simon, Using Strassen's algorithm to accelerate the solution of linear systems. The Journal of Supercomputing, 4(4):357-371, 1990.
    • (1990) The Journal of Supercomputing , vol.4 , Issue.4 , pp. 357-371
    • Bailey, D.H.1    Lee, K.2    Simon, H.D.3
  • 3
    • 0004182554 scopus 로고
    • Master's thesis, Stanford University
    • R. P. Brent. Algorithms for matrix multiplication. Master's thesis, Stanford University, 1970. http://web.comlab.ox.ac.uk/oucl/work/richard.brent/.
    • (1970) Algorithms for Matrix Multiplication
    • Brent, R.P.1
  • 4
    • 84983014125 scopus 로고
    • Fast solution of Toeplitz systems of equations and computations of Padé approximants
    • R. P. Brent, F. G. Gustavson, and D. Y. Y. Yun. Fast solution of Toeplitz systems of equations and computations of Padé approximants. Journal of Algorithms, 1:259-295, 1980.
    • (1980) Journal of Algorithms , vol.1 , pp. 259-295
    • Brent, R.P.1    Gustavson, F.G.2    Yun, D.Y.Y.3
  • 5
    • 84870703477 scopus 로고    scopus 로고
    • The Computational Algebra Group in the School of Mathematics and Statistics at the University of Sydney. The MAGMA Computational Algebra System. http://magma.maths.usyd.edu.au/magma/.
    • The MAGMA Computational Algebra System
  • 6
    • 84968470212 scopus 로고
    • An algorithm for the machine calculation of complex Fourier series
    • J. Cooley and J. Tukey. An algorithm for the machine calculation of complex Fourier series. Math. Comp., 19:297-301, 1965.
    • (1965) Math. Comp. , vol.19 , pp. 297-301
    • Cooley, J.1    Tukey, J.2
  • 9
    • 0036049545 scopus 로고    scopus 로고
    • Finite field linear algebra subroutines
    • ACM
    • J.-G. Dumas, T. Gautier, and C. Pernet. Finite field linear algebra subroutines. In ISSAC 02, pages 63-74. ACM, 2002.
    • (2002) ISSAC 02 , pp. 63-74
    • Dumas, J.-G.1    Gautier, T.2    Pernet, C.3
  • 15
    • 27644450555 scopus 로고    scopus 로고
    • The truncated fourier transform and applications
    • ACM
    • J. van der Hoeven. The Truncated Fourier Transform and applications. In ISSAC 04, pages 290-296. ACM, 2004.
    • (2004) ISSAC 04 , pp. 290-296
    • Van Der Hoeven, J.1
  • 16
    • 33748956212 scopus 로고    scopus 로고
    • The University of Western Ontario
    • http://www.aldor.org. The Aldor compiler web site. The University of Western Ontario, 2002.
    • (2002)
  • 17
    • 33748981934 scopus 로고    scopus 로고
    • The LinBox group
    • http://www.linalg.org/.LinBox. The LinBox group, 2005.
    • (2005) LinBox
  • 18
    • 11144229048 scopus 로고    scopus 로고
    • V. Shoup
    • http://www.shoup.net/ntl. The Number Theory Library. V. Shoup, 1996-2006.
    • (1996) The Number Theory Library
  • 20
    • 33748970197 scopus 로고    scopus 로고
    • Architecture-aware classical Taylor shift by 1
    • ACM
    • J. R. Johnson, W. Krandick, and A. D. Ruslanov. Architecture-aware classical Taylor shift by 1. In ISSAC 05, pages 200-207. ACM, 2005.
    • (2005) ISSAC 05 , pp. 200-207
    • Johnson, J.R.1    Krandick, W.2    Ruslanov, A.D.3
  • 21
    • 0001464763 scopus 로고
    • Multiplication of multidigit numbers on automata
    • A. Karatsuba and Yu. Ofman. Multiplication of multidigit numbers on automata. Sov. Phys. Dokl., (7):595-596, 1963.
    • (1963) Sov. Phys. Dokl. , Issue.7 , pp. 595-596
    • Karatsuba, A.1    Ofman, Yu.2
  • 24
    • 33748955102 scopus 로고    scopus 로고
    • Half-gcd and fast rational recovery
    • ACM
    • D. Lichtblau. Half-gcd and fast rational recovery. In ISSAC 05, pages 231-236. ACM, 2005.
    • (2005) ISSAC 05 , pp. 231-236
    • Lichtblau, D.1
  • 25
    • 84931426867 scopus 로고
    • Practical fast polynomial multiplication
    • ACM
    • R. T. Moenck. Practical fast polynomial multiplication. In SYMSAC 76, pages 136-148, ACM, 1976.
    • (1976) SYMSAC 76 , pp. 136-148
    • Moenck, R.T.1
  • 26
    • 0001465210 scopus 로고
    • A new polynomial factorization algorithm and its implementation
    • V. Shoup. A new polynomial factorization algorithm and its implementation. J. Symb. Comp., 20(4):363-397, 1995.
    • (1995) J. Symb. Comp. , vol.20 , Issue.4 , pp. 363-397
    • Shoup, V.1
  • 27
    • 34250487811 scopus 로고
    • Gaussian elimination is not optimal
    • V. Strassen. Gaussian elimination is not optimal. Numerische Mathematik., 13:354-356, 1969.
    • (1969) Numerische Mathematik. , vol.13 , pp. 354-356
    • Strassen, V.1
  • 28
    • 33748970926 scopus 로고
    • The A# programming language and its compiler
    • IBM Research
    • S. M. Watt. The A# programming language and its compiler. Technical report, IBM Research, 1993.
    • (1993) Technical Report
    • Watt, S.M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.