Sciweavers

79 search results - page 10 / 16
» Galerkin eigenvector approximations
Sort
View
JC
2006
97views more  JC 2006»
13 years 9 months ago
Optimal approximation of elliptic problems by linear and nonlinear mappings II
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Stephan Dahlke, Erich Novak, Winfried Sickel
DAGSTUHL
2004
13 years 11 months ago
Optimal Approximation of Elliptic Problems by Linear and Nonlinear Mappings
We study the optimal approximation of the solution of an operator equation A(u) = f by four types of mappings: a) linear mappings of rank n; b) n-term approximation with respect t...
Erich Novak, Stephan Dahlke, Winfried Sickel
NIPS
2004
13 years 11 months ago
A Direct Formulation for Sparse PCA Using Semidefinite Programming
We examine the problem of approximating, in the Frobenius-norm sense, a positive, semidefinite symmetric matrix by a rank-one matrix, with an upper bound on the cardinality of its...
Alexandre d'Aspremont, Laurent El Ghaoui, Michael ...
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 10 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
MCS
2010
Springer
13 years 8 months ago
Goal-oriented a posteriori error estimates for transport problems
Some aspects of goal-oriented a posteriori error estimation are addressed in the context of steady convection-diffusion equations. The difference between the exact and approxima...
Dmitri Kuzmin, Sergey Korotov