Bases for kernel-based spaces (Q651113): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cam.2011.05.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2009836052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scattered Data Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3446085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability of kernel-based interpolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Haar's Theorem Concerning Chebychev Approximation Problems Having Unique Solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of convergence of an iterative technique for thin plate spline interpolation in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton basis for kernel spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Meshless methods: An overview and recent developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank

Latest revision as of 18:11, 4 July 2024

scientific article
Language Label Description Also known as
English
Bases for kernel-based spaces
scientific article

    Statements

    Bases for kernel-based spaces (English)
    0 references
    0 references
    0 references
    8 December 2011
    0 references
    When computing interpolants with radial basis functions or other kernel methods, using translates of the kernels directly is most often a bad idea, since the linear systems that give rise to the interpolation coefficients are ill conditioned. This does not mean that the problem as such is not well-solvable, but a new basis within the space of translates of the kernel is needed. In this paper, many important special choices of such changes of bases are considered, such as orthonormal bases, Lagrange bases, Newton bases and several others. All these bases depend on the choices of data points as well. An adaptive choice of Newton bases is also considered, as well as numerical examples given. The paper is a most useful and comprehensive contribution to the class of kernel and radial basis function approximation schemes.
    0 references
    0 references
    0 references
    0 references
    0 references
    scattered data
    0 references
    kernels
    0 references
    matching pursuit
    0 references
    adaptivity
    0 references
    stability
    0 references
    duality
    0 references
    0 references