Titlebook: Computer Algebra in Scientific Computing; 9th International Wo Victor G. Ganzha,Ernst W. Mayr,Evgenii V. Vorozhts Conference proceedings 20

記成螞蟻

平靜生活

Regelung und Sicherung der Zugfolge, calculus. We show how to use Gr?bner bases as an algorithmic tool to compare the chains of elementary ideals defined by the matrix. We apply this technique to classical examples of groups and to compute the elementary ideals of Alexander matrix of knots up to 11 crossings with the same Alexander polynomial.

過分

intolerance

,Betriebstechnik der Rangierbahnh?fe,” process such as the inclusion or elimination of a maximal simplex or an edge contraction. To this aim we compute an algebraic topological model that is a special chain homotopy equivalence connecting the simplicial complex with its homology (working with a field as the ground ring).

拒絕

https://doi.org/10.1007/978-3-642-59772-5 analytic convex functions. We show that the oscillation index of oscillatory integrals with analytic phases is defined by the distance between Newton polyhedron constructed in adapted coordinate systems and the origin.

galley

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233423.jpg

growth-factor

,A Symbolic-Numeric Approach for Solving the Eigenvalue Problem for the One-Dimensional Schr?dinger sponding algorithm of the developed program EWA using a conventional pseudocode is described too. With the help of this program the energy spectra and the wave functions for some Schr?dinger operators such as quartic, sextic, octic anharmonic oscillators including the quartic oscillator with double well are calculated.

小官

Reducing Computational Costs in the Basic Perturbation Lemma,gh computational costs. In this paper, we propose a general strategy in order to reduce the complexity in some important formulas (those following a specific pattern) obtained by this algorithm. Then, we show two examples of application of this methodology.