EUROSAM 84
Editat de J. Fitchen Limba Engleză Paperback – iun 1984
Preț: 327.92 lei
Preț vechi: 409.89 lei
-20%
Puncte Express: 492
Carte tipărită la comandă
Livrare economică 09-23 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: 9783540133506
ISBN-10: 354013350X
Pagini: 412
Ilustrații: XI, 397 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1984
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354013350X
Pagini: 412
Ilustrații: XI, 397 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.62 kg
Ediția:1984
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Homogeneous linear difference equation (Frobenius — Boole method).- An experiment toward a general quadrature for second order linear ordinary differential equations by symbolic computation.- Operational calculus techniques for solving differential equations.- On the application of symbolic computation to nonlinear control theory.- Quartic equations and algorithms for riemann tensor classification.- Symbolic computation and the Dirichlet problem.- Simplification of polynomials in n variables.- On the equivalence of hierarchical and non-hierarchical rewriting on conditional term rewriting systems.- Implementation of a p-adic package for polynomial factorization and other related operations.- Computations on curves.- Detecting torsion divisors on curves of genus 2.- Computation in radical extensions.- A primer: 11 Keys to new scratchpad.- A pure and really simple initial functional algebraic language.- Some effectivity problems in polynomial ideal theory.- Upper and lower bounds for the degree of Groebner bases.- On the complexity of the Gröbner-bases algorithm over K[x,y,z].- Algorithms for computing Gröbner bases of polynomial ideals over various Euclidean rings.- Computations with rational subsets of confluent groups.- Camac2: A portable system for combinatorial and algebraic computation.- Polynomial time algorithms for Galois groups.- Code generation and optimization for finite element analysis.- A comparison of algorithms for the symbolic computation of Padé approximants.- Automatic error cumulation control.- Polynomial factorization by root approximation.- Effective Hilbert irreducibility.- GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation.- A new lifting process for the multivariate polynomial factorization.- Explicit construction ofthe hilbert class fields of imaginary quadratic fields with class numbers 7 and 11.- On a simple primality testing algorithm.- A criterion for the equivalence of two ideals.- y?+fy=g.- Integration in finite terms with special functions: A progress report.- A note on the Risch differential equation.- Approximation by continued fraction of a polynomial real root.- On the automatic resolution of certain diophantine equations.- On pseudo-resultants.