Search results for "NF"

Common fixed points of g-quasicontractions and related mappings in 0-complete partial metric spaces

2012

Abstract Common fixed point results are obtained in 0-complete partial metric spaces under various contractive conditions, including g-quasicontractions and mappings with a contractive iterate. In this way, several results obtained recently are generalized. Examples are provided when these results can be applied and neither corresponding metric results nor the results with the standard completeness assumption of the underlying partial metric space can. MSC:47H10, 54H25.

Variable time amplitude amplification and quantum algorithms for linear algebra problems

2012

Quantum amplitude amplification is a method of increasing a success probability of an algorithm from a small epsilon>0 to Theta(1) with less repetitions than classically. In this paper, we generalize quantum amplitude amplification to the case when parts of the algorithm that is being amplified stop at different times. We then apply the new variable time amplitude amplification to give two new quantum algorithms for linear algebra problems. Our first algorithm is an improvement of Harrow et al. algorithm for solving systems of linear equations. We improve the running time of the algorithm from O(k^2 log N) to O(k log^3 k log N) where k is the condition number of the system of equations. …

NightShift: NMR shift inference by general hybrid model training - a framework for NMR chemical shift prediction

2013

Derivation of a Homogenized Two-Temperature Model from the Heat Equation

2014

This work studies the heat equation in a two-phase material with spherical inclusions. Under some appropriate scaling on the size, volume fraction and heat capacity of the inclusions, we derive a coupled system of partial differential equations governing the evolution of the temperature of each phase at a macroscopic level of description. The coupling terms describing the exchange of heat between the phases are obtained by using homogenization techniques originating from [D. Cioranescu, F. Murat: Coll\`ege de France Seminar vol. 2. (Paris 1979-1980) Res. Notes in Math. vol. 60, pp. 98-138. Pitman, Boston, London, 1982.]

The convective eigenvalues of the one–dimensional p–Laplacian as p → 1

2020

Abstract This paper studies the limit behavior as p → 1 of the eigenvalue problem { − ( | u x | p − 2 u x ) x − c | u x | p − 2 u x = λ | u | p − 2 u , 0 x 1 , u ( 0 ) = u ( 1 ) = 0 . We point out that explicit expressions for both the eigenvalues λ n and associated eigenfunctions are not available (see [16] ). In spite of this hindrance, we obtain the precise values of the limits lim p → 1 + ⁡ λ n . In addition, a complete description of the limit profiles of the eigenfunctions is accomplished. Moreover, the formal limit problem as p → 1 is also addressed. The results extend known features for the special case c = 0 ( [6] , [28] ).

Global Lp -integrability of the derivative of a quasiconformal mapping

1988

Let f be a quasiconformal mapping of an open bounded set U in Rn into Rn . Then f′ belongs to Lp(U) for some p > n provided that f satisfies (a) U is a uniform domain and fU is a John domain or (b) f is quasisymmetric and U satisfies a metric plumpness condition.

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

Removing the saturation assumption in Bank-Weiser error estimator analysis in dimension three

2020

International audience; We provide a new argument proving the reliability of the Bank-Weiser estimator for Lagrange piecewise linear finite elements in both dimension two and three. The extension to dimension three constitutes the main novelty of our study. In addition, we present a numerical comparison of the Bank-Weiser and residual estimators for a three-dimensional test case.

Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial

2018

Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …