Results 231 to 240 of about 419,227 (284)

Approximate quantum circuit compilation for proton-transfer kinetics on quantum processors.

Phys Chem Chem Phys
Kovyrshin A, Manawadu D, Altamura E, Pennington G, Jaderberg B, Brandhofer S, Nykänen A, Miller A, Talarico W, Knecht S, Pavošević F, Baiardi A, Tacchino F, Tavernelli I, Mensa S, Crain J, Tornberg L, Broo A.   +17 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Simultaneous Polynomial Approximation

SIAM Journal on Mathematical Analysis, 1993
The authors prove the approximation theorem on simultaneous approximation of \(f\in C^ s[- 1,1]\) and its derivatives of order \(j\), \(0\leq j\leq s\), by polynomials of degree \(n\) and their derivatives which has filled the gap between Timan-Trigub's type theorem and the classical norm estimate of the Jackson type.
Ditzian, Z., Jiang, Dechang, Leviatan, D.   +2 more
openaire   +2 more sources

Weighted Polynomial Approximations

2001
In this chapter, we establish the existence of weighted polynomial approximations that are a prerequisite to the estimates and asymptotics in subsequent chapters. We search for polynomials P n of degree n such that P n W approximates 1 in some sense on [a −n, a n ].
Eli Levin, Doron S. Lubinsky
openaire   +1 more source

m-approximate Taylor polynomial

manuscripta mathematica, 2019
In \(\mathbb{R}^n\) a notion of \(m\)-density for \(m\in [n, \infty)\) is a generalization of density. Analogous as approximate continuity (differentiability) one can define \(m\)-approximate continuity (differentiability) at a point. It is proved that if \(1\leq p< \infty\) and \(f\colon \mathbb{R}^n \to \mathbb{R}\) is \(L^p\) differentiable at \(x ...
openaire   +3 more sources

Approximation Numbers for Polynomials

2019
Approximation numbers of linear operators are a very useful tool in order to understand the structure and the numerical behaviour of the operators. In this paper, this concept is extended to polynomials on Banach spaces and the approximation numbers of diagonal polynomials are estimated.
Junek, Heinz, Braunß, Hans-Andreas, Plewnia, Eckart   +2 more
openaire   +2 more sources

Approximate Polynomial GCD by Approximate Syzygies

Mathematics in Computer Science, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Probability measures, appel polynomials and polynomial approximation

Applied Mathematics and Computation, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin, Clyde, Shubov, Victor
openaire   +2 more sources

Monotone Approximation by Polynomials

SIAM Journal on Mathematical Analysis, 1977
We prove Jackson type estimates for the approximation of monotone functions by monotone polynomials. The results are given in terms of the modulus of continuity of $f^{(k)} $ , for any $k \geqq 0$. The estimates are of the same order as for the unconstrained approximation by polynomials.
openaire   +1 more source

Associated Legendre Polynomial Approximations

Journal of Applied Physics, 1951
Approximations for the associated Legendre Polynomials are derived by a phase integral method. The method is an extension of the WBK method, applicable to separable multidimensional wave propagation problems.
openaire   +2 more sources

Approximation by Bernstein Polynomials

American Journal of Mathematics, 1994
Let \[ B_ n(f; x)= \sum^ n_{k=0} f\left({k\over n}\right)\left(\begin{smallmatrix} n\\ k\end{smallmatrix}\right) x^ k(1-x)^{n- k} \] and \(w_ \varphi(f; \delta)= \sup_{0\leq t\leq \delta} \sup_ x| f(x- t\varphi(x))- 2f(x)+ f(x+ t\varphi(x)))|\), where \(f\in C[0,1]\), \(\varphi(x)= \sqrt{x(1-x)}\) and the second supremum is taken for those values of ...
openaire   +2 more sources