2008
DOI: 10.1007/s10474-008-8037-2
|View full text |Cite
|
Sign up to set email alerts
|

Estimates of the norm of the Mercer kernel matrices with discrete orthogonal transforms

Abstract: The paper is related to the lower and upper estimates of the norm for Mercer kernel matrices. We rst give a presentation of the Lagrange interpolating operators from the view of reproducing kernel space. Then, we modify the Lagrange interpolating operators to make them bounded in the space of continuous function and be of the de la Vallée Poussin type. The order of approximation by the reproducing kernel spaces for the continuous functions is thus obtained, from which the lower and upper bounds of the Rayleigh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 22 publications
0
4
0
Order By: Relevance
“…where 𝜑 is the feature projection operator from input vector space ℛ to feature vector space ℱ. When 𝜅 satisfies Mercer condition [30][31], i.e., 𝜅 is continuous, symmetric and positive definite, it has 1) ∀ 𝑥 ∈ ℛ, 𝜅(𝑥, 𝑦) ∈ ℱ;…”
Section: Kernel Projection To Rkhsmentioning
confidence: 99%
See 2 more Smart Citations
“…where 𝜑 is the feature projection operator from input vector space ℛ to feature vector space ℱ. When 𝜅 satisfies Mercer condition [30][31], i.e., 𝜅 is continuous, symmetric and positive definite, it has 1) ∀ 𝑥 ∈ ℛ, 𝜅(𝑥, 𝑦) ∈ ℱ;…”
Section: Kernel Projection To Rkhsmentioning
confidence: 99%
“…Equations ( 26) to (31) complete the process of one-step estimation in a kernel Kalman filter, where 𝒂 𝑖 , 𝑷 ̃𝑖 − , 𝑮 ̃𝑖, 𝑷 ̃𝑖, and 𝒃 𝑖 all can be expressed with inner product of embedded variables so that they can be calculated conveniently by kernel trick with given kernel function.…”
Section: ) One-step Estimation In Rkhsmentioning
confidence: 99%
See 1 more Smart Citation
“…Putting(21) and(25)into(20) with f = η m (f M ), we get E(f z,λ ) − E(f M ) ≤ λ kC {E(f z,λ ) − E(f M )} + c(m),where c(m) is defined in(25), we have with confidence at least 1 − 2δ , thatE(f z,λ ) − E(f M ) ≤ 2λ kC 2 1…”
mentioning
confidence: 99%