FOXBOX: A system for manipulating symbolic objects in black box representation. The FOXBOX system puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations. Black box objects are stored as functions. For instance: a black box polynomial is a procedure that takes values for the variables as input and evaluates the polynomial at that given point. FOXBOX can compute the greatest common divisor and factorize polynomials in black box representation, producing as output new black boxes. It also can compute the standard sparse distributed representation of a black box polynomial, for example, one which was computed for an irreducible factor. We establish that the black box representation of objects can push the size of symbolic expressions far beyond what standard data structures could handle before. Furthermore, FOXBOX demonstrates the generic program design methodology. The FOXBOX system is written in C++. C++ template arguments provide for abstract domain types. Currently, FOXBOX can be compiled with SACLIB 1.1, Gnu-MP 1.0, and NTL 2.0 as its underlying field and polynomial arithmetic. Multiple arithmetic plugins can be used in the same computation. FOXBOX provides an MPI compliant distribution mechanism that allows for parallel and distributed execution of FOXBOX programs. Finally, FOXBOX plugs into a server/client-style Maple application interface.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 15 articles , 1 standard article )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Cuyt, Annie; Lee, Wen-Shin: Sparse interpolation of multivariate rational functions (2011)
  2. Giesbrecht, Mark; Labahn, George; Lee, Wen-Shin: Symbolic-numeric sparse interpolation of multivariate polynomials (2009)
  3. Kaltofen, Erich; Yang, Zhengfeng: On exact and approximate interpolation of sparse rational functions (2007)
  4. Giesbrecht, Mark; Kaltofen, Erich; Lee, Wen-shin: Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases (2003)
  5. Kaltofen, Erich; Lee, Wen-shin: Early termination in sparse interpolation algorithms (2003)
  6. Schreiner, Wolfgang; Mittermaier, Christian; Bosa, Karoly: Distributed Maple: Parallel computer algebra in networked environments. (2003)
  7. Bruno, N.; Heintz, J.; Matera, G.; Wachenchauzer, R.: Functional programming concepts and straight-line programs in computer algebra (2002)
  8. Dumas, J.-G.; Gautier, T.; Giesbrecht, M.; Giorgi, P.; Hovinen, B.; Kaltofen, E.; Saunders, B.D.; Turner, W.J.; Villard, G.: LinBox: A generic library for exact linear algebra (2002)
  9. Giesbrecht, Mark; Kaltofen, Erich; Lee, Wen-shin: Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm (2002)
  10. Petcu, Dana: Solving initial value problems with parallel Maple processes (2001)
  11. Schreiner, Wolfgang: Manager-worker parallelism versus dataflow in a distributed computer algebra system (2001)
  12. Mourrain, Bernard; Trebuchet, Philippe: Solving projective complete intersection faster (2000)
  13. Schreiner, Wolfgang; Mittermaier, Christian; Winkler, Franz: Plotting algebraic space curves by cluster computing (2000)
  14. Díaz, Angel; Kaltofen, Erich: FOXBOX: A system for manipulating symbolic objects in black box representation (1998)
  15. Gloor, Oliver (ed.): Proceedings of the 1998 international symposium on symbolic and algebraic computation, ISSAC ’98, Rostock, Germany, August 13--15, 1998 (1998)