標題: Titlebook: Computer Algebra; Symbolic and Algebra Bruno Buchberger,George Edwin Collins,Rüdiger Loos Book 19821st edition Springer-Verlag Wien 1982 al [打印本頁] 作者: 過分愛國主義 時間: 2025-3-21 19:21
書目名稱Computer Algebra影響因子(影響力)
書目名稱Computer Algebra影響因子(影響力)學(xué)科排名
書目名稱Computer Algebra網(wǎng)絡(luò)公開度
書目名稱Computer Algebra網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Computer Algebra被引頻次
書目名稱Computer Algebra被引頻次學(xué)科排名
書目名稱Computer Algebra年度引用
書目名稱Computer Algebra年度引用學(xué)科排名
書目名稱Computer Algebra讀者反饋
書目名稱Computer Algebra讀者反饋學(xué)科排名
作者: Allodynia 時間: 2025-3-21 20:17
Pamela A. Fenning,Leah M. Nellisthe minimum root separation, Sturm’s algorithm, an algorithm based on Rolle’s theorem due to Collins and Loos and the modified Uspensky algorithm due to Collins and Aritas. For the last algorithm a recursive version with correctness proof is given which appears in print for the first time.作者: 滑動 時間: 2025-3-22 01:23
https://doi.org/10.1007/978-3-031-21381-6ree decomposition algorithms and Hensel lifting techniques are analyzed. An attempt is made to establish a complete historic trace for today’s methods. The exponential worst case complexity nature of these algorithms receives attention.作者: Trypsin 時間: 2025-3-22 06:38
Supporting Human Activities by Obstruction,wo polynomials. We study the primitive, the reduced and the improved subresultant p.r.s. algorithm of Brown and Collins as basis for computing polynomial greatest common divisors, resultants or Sturm sequences. Habicht’s subresultant theorem allows new and simple proofs of many results and algorithms found in different ways in computer algebra.作者: 極小 時間: 2025-3-22 09:17 作者: CESS 時間: 2025-3-22 14:41 作者: CESS 時間: 2025-3-22 20:04 作者: 柏樹 時間: 2025-3-22 23:26
Generalized Polynomial Remainder Sequences,wo polynomials. We study the primitive, the reduced and the improved subresultant p.r.s. algorithm of Brown and Collins as basis for computing polynomial greatest common divisors, resultants or Sturm sequences. Habicht’s subresultant theorem allows new and simple proofs of many results and algorithms found in different ways in computer algebra.作者: Amorous 時間: 2025-3-23 05:21 作者: 獨裁政府 時間: 2025-3-23 08:22
An ethical approach: socio-technical design,on. After introducing Zassenhaus’ quadratic lifting construction, again, the case of . and ., . [.] and . [.1,…., .r] is considered. For both techniques, chinese remaindering as well as the lifting algorithms, a complete computational example is presented and the most frequent applications are discussed.作者: 軍火 時間: 2025-3-23 10:37
Carl Erik Moe,Hallgeir Nilsen,Tore U. ?rvikers, integers modulo ., Gaussian integers, polynomials, rational functions, power series, finite fields and .-adic numbers. Bounds on the maximum, minimum and average computing time (.., .., .*) for the various algorithms are given.作者: JOG 時間: 2025-3-23 17:44 作者: 開始沒有 時間: 2025-3-23 18:12
Koushik Maharatna,Silvio Bonfiglioiary arithmetic on rational intervals (Section 3). Finally, we present some auxiliary algebraic number algorithms used in other chapters of this volume (Section 7). This chapter does not include any special algorithms of algebraic number theory. For an introduction and survey with an extensive bibliography the reader is referred to Zimmer [15].作者: 陳腐的人 時間: 2025-3-23 23:58
Computing in Algebraic Extensions,iary arithmetic on rational intervals (Section 3). Finally, we present some auxiliary algebraic number algorithms used in other chapters of this volume (Section 7). This chapter does not include any special algorithms of algebraic number theory. For an introduction and survey with an extensive bibliography the reader is referred to Zimmer [15].作者: Perigee 時間: 2025-3-24 04:02 作者: Bmd955 時間: 2025-3-24 10:23
Algebraic Simplification,sions, radical expressions and transcendental expressions are treated (Sections 3–7). As examples for completion algorithms the Knuth-Bendix algorithm for rewrite rules and an algorithm for completing bases of polynomial ideals are described (Sections 8–11).作者: grovel 時間: 2025-3-24 12:44 作者: GUISE 時間: 2025-3-24 15:59 作者: Surgeon 時間: 2025-3-24 22:21
Computer Algebra978-3-7091-3406-1Series ISSN 0344-8029 作者: PALMY 時間: 2025-3-24 23:51
Systems Collaboration and Integration and elementary transcendental integrands are reviewed. Heuristic techniques for indefinite integration, and techniques for definite integration and ordinary differential equations are touched on only briefly.作者: 加入 時間: 2025-3-25 03:46
Chin-Yin Huang,Sang Won Yoon,Shimon Y. Nof are treated. The main concern of this paper is a description of Gosper’s algorithm, which is applicable for a wide class of summands. Karr’s theory of extension difference fields and some heuristic techniques are touched on briefly.作者: 天文臺 時間: 2025-3-25 08:37
,Einführung in Systems Engineering,y survey articles are previously published, we did not attempt to be exhaustive. We discuss mainly recent work in biology, chemistry, physics, mathematics and computer science, thus again confirming that applications have both engineering and scientific aspects, i.e. apart from delivering results they assist in gaining insight as well.作者: 值得尊敬 時間: 2025-3-25 15:40 作者: MUTE 時間: 2025-3-25 17:50
Systems Collaboration and Integration and elementary transcendental integrands are reviewed. Heuristic techniques for indefinite integration, and techniques for definite integration and ordinary differential equations are touched on only briefly.作者: 講個故事逗他 時間: 2025-3-25 20:22 作者: 進取心 時間: 2025-3-26 01:47
Pamela A. Fenning,Leah M. Nellisendpoints, each containing exactly one real zero of . and together containing all real zeros of .. We describe an algorithm due to Kronecker based on the minimum root separation, Sturm’s algorithm, an algorithm based on Rolle’s theorem due to Collins and Loos and the modified Uspensky algorithm due 作者: 埋伏 時間: 2025-3-26 06:11 作者: BLUSH 時間: 2025-3-26 10:40 作者: 珍奇 時間: 2025-3-26 12:40 作者: sterilization 時間: 2025-3-26 19:55
https://doi.org/10.1007/978-1-349-14199-9ctions over the field. The computational difficulty associated with such extensions is in verifying that proposed extensions are transcendental. When the extensions being considered are functions, and where a differentiation operator can be defined for them, structure theorems can be used to determi作者: Hyperlipidemia 時間: 2025-3-26 21:57 作者: START 時間: 2025-3-27 03:44 作者: Parallel 時間: 2025-3-27 09:02
Object-Oriented Information Technologies,and methods in a historical perspective, by us considered as instrumental for a better understanding of the rich diversity of now available facilities. We first indicate which classes of mathematical expressions can be stated and manipulated in different systems before we touch on different general 作者: indicate 時間: 2025-3-27 11:32
,Einführung in Systems Engineering,y survey articles are previously published, we did not attempt to be exhaustive. We discuss mainly recent work in biology, chemistry, physics, mathematics and computer science, thus again confirming that applications have both engineering and scientific aspects, i.e. apart from delivering results th作者: 激怒 時間: 2025-3-27 17:34
Integration in Finite Terms, and elementary transcendental integrands are reviewed. Heuristic techniques for indefinite integration, and techniques for definite integration and ordinary differential equations are touched on only briefly.作者: 很像弓] 時間: 2025-3-27 17:45
Summation in Finite Terms, are treated. The main concern of this paper is a description of Gosper’s algorithm, which is applicable for a wide class of summands. Karr’s theory of extension difference fields and some heuristic techniques are touched on briefly.作者: 和平主義者 時間: 2025-3-28 01:41 作者: 一美元 時間: 2025-3-28 03:06
https://doi.org/10.1007/978-3-7091-3406-1algebra; computer algebra; computeralgebra作者: moratorium 時間: 2025-3-28 08:34 作者: Bumble 時間: 2025-3-28 10:55
Computing Supplementahttp://image.papertrans.cn/c/image/233391.jpg作者: FLAG 時間: 2025-3-28 15:44 作者: 單色 時間: 2025-3-28 19:22
Systems Collaboration and IntegrationIn this survey an attempt is made to give some impression of the capabilities of currently available programs for computations with finitely generated groups and their representations.作者: 縱欲 時間: 2025-3-29 01:32
https://doi.org/10.1007/978-3-031-44373-2This article provides a brief summary of the most important publications relating to quantifier elimination algorithms for the elementary theory of real closed fields. Especially mentioned is the cylindrical algebraic decomposition method and its relation to the facilities of computer algebra facilities.作者: 保守 時間: 2025-3-29 06:04
https://doi.org/10.1007/978-3-662-64517-8Some fundamental inequalities for the following values are listed: the determinant of a matrix, the absolute value of the roots of a polynomial, the coefficients of divisors of polynomials, and the minimal distance between the roots of a polynomial. These inequalities are useful for the analysis of algorithms in various areas of computer algebra.作者: motor-unit 時間: 2025-3-29 11:00
Introduction,In this introduction we first give a working definition of computer algebra. We then describe the organization of research activities in this field. Finally the overall structure and the intention of the present volume on computer algebra is explained. Some technical information (basic references, notation etc.) about the volume is given.作者: 清洗 時間: 2025-3-29 14:26
Computing with Groups and Their Character Tables,In this survey an attempt is made to give some impression of the capabilities of currently available programs for computations with finitely generated groups and their representations.作者: 值得 時間: 2025-3-29 16:26 作者: 反復(fù)拉緊 時間: 2025-3-29 23:19
Some Useful Bounds,Some fundamental inequalities for the following values are listed: the determinant of a matrix, the absolute value of the roots of a polynomial, the coefficients of divisors of polynomials, and the minimal distance between the roots of a polynomial. These inequalities are useful for the analysis of algorithms in various areas of computer algebra.作者: 氣候 時間: 2025-3-30 00:03
Algebraic Simplification,formally stated and some elementary facts are derived that explain the fundamental role of simplification in computer algebra. In the subsequent sections two major groups of simplification techniques are presented: special techniques for simplifying terms over numerical domains and completion algori作者: Essential 時間: 2025-3-30 07:29
Integration in Finite Terms, and elementary transcendental integrands are reviewed. Heuristic techniques for indefinite integration, and techniques for definite integration and ordinary differential equations are touched on only briefly.作者: CYN 時間: 2025-3-30 11:07 作者: AVID 時間: 2025-3-30 12:29
Real Zeros of Polynomials,endpoints, each containing exactly one real zero of . and together containing all real zeros of .. We describe an algorithm due to Kronecker based on the minimum root separation, Sturm’s algorithm, an algorithm based on Rolle’s theorem due to Collins and Loos and the modified Uspensky algorithm due 作者: 激怒某人 時間: 2025-3-30 20:16 作者: 古董 時間: 2025-3-30 23:39 作者: Credence 時間: 2025-3-31 04:14
Computing by Homomorphic Images,ated extensively. Chinese remaindering is first presented in an abstract setting. Then the specialization to Euclidean domains, in particular ., . [.] and . [..,..., ..] is treated. The lifting construction is first also presented in an abstract form from which Hensel’s Lemma derives by specializati作者: sulcus 時間: 2025-3-31 05:45
Computing in Transcendental Extensions,ctions over the field. The computational difficulty associated with such extensions is in verifying that proposed extensions are transcendental. When the extensions being considered are functions, and where a differentiation operator can be defined for them, structure theorems can be used to determi作者: Conducive 時間: 2025-3-31 11:56 作者: Corral 時間: 2025-3-31 13:25 作者: Spinal-Fusion 時間: 2025-3-31 17:48 作者: 法官 時間: 2025-3-31 22:37
Computer Algebra Applications,y survey articles are previously published, we did not attempt to be exhaustive. We discuss mainly recent work in biology, chemistry, physics, mathematics and computer science, thus again confirming that applications have both engineering and scientific aspects, i.e. apart from delivering results th作者: 機制 時間: 2025-4-1 02:51 作者: Spartan 時間: 2025-4-1 09:58 作者: 衰老 時間: 2025-4-1 12:17 作者: Conscientious 時間: 2025-4-1 14:22 作者: 中世紀 時間: 2025-4-1 18:42
