找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

Titlebook: Computer Algebra in Scientific Computing; 14th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20

[復(fù)制鏈接]
查看: 15336|回復(fù): 57
樓主
發(fā)表于 2025-3-21 16:47:27 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書目名稱Computer Algebra in Scientific Computing
副標(biāo)題14th International W
編輯Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht
視頻videohttp://file.papertrans.cn/234/233420/233420.mp4
概述Up-to-date results.Fast-track conference proceedings.State-of-the-art research
叢書名稱Lecture Notes in Computer Science
圖書封面Titlebook: Computer Algebra in Scientific Computing; 14th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20
描述This book constitutes the proceedings of the 14th International Workshop on Computer Algebra in Scientific Computing, CASC 2012, held in Maribor, Slovenia, in September 2012. The 28 full papers presented were carefully reviewed and selected for inclusion in this book. One of the main themes of the CASC workshop series, namely polynomial algebra, is represented by contributions devoted to new algorithms for computing comprehensive Gr?bner and involutive systems,parallelization of the Gr?bner bases computation, the study of quasi-stable polynomial ideals, new algorithms to compute the Jacobson form of a matrix of Ore polynomials, a recursive Leverrier algorithm for inversion of dense matrices whose entries are monic polynomials, root isolation of zero-dimensional triangular polynomial systems, optimal computation of the third power of a long integer, investigation of the complexity of solving systems with few independent monomials, the study of ill-conditioned polynomial systems, a method for polynomial root-finding via eigen-solving and randomization, an algorithm for fast dense polynomial multiplication with Java using the new opaque typed method, and sparse polynomial powering usi
出版日期Conference proceedings 2012
關(guān)鍵詞complexity; holonomic functions; long integers; parallel algorithms; polynomial factorization; algorithm
版次1
doihttps://doi.org/10.1007/978-3-642-32973-9
isbn_softcover978-3-642-32972-2
isbn_ebook978-3-642-32973-9Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2012
The information of publication is updating

書目名稱Computer Algebra in Scientific Computing影響因子(影響力)




書目名稱Computer Algebra in Scientific Computing影響因子(影響力)學(xué)科排名




書目名稱Computer Algebra in Scientific Computing網(wǎng)絡(luò)公開度




書目名稱Computer Algebra in Scientific Computing網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computer Algebra in Scientific Computing被引頻次




書目名稱Computer Algebra in Scientific Computing被引頻次學(xué)科排名




書目名稱Computer Algebra in Scientific Computing年度引用




書目名稱Computer Algebra in Scientific Computing年度引用學(xué)科排名




書目名稱Computer Algebra in Scientific Computing讀者反饋




書目名稱Computer Algebra in Scientific Computing讀者反饋學(xué)科排名




單選投票, 共有 0 人參與投票
 

0票 0%

Perfect with Aesthetics

 

0票 0%

Better Implies Difficulty

 

0票 0%

Good and Satisfactory

 

0票 0%

Adverse Performance

 

0票 0%

Disdainful Garbage

您所在的用戶組沒有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 23:46:05 | 只看該作者
板凳
發(fā)表于 2025-3-22 03:40:34 | 只看該作者
地板
發(fā)表于 2025-3-22 06:54:20 | 只看該作者
Lightweight Abstraction for Mathematical Computation in Java,, programs are compiled twice, first with objects to verify type safety, and then with the objects removed for efficiency. This gives significant performance gains across a range of tests, including the generic SciGMark tests.
5#
發(fā)表于 2025-3-22 12:13:08 | 只看該作者
Symbolic-Numerical Calculations of High-|,| Rydberg States and Decay Rates in Strong Magnetic Fieldrix elements. The efficiency and accuracy of the derived algorithm and that of Kantorovich numerical scheme are confirmed by calculating eigenenergies and eigenfunctions, dipole moments and decay rates of low-excited Rydberg states at high |.|~200 of a hydrogen atom in the laboratory homogeneous mag
6#
發(fā)表于 2025-3-22 13:05:35 | 只看該作者
7#
發(fā)表于 2025-3-22 19:39:57 | 只看該作者
8#
發(fā)表于 2025-3-22 21:14:17 | 只看該作者
9#
發(fā)表于 2025-3-23 01:33:19 | 只看該作者
10#
發(fā)表于 2025-3-23 09:07:53 | 只看該作者
Alexander Poth,Simon Field,Marc Koeslinggorithm such that it can work at any point of .(.,.), rational or not. In addition, we propose algorithmic criteria for reducing the case of . variables to the bivariate one. Experimental results are also reported.
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-9 03:26
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
大丰市| 隆安县| 吉安市| 正定县| 泸定县| 天全县| 新丰县| 方正县| 塔城市| 保山市| 通州市| 博湖县| 江油市| 宜城市| 方正县| 安仁县| 曲阜市| 出国| 渭南市| 临清市| 清河县| 东莞市| 崇州市| 垣曲县| 黄陵县| 通渭县| 耒阳市| 观塘区| 宜春市| 荣昌县| 滁州市| 沐川县| 安远县| 屯昌县| 溆浦县| 宁阳县| 江都市| 瓦房店市| 驻马店市| 株洲县| 建宁县|