Results 1  10
of
16,869
The Magma Algebra System I: The User Language
, 1997
"... In the first of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets. ..."
Abstract

Cited by 1346 (7 self)
 Add to MetaCart
In the first of two papers on Magma, a new system for computational algebra, we present the Magma language, outline the design principles and theoretical background, and indicate its scope and use. Particular attention is given to the constructors for structures, maps, and sets.
and computer algebra
, 2008
"... In this paper there we describe the calculational background of deriving a strong meson Lagrangian from the Nambu–JonaLasinio quark model using the computer algebra systems FORM and REDUCE in recursive algorithms, based on the heatkernel method for the calculation of the quark determinant. 0 Compu ..."
Abstract
 Add to MetaCart
In this paper there we describe the calculational background of deriving a strong meson Lagrangian from the Nambu–JonaLasinio quark model using the computer algebra systems FORM and REDUCE in recursive algorithms, based on the heatkernel method for the calculation of the quark determinant. 0
computer algebra
, 2002
"... Let L be a linear differential operator with polynomial coefficients. We show that there is an isomorphism of differential operators Dα and an integral transform Hα (called the Hermite transform) on functions for which (DαL)f(x) = 0 implies LHα(f)(x) = 0. We present an algorithm that computes the ..."
Abstract
 Add to MetaCart
Let L be a linear differential operator with polynomial coefficients. We show that there is an isomorphism of differential operators Dα and an integral transform Hα (called the Hermite transform) on functions for which (DαL)f(x) = 0 implies LHα(f)(x) = 0. We present an algorithm that computes
Computer Algebra, and the
"... The solutions of the matrix equation S expS = A are studied. This is motivated by the study of systems of delay differential equations y′(t) = Ay(t−1), which occur in some models of practical interest, especially in mathematical biology. This paper concentrates on the distinction between evaluati ..."
Abstract
 Add to MetaCart
evaluating a matrix function and solving a matrix equation. As is wellknown in the theory of computing matrix functions, there can be difficult, exceptional cases. This paper examines some of these; specifically, it shows that the matrix Lambert W function evaluated at the matrix A does not represent all
An Extended Set of Fortran Basic Linear Algebra Subprograms
 ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE
, 1986
"... This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers. ..."
Abstract

Cited by 523 (68 self)
 Add to MetaCart
This paper describes an extension to the set of Basic Linear Algebra Subprograms. The extensions are targeted at matrixvector operations which should provide for efficient and portable implementations of algorithms for high performance computers.
Computer Algebra: General Principles
"... For article on related subject see SYMBOL MANIPULATION. Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish computer algebra from numerical analysis, the other principal branch of scientific computation. (1) Computer algebra involves com ..."
Abstract
 Add to MetaCart
For article on related subject see SYMBOL MANIPULATION. Computer algebra is a branch of scientific computation. There are several characteristic features that distinguish computer algebra from numerical analysis, the other principal branch of scientific computation. (1) Computer algebra involves
Computer Algebra and Theorem Proving
, 1999
"... Is the use of computer algebra technology beneficial for mechanised reasoning in and about mathematical domains? Usually it is assumed that it is. Many works in this area, however, either have little reasoning content, or use symbolic computation only to simplify expressions. In work that has achiev ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
Is the use of computer algebra technology beneficial for mechanised reasoning in and about mathematical domains? Usually it is assumed that it is. Many works in this area, however, either have little reasoning content, or use symbolic computation only to simplify expressions. In work that has
REDLOG Computer Algebra Meets Computer Logic
 ACM SIGSAM Bulletin
, 1996
"... . redlog is a package that extends the computer algebra system reduce to a computer logic system, i.e., a system that provides algorithms for the symbolic manipulation of firstorder formulas over some temporarily fixed language and theory. In contrast to theorem provers, the methods applied know a ..."
Abstract

Cited by 130 (30 self)
 Add to MetaCart
. redlog is a package that extends the computer algebra system reduce to a computer logic system, i.e., a system that provides algorithms for the symbolic manipulation of firstorder formulas over some temporarily fixed language and theory. In contrast to theorem provers, the methods applied know
Results 1  10
of
16,869