Computer Algebra [electronic resource] : EUROCAL'83, European Computer Algebra Conference London, England, March 28–30, 1983 Proceedings /
Integration — What do we want from the theory? -- The Euclidean algorithm for Gaussian integers -- Multi polynomial remainder sequence and its application to linear diophantine equations -- Towards mechanical solution of the Kahan ellipse problem I -- Automatically determining symmetries of ordinary differential equations -- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations -- Characterization of a linear differential system with a regular singularity -- The Bath Concurrent LISP machine -- The ecology of LISP or the case for the preservation of the environment -- The design of Maple: A compact, portable, and powerful computer algebra system -- LISP compilation viewed as provable semantics preserving program transformation -- Implementing REDUCE on a microcomputer -- A note on the complexity of constructing Gröbner-bases -- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations -- The computation of the Hilbert function -- An algorithm for constructing detaching bases in the ring of polynomials over a field -- On the problem of Beh? Edd?n 'Am?l? and the computation of height functions -- A procedure for determining algebraic integers of given norm -- Computation of integral solutions of a special type of systems of quadratic equations -- Factorisation of sparse polynomials -- Early detection of true factors in univariate polynomial factorization -- On the complexity of finding short vectors in integer lattices -- Factoring polynomials over algebraic number fields -- The construction of a complete minimal set of contextual normal forms -- A knowledge-based approach to user-friendliness in symbolic computing -- Computer algebra and VLSI, prospects for cross fertilization -- Code optimization of multivariate polynomial schemes: A pragmatic approach.
Main Authors: | , |
---|---|
Format: | Texto biblioteca |
Language: | eng |
Published: |
Berlin, Heidelberg : Springer Berlin Heidelberg,
1983
|
Subjects: | Mathematics., Numerical analysis., Numerical Analysis., |
Online Access: | http://dx.doi.org/10.1007/3-540-12868-9 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Integration — What do we want from the theory? -- The Euclidean algorithm for Gaussian integers -- Multi polynomial remainder sequence and its application to linear diophantine equations -- Towards mechanical solution of the Kahan ellipse problem I -- Automatically determining symmetries of ordinary differential equations -- Algebraic computation of the statistics of the solution of some nonlinear stochastic differential equations -- Characterization of a linear differential system with a regular singularity -- The Bath Concurrent LISP machine -- The ecology of LISP or the case for the preservation of the environment -- The design of Maple: A compact, portable, and powerful computer algebra system -- LISP compilation viewed as provable semantics preserving program transformation -- Implementing REDUCE on a microcomputer -- A note on the complexity of constructing Gröbner-bases -- Gröbner bases, Gaussian elimination and resolution of systems of algebraic equations -- The computation of the Hilbert function -- An algorithm for constructing detaching bases in the ring of polynomials over a field -- On the problem of Beh? Edd?n 'Am?l? and the computation of height functions -- A procedure for determining algebraic integers of given norm -- Computation of integral solutions of a special type of systems of quadratic equations -- Factorisation of sparse polynomials -- Early detection of true factors in univariate polynomial factorization -- On the complexity of finding short vectors in integer lattices -- Factoring polynomials over algebraic number fields -- The construction of a complete minimal set of contextual normal forms -- A knowledge-based approach to user-friendliness in symbolic computing -- Computer algebra and VLSI, prospects for cross fertilization -- Code optimization of multivariate polynomial schemes: A pragmatic approach. |
---|