Results 291 to 300 of about 5,939,728 (334)

A Mathematical Analysis of IPT-DMFT. [PDF]

Commun Math Phys
Cancès E, Kirsch A, Perrin-Roussel S.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximate function memoization

Concurrency and Computation: Practice and Experience, 2022
SummaryFunction memoization is an optimization technique that reduces a function call overhead when the same input appears again. A table that stores the previous result is searched and used to skip the repeated computation. This way, it increases the performance of the function call.
Priya Arundhati, Sisir Kumar Jena, Santosh Kumar Pani   +2 more
openaire   +1 more source

APPROXIMATION OF BELIEF FUNCTIONS

International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2003
This paper addresses the approximation of belief functions by probability functions where the approximation is based on minimizing the Euclidean distance. First of all, we simplify this optimization problem so it becomes equivalent to a standard problem in linear algebra.
openaire   +2 more sources

Superfractal Approximation of Functions

Ukrainian Mathematical Journal, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On the Approximation of Interval Functions

2006
Many problems in interval arithmetic in a natural way lead to a quantifier elimination problem over the reals. By studying closer the precise form of the latter we show that in some situations it is possible to obtain a refined complexity analysis of the problem.
openaire   +3 more sources

Approximations in Functional Analysis

Results in Mathematics, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lowen, Robert, Sioen, Mark
openaire   +3 more sources

Decomposition of Approximable Functions

The Annals of Mathematics, 1984
The purpose of this paper is to give a description of the space \(A_ D(F)\) of functions on a relatively closed subset F of an open plane set D which can be approximated uniformly on F by functions in H(D), i.e. functions analytic on D. The main result is the decomposition \[ A_ D(F)=C_{ua}(F\cup \Omega (F))+H(D)).
openaire   +2 more sources

APPROXIMATION OF SUBHARMONIC FUNCTIONS

Mathematics of the USSR-Sbornik, 1985
If the function f(z) is holomorphic in \(\Omega \subset R_ 2\), the function ln \(| f(z)|\) is subharmonic in \(\Omega\). In the paper the possibilities of approximations of subharmonic functions defined on an arbitrary domain \(\Omega \subset R_ 2\) are studied. For the case \(\Omega =R_ 2\) the problem is also solved. The approximation is realized by
openaire   +4 more sources

Approximately Midconvex Functions

2008
Let X be a vector space and let D ⊂ X be a nonempty convex set. We say that a function f is δ-midconvex if $$ f\left( {\frac{{x + y}} {2}} \right) \leqslant \frac{{f(x) + f(y)}} {2} + \delta\;\;for x,y \in D. $$ We find the smallest function C : [0, 1] ∩ ℚ → ℝ such that for every δ-midconvex function f : D → ℝ the following estimate holds $$
Misztal, Krzysztof, Tabor, Jacek, Tabor, Józef   +2 more
openaire   +2 more sources

Approximation by Spherical Functions

Mathematische Nachrichten, 1993
AbstractResults on the degree of approximation of continuous or Lipschitz‐continuous functions f:Sn−1 → ℝ on the sphere in ℝn by spherical functions of degree k are given in terms of k and n, strengthening results of Newman and Shapiro. An example of (restriction of) a norm shows the result to be the best possible in k and n.
openaire   +2 more sources