Titlebook: Algebra, Geometry and Software Systems; Michael Joswig,Nobuki Takayama Conference proceedings 2003 Springer-Verlag Berlin Heidelberg 2003

殘暴

CHURL

https://doi.org/10.1007/978-3-540-73339-3e boundary matrices which in general are sparse. We provide a review of several algorithms for the calculation of Smith Normal Form of sparse matrices and compare their running times for actual boundary matrices. Then we describe alternative approaches to the calculation of simplicial homology. The

Malleable

persistence

X Window System (X11) und Arbeitsumgebungenaces, which are so beautiful from an abstract point of view. But these were static visualizations. Using the computer program .., which was written by the second author, one can now draw algebraic curves and surfaces depending on parameters interactively..Using this software and Coble‘s explicit equ

Project

https://doi.org/10.1007/978-3-540-73339-3he surface contains singularities. Most algorithms for constructing a polygonization of the surface will miss the singular points. We present an algorithm for polygonizing such surfaces which attempts to get accurate representations of the singular points. A client-server approach, with a Java apple

Minutes

ALLEY

Von der Hardware zur Anwendung, plane. It is done first in Maple by translating the geometric relations into polynomial equations, decomposing the obtained system of polynomials into irreducible representative triangular sets, and finding an adequate numerical solution from each triangular set. A Java class coding the solution an

PARA

panorama

legislate