Computer Algebra [electronic resource] : EUROCAL'83, European Computer Algebra Conference London, England, March 28–30, 1983 Proceedings / edited by J. A. Hulzen.

Contributor(s): Hulzen, J. A [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 162Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1983Description: XIII, 306 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540387565Subject(s): Mathematics | Numerical analysis | Mathematics | Numerical AnalysisAdditional physical formats: Printed edition:: No titleDDC classification: 518 LOC classification: QA297-299.4Online resources: Click here to access online
Contents:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK4536

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha