Results 91 to 100 of about 937,852 (212)
An approximation theorem for likelihood ratios
A semigroup approximation theorem is used to prove the convergence of approximate likelihood ratios.Semigroups likelihood ...
Pitcher, Tom S.
core
O’Neill’s theorem for PL approximations
AbstractWe present a version of O’Neill’s theorem (Theorem 5.2 in O’Neill in Am J Math 75(3):497–509, 1953) for piecewise linear approximations.
Govindan, S., Pahl, L.
openaire +3 more sources
The inverse theorem of approximation theory in Smirnov-Orlicz classes
Let F be a Dini- smooth curve in the complex plane C. In this study we prove inverse theorem of approximation theory by polynomials in Smirnov-Orlicz classes EM (G)
Sadulla Z. Jafarov, Jafarov, Sadulla Z.
core +1 more source
The approximation of bivariate functions by bivariate operators and GBS operators
In this paper we demonstrate a general approximation theorem for the bivariate functions by bivariate operators and GBS (Generalized Boolean Sum) operators.
Ovidiu T. Pop
doaj
Arithmetic Demailly approximation theorem
We generalize the Demailly approximation theorem from complex geometry to Arakelov geometry.As an application, let $X/\mathbb{Q}$ be an integral projective variety and $\overline N$ be an adelic line bundle on $X$, we prove that $\operatorname{ess}(\overline N) \geq 0$ $\Longrightarrow $ $\overline N$ pseudo-effective.
Qu, Binggang, Yin, Hang
openaire +2 more sources
Best Simultaneous Approximation of Functions and a Generalized Minimax Theorem [PDF]
Best simultaneous approximation (BSA) for finitely or infinitely many functions are considered under the uniform norm and other important norms. Characterization theorems for a BSA from a finite-dimensional subspace are obtained by a generalized minimax ...
Tanimoto, Shinji
core
Nonlinear Knowledge in Kernel Approximation [PDF]
Prior knowledge over arbitrary general sets is incorporated into nonlinear kernel approximation problems in the form of linear constraints in a linear program.
Mangasarian, Olvi, Wild, Edward
core
Approximate Selection Theorems and Their Applications
Let \(X\) be a paracompact space, \(Y\) a locally convex linear topological space, and \(F:X\to Y\) a multifunction with convex values. \(F\) is called sub-lsc if for each \(x\in X\) and each neighbourhood of zero in \(Y\) there is a \(z\in F(x)\) and a neighbourhood \(U(x)\) of \(x\) in \(X\) such that for each \(y\in U(x)\), \(z\in F(y)+V\).
openaire +2 more sources
A covering approach to eigenvalue bounds for the fractional p-Laplacian
We study Weyl-type lower bounds for the variational eigenvalues associated with a weighted fractional p-Laplacian on bounded domains with Lipschitz boundary in a critical (limit) case.
Hasanov Mahir
doaj +1 more source
A Generalisation of Steenrod's Approximation Theorem
In this paper we aim for a generalisation of the Steenrod Approximation Theorem from, concerning a smoothing procedure for sections in smooth locally trivial bundles. The generalisation is that we consider locally trivial smooth bundles with a possibly infinite-dimensional typical fibre.
openaire +3 more sources

