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

遺產(chǎn)

Bounds for the Condition Number of Polynomials Systems with Integer Coefficients,perhaps the most successful numerical ones are the homotopy algorithms. The number of operations that these algorithms perform depends on the condition number of the roots of the polynomial system. Roughly speaking the condition number expresses the sensitivity of the roots with respect to small per

令人發(fā)膩

間諜活動

Homotopy Analysis Method for Stochastic Differential Equations with Maxima,ferential equations is applied to stochastic differential equations with Gaussian stochastic forces. It has been found that the homotopy analysis method yields excellent agreement with exact results (when the latter are available) and appears to be a very promising approach in the calculations relat

后退

On the Topology and Visualization of Plane Algebraic Curves, root isolation for univariate polynomials. The novelty of this paper is that we use a technique of interval polynomials to solve the system . and at the same time, get the simple roots of .(., .)?=?0 on the . fiber. It greatly improves the efficiency of the lifting step since we need not compute th

不來

0302-9743 ic Computing, CASC 2015, held in Aachen, Germany, in September 2015. ..The 35 full papers presented in this volume were carefully reviewed and selected from 42 submissions. They deal with the ongoing progress both in theoretical computer algebra and its expanding applications. New and closer interac

征稅

Hypopnea

褲子

ALB

critique

https://doi.org/10.1007/978-3-322-80858-5rojection operators for the intrinsic group acting in the space . are constructed. The efficiency of the algorithm is investigated by calculating the bases for both laboratory and intrinsic octahedral groups irreducible representations for the set of angular momenta up to .?=?10.