Risa is the name of whole libraries of a computer algebra system (CAS) which is under development at FUJITSU LABORATORIES LIMITED. The structure of Risa is as follows. - The basic algebraic engine This is the part which performs basic algebraic operations, such as arithmetic operations, to algebraic objects, e.g., numbers and polynomials, which are already converted into internal forms. It exists, like `libc.a’ of UNIX, as a library of ordinary UNIX system. The algebraic engine is written mainly in C language and partly in assembler. It serves as the basic operation part of Asir, a standard language interface of Risa. - Memory Manager Risa employs, as its memory management component (the memory manager), a free software distributed by Boehm (gc-6.1alpha5). It is proposed by [Boehm,Weiser], and developed by Boehm and his colleagues. The memory manager has a memory allocator which automatically reclaims garbages, i.e., allocated but unused memories, and refreshes them for further use. The algebraic engine gets all its necessary memories through the memory manager. - Asir Asir is a standard language interface of Risa’s algebraic engine. It is one of the possible language interfaces, because one can develop one’s own language interface easily on Risa system. Asir is an example of such language interfaces. Asir has very similar syntax and semantics as C language. Furthermore, it has a debugger that provide a subset of commands of dbx, a widely used debugger of C language.

This software is also referenced in ORMS.

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

Showing results 61 to 80 of 111.
Sorted by year (citations)
  1. Berkesch, Christine; Leykin, Anton: Algorithms for Bernstein-Sato polynomials and multiplier ideals (2010)
  2. Montes, Antonio; Wibmer, Michael: Gröbner bases for polynomial systems with parameters (2010)
  3. Nabeshima, Katsusuke: On the computation of parametric Gröbner bases for modules and syzygies (2010)
  4. Nishiyama, Kenta; Noro, Masayuki: Stratification associated with local (b)-functions (2010)
  5. Noro, Masayuki: New algorithms for computing primary decomposition of polynomial ideals (2010)
  6. Andres, Daniel; Levandovskyy, Viktor; Morales, Jorge Martín: Principal intersection and Bernstein-Sato polynomial of an affine variety (2009)
  7. Inoue, Shutaro: On the computation of comprehensive Boolean Gröbner bases (2009)
  8. Inoue, Shutaro; Nagai, Akira: On the implementation of Boolean Gröbner bases (2009)
  9. Inoue, Shutaro; Sato, Yosuke: Implementation of Boolean Gröbner bases in Risa/Asir (2009)
  10. Nakayama, Hiromasa; Sekiguchi, Jiro: Determination of (b)-functions of polynomials defining Saito free divisors related with simple curve singularities of types (E_6,E_7,E_8) (2009)
  11. Noro, Masayuki: Modular algorithms for computing a generating set of the syzygy module (2009)
  12. Ohara, Katsuyoshi; Tajima, Shinichi: Spectral decomposition and eigenvectors of matrices by residue calculus (2009)
  13. Ohara, Katsuyoshi; Takayama, Nobuki: Holonomic rank of (\mathcalA)-hypergeometric differential-difference equations (2009)
  14. Sato, Yosuke; Suzuki, Akira: Computation of inverses in residue class rings of parametric polynomial ideals (2009)
  15. Suzuki, Akira: Computing Gröbner bases within linear algebra (2009)
  16. Suzuki, Akira: Computing Gröbner bases within linear algebra and its implementation (2009)
  17. Kaneko, Masanobu; Noro, Masayuki; Tsurumaki, Ken’ichi: On a conjecture for the dimension of the space of the multiple zeta values (2008)
  18. Kurata, Yosuke; Noro, Masayuki: Computation of discrete comprehensive Gröbner bases using modular dynamic evaluation (2007)
  19. Montaner, J. Àlvarez; Castro-Jiménez, F. J.; Ucha, J. M.: Localization at hyperplane arrangements: combinatorics and (\mathcalD)-modules (2007)
  20. Nabeshima, Katsusuke: A speed-up of the algorithm for computing comprehensive Gröbner systems (2007)