標題: Titlebook: Computer Algebra in Scientific Computing; 14th International W Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. Vorozht Conference proceedings 20 [打印本頁] 作者: 不足木 時間: 2025-3-21 16:47
書目名稱Computer Algebra in Scientific Computing影響因子(影響力)
書目名稱Computer Algebra in Scientific Computing影響因子(影響力)學科排名
書目名稱Computer Algebra in Scientific Computing網絡公開度
書目名稱Computer Algebra in Scientific Computing網絡公開度學科排名
書目名稱Computer Algebra in Scientific Computing被引頻次
書目名稱Computer Algebra in Scientific Computing被引頻次學科排名
書目名稱Computer Algebra in Scientific Computing年度引用
書目名稱Computer Algebra in Scientific Computing年度引用學科排名
書目名稱Computer Algebra in Scientific Computing讀者反饋
書目名稱Computer Algebra in Scientific Computing讀者反饋學科排名
作者: 反復無常 時間: 2025-3-21 23:46 作者: acquisition 時間: 2025-3-22 03:40 作者: objection 時間: 2025-3-22 06:54
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.作者: 親屬 時間: 2025-3-22 12:13
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作者: Mercantile 時間: 2025-3-22 13:05 作者: Mercantile 時間: 2025-3-22 19:39 作者: 巡回 時間: 2025-3-22 21:14 作者: 反對 時間: 2025-3-23 01:33 作者: capsaicin 時間: 2025-3-23 09:07
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.作者: 冒煙 時間: 2025-3-23 10:53
Computing Hopf Bifurcations in Chemical Reaction Networks Using Reaction Coordinates,for reaction systems with linear conservation laws using reaction coordinates instead of concentration coordinates, a technique that extends the range of networks, which can be analyzed in practice, considerably.作者: VERT 時間: 2025-3-23 16:27 作者: miniature 時間: 2025-3-23 18:15
A Polynomial-Time Algorithm for the Jacobson Form of a Matrix of Ore Polynomials, of . will have a Hermite form whose diagonal is equal to that of the Jacobson form. From this the reduction to the Jacobson form is easy. Polynomial-time algorithms for the Hermite form have already been established.作者: Evacuate 時間: 2025-3-23 23:56
,On Fulton’s Algorithm for Computing Intersection Multiplicities,gorithm 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.作者: Paradox 時間: 2025-3-24 03:13
Stability of Equilibrium Positions in the Spatial Circular Restricted Four-Body Problem,y of three equilibrium positions for the majority of initial conditions in case of mass parameters of the system belonging to the domain of the solutions linear stability, except for the points in the parameter plane for which the third and fourth order resonance conditions are fulfilled.作者: licence 時間: 2025-3-24 09:19
Conference proceedings 2012enia, 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 invo作者: 巨碩 時間: 2025-3-24 14:24
Jakub Stolfa,Marek Spanyik,Petr Dolejsiy of three equilibrium positions for the majority of initial conditions in case of mass parameters of the system belonging to the domain of the solutions linear stability, except for the points in the parameter plane for which the third and fourth order resonance conditions are fulfilled.作者: DNR215 時間: 2025-3-24 16:37
0302-9743 l 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作者: 滔滔不絕地說 時間: 2025-3-24 20:32 作者: Carcinoma 時間: 2025-3-25 03:02 作者: Anemia 時間: 2025-3-25 06:41 作者: minaret 時間: 2025-3-25 08:06
Murat Yilmaz,Paul Clarke,Bruno W?ranequations with polynomial coefficients) may be computed with error bounded by 2. in time . and space O (.). The standard fast algorithm for this task, due to Chudnovsky and Chudnovsky, achieves the same time complexity bound but requires . bits of memory.作者: 可卡 時間: 2025-3-25 15:33 作者: Arb853 時間: 2025-3-25 18:43
A New Algorithm for Long Integer Cube Computation with Some Insight into Higher Powers, new basic tool to improve long integer exponentiation: different techniques combining binary and ternary exponent expansion are shown. Effective implementations by using the GMP library are tested, and performance comparisons are presented.作者: Indurate 時間: 2025-3-25 23:36 作者: geriatrician 時間: 2025-3-26 02:43
A Note on the Space Complexity of Fast D-Finite Function Evaluation,equations with polynomial coefficients) may be computed with error bounded by 2. in time . and space O (.). The standard fast algorithm for this task, due to Chudnovsky and Chudnovsky, achieves the same time complexity bound but requires . bits of memory.作者: Insulin 時間: 2025-3-26 06:17 作者: 饒舌的人 時間: 2025-3-26 08:38
On Polynomial Solutions of Linear Partial Differential and (,-)Difference Equations,olutions can be described algorithmically. We present examples which demonstrate that, in contrast with the differential and difference cases where the dimension of this space is either infinite or zero, in the .-difference case it can also be finite and non-zero.作者: Antecedent 時間: 2025-3-26 16:28
Computer Algebra in Scientific Computing978-3-642-32973-9Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 消耗 時間: 2025-3-26 19:30
Michel Picard,Alain Renault,Béatrix Barafort polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.作者: 脖子 時間: 2025-3-26 21:41
Walter Sebron,Hans Tschürtz,Peter Krebsknown algorithms when a system contains a few linearly independent monomials. For parametric binomial systems we construct an algorithm of polynomial complexity. We discuss the applications of these algorithms in the context of chemical reaction systems.作者: BLINK 時間: 2025-3-27 02:24 作者: MODE 時間: 2025-3-27 05:54
Alexander Poth,Simon Field,Marc Koeslingrating or at least separating subsets of rings of invariants. This talk gives some examples in which invariant theory is applied to graph theory, computer vision, and coding theory. We also give an overview of the state of the art of algorithmic invariant theory.作者: glacial 時間: 2025-3-27 09:28
Vladimir P. Gerdt,Wolfram Koepf,Evgenii V. VorozhtUp-to-date results.Fast-track conference proceedings.State-of-the-art research作者: 橢圓 時間: 2025-3-27 16:08
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233420.jpg作者: BLAZE 時間: 2025-3-27 19:37
An Algebraic Characterization of Rainbow Connectivity, polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.作者: micronized 時間: 2025-3-27 22:35 作者: Palpitation 時間: 2025-3-28 05:31
Quasi-stability versus Genericity, the generic initial ideal. In contrast to genericity, quasi-stability is a characteristic independent property that can be effectively verified. We also relate Pommaret bases to some invariants associated with local cohomology, exhibit the existence of linear quotients in Pommaret bases and prove some results on componentwise linear ideals.作者: lattice 時間: 2025-3-28 09:45 作者: debase 時間: 2025-3-28 13:27
Michel Picard,Alain Renault,Béatrix Barafortsolutions is algorithmically undecidable. However, for equations with constant coefficients this question can be decided very easily since such an equation has a non-zero polynomial solution iff its constant term is zero. We give a simple combinatorial proof of the fact that in this case the equatio作者: Exploit 時間: 2025-3-28 16:32
Michel Picard,Alain Renault,Béatrix Barafort polynomial equations. We first consider the case of two colors for which the problem is known to be hard and we then extend the approach to the general case. We also present a formulation of the rainbow connectivity problem as an ideal membership problem.作者: Preserve 時間: 2025-3-28 19:15
https://doi.org/10.1007/978-3-319-24647-5n three variables near a singular point at which this polynomial is annulled with its partial derivatives. We apply this method for investigation of the set of stability of some gyroscopic system with 4 degrees of freedom and with 3 parameters. It is also possible to compute the set of stability wit作者: Interim 時間: 2025-3-28 22:56
Murat Yilmaz,Ali Al-Taei,Rory V. O’Connork-3 unbalanced method is presented, showing that the “classical” square-and-multiply algorithm is not (always) optimal. The new algorithm is used as a new basic tool to improve long integer exponentiation: different techniques combining binary and ternary exponent expansion are shown. Effective impl作者: Innocence 時間: 2025-3-29 04:52 作者: BOOM 時間: 2025-3-29 09:11
Jakub Stolfa,Marek Spanyik,Petr Dolejsitationary points of the system, two of one-parameter families were chosen. These families correspond to the resonance of eigenvalues (0, 0, .,???., 2.,???2.) of the matrix of the linear part of the system, also in [1] it was conjectured the absence of the additional first integral (with respect to w作者: 失望昨天 時間: 2025-3-29 11:25 作者: GONG 時間: 2025-3-29 16:54
https://doi.org/10.1007/978-3-319-97925-0due to its relation to the existence of oscillations. For low dimensional reaction systems without additional constraints Hopf bifurcation can be computed by reducing the question of its occurrence to quantifier elimination problems on real closed fields. However deciding its occurrence in high dime作者: 捐助 時間: 2025-3-29 20:28 作者: 心胸開闊 時間: 2025-3-30 02:02 作者: 偽造 時間: 2025-3-30 05:45 作者: hemophilia 時間: 2025-3-30 08:28 作者: arthrodesis 時間: 2025-3-30 12:43
Peter H. Carstensen,Otto Vinter the generic initial ideal. In contrast to genericity, quasi-stability is a characteristic independent property that can be effectively verified. We also relate Pommaret bases to some invariants associated with local cohomology, exhibit the existence of linear quotients in Pommaret bases and prove s作者: 嘮叨 時間: 2025-3-30 17:29 作者: Communal 時間: 2025-3-31 00:28 作者: rectum 時間: 2025-3-31 04:15
Murat Yilmaz,Paul Clarke,Bruno W?rany binary splitting. It follows from our analysis that the values of D-finite functions (i.e., functions described as solutions of linear differential equations with polynomial coefficients) may be computed with error bounded by 2. in time . and space O (.). The standard fast algorithm for this task,作者: ASTER 時間: 2025-3-31 06:56
https://doi.org/10.1007/978-3-642-32973-9complexity; holonomic functions; long integers; parallel algorithms; polynomial factorization; algorithm 作者: Affectation 時間: 2025-3-31 09:11
978-3-642-32972-2Springer-Verlag Berlin Heidelberg 2012作者: 粗糙濫制 時間: 2025-3-31 13:49
https://doi.org/10.1007/978-3-319-97925-0Using tools of computer algebra we derive the conditions for the cubic Lotka–Volterra system ., . to be linearizable and to admit a first integral of the form Φ(.,.)?=?....?+?? in a neighborhood of the origin, in which case the origin is called a 2:???3 resonant center.
