標(biāo)題: Titlebook: Computer Algebra in Scientific Computing; 15th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20 [打印本頁(yè)] 作者: HEM 時(shí)間: 2025-3-21 18:29
書目名稱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é)科排名
作者: 防銹 時(shí)間: 2025-3-21 21:51
Conference proceedings 2013tion of the CAS Mathematica for the simulation of quantum error correction in quantum computing; the application of the CAS GAP for the enumeration of Schur rings over the group A5; constructive computation of zero separation bounds for arithmetic expressions; the parallel implementation of fast Fou作者: adhesive 時(shí)間: 2025-3-22 04:04
0302-9743 eration of Schur rings over the group A5; constructive computation of zero separation bounds for arithmetic expressions; the parallel implementation of fast Fou978-3-319-02296-3978-3-319-02297-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Hormones 時(shí)間: 2025-3-22 07:51 作者: BADGE 時(shí)間: 2025-3-22 08:55
General concepts from universal algebra,xamples of generating the symmetrized coordinate representation for . dimensional oscillator functions in one-dimensional Euclidean space are analyzed. The approach is aimed at solving the problem of tunnelling the clusters, consisting of several identical particles, through repulsive potential barriers of a target.作者: 明智的人 時(shí)間: 2025-3-22 13:03 作者: 明智的人 時(shí)間: 2025-3-22 19:16 作者: 凝視 時(shí)間: 2025-3-22 23:44 作者: 現(xiàn)暈光 時(shí)間: 2025-3-23 04:07
https://doi.org/10.1007/978-1-349-13443-4thm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orbit are solved only once, allowing for a systematic filtration of redundant data. Computations with cddlib, Gfan, PHCpack, and Sage are illustrated on cyclic .-roots polynomial systems.作者: 性冷淡 時(shí)間: 2025-3-23 09:15 作者: Aids209 時(shí)間: 2025-3-23 11:12 作者: 眉毛 時(shí)間: 2025-3-23 15:38 作者: Fillet,Filet 時(shí)間: 2025-3-23 21:12
https://doi.org/10.1007/978-1-4613-4229-8ed by the Java Algebra System. Type classes are then introduced as an alternate abstraction scheme and shown to be eventually better suited for modeling categories. Pro and cons of the two approaches are discussed and a hybrid solution is exhibited.作者: 脫水 時(shí)間: 2025-3-24 01:37
Polyhedral Methods for Space Curves Exploiting Symmetry Applied to the Cyclic ,-roots Problem,thm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orbit are solved only once, allowing for a systematic filtration of redundant data. Computations with cddlib, Gfan, PHCpack, and Sage are illustrated on cyclic .-roots polynomial systems.作者: Isthmus 時(shí)間: 2025-3-24 04:40
Efficient Methods to Compute Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordincoordinates. For this purpose we provide heuristics on the basis of the Newton polytope that ensure the existence of positive and negative values of the polynomial for positive coordinates. We apply our method to the example of the Methylene Blue Oscillator (MBO).作者: 消極詞匯 時(shí)間: 2025-3-24 09:40 作者: somnambulism 時(shí)間: 2025-3-24 12:03 作者: Occipital-Lobe 時(shí)間: 2025-3-24 16:16 作者: 郊外 時(shí)間: 2025-3-24 20:45
General concepts from universal algebra, detail. The stability analysis of equilibria is performed on the basis of Lyapunov’s theorem. It is shown that the number of equilibria of the gyrostat satellite in general case is no less than 8 and no more than 24, and the number of stable equilibria changes from 4 to 2.作者: UNT 時(shí)間: 2025-3-25 01:42
Symbolic-Numerical Investigation of Gyrostat Satellite Dynamics, detail. The stability analysis of equilibria is performed on the basis of Lyapunov’s theorem. It is shown that the number of equilibria of the gyrostat satellite in general case is no less than 8 and no more than 24, and the number of stable equilibria changes from 4 to 2.作者: 話 時(shí)間: 2025-3-25 04:35
Conference proceedings 2013any, in September 2013. The 33 full papers presented were carefully reviewed and selected for inclusion in this book. .The papers address issues such as polynomial algebra; the solution of tropical linear systems and tropical polynomial systems; the theory of matrices; the use of computer algebra fo作者: 的事物 時(shí)間: 2025-3-25 09:47 作者: overrule 時(shí)間: 2025-3-25 13:53
On Possibility of Additional Solutions of the Degenerate System Near Double Degeneration at the Spet of 4 two-parameter subsets in this 5-parameter space except 1 special hyper plane ..?=?2/3. We wrote down 4 first integrals of motion as functions of the system parameters. Here we have proved that the limitation ..?≠?2/3 can be excluded from the previously obtained solutions. Now we have not found the additional first integrals.作者: 懸崖 時(shí)間: 2025-3-25 19:46
On the Dimension of Solution Spaces of Full Rank Linear Differential Systems,n space that occurs while differentiating one of the equations. Basing on this, we show a way to compute the dimension of the solution space of a given full rank system. In addition, we show how the change in the dimension can be used to estimate the number of steps of some algorithms to convert a given full rank system into an appropriate form.作者: Lipoma 時(shí)間: 2025-3-25 21:33 作者: Bucket 時(shí)間: 2025-3-26 02:25
Faster Sparse Interpolation of Straight-Line Programs,ation .. of ., such that .???.. probably has at most half the number of terms of ., then recurses on the difference .???... Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes required than previous methods, in many cases.作者: 北京人起源 時(shí)間: 2025-3-26 04:51
Highly Scalable Multiplication for Distributed Sparse Multivariate Polynomials on Many-Core Systems only the shared memory multicore computers, but also computers clusters or specialized hardware attached to a host computer, such as graphics processing units or many-core coprocessors. The scalability on the large number of cores is ensured by the lacks of synchronizations, locks and false-sharing during the main parallel step.作者: Ergots 時(shí)間: 2025-3-26 12:11 作者: 內(nèi)閣 時(shí)間: 2025-3-26 12:58 作者: 澄清 時(shí)間: 2025-3-26 19:41
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233414.jpg作者: cleaver 時(shí)間: 2025-3-27 00:13
https://doi.org/10.1007/978-3-319-02297-0complexity; holonomic functions; long integers; parallel algorithms; polynomial factorization; algorithm 作者: 悄悄移動(dòng) 時(shí)間: 2025-3-27 03:33
978-3-319-02296-3Springer International Publishing Switzerland 2013作者: 朦朧 時(shí)間: 2025-3-27 08:53 作者: 我不明白 時(shí)間: 2025-3-27 10:37
https://doi.org/10.1007/978-1-349-13443-4n the first two terms of a Puiseux series expansion. The leading powers of the series are computed via the tropical prevariety. This polyhedral algorithm is well suited for exploitation of symmetry, when it arises in systems of polynomials. Initial form systems with pretropisms in the same group orb作者: 壓艙物 時(shí)間: 2025-3-27 15:36 作者: antipsychotic 時(shí)間: 2025-3-27 17:56 作者: violate 時(shí)間: 2025-3-28 00:35
Background And Fundamental Methods,ation .. of ., such that .???.. probably has at most half the number of terms of ., then recurses on the difference .???... Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes r作者: 開玩笑 時(shí)間: 2025-3-28 04:34 作者: enormous 時(shí)間: 2025-3-28 10:18 作者: BLAZE 時(shí)間: 2025-3-28 11:43 作者: intuition 時(shí)間: 2025-3-28 18:29
Lecture Notes in Computer Scienceis a generalized divisor of the latter one. We design an algorithm which finds first-order quasi-linear generalized divisors of a second-order quasi-linear ordinary differential equation. If solutions of an equation contain solutions of a pair of equations we say that the equation is a common multip作者: 名義上 時(shí)間: 2025-3-28 20:32
General concepts from universal algebra, target, is considered. A symbolic-numerical algorithm for generating .-dimensional oscillator eigenfunctions, symmetric or antisymmetric with respect to permutations of . identical particles in the new symmetrized coordinates, is formulated and implemented using the MAPLE computer algebra system. E作者: ARC 時(shí)間: 2025-3-28 23:36 作者: 單純 時(shí)間: 2025-3-29 03:19
General concepts from universal algebra,ie algebra .(3,1) when the equations possess additional polynomial first integrals of degrees 3 and 6. The problems of obtaining stationary sets of the equations and investigation of their stability are considered. In addition to the sets obtained earlier [1], we have found new zero-dimensional and 作者: climax 時(shí)間: 2025-3-29 08:18 作者: badinage 時(shí)間: 2025-3-29 15:06
https://doi.org/10.1007/978-1-4613-4229-8s must have in order to allow a categorical approach is given. Object-oriented inheritance is presented as a suitable abstraction scheme and exemplified by the Java Algebra System. Type classes are then introduced as an alternate abstraction scheme and shown to be eventually better suited for modeli作者: Influx 時(shí)間: 2025-3-29 19:19
https://doi.org/10.1007/978-3-319-53721-4. of order 60 are enumerated. It turns out that there are 2848 S-rings over .., in 163 orbits under the action of ... Among them there are 505 non-Schurian S-rings, in 19 orbits. We discuss the entire picture of this rich computer data and try to present an initial outline of a human explanation for作者: 難聽的聲音 時(shí)間: 2025-3-29 20:08
Computer Algebra in Scientific Computing978-3-319-02297-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: ILEUM 時(shí)間: 2025-3-30 02:51
https://doi.org/10.1007/978-1-349-12988-1n space that occurs while differentiating one of the equations. Basing on this, we show a way to compute the dimension of the solution space of a given full rank system. In addition, we show how the change in the dimension can be used to estimate the number of steps of some algorithms to convert a given full rank system into an appropriate form.作者: 大暴雨 時(shí)間: 2025-3-30 06:59 作者: 一夫一妻制 時(shí)間: 2025-3-30 11:04
Background And Fundamental Methods,ation .. of ., such that .???.. probably has at most half the number of terms of ., then recurses on the difference .???... Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes required than previous methods, in many cases.作者: 凌辱 時(shí)間: 2025-3-30 16:20 作者: fleeting 時(shí)間: 2025-3-30 19:52 作者: Extricate 時(shí)間: 2025-3-31 00:11 作者: 暗語(yǔ) 時(shí)間: 2025-3-31 01:46 作者: 拖債 時(shí)間: 2025-3-31 07:03
https://doi.org/10.1007/3-540-18598-4At the last conference on . (AD) in July 2012, Bert Speelpenning gave a very entertaining account of his pioneering work in the field. After finishing his thesis titled . at Urbana Champain in 1981 he had dropped from sight of the scientific community and spent a few decades in the software industry working amongst others for Oracle and Microsoft.作者: apropos 時(shí)間: 2025-3-31 10:45
General concepts from universal algebra,An algorithm is designed which tests solvability of a system of . polynomial equations in . variables with degrees . within complexity polynomial in .. If the system is solvable then the algorithm yields one of its solutions. Thus, for fixed ., . the complexity of the algorithm is polynomial.作者: JAUNT 時(shí)間: 2025-3-31 14:45 作者: 賞心悅目 時(shí)間: 2025-3-31 19:01 作者: prosperity 時(shí)間: 2025-4-1 00:45 作者: MEEK 時(shí)間: 2025-4-1 02:58
Polynomial Complexity of Solving Systems of Few Algebraic Equations with Small Degrees,An algorithm is designed which tests solvability of a system of . polynomial equations in . variables with degrees . within complexity polynomial in .. If the system is solvable then the algorithm yields one of its solutions. Thus, for fixed ., . the complexity of the algorithm is polynomial.
