Displaying similar documents to “Iterative methods with analytical preconditioning technique to linear complementarity problems: application to obstacle problems”

Some aspects of the local theory of generalized Dhombres functional equations in the complex domain

Jörg Tomaschek (2012)

ESAIM: Proceedings

Similarity:

We study the generalized Dhombres functional equation (()) = (()) in the complex domain. The function is given and we are looking for solutions with (0) =  and is a primitive root of unity of order  ≥ 2. All formal solutions for this case are described in this work, for the situation where can be transformed into a function which is linearizable and local analytic in a neighbourhood...

Universality in the bulk of the spectrum for complex sample covariance matrices

Sandrine Péché (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

We consider complex sample covariance matrices = (1/)* where is a × random matrix with i.i.d. entries , 1 ≤ ≤ , 1 ≤ ≤ , with distribution . Under some regularity and decay assumptions on , we prove universality of some local eigenvalue statistics in the bulk of the spectrum in the limit where → ∞ and lim→∞ / = for any real number ∈ (0, ∞).

Model selection and estimation of a component in additive regression

Xavier Gendre (2014)

ESAIM: Probability and Statistics

Similarity:

Let  ∈ ℝ be a random vector with mean and covariance matrix where is some known  × -matrix. We construct a statistical procedure to estimate as well as under moment condition on or Gaussian hypothesis. Both cases are developed for known or unknown . Our approach is free from any prior assumption on and is based on non-asymptotic model selection methods....

Computing and proving with pivots

Frédéric Meunier (2013)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

A simple idea used in many combinatorial algorithms is the idea of . Originally, it comes from the method proposed by Gauss in the 19th century for solving systems of linear equations. This method had been extended in 1947 by Dantzig for the famous simplex algorithm used for solving linear programs. From since, a pivoting algorithm is a method exploring subsets of a ground set and going from one subset to a new one ′ by deleting an element inside and adding an element outside : ′ =  ...

Pointwise constrained radially increasing minimizers in the quasi-scalar calculus of variations

Luís Balsa Bicho, António Ornelas (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We prove of vector minimizers () =  (||) to multiple integrals ∫ ((), |()|)  on a  ⊂ ℝ, among the Sobolev functions (·) in + (, ℝ), using a  : ℝ×ℝ → [0,∞] with (·) and . Besides such basic hypotheses, (·,·) is assumed to satisfy also...

Variational approximation of a functional of Mumford–Shah type in codimension higher than one

Francesco Ghiraldin (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper we consider a new kind of Mumford–Shah functional () for maps : ℝ → ℝ with  ≥ . The most important novelty is that the energy features a singular set of codimension greater than one, defined through the theory of distributional jacobians. After recalling the basic definitions and some well established results, we prove an approximation property for the energy ()  −convergence, in the same spirit of the work by Ambrosio and Tortorelli [L....

Hereditary properties of words

József Balogh, Béla Bollobás (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

Let be a hereditary property of words, , an infinite class of finite words such that every subword (block) of a word belonging to is also in . Extending the classical Morse-Hedlund theorem, we show that either contains at least words of length for every  or, for some , it contains at most words of length for every . More importantly, we prove the following quantitative extension of this result: if has words of length then, for every , it contains at most ⌈( + 1)/2⌉⌈( + 1)/2⌈...

Central limit theorems for linear spectral statistics of large dimensional F-matrices

Shurong Zheng (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

In many applications, one needs to make statistical inference on the parameters defined by the limiting spectral distribution of an matrix, the product of a sample covariance matrix from the independent variable array ( )×1 and the inverse of another covariance matrix from the independent variable array ( )×2. Here, the two variable arrays are assumed to either both real or both complex. It helps to find the asymptotic distribution of the relevant parameter...

Hydrodynamic limit of a d-dimensional exclusion process with conductances

Fábio Júlio Valentim (2012)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

Fix a polynomial of the form () = + ∑2≤≤    =1 with (1) gt; 0. We prove that the evolution, on the diffusive scale, of the empirical density of exclusion processes on 𝕋 d , with conductances given by special class of functions, is described by the unique weak solution of the non-linear parabolic partial differential equation = ∑    ...

Spectral analysis in a thin domain with periodically oscillating characteristics

Rita Ferreira, Luísa M. Mascarenhas, Andrey Piatnitski (2012)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

The paper deals with a Dirichlet spectral problem for an elliptic operator with -periodic coefficients in a 3D bounded domain of small thickness . We study the asymptotic behavior of the spectrum as and tend to zero. This asymptotic behavior depends crucially on whether and are of the same order ( ≈ ), or is much less than ( =   < 1), or is much greater than ( =   > 1). We consider all three cases. ...

Plug-in estimation of level sets in a non-compact setting with applications in multivariate risk theory

Elena Di Bernardino, Thomas Laloë, Véronique Maume-Deschamps, Clémentine Prieur (2013)

ESAIM: Probability and Statistics

Similarity:

This paper deals with the problem of estimating the level sets () =  {() ≥ }, with  ∈ (0,1), of an unknown distribution function on ℝ . A plug-in approach is followed. That is, given a consistent estimator of , we estimate () by () =  { () ≥ }. In our setting, non-compactness property is required for the level sets to estimate. We state consistency results with respect to the Hausdorff distance and the volume of the symmetric...

Upper large deviations for maximal flows through a tilted cylinder

Marie Theret (2014)

ESAIM: Probability and Statistics

Similarity:

We consider the standard first passage percolation model in ℤ for  ≥ 2 and we study the maximal flow from the upper half part to the lower half part (respectively from the top to the bottom) of a cylinder whose basis is a hyperrectangle of sidelength proportional to and whose height is () for a certain height function . We denote this maximal flow by (respectively ). We emphasize the fact that the cylinder may be tilted. We look at the probability that...

Means in complete manifolds: uniqueness and approximation

Marc Arnaudon, Laurent Miclo (2014)

ESAIM: Probability and Statistics

Similarity:

Let be a complete Riemannian manifold,  ∈ ℕ and  ≥ 1. We prove that almost everywhere on  = ( ,, ) ∈  for Lebesgue measure in , the measure μ ( x ) = N k = 1 N x k μ ( x ) = 1 N ∑ k = 1 N δ x k has a unique–mean (). As a consequence, if  = ( ,, ) is a -valued random variable with absolutely continuous law, then almost surely (()) has a unique –mean. In particular if ( ...