A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Greedy Algorithms for High-Dimensional Eigenvalue Problems
Greedy Algorithms for High-Dimensional Eigenvalue Problems
Greedy Algorithms for High-Dimensional Eigenvalue Problems
Cancès, E. (author) / Ehrlacher, V. (author) / Lelièvre, T. (author)
CONSTRUCTIVE APPROXIMATION ; 40 ; 387-423
2014-01-01
37 pages
Article (Journal)
English
DDC:
511.4
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Lanczos Algorithms-Type for Hamiltonian Eigenvalue Problems
| British Library Online Contents | 2001
Greedy Algorithms for Scheduling Workers
| British Library Conference Proceedings | 1996
Generalized Approximate Weak Greedy Algorithms
| British Library Online Contents | 2005
Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
| British Library Online Contents | 2012
Preconditioned low-rank methods for high-dimensional elliptic PDE eigenvalue problems
| British Library Online Contents | 2011