Symbolic and Algebraic Computation [electronic resource] : EUROSM '79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, France, June 1979 / edited by Edward W. Ng.

Contributor(s): Ng, Edward W [editor.] | SpringerLink (Online service)Material type: TextTextSeries: Lecture Notes in Computer Science ; 72Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1979Description: XVII, 563 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540351283Subject(s): Computer science | Computer Science | Computer Science, generalAdditional physical formats: Printed edition:: No titleDDC classification: 004 LOC classification: QA75.5-76.95Online resources: Click here to access online
Contents:
A criterion for detecting unnecessary reductions in the construction of Gröbner-bases -- Unification of commutative terms -- Canonicality in rule systems -- The application of symbolic algebra to physics — A case of creeping flow -- Progress towards a solution of the equivalence problem in general relativity -- Symbol calculus by symbolic computation and semi-classical expansions -- An algorithm for the analytic evaluation of a class of integrals -- Fast computation of the rational hermite interpolant and solving toeplitz systems of equations via the extended Euclidean algorithm -- Approximate algorithms to derive exact solutions to systems of linear equations -- New recursive minor expansion algorithms, a presentation in a comparative context -- Systems of algebraic equations -- On the van der waerden criterion for the group of an equation -- Some computations related to torsion points on elliptic curves over number fields -- The computerisation of algebraic geometry -- Algebraic extensions of arbitrary integral domains -- On unit computation in real quadratic fields -- An algebraic form of a solution of a system of linear differential equations with constant coefficients -- Substitution methods for the automatic symbolic solution of differential equations of first order and first degree -- A semi-numeric difference algorithm -- Convergence behaviour of the Newton iteration for first order differential equations -- Probabilistic algorithms for verification of polynomial identities -- Probabilistic algorithms for sparse polynomials -- Non-modular computation of polynomial GCDS using trial division -- Product of symmetric and anti-symmetric polynomials -- Capabilities of the mumath-79 computer algebra system for the intel-8080 microprocessor -- CAMAC 1979 -- The initial design of a vector based algebra system -- Hashing — the key to rapid pattern matching -- A system for automatic generation of tensor algorithms and indicial tensor calculus, including substitution of sums -- Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion -- A cellular decomposition algorithm for semialgebraic sets -- Gamma-algebra algorithms for canonical hypercomplex representations -- Factoring univariate integral polynomials in polynomial average time -- Symbolic-numeric interface: A review -- A note on methods for solving systems of polynomial equations with floating point coefficients -- An arbitrary precision real arithmetic package in REDUCE -- Symbolic preprocessing in interval function computing -- Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation -- Symbolic integration — the dust settles? -- Integration of simple radical extensions -- Algorithms for the integration of algebraic functions -- An extension of liouville's theorem -- Integer matrices and Abelian groups -- An algorithm for the computation of conjugacy classes and centralizers in p-groups -- MODLISP: An introduction -- Extending interlisp for modularization and efficiency -- TLISP — A “transportable-lisp” implemented in pcode -- Symbolic computing with compression of data structures: General observations, and a case study -- On the design of algebraic data structures with the approach of abstract data types -- Matching under commutativity -- ?-algebra algorithms for canonical hypercomplex representations.
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 EBK4141

A criterion for detecting unnecessary reductions in the construction of Gröbner-bases -- Unification of commutative terms -- Canonicality in rule systems -- The application of symbolic algebra to physics — A case of creeping flow -- Progress towards a solution of the equivalence problem in general relativity -- Symbol calculus by symbolic computation and semi-classical expansions -- An algorithm for the analytic evaluation of a class of integrals -- Fast computation of the rational hermite interpolant and solving toeplitz systems of equations via the extended Euclidean algorithm -- Approximate algorithms to derive exact solutions to systems of linear equations -- New recursive minor expansion algorithms, a presentation in a comparative context -- Systems of algebraic equations -- On the van der waerden criterion for the group of an equation -- Some computations related to torsion points on elliptic curves over number fields -- The computerisation of algebraic geometry -- Algebraic extensions of arbitrary integral domains -- On unit computation in real quadratic fields -- An algebraic form of a solution of a system of linear differential equations with constant coefficients -- Substitution methods for the automatic symbolic solution of differential equations of first order and first degree -- A semi-numeric difference algorithm -- Convergence behaviour of the Newton iteration for first order differential equations -- Probabilistic algorithms for verification of polynomial identities -- Probabilistic algorithms for sparse polynomials -- Non-modular computation of polynomial GCDS using trial division -- Product of symmetric and anti-symmetric polynomials -- Capabilities of the mumath-79 computer algebra system for the intel-8080 microprocessor -- CAMAC 1979 -- The initial design of a vector based algebra system -- Hashing — the key to rapid pattern matching -- A system for automatic generation of tensor algorithms and indicial tensor calculus, including substitution of sums -- Analysis of the p-adic construction of multivariate correction coefficiencts in polynomial factorization: Iteration vs. recursion -- A cellular decomposition algorithm for semialgebraic sets -- Gamma-algebra algorithms for canonical hypercomplex representations -- Factoring univariate integral polynomials in polynomial average time -- Symbolic-numeric interface: A review -- A note on methods for solving systems of polynomial equations with floating point coefficients -- An arbitrary precision real arithmetic package in REDUCE -- Symbolic preprocessing in interval function computing -- Approximate rational arithmetic systems: Analysis of recovery of simple fractions during expression evaluation -- Symbolic integration — the dust settles? -- Integration of simple radical extensions -- Algorithms for the integration of algebraic functions -- An extension of liouville's theorem -- Integer matrices and Abelian groups -- An algorithm for the computation of conjugacy classes and centralizers in p-groups -- MODLISP: An introduction -- Extending interlisp for modularization and efficiency -- TLISP — A “transportable-lisp” implemented in pcode -- Symbolic computing with compression of data structures: General observations, and a case study -- On the design of algebraic data structures with the approach of abstract data types -- Matching under commutativity -- ?-algebra algorithms for canonical hypercomplex representations.

There are no comments on this title.

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

Powered by Koha