Titlebook: Mathematical Software - ICMS 2006; Second International Andrés Iglesias,Nobuki Takayama Conference proceedings 2006 Springer-Verlag Berlin

聯(lián)想記憶

Robust HGCD with No Backup Stepseen notoriously difficult, with the need for “backup steps” in various forms. This paper explains why backup steps are necessary for algorithms based directly on the quotient sequence, and proposes a robustness criterion that can be used to construct a “half-gcd” algorithm without any backup steps.

圖畫文字

The Design of CoCoALibffort has been invested in making the code clean and portable while not neglecting run-time performance; one of the primary goals is to offer freely available reference implementations of the most important algorithms in the field.

吵鬧

散步

Tree Checking for Sparse ComplexesWe detail here the sparse variant of the algorithm sketched in [2] for checking if a simplicial complex is a tree. A full worst case complexity analysis is given and several optimizations are discussed. The practical complexity is discussed for some examples.

無動于衷

Perineum

擔心

斗爭

https://doi.org/10.1007/11832225Mathematica; computer; computer algebra; mathematical software; number theory; optimization; visualization

heart-murmur

Dna262

Matlab-Based Problem-Solving Environment for Geometric Processing of Surfacesbriefly described. The PSE has shown to provide our partner with accurate, reliable solutions to these and other problems and to serve as a communication channel for exchange of geometrical data as well as a platform for trial and research support.