Sciweavers

7 search results - page 1 / 2
» A distance bound for pseudospectra of matrix polynomials
Sort
View
APPML
2007
76views more  APPML 2007»
13 years 11 months ago
A distance bound for pseudospectra of matrix polynomials
In this note, we obtain a lower bound for the distance between the pseudospectrum of a matrix polynomial and a given point that lies out of it, generalizing a known result on pseu...
Panayiotis Psarrakos
AMC
2010
126views more  AMC 2010»
13 years 11 months ago
On condition numbers of polynomial eigenvalue problems
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
Nikolaos Papathanasiou, Panayiotis Psarrakos
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 8 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
COLT
2010
Springer
13 years 8 months ago
Toward Learning Gaussian Mixtures with Arbitrary Separation
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
Mikhail Belkin, Kaushik Sinha
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
14 years 8 months ago
Coresets and Sketches for High Dimensional Subspace Approximation Problems
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...
Dan Feldman, Morteza Monemizadeh, Christian Sohler...