Sciweavers

3454 search results - page 56 / 691
» Modern computer algebra
Sort
View
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 5 months ago
On the Computation of the Topology of a Non-Reduced Implicit Space Curve
An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise ...
Daouda Niang Diatta, Bernard Mourrain, Olivier Rua...
INFOVIS
2002
IEEE
15 years 10 months ago
ACE: A Fast Multiscale Eigenvectors Computation for Drawing Huge Graphs
We present an extremely fast graph drawing algorithm for very large graphs, which we term ACE (for Algebraic multigrid Computation of Eigenvectors). ACE exhibits an improvement of...
Yehuda Koren, Liran Carmel, David Harel
AMC
2007
89views more  AMC 2007»
15 years 5 months ago
Iterative methods for computing generalized inverses
We develop several iterative methods for computing generalized inverses using both first and second order optimization methods in C∗ -algebras. Known steepest descent iterative...
Dragan S. Djordjevic
SIAMNUM
2011
252views more  SIAMNUM 2011»
15 years 14 days ago
Analysis and Computation of Compatible Least-Squares Methods for div-curl Equations
We develop and analyze least-squares finite element methods for two complementary div-curl elliptic boundary value problems. The first one prescribes the tangential component of ...
Pavel B. Bochev, Kara Peterson, Christopher M. Sie...
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
15 years 5 months ago
Recognizing Cluster Algebras of Finite Type
We compute the list of all minimal 2-infinite diagrams, which are cluster algebraic analogues of extended Dynkin graphs.
Ahmet I. Seven