电子版pdf 吴文俊全集《数学机械化卷 I》THE COMPLETE WORKS OF WU WEN-TSUN MATHEMATICS MECHANIZATION I

+++++++++
①本站的扒谱扒带一般只涉及扒音轨,如果是涉及到旋律音高等全面的扒带扒谱会特别给出MIDI文件!
②本站资源自助高速下载!部分资源无需注册登录(部分需要会标明登录,注册登录后(点击这里)需要去个人中心充值:点击这里)点击立即支付后支付宝扫二维码支付,等待页面跳转显示下载链接(手机端需手动刷新页面,推荐电脑访问)! +++++++++++++++
请尽快抓紧及时下载,24小时后访问失效!有事文章底部留言或请取得QQ联系:联系我们
本站所有电子书内页预览(按网址中的编号):点击查看

本文链接网址:
https://ebook.zhensi.org/shuxue-68.html

文件大小:059.24 MB 吴文俊全集-数学机械化卷 I=THE COMPLETE WORKS OF WU WEN-TSUN MATHEMATICS MECHANIZATION I

下载地址:

此付款无需注册!付款后等候跳转显示!您需要先支付 30元 才能查看此处内容!立即支付

吴文俊全集(数学机械化卷Ⅰ)(精)
作者:吴文俊出版社:龙门书局出版时间:2019年05月

http://img3m1.ddimg.cn/24/18/11106921201-1_u_1.jpg

开 本:16开
纸 张:胶版纸
包 装:平装-胶订
是否套装:否
国际标准书号ISBN:9787508855509
所属分类:
图书>自然科学>力学

内容简介
本卷收录了吴文俊的Mathematics Mechanization: MechanicalGeometry Theorem-Proving,Mechanical Geometry Problem-Solving andPolynomial Equations-Solving一书。本书是围绕作者命名的“数学机械化”这一中心议题而陆续发表的一系列论文的综述。本书试图以构造性与算法化的方式来研究数学,使数学推理机械化以至于自动化,由此减轻繁琐的脑力劳动。
全书分成三个部分: 部分考虑数学机械化的发展历史,特别强调在古代中国的发展历史。第二部分给出求解多项式方程组所依据的基本原理与特征列方法。作为这一方法的基础,本书还论述了构造性代数几何中的若干问题。 第三部分给出了特征列方法在几何定理证明与发现、机器人、天体力学、全局优化和计算机辅助设计等领域中的应用。

本书可供数学工作者、数学及计算机专业高年级大学生和研究生以及有关工程人员参阅。

目  录
Chapter 1 Polynomial Equations-Solving in Ancient Times, Mainly in Ancient China
1.1 A Brief Deion of History of Ancient China and Mathematics Classics in Ancient China
1.2 Polynomial Equations-Solving in Ancient China
1.3 Polynomial Equations-Solving in Ancient Times beyond China and the Program of Descartes
Chapter 2 Historical Development of Geometry Theorem-Proving and Geometry Problem-Solving in Ancient Times
2.1 Geometry Theorem-Proving from Euclid to Hilbert
2.2 Geometry Theorem-Proving in the Computer Age
2.3 Geometry Problem-Solving and Geometry Theorem-Proving in Ancient China
Chapter 3 Algebraic Varieties as Zero-Sets and Characteristic-Set Method
3.1 Affine and Projective SpaceExtended Points and Specialization
3.2 Algebraic Varieties and Zero-Sets
3.3 Polsets and Ascending SetsPartial Ordering
3.4 Characteristic Set of a Polset and Well-Ordering Principle
3.5 Zero-Decomposition Theorems
3.6 Variety-Decomposition Theorems
Chapter 4 Some Topics in Computer Algebra
4.1 Tuples of integers
4.2 Well-Arranged Basis of a Polynomial Ideal
4.3 Well-Behaved Basis of a Polynomial Idea l
4.4 Properties of Well-Behaved Basis and its Relationship with Groebner Basis
4.5 Factorization and of Multivariate Polynomials over Arbitrary Extension Fields
Chapter 5 Some Topics in Computational Algebraic Geometry
5.1 Some Important Characters of Algebraic Varieties Complex and Real Varieties
5.2 Algebraic Correspondence and Chow Form
5.3 Chern Classes and Chern Numbers of an Irreducible Algebraic Variety with Arbitrary Singularities
5.4 A Projection Theorem on Quasi-Varieties
5.5 Extremal Properties of Real Polynomials
Chapter 6 Applications to Polynomial Equations-Solving
6.1 Basic Principles of Polynomial Equations-Solving: The Char-Set Method
6.2 A Hybrid Method of Polynomial Equations-Solving
6.3 Solving of Problems in Enumerative Geometry
6.4 Central Configurations in Planet Motions and Vortex Motions
6.5 Solving of Inverse Kinematic Equations in Robotics
Chapter 7 Appicaltions to Geometry Theorem-Proving
7.1 Basic Principles of Mechanical Geometry Theorem-Proving
7.2 Mechanical Proving of Geometry Theorems of Hilbertian Type
7.3 Mechanical Proving of Geometry Theorems involving Equalities Alone
7.4 Mechanical Proving of Geometry Theorems involving Inequalities
Chapter 8 Diverse Applications
8.1 Applications to Automated Discovering of Unknown Relations and Automated Determination of Geometric Loci
8.2 yApplications to Problems involving Inequalities, Optimization Problems, and Non-Linear Programming
8.3 Applications to 4-Bar Linkage Design
8.4 Applications to Surface-Fitting Problem in CAGD
8.5 Some Miscellaneous Complements and Extensions
Bibliography
Index

Related Posts:

Tagged . Bookmark the permalink.

发表评论