Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
A p-adic algorithm for univariate partial fractions
  • Paul S. Wang
  • Mathematics, Computer Science
    SYMSAC '81
  • 5 August 1981
Partial fractions is an important algebraic operation with many applications in applied mathematics, physics and engineering. It is also an important operation in any computer symbolic and algebraic…
View on ACM
An improved multivariate polynomial factoring algorithm
TLDR
A new algorithm for factoring multivariate polynomials over the integers based on an algorithm by Wang and Rothschild is described, which is generally faster and requires less store then the original algorithm.
View via Publisher
Chains of recurrences—a method to expedite the evaluation of closed-form functions
TLDR
Chains of Recurrences are introduced as an effective method to evaluate functions at regular intervals and an implementation of the method in MAXIMA/Common Lisp is discussed.
View on ACM
The EEZ-GCD algorithm
TLDR
An enhanced gcd algorithm based on the EZ-GCD algorithm is described, which is generally faster and is particularly suited for computing gcd of sparse multivariate polynomials.
View on ACM
P-adic reconstruction of rational numbers
TLDR
In a recent paper, Wang [1981] introduces a p-adic algorithm for the construction of partial fraction decompositions that is used to reconstruct rational numbers, rather than integers.
View on ACM
Weighted Low-Rank Approximation of General Complex Matrices and Its Application in the Design of 2-D Digital Filters
TLDR
Application of the proposed algorithm to the design of FIR two-dimensional (2-D) digital filters is described to demonstrate the usefulness of the algorithm proposed.
View via Publisher
Numerological analysis of the WKB approximation in large order
We show how to slove the one-dimensional two-turning-point eigenvalue problem for analytic potentials to all orders in the WKB approximation. We use this method to compute the eigenvalues of the…
View via Publisher
Factoring multivariate polynomials over algebraic number fields
The algorithm for factoring polynomials over the integers by Wang and Rothschild is generalized to an algorithm for the irreducible factorization of multivariate polynomials over any given algebraic…
View via Publisher
Factoring multivariate polynomials over the integers
This paper gives an algorithm for finding the irreducible factors of any multivariate polynomial with integer coefficients. The algorithm begins by making substitutions for all but one of the…
View on ACM
SUI: a system independent user interface for an integrated scientific computing environment
TLDR
SUI is a window-menu-mouse oriented graphical user interface that is designed to provide a modern and integrated computing environment for scientific work and achieves hardware and operating system independence as well as network transparency by employing the X11 protocols.
View on ACM
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License