79 search results - page 10 / 16 » Galerkin eigenvector approximations |
128
Voted
JC
2006
15 years 1 months ago
2006
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...
DAGSTUHL
2004
15 years 3 months ago
2004
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...
125
click to vote
NIPS
2004
15 years 3 months ago
2004
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...
133
Voted
CORR
2008
Springer
15 years 1 months ago
2008
Springer
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...
133
click to vote
MCS
2010
Springer
15 years 8 days ago
2010
Springer
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...