#### Filter Results:

- Full text PDF available (53)

#### Publication Year

1983

2019

- This year (18)
- Last 5 years (41)
- Last 10 years (77)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Robert M. Corless, Gaston H. Gonnet, D. E. G. Hare, David J. Jeffrey, Donald E. Knuth
- Adv. Comput. Math.
- 1996

The LambertW function is defined to be the multivalued inverse of the functionw →wew. It has many applications in pure and applied mathematics, some of which are briefly described here. We present a… (More)

This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known. We first give an… (More)

Companion matrices of matrix polynomials L(λ) (with possibly singular leading coefficient) are a familiar tool in matrix theory and numerical practice leading to so-called “linearizations” λB −A of… (More)

- Robert M. Corless, Stephen M. Watt, Lihong Zhi
- IEEE Transactions on Signal Processing
- 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… (More)

- Robert M. Corless, Patrizia M. Gianni, Barry M. Trager
- ISSAC
- 1997

The technique of solving systems of multivariate polynomial equations via rigenproblems has become a topic of active research (with applications in computer-aided design and {untrul theory, for… (More)

A new algorithm is presented for factoring bivariate approximate polynomials over C[x, y]. Given a particular polynomial, the method constructs a nearby composite polynomial, if one exists, and its… (More)

- Paulina Chin, Robert M. Corless, George F. Corliss
- ISSAC
- 1998

We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactlyknown coe cients. Assuming that an estimate for the GCD degree is available (e.g.,… (More)

It is well known that solving polynomial equations, or finding the eigenvalues of matrix polynomials, can be done by transforming to a generalized eigenvalue problem (see for example [10]). In this… (More)