#### Filter Results:

- Full text PDF available (29)

#### Publication Year

2004

2013

- This year (0)
- Last 5 years (1)
- Last 10 years (12)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Plamen Koev, Alan Edelman
- Math. Comput.
- 2006

We present new algorithms that efficiently approximate the hypergeometric function of a matrix argument through its expansion as a series of Jack functions. Our algorithms exploit the combinatorialâ€¦ (More)

Formulas are derived for the probability density function and the probability distribution function of the largest canonical angle between two p-dimensional subspaces of Rn chosen from the uniformâ€¦ (More)

- Plamen Koev
- SIAM J. Matrix Analysis Applications
- 2005

- Plamen Koev
- SIAM J. Matrix Analysis Applications
- 2007

We consider the problem of performing accurate computations with rectangular (mÃ—n) totally nonnegative matrices. The matrices under consideration have the property of having a unique representationâ€¦ (More)

- Ioana Dumitriu, Plamen Koev
- SIAM J. Matrix Analysis Applications
- 2008

We present explicit formulas for the distributions of the extreme eigenvalues of the Î²â€“Jacobi random matrix ensemble in terms of the hypergeometric function of a matrix argument. For Î² = 1, 2, 4,â€¦ (More)

- FroilÃ¡n M. Dopico, Plamen Koev, Juan M. Molera
- Numerische Mathematik
- 2009

We prove that the Jacobi algorithm applied implicitly on a decomposition A = XDXT of the symmetric matrix A, where D is diagonal, and X is well conditioned, computes all eigenvalues of A to highâ€¦ (More)

- James Demmel, Plamen Koev
- Numerische Mathematik
- 2004

We present a new O(n 3) algorithm which computes the SVD of a weakly diagonally dominant M-matrix to high relative accuracy. The algorithm takes as an input the offdiagonal entries of the matrix andâ€¦ (More)

- James Demmel, Plamen Koev
- SIAM J. Matrix Analysis Applications
- 2005

Vandermonde, Cauchy, and Cauchyâ€“Vandermonde totally positive linear systems can be solved extremely accurately in O(n2) time using BjÃ¶rckâ€“Pereyra-type methods. We prove that BjÃ¶rckâ€“Pereyra-typeâ€¦ (More)

- James Demmel, Plamen Koev
- Math. Comput.
- 2006

We present new algorithms for computing the values of the Schur sÎ»(x1, x2, . . . , xn) and Jack J Î± Î» (x1, x2, . . . , xn) functions in floating point arithmetic. These algorithms deliver guaranteedâ€¦ (More)

We present two new algorithms for computing all Schur functions sÎº(x1, . . . ,xn) for partitions Îº such that |Îº| â‰¤ N. Both algorithms have the property that for nonnegative arguments x1, . . . ,xnâ€¦ (More)