Applied Numerical Mathematics - Special Issue on Continued Fractions
Polynomial decomposition algorithms
Journal of Symbolic Computation
Functional decomposition of polynomials: The wild case
Journal of Symbolic Computation
Rational function decomposition
ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Real theorem provers deserve real user-interfaces
SDE 5 Proceedings of the fifth ACM SIGSOFT symposium on Software development environments
Homogeneous bivariate decompositions
Journal of Symbolic Computation
Algorithms for computing sparse shifts for multivariate polynomials
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
SIAM Review
A survey of user interfaces for computer algebra systems
Journal of Symbolic Computation - Special issue graphical user interfaces and protocols
On multivariate rational function decomposition
Journal of Symbolic Computation - Computer algebra: Selected papers from ISSAC 2001
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Algebraic simplification a guide for the perplexed
SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
Greedy algorithms for optimizing multivariate Horner schemes
ACM SIGSAM Bulletin
Designing the User Interface: Strategies for Effective Human-Computer Interaction (4th Edition)
Designing the User Interface: Strategies for Effective Human-Computer Interaction (4th Edition)
On the decomposition of rational functions
Journal of Symbolic Computation
Useful computations need useful numbers
ACM Communications in Computer Algebra
Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation)
Algorithms in Invariant Theory (Texts and Monographs in Symbolic Computation)
Functional Decomposition of Symbolic Polynomials
ICCSA '08 Proceedings of the 2008 International Conference on Computational Sciences and Its Applications
Multivariate partial fraction expansion
ACM Communications in Computer Algebra
High order derivatives and decomposition of multivariate polynomials
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Unit normalization of multinomials over Gaussian integers
ACM Communications in Computer Algebra
Ten commandments for good default expression simplification
Journal of Symbolic Computation
Hi-index | 0.00 |
Many computer algebra systems have more than 1000 built-in functions, making expertise difficult. Using mock dialog boxes, this article describes a proposed interactive general-purpose wizard for organizing optional transformations and allowing easy fine grain control over the form of the result -- even by amateurs. This wizard integrates ideas including: flexible subexpression selection; complete control over the ordering of variables and commutative operands, with wellchosen defaults; interleaving the choice of successively less main variables with applicable function choices to provide detailed control without incurring a combinatorial number of applicable alternatives at any one level; quick applicability tests to reduce the listing of inapplicable transformations; using an organizing principle to order the alternatives in a helpful manner; labeling quickly-computed alternatives in dialog boxes with a preview of their results, using ellipsis elisions if necessary or helpful; allowing the user to retreat from a sequence of choices to explore other branches of the tree of alternatives -- or to return quickly to branches already visited; allowing the user to accumulate more than one of the alternative forms; integrating direct manipulation into the wizard; and supporting not only the usual input-result pair mode, but also the useful alternative derivational and in situ replacement modes in a unified window.