Skip to main content
Article thumbnail
Location of Repository

Proceedings of DWCAA12, Volume 6 · 2013 · Pages 83–100 A Vectorial Kernel Orthogonal Greedy Algorithm

By Daniel Wirtz and Bernard Haasdonk


This work is concerned with derivation and analysis of a modified vectorial kernel orthogonal greedy algorithm (VKOGA) for approximation of nonlinear vectorial functions. The algorithm pursues simultaneous approximation of all vector components over a shared linear subspace of the underlying function Hilbert space in a greedy fashion [16, 37] and inherits the selection principle of the f /P-Greedy algorithm [18]. For the considered algorithm we perform a limit analysis of the selection criteria for already included subspace basis functions. We show that the approximation gain is bounded globally and for the multivariate case the limit functions correspond to a directional Hermite interpolation. We further prove algebraic convergence similar to [14], improved by a dimension-dependent factor, and introduce a new a-posteriori error bound. Comparison to related variants of our algorithm are presented. Targeted applications of this algorithm are model reduction of multiscale models [42]. Sparse approximation of nonlinear functions is a challenging task that arises in many different areas of modern computing. A key element to find sparse representations is the concept of m-term approximation [31, 8], which basically is a measure of how well a function from a given function space can be approximated by linearly combining m functions ou

Year: 2013
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.