標題: Titlebook: Computer Algebra in Scientific Computing; 25th International W Fran?ois Boulier,Matthew England,Evgenii V. Vorozh Conference proceedings 20 [打印本頁] 作者: 珍愛 時間: 2025-3-21 18:43
書目名稱Computer Algebra in Scientific Computing影響因子(影響力)
書目名稱Computer Algebra in Scientific Computing影響因子(影響力)學科排名
書目名稱Computer Algebra in Scientific Computing網(wǎng)絡公開度
書目名稱Computer Algebra in Scientific Computing網(wǎng)絡公開度學科排名
書目名稱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讀者反饋學科排名
作者: Communicate 時間: 2025-3-21 21:21 作者: BLANK 時間: 2025-3-22 03:51 作者: bonnet 時間: 2025-3-22 06:57
https://doi.org/10.1007/978-3-642-95646-1 common zeros (encoded as regular chains) of a quasi-component and a hypersurface. As a result, decomposing a polynomial system into regular chains can be achieved by repeated calls to the Intersect procedure. Expression swell in Intersect has long been observed in the literature. When the regular c作者: 極力證明 時間: 2025-3-22 12:12 作者: 充氣女 時間: 2025-3-22 13:24 作者: 充氣女 時間: 2025-3-22 18:03
Systemtechnik des Schienenverkehrsof the optical model (OM) described by a second-order ordinary differential equation (ODE) with a complex-valued potential and regular boundary conditions. The complex-valued potential consists of the known real part, which is a sum of the nuclear potential, the Coulomb potential, and the centrifuga作者: 假設 時間: 2025-3-22 22:14
,Betriebstechnik der Rangierbahnh?fe,er an algebraic extension field. For this, we use the theory of Gr?bner bases to employ linear algebra methods as well as to work in an algebraic extension. We show that this has good complexity. Finally, we report an implementation of our algorithms in . and illustrate its effectiveness via several作者: 放氣 時間: 2025-3-23 01:52
Regelung und Sicherung der Zugfolge,ius–Lohner (CL) framework of decomposing . as ., which requires to compute .(.) “exactly” for an interval .. There are two problems: this approach limits the order of convergence to 6 in practice, and exact computation is impossible to achieve in standard implementation models. We generalize the CL 作者: corpus-callosum 時間: 2025-3-23 06:42 作者: irradicable 時間: 2025-3-23 12:46
Systemtechnik des Schienenverkehrsss studied. Here, asymptotic series expansions for the non-principal branches are obtained, and their properties, including accuracy and convergence are studied. The expansions are investigated by mapping circles around singular points in the domain of the function into the range of the function usi作者: 鬧劇 時間: 2025-3-23 15:57 作者: 沙草紙 時間: 2025-3-23 19:40
https://doi.org/10.1007/978-3-8348-2587-2of full rank .. The solutions . will be rational functions in the parameters. We present a new algorithm for computing . that uses our sparse rational function interpolation which was presented at CASC 2022. It modifies Cuyt and Lee’s sparse rational function interpolation algorithm to use a Kroneck作者: ethereal 時間: 2025-3-23 22:53
Systemtechnik des Schienenverkehrs. The problem is reduced to the univariate algebraic equation construction via computing the discriminant of an appropriate bivariate polynomial. Several examples are presented including the cases of complex and real matrices.作者: 點燃 時間: 2025-3-24 03:17 作者: 心胸狹窄 時間: 2025-3-24 10:23
Systemtechnik des Schienenverkehrs the method of equivariant moving frames. We develop a computational algorithm that will, in many cases, determine whether a given set of differential invariants is generating. As an example, we establish a new result that the Gaussian curvature generates all the differential invariants for Euclidea作者: 寬敞 時間: 2025-3-24 14:33
Systemtechnik des Schienenverkehrsrves, our technique simplifies the process by reducing and comparing the ranges of . and . coordinates. The essential advantage of this technique lies in its simplicity, achieved through the reduction and comparison of the . and . coordinates ranges of the two curves. The monotonicity of curves is u作者: 冰河期 時間: 2025-3-24 18:11 作者: Credence 時間: 2025-3-24 19:27
,On the?Complexity of?Linear Algebra Operations over?Algebraic Extension Fields,er an algebraic extension field. For this, we use the theory of Gr?bner bases to employ linear algebra methods as well as to work in an algebraic extension. We show that this has good complexity. Finally, we report an implementation of our algorithms in . and illustrate its effectiveness via several examples.作者: Glossy 時間: 2025-3-25 02:25 作者: fibroblast 時間: 2025-3-25 04:05
,On the?Distance to?the?Nearest Defective Matrix,. The problem is reduced to the univariate algebraic equation construction via computing the discriminant of an appropriate bivariate polynomial. Several examples are presented including the cases of complex and real matrices.作者: ROOF 時間: 2025-3-25 07:49
,On the?Structure and?Generators of?Differential Invariant Algebras, the method of equivariant moving frames. We develop a computational algorithm that will, in many cases, determine whether a given set of differential invariants is generating. As an example, we establish a new result that the Gaussian curvature generates all the differential invariants for Euclidean surfaces in three-dimensional space.作者: infinite 時間: 2025-3-25 11:51 作者: 發(fā)電機 時間: 2025-3-25 18:10 作者: progestin 時間: 2025-3-25 21:55
Systemtechnik des Schienenverkehrsons on the parameters of the system are derived by using methods of solving semi-algebraic systems. Using the method of algorithmic averaging, we provide sufficient conditions for the existence of one limit cycle bifurcating from a zero-Hopf equilibrium of the Lorenz–Stenflo system. Some examples are presented to verify the established results.作者: acetylcholine 時間: 2025-3-26 02:49
Systemtechnik des Schienenverkehrs. The problem is reduced to the univariate algebraic equation construction via computing the discriminant of an appropriate bivariate polynomial. Several examples are presented including the cases of complex and real matrices.作者: Definitive 時間: 2025-3-26 06:00 作者: mucous-membrane 時間: 2025-3-26 11:31
https://doi.org/10.1007/978-3-031-41724-5symbolic and algebraic algorithms; computer algebra systems; mathematical software; modeling and simula作者: 蔑視 時間: 2025-3-26 12:56 作者: EWE 時間: 2025-3-26 19:25 作者: alcohol-abuse 時間: 2025-3-26 21:08 作者: Influx 時間: 2025-3-27 04:41
https://doi.org/10.1007/978-3-658-27377-4 models trained upon them. In this paper, we describe how to use the Risch Algorithm for symbolic integration to create a dataset of elementary integrable expressions. Further, we show that data generated this way alleviates some of the flaws found in earlier methods.作者: 1FAWN 時間: 2025-3-27 08:46 作者: 荒唐 時間: 2025-3-27 10:18 作者: 魯莽 時間: 2025-3-27 16:40
Systemtechnik des Schienenverkehrsng the new expansions. Different expansions apply for large circles around the origin and for small circles. Although the expansions are derived as asymptotic expansions, some surprising convergence properties are observed.作者: 圍裙 時間: 2025-3-27 18:33
Generating Elementary Integrable Expressions, models trained upon them. In this paper, we describe how to use the Risch Algorithm for symbolic integration to create a dataset of elementary integrable expressions. Further, we show that data generated this way alleviates some of the flaws found in earlier methods.作者: notion 時間: 2025-3-27 22:33
,How to?Automatise Proofs of?Operator Statements: Moore–Penrose Inverse; A Case Study,d algebraic proofs for every true first-order operator statement. We illustrate the capability of the framework in combination with our software by a case study on statements about the Moore-Penrose inverse, including classical facts and recent results, presented in an online notebook.作者: 隱士 時間: 2025-3-28 04:11
,Certified Study of?Internal Solitary Waves,duction of the allowed configurations, and we can provide a topological classification of the phase plane curves. So, special behaviors are detected even if they appear in tiny domain of the parameter space. The paper is illustrated with examples and pictures.作者: WAX 時間: 2025-3-28 10:12 作者: 溫和女人 時間: 2025-3-28 11:12
0302-9743 ich took place in Havana, Cuba, during August 28-September 1, 2023..The 22 full papers included in this book were carefully reviewed and selected from 29 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of sci作者: Fissure 時間: 2025-3-28 18:19
https://doi.org/10.1007/978-3-8348-2587-2integrals and these are completely integrable. The nonintegrable case, when potential forces act upon the system, is also considered. The qualitative analysis of the equations of motion is done in the both cases: stationary sets are found and their Lyapunov stability is studied. A mechanical interpretation for the obtained solutions is given.作者: 直覺沒有 時間: 2025-3-28 20:56
Systemtechnik des Schienenverkehrseals. The key ingredients of the generalization are the prime decomposition of a radical ideal and a maximal independent set. The results of comparison between the resulting algorithm with another existing one are also given.作者: agonist 時間: 2025-3-28 23:08 作者: engagement 時間: 2025-3-29 06:09
,Effective Algorithm for?Computing Noetherian Operators of?Positive Dimensional Ideals,eals. The key ingredients of the generalization are the prime decomposition of a radical ideal and a maximal independent set. The results of comparison between the resulting algorithm with another existing one are also given.作者: 阻撓 時間: 2025-3-29 08:21
Conference proceedings 2023lace in Havana, Cuba, during August 28-September 1, 2023..The 22 full papers included in this book were carefully reviewed and selected from 29 submissions. They focus on the theory of symbolic computation and its implementation in computer algebra systems as well as all other areas of scientific co作者: ANT 時間: 2025-3-29 13:53 作者: Annotate 時間: 2025-3-29 17:44 作者: 死亡率 時間: 2025-3-29 20:18 作者: cyanosis 時間: 2025-3-30 02:41
,Computing GCDs of?Multivariate Polynomials over?Algebraic Number Fields Presented with?Multiple Extstruct the rational coefficients in ., we apply the Chinese remaindering and the rational number reconstruction. We present an analysis of the expected time complexity of our algorithm. We have implemented our algorithm in Maple using a recursive dense representation for polynomials.作者: Evolve 時間: 2025-3-30 06:35
Solving Parametric Linear Systems Using Sparse Rational Function Interpolation,algorithm in Maple and C. We present timing results comparing our implementation with a Maple implementation of Bareiss/Edmonds/Lipson fraction free Gaussian elimination and three other algorithms in Maple for solving ..作者: Integrate 時間: 2025-3-30 09:16 作者: 詼諧 時間: 2025-3-30 13:07 作者: fiscal 時間: 2025-3-30 19:07
Generating Elementary Integrable Expressions,ub-field of Symbolic Integration. However, machine learning models require an abundance of data for them to be successful and there exist few benchmarks on the scale required. While methods to generate new data already exist, they are flawed in several ways which may lead to bias in machine learning作者: 詞根詞綴法 時間: 2025-3-31 00:27
,How to?Automatise Proofs of?Operator Statements: Moore–Penrose Inverse; A Case Study,ynomials. Furthermore, we present our new . package ., which offers functionality for automatising such computations. We aim to provide a practical understanding of our approach and the software through examples, while also explaining the completeness of the method in the sense that it allows to fin作者: 嫌惡 時間: 2025-3-31 01:55
,A Modular Algorithm for?Computing the?Intersection of?a?One-Dimensional Quasi-Component and?a?Hyper common zeros (encoded as regular chains) of a quasi-component and a hypersurface. As a result, decomposing a polynomial system into regular chains can be achieved by repeated calls to the Intersect procedure. Expression swell in Intersect has long been observed in the literature. When the regular c作者: Encoding 時間: 2025-3-31 05:24 作者: 紳士 時間: 2025-3-31 11:39
,Root-Squaring for?Root-Finding,os are the .th powers of the zeros of an input polynomial .(.) for . The iterations have been the main tool for univariate polynomial root-finding in the 19th century and well beyond but became obsolete later because of severe numerical stability problems observed already in a few iterations. To cir作者: 比喻好 時間: 2025-3-31 13:41
,Symbolic-Numerical Algorithm for?Solving the?Problem of?Heavy Ion Collisions in?an?Optical Model wiof the optical model (OM) described by a second-order ordinary differential equation (ODE) with a complex-valued potential and regular boundary conditions. The complex-valued potential consists of the known real part, which is a sum of the nuclear potential, the Coulomb potential, and the centrifuga作者: intercede 時間: 2025-3-31 21:27 作者: 龍卷風 時間: 2025-3-31 23:11 作者: 補角 時間: 2025-4-1 02:23
,Stability and?Zero-Hopf Bifurcation Analysis of?the?Lorenz–Stenflo System Using Symbolic Methods,ons on the parameters of the system are derived by using methods of solving semi-algebraic systems. Using the method of algorithmic averaging, we provide sufficient conditions for the existence of one limit cycle bifurcating from a zero-Hopf equilibrium of the Lorenz–Stenflo system. Some examples ar作者: obnoxious 時間: 2025-4-1 06:33
