Fundamental Problems of Algorithmic Algebra
简介：
流行的计算机代数系统，如Maple，Macsyma，Mathematica和REDUCE现在是大多数计算机上的基本工具。用于各种代数运算的有效算法是所有这些系统的基础。计算机代数或算法代数研究这些算法及其属性，代表了理论计算机科学与经典数学的丰富交集。
算法代数的基本问题提供了对核心问题集合的系统而集中的处理，这些核心问题是代数及其导数的经典基本问题的计算等价物。涵盖的主题包括GCD，子结果，模块化技术，代数的基本定理，多项式的根，Sturm理论，高斯晶格约简，晶格和多项式因式分解，线性系统，消除理论，Grobner基等。
英文简介：
Popular computer algebra systems such as Maple, Macsyma, Mathematica, and REDUCE are now basic tools on most computers. Efficient algorithms for various algebraic operations underlie all these systems. Computer algebra, or algorithmic algebra, studies these algorithms and their properties and represents a rich intersection of theoretical computer science with classical mathematics.
Fundamental Problems of Algorithmic Algebra provides a systematic and focused treatment of a collection of core problemsthe computational equivalents of the classical Fundamental Problem of Algebra and its derivatives. Topics covered include the GCD, subresultants, modular techniques, the fundamental theorem of algebra, roots of polynomials, Sturm theory, Gaussian lattice reduction, lattices and polynomial factorization, linear systems, elimination theory, Grobner bases, and more.
- 书名
- Fundamental Problems of Algorithmic Algebra
- 译名
- 算法代数的基本问题
- 语言
- 英语
- 页数
- 546页
- 大小
- 5.06 MB
- 标签
- 代数
- 算法
- 数学
- 下载
Fundamental Problems of Algorithmic Algebra.pdf- 密码
- 65536
最后更新：2025-04-12 23:57:40