Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Mathematical Markup Language (MathML) Version 3.0
This specification of the markup language MathML is intended primarily for a readership consisting of those who will be developing or implementing renderers or editors using it, or software that will communicate using MathML as a protocol for input or output.
The singular value decomposition for polynomial systems
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coecients are inexact or imperfectly known. We first give an…
First Leaves: A Tutorial Introduction to Maple V
This tutorial shows how to use Maple both as a calculator with instant access to hundreds of high-level math routines and as a programming language for more demanding tasks. It covers topics such as…
QR factoring to compute the GCD of univariate approximate polynomials
- Robert M Corless, S. Watt, L. Zhi
- Computer Science, MathematicsIEEE Transactions on Signal Processing
- 1 December 2004
We present a stable and practical algorithm that uses QR factors of the Sylvester matrix to compute the greatest common divisor (GCD) of univariate approximate polynomials over /spl Ropf/[x] or /spl…
An OpenMath 1.0 implementation
This paper presents the first implementation of the OpenMath specification, in the form of a C library, and describes how the C library has been embedded in two main-stream computer algebra systems, Maple and Reduce, which can now communicate with each other and Aldor, and with specialized programs also linking the libraries.
Towards factoring bivariate approximate polynomials
A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y], which constructs a nearby composite polynomial, if one exists, and its irreducible factors.
Hybrid Mathematical Symbol Recognition Using Support Vector Machines
Results from the experiments show that giving slightly higher weight to the on-line information produces better results, and the overall error rate of the hybrid system is lower than that of both the online and offline recognition systems when used in isolation.
Pivot-Free Block Matrix Inversion
- S. Watt
- MathematicsEighth International Symposium on Symbolic and…
- 26 September 2006
A pivot-free deterministic algorithm for the inversion of block matrices based on the Moore-Penrose inverse that improves on previous methods that required at least one invertible on-diagonal block, and that otherwise required row- or column-based pivoting, disrupting the block structure.
Reasoning about the Elementary Functions of Complex Analysis
This paper outlines the "unwinding number" approach to the simplification of elementary functions, and shows how it can be used to prevent errors and to systematise such simplification, even though it has not yet been reduced to a complete algorithm.