Results 281 to 290 of about 1,388,848 (321)
Some of the next articles are maybe not open access.
2011
Best approximation algorithms were already discussed in Corollary 5.30, in Example 28.18, and in Example 28.19. In this chapter, we provide further approaches for computing the projection onto the intersection of finitely many closed convex sets. The methods we present, all of which employ the individual projectors onto the given sets, are Halpern’s ...
Heinz H. Bauschke, Patrick L. Combettes
openaire +1 more source
Best approximation algorithms were already discussed in Corollary 5.30, in Example 28.18, and in Example 28.19. In this chapter, we provide further approaches for computing the projection onto the intersection of finitely many closed convex sets. The methods we present, all of which employ the individual projectors onto the given sets, are Halpern’s ...
Heinz H. Bauschke, Patrick L. Combettes
openaire +1 more source
Best approximations by rational functions
Mathematical Notes of the Academy of Sciences of the USSR, 1971Description of a general class of real continuous functions cn a segment Δ of the real line for which a best rational approximation with complex coefficients is not unique.
openaire +3 more sources
Best Approximation with Walsh Atoms
Constructive Approximation, 1997The author connects the theoretical algorithmic approximation rate in \(L^2 (\overline R)\) for the model case where \(W\) consist of Walsh atoms. The main result stated implies that a linear combination of \(K\) atoms can be approximated to relative error \(e\) with linear combination of \(O(K^2 \log(1/E)\)-orthogonal atoms. In finite dimension \(N\),
openaire +2 more sources
SSRN Electronic Journal, 1971
The central theme of this paper is the minimax approximation of a function rotated by an angle about the origin and the study of the optimal angle of rotation of least minimax error. Existence theorems indicate validity for any choice of norm. In the following formulation of the problem we will include, with obvious modifications, the cases when the ...
openaire +1 more source
The central theme of this paper is the minimax approximation of a function rotated by an angle about the origin and the study of the optimal angle of rotation of least minimax error. Existence theorems indicate validity for any choice of norm. In the following formulation of the problem we will include, with obvious modifications, the cases when the ...
openaire +1 more source
1990
In this chapter we shall consider the problem for the best approximation of segment functions with regard to the Hausdorff distance. We shall confine ourselves to the consideration of functions defined on a finite or infinite interval.
openaire +1 more source
In this chapter we shall consider the problem for the best approximation of segment functions with regard to the Hausdorff distance. We shall confine ourselves to the consideration of functions defined on a finite or infinite interval.
openaire +1 more source
The evolving landscape of salivary gland tumors
Ca-A Cancer Journal for Clinicians, 2023Conor Steuer
exaly
Best Approximation Characterizations
1986The metric projection P A is the set-valued function which carries x ∈ E to its (possibly empty) best approximation set in A ⊂ E., i.e. P A x ≡ {y ∈ A; ǁx - yǁ = d(x,A)}.
openaire +1 more source