Symbolic and Algebraic Computation
Editat de Patrizia Giannien Limba Engleză Paperback – 23 aug 1989
Preț: 335.48 lei
Preț vechi: 419.35 lei
-20%
Puncte Express: 503
Carte tipărită la comandă
Livrare economică 07-21 iulie
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540510840
ISBN-10: 3540510842
Pagini: 560
Ilustrații: XII, 488 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.84 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540510842
Pagini: 560
Ilustrații: XII, 488 p.
Dimensiuni: 155 x 235 x 30 mm
Greutate: 0.84 kg
Ediția:1989
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Dynamic maintenance of paths and path expressions on graphs.- Generic programming.- From a noncomputability result to new interesting definitions and computability results.- Symbolic derivation and automatic generation of parallel routines for finite element analysis.- Liouvillian first integrals of differential equations.- Fast reduction of the Risch differential equation.- An application of reduce to the approximation of F(X,Y).- The use of symbolic computation in solving some non-relativistic quantum mechanical problems.- Experiments with quadtree representation of matrices.- Discovering inequality conditions in the analytical solution of optimization problems.- Can EXCALC be used to investigate high-dimensional cosmological models with non-linear Lagrangians?.- Gröbner trace algorithms.- Solving systems of algebraic equations.- Groebner bases in non-commutative algebras.- Greater easy common divisor and standard basis completion algorithms.- Experiments with a projection operator for algebraic decomposition.- Rational Newton algorithm for computing formal solutions of linear differential equations.- An ordinary differential equation solver for REDUCE.- A fixed point method for power series computation.- An algorithm for symbolic computation of center manifolds.- Shortest division chains in imaginary quadratic number fields.- Effective tests for cyclotomic polynomials.- The probability of relative primality of Gaussian integers.- Some computational aspects of root finding in GF(qm).- Symbolic computation for Witt rings.- Computations with algebraic curves.- On the computational complexity of the resolution of plane curve singularities.- Generalized characteristic polynomials.- Decomposition of algebras.- Algebraic transformations of polynomial equations, symmetricpolynomials and elimination.- Tetrahedrizing point sets in three dimensions.- A generalization of the roider method to solve the robot collision problem in 3D.- Symbolic analysis of planar drawings.- A geometrical decision algorithm based on the gröbner bases algorithm.- Solving permutation problems using rewriting systems.- Applying rewriting techniques to groups with power-commutation-presentations.- Efficient decision procedures for locally finite theories II.- Aformal approach to some usually informal techniques used in mathematical reasoning.- Decision procedures for elementary sublanguages of set theory. XIV. Three languages involving rank related constructs.- Computer algebra on MIMD machine.- Algebraic extensions and algebraic closure in Scratchpad II.- Software development for computer algebra or from ALDES/SAC-2 to WEB/Modula-2.- Cayley, version 4: The user language.- Improved sparse multivariate polynomial interpolation algorithms.- Heuristic methods for operations with algebraic numbers.- Asymptotic estimation of oscillating functions using an interval calculus.- A new algorithm for computing symbolic limits using hierarchical series.- Verification of non-identities in algebras.- Equations in words.- Cayley factorization.- Complexity of computing the characters and the genre of a system of exterior differential equations.