scientific article
From MaRDI portal
Publication:3992490
zbMath0675.68001MaRDI QIDQ3992490
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Software, source code, etc. for problems pertaining to number theory (11-04) Software, source code, etc. for problems pertaining to field theory (12-04)
Related Items
Non-standard H control problem: A generalized chain-scattering representation approach, Complexity of real root isolation using continued fractions, Computing the reciprocal of units in Galois rings, Matrix computation of subresultant polynomial remainder sequences in integral domains, Algorithms and programs for calculating the roots of polynomial of one or two variables, Improved bounds for the CF algorithm, On the complexity of computing the greatest common divisor of several univariate polynomials, Symbolic-numerical solution of systems of linear ordinary differential equations with required accuracy, A Gröbner bases-based rule based expert system for fibromyalgia diagnosis, An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases, Does computer algebra help at all learning about real numbers?, Symbolic derivation of the equations of caustics about a crack tip, Algorithmes des fractions continues et de Jacobi-Perron, How to count the number of zeros that a polynomial has on the unit circle?, The effect of the nonuniformity of the Earth's magnetic field on electrodynamic space tether system dynamics, Orthogonal polynomials and Möbius transformations, On the complexity of real root isolation using continued fractions, Detecting algebraic curves in bad position, Symbolic and numerical analysis of the restricted five body problem using computer algebra, An algebraic approach to rule based expert systems, Invariant coordinate subspaces of normal form of a system of ordinary differential equations, Exact, efficient, and complete arrangement computation for cubic curves, On the Bézout construction of the resultant, Localization of real algebraic hypersurfaces with applications to the enumeration of the classes of relative equilibria of a \((5+1)\)-body problem, An Algorithm for Symbolic Solving of Differential Equations and Estimation of Accuracy, Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision, Fields of algebraic numbers computable in polynomial time. I, Algorithme de Bareiss, algorithme des sous-résultants, A general method of finding new symplectic schemes for Hamiltonian mechanics, Sur la vie et l'oeuvre de François Budan (1761--1840). (On the life and work of F. Budan), Searching for applicable versions of computable structures
Uses Software
