115
click to vote
CASC
15 years 11 days ago
2010 Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
123
click to vote
CASC
15 years 11 days ago
2010 Springer
Computer algebra in scientific computation squarely faces the dilemma of natural mathematical expression versus efficiency. While higher-order programming constructs and parametri...
115
click to vote
CASC
14 years 10 months ago
2010 Springer
Abstract. Residue systems present a well-known way to reduce computation cost for symbolic computation. However most residue systems are implemented for integers or polynomials. Th...
111
click to vote
CASC
15 years 11 days ago
2010 Springer
Convexity is an important property in nonlinear optimization since it allows to apply efficient local methods for finding global solutions. We propose to apply symbolic methods t...
|