Computer Algebra in Scientific Computing : 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings (Theoretical Computer Science and General Issues) / Gerdt, Vladimir P. (EDT)/ Koepf, Wolfram (EDT)/ Seiler, Werner M. (EDT)

Computer Algebra in Scientific Computing : 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings (Theoretical Computer Science and General Issues) （2014）

個数：

Computer Algebra in Scientific Computing : 16th International Workshop, CASC 2014, Warsaw, Poland, September 8-12, 2014. Proceedings (Theoretical Computer Science and General Issues) （2014）

Gerdt, Vladimir P. (EDT)/ Koepf, Wolfram (EDT)/ Seiler, Werner M. (EDT)

ウェブストア価格 ¥11,148（本体¥10,135）
Springer International Publishing AG（2014/08発売）
外貨定価 US$ 54.99
ポイント 101pt

オンデマンド(OD/POD)版です。キャンセルは承れません。

【入荷遅延について】
世界情勢の影響により、海外からお取り寄せとなる洋書・洋古書の入荷が、表示している標準的な納期よりも遅延する場合がございます。
おそれいりますが、あらかじめご了承くださいますようお願い申し上げます。

◆画像の表紙や帯等は実物とは異なる場合があります。

◆ウェブストアでの洋書販売価格は、弊社店舗等での販売価格とは異なります。
また、洋書販売価格は、ご注文確定時点での日本円価格となります。
ご注文確定後に、同じ洋書の販売価格が変動しても、それは反映されません。

製本 Paperback:紙装版/ペーパーバック版／ページ数 502 p.
商品コード 9783319105147

Full Description

This book constitutes the proceedings of the 16th International Workshop on Computer Algebra in Scientific Computing, CASC 2014, held in Warsaw, Poland, in September 2014. The 33 full papers presented were carefully reviewed and selected for inclusion in this book.
The papers address issues such as Studies in polynomial algebra are represented by contributions devoted to factoring sparse bivariate polynomials using the priority queue, the construction of irreducible polynomials by using the Newton index, real polynomial root finding by means of matrix and polynomial iterations, application of the eigenvalue method with symmetry for solving polynomial systems arising in the vibration analysis of mechanical structures with symmetry properties, application of Gröbner systems for computing the (absolute) reduction number of polynomial ideals, the application of cylindrical algebraic decomposition for solving the quantifier elimination problems, certification of approximate roots of overdetermined and singular polynomial systems via the recovery of an exact rational univariate representation from approximate numerical data, new parallel algorithms for operations on univariate polynomials (multi-point evaluation, interpolation) based on subproduct tree techniques.

Relation Algebra, RelView, and Plurality Voting .- An Algorithm for Converting Nonlinear Differential Equations to Integral Equations with an Application to Parameter Estimation from Noisy Data.- Truth Table Invariant Cylindrical Algebraic Decomposition by Regular Chains.- Computing the Topology of an Arrangement of Implicit and Parametric Curves Given by Values.- Finding a Deterministic Generic Position for an Algebraic Space Curve.- Computer Algebra Experimentation.- On the Parallelization of Subproduct Tree Techniques Targeting.- Many-core Architectures.- Deterministically Computing Reduction Numbers of Polynomial Ideals.