Cargando…
Greedy Approximation
Provides the theoretical foundations for algorithms widely used in numerical mathematics. Includes classical results, as well as the latest advances.
Autor principal: | Temlyakov, Vladimir |
---|---|
Lenguaje: | eng |
Publicado: |
Cambridge University Press
2011
|
Materias: | |
Acceso en línea: | http://cds.cern.ch/record/1416988 |
Ejemplares similares
-
Optimization by GRASP: greedy randomized adaptive search procedures
por: Resende, Mauricio G C, et al.
Publicado: (2016) -
Approximate calculation of integrals
por: Krylov, Vladimir Ivanovich, et al.
Publicado: (1962) -
Approximate and Renormgroup Symmetries
por: Ibragimov, Nail H, et al.
Publicado: (2009) -
Constructive approximation: fractal approximation
por: DeVore, Ronald, et al.
Publicado: (1989) -
KAM theory and semiclassical approximations to eigenfunctions
por: Lazutkin, Vladimir F
Publicado: (1993)