Search

We investigate the critical properties of continuous random field Ising model (RFIM). Using the distributional zeta-function method, we obtain a series representation for the quenched free energy. It is possible to show that for each moment of the partition function, the multiplet of $k$-fields the Gaussian contribution has one field with the contribution of the disorder and $(k-1)$-fields with the usual propagator. Although the non-gaussian contribution is non-perturbative we are able to show that the model is confined between two $\mathbb{Z}_2\times\mathcal{O}(k-1)$-symmetric models. Using arguments of lower critical dimension alongside with monotone operators, we show that the phase of the continuous RFIM can be restricted by an $\mathbb{Z}_2 \times \mathcal{O}(k-1) \to \mathcal{O}(k-2)$ phase transition., Comment: 6 pages

Critical Casimir effect appears when critical fluctuations of an order parameter interact with classical boundaries. We investigate this effect in the setting of a Landau-Ginzburg model with continuous symmetry in the presence of quenched disorder. The quenched free energy is written as an asymptotic series of moments of the models partition function. Our main result is that, in the presence of a strong disorder, Goldstone modes of the system contribute either with an attractive or with a repulsive force. This result was obtained using the distributional zeta-function method without relying on any particular ansatz in the functional space of the moments of the partition function., Comment: 11 pages, 2 figures

We propose and analyze a family of successive projection methods whose step direction is the same as Landweber method for solving nonlinear ill-posed problems that satisfy the Tangential Cone Condition (TCC). This family enconpasses Landweber method, the minimal error method, and the steepest descent method; thush providing an unified framework for the analysis of these methods. Moreover, we define in this family new methods which are convergent for the constant of the TCC in a range twice as large as the one required for the Landweber and other gradient type methods. The TCC is widely used in the analysis of iterative methods for solving nonlinear ill-posed problems. The key idea in this work is to use the TCC in order to construct special convex sets possessing a separation property, and to succesively project onto these sets. Numerical experiments are presented for a nonlinear 2D elliptic parameter identification problem, validating the efficiency of our method., Comment: 29 pages, 6 figures

In this article we propose a novel strategy for choosing the Lagrange multipliers in the Levenberg-Marquardt method for solving ill-posed problems modeled by nonlinear operators acting between Hilbert spaces. Convergence analysis results are established for the proposed method, including: monotonicity of iteration error, geometrical decay of the residual, convergence for exact data, stability and semi-convergence for noisy data. Numerical experiments are presented for an elliptic parameter identification two-dimensional EIT problem. The performance of our strategy is compared with standard implementations of the Levenberg-Marquardt method (using a priori choice of the multipliers)., Comment: 25 pages, 3 figures, IMA Journal of Numerical Analysis (to appear)

In this article we combine the projective Landweber method, recently proposed by the authors, with Kaczmarz's method for solving systems of non-linear ill-posed equations. The underlying assumption used in this work is the tangential cone condition. We show that the proposed iteration is a convergent regularization method. Numerical tests are presented for a non-linear inverse problem related to the Dirichlet-to-Neumann map, indicating a superior performance of the proposed method when compared with other well established iterations. Our preliminary investigation indicates that the resulting iteration is a promising alternative for computing stable solutions of large scale systems of nonlinear ill-posed equations., Comment: 22 pages, 3 figures

In this article we propose a novel nonstationary iterated Tikhonov (NIT) type method for obtaining stable approximate solutions to ill-posed operator equations modeled by linear operators acting between Hilbert spaces. Geometrical properties of the problem are used to derive a new strategy for choosing the sequence of regularization parameters (Lagrange multipliers) for the NIT iteration. Convergence analysis for this new method is provided. Numerical experiments are presented for two distinct applications: I) A 2D elliptic parameter identification problem (Inverse Potential Problem); II) An image deblurring problem. The results obtained validate the efficiency of our method compared with standard implementations of the NIT method (where a geometrical choice is typically used for the sequence of Lagrange multipliers)., Comment: 22 pages, 8 figures

Recently we introduced a new technique for computing the average free energy of a system with quenched randomness. The basic tool of this technique is a distributional zeta-function. The distributional zeta-function is a complex function whose derivative at the origin yields the average free energy of the system as the sum of two contributions: the first one is a series in which all the integer moments of the partition function of the model contribute; the second one, which can not be written as a series of the integer moments, can be made as small as desired. In this paper we present a mathematical rigorous proof that the average free energy of one disordered $\lambda\varphi^{4}$ model defined in a zero-dimensional space can be obtained using the distributional zeta-function technique. We obtain an analytic expression for the average free energy of the model., Comment: arXiv admin note: substantial text overlap with arXiv:1603.05919

In this paper we present a new mathematical rigorous technique for computing the average free energy of a disordered system with quenched randomness, using the replicas. The basic tool of this technique is a distributional zeta-function, a complex function whose derivative at the origin yields the average free energy of the system as the sum of two contributions: the first one is a series in which all the integer moments of the partition function of the model contribute; the second one, which can not be written as a series of the integer moments, can be made as small as desired. This result supports the use of integer moments of the partition function, computed via replicas, for expressing the average free energy of the system. One advantage of the proposed formalism is that it does not require the understanding of the properties of the permutation group when the number of replicas goes to zero. Moreover, the symmetry is broken using the saddle-point equations of the model. As an application for the distributional zeta-function technique, we obtain the average free energy of the disordered $\lambda\varphi^{4}$ model defined in a $d$-dimensional Euclidean space., Comment: 18 pages

The Riemann hypothesis states that all nontrivial zeros of the zeta function lie in the critical line $\Re(s)=1/2$. Hilbert and P\'olya suggested that one possible way to prove the Riemann hypothesis is to interpret the nontrivial zeros in the light of spectral theory. Following this approach, we discuss a necessary condition that such a sequence of numbers should obey in order to be associated with the spectrum of a linear differential operator of a system with countably infinite number of degrees of freedom described by quantum field theory. The sequence of nontrivial zeros is zeta regularizable. Then, functional integrals associated with hypothetical systems described by self-adjoint operators whose spectra is given by this sequence can be constructed. However, if one considers the same situation with primes numbers, the associated functional integral cannot be constructed, due to the fact that the sequence of prime numbers is not zeta regularizable. Finally, we extend this result to sequences whose asymptotic distributions are not "far away" from the asymptotic distribution of prime numbers., Comment: Revised version, 18 pages

In this work we present a simplifyed proof of Kantorovich's Theorem on Newton's Method. This analysis uses a technique which has already been used for obtaining new extensions of this theorem.

We study the relations between some geometric properties of maximal monotone operators and generic geometric and analytical properties of the functions on the associate Fitzpatrick family of convex representations. We also investigate under which conditions a convex function represents a maximal monotone operator with bounded range and provide an example of a non type (D) operator on this class., Comment: 15 pages

A new framework for analyzing Fejer convergent algorithms is presented. Using this framework we define a very general class of Fejer convergent algorithms and establish its convergence properties. We also introduce a new definition of approximations of resolvents which preserve some useful features of the exact resolvent, and use this concept to present an unifying view of the Forward-Backward splitting method, Tseng's Modified Forward-Backward splitting method and Korpelevich's method. We show that methods based on families of approximate resolvents fall within the aforementioned class of Fejer convergent methods. We prove that such approximate resolvents are the iteration maps of the Hybrid Proximal-Extragradient method.

Previous constructions of non-type (D) maximal monotone operators were based on the non-type (D) operators introduced by Gossez, and the construction of such operators or the proof that they were non-type (D) were not straightforward. The aim of this paper is to present a very simple non-type (D) linear isometry.

We prove that under semi-local assumptions, the inexact Newton method with a fixed relative residual error tolerance converges Q-linearly to a zero of the non-linear operator under consideration. Using this result we show that Newton method for minimizing a self-concordant function or to find a zero of an analytic function can be implemented with a fixed relative residual error tolerance. In the absence of errors, our analysis retrieve the classical Kantorovich Theorem on Newton method.

We analyze a class of sublinear functionals which characterize the interior and the exterior of a convex cone in a normed linear space.

Previous examples of non-type (D) maximal monotone operators were restricted to $\ell^1$, $L^1$, and Banach spaces containing isometriccopies of these spaces. This fact led to the conjecture that non-type (D) operators were restricted to this class of Banach spaces. We present a linear non-type (D) operator in $c_0$.

We define a family of linear type (D) operators for which the inverse of their maximal monotone extensions to the bidual are not of type (D) and provide an example of an operator in this family.

We prove that the sequences generate by the Douglas-Rachford method converge weakly to a solution of the inclusion problem

Gossez type (D) operators are defined in non-reflexive Banach spaces and share with the subdifferential a topological related property, characterized by bounded nets. In this work we present new properties and characterizations of these operators. The class (NI) was defined after Gossez defined the class (D) and seemed to generalize the class (D). One of our main results is the proof that these classes, type (D) and (NI), are identical., Comment: Added one reference. Added Corollary 4.3, which is a trivial, but interesting, consequence of Lemma 4.1 and Theorem 4.2

Maximal monotone operators on a Banach space into its dual can be represented by convex functions bounded below by the duality product. It is natural to ask under which conditions a convex function represents a maximal monotone operator. A satisfactory answer, in the context of reflexive Banach spaces, has been obtained some years ago. Recently, a partial result on non-reflexive Banach spaces was obtained. In this work we study some others conditions which guarantee that a convex function represents a maximal monotone operator in non-reflexive Banach spaces.

Inspired by biological dynamics, we consider a growth Markov process taking values on the space of rooted binary trees, similar to the Aldous-Shields model. Fix $n\ge 1$ and $\beta>0$. We start at time 0 with the tree composed of a root only. At any time, each node with no descendants, independently from the other nodes, produces two successors at rate $\beta(n-k)/n$, where $k$ is the distance from the node to the root. Denote by $Z_n(t)$ the number of nodes with no descendants at time $t$ and let $T_n = \beta^{-1} n \ln(n /\ln 4) + (\ln 2)/(2 \beta)$. We prove that $2^{-n} Z_n(T_n + n \tau)$, $\tau\in\bb R$, converges to the Gompertz curve $\exp (- (\ln 2) e^{-\beta \tau})$. We also prove a central limit theorem for the martingale associated to $Z_n(t)$., Comment: 13 pages

The epsilon-enlargement of a maximal monotone operator is a construct similar to the Br{\o}ndsted and Rocakfellar epsilon-subdifferential enlargement of the subdifferential. Like the epsilon-subdifferential, the epsilon-enlargement of a maximal monotone operator has practical and theoretical applications. In a recent paper in Journal of Convex Analysis Burachik and Iusem studied conditions under which a maximal monotone operator is non-enlargeable, that is, its epsilon-enlargement coincides with the operator. Burachik and Iusem studied these non-enlargeable operators in reflexive Banach spaces, assuming the interior of the domain of the operator to be nonempty. In the present work, we remove the assumption on the domain of non-enlargeable operators and also present partial results for the non-reflexive case., Comment: Submitted for publication in July 7, 2008

We present a new sufficient condition under which a maximal monotone operator $T:X\tos X^*$ admits a unique maximal monotone extension to the bidual $\widetilde T:X^{**} \rightrightarrows X^*$. For non-linear operators this condition is equivalent to uniqueness of the extension. The class of maximal monotone operators which satisfy this new condition includes class of Gossez type D maximal monotone operators, previously defined and studied by J.-P. Gossez, and all maximal monotone operators of this new class satisfies a restricted version of Brondsted-Rockafellar condition. The central tool in our approach is the $\mathcal{S}$-function defined and studied by Burachik and Svaiter in 2000 \cite{BuSvSet02}(submission date, July 2000). For a generic operator, this function is the supremum of all convex lower semicontinuous functions which are majorized by the duality product in the graph of the operator. We also prove in this work that if the graph of a maximal monotone operator is convex, then this graph is an affine linear subspace., Comment: Submitted for publication in JCA in March, 2 2008

We are concerned with surjectivity of perturbations of maximal monotone operators in non-reflexive Banach spaces. While in a reflexive setting, a classical surjectivity result due to Rockafellar gives a necessary and sufficient condition to maximal monotonicity, in a non-reflexive space we characterize maximality using a ``enlarged'' version of the duality mapping, introduced previously by Gossez., Comment: Submitted for publication in JNA in May 7, 2008

In a recent paper in Journal of Convex Analysis the authors studied, in non-reflexive Banach spaces, a class of maximal monotone operators, characterized by the existence of a function in Fitzpatrick's family of the operator which conjugate is above the duality product. This property was used to prove that such operators satisfies a restricted version of Brondsted-Rockafellar property. In this work we will prove that if a single Fitzpatrick function of a maximal monotone operator has a conjugate above the duality product, then all Fitzpatrick function of the operator have a conjugate above the duality product. As a consequence, the family of maximal monotone operators with this property is just the class NI, previously defined and studied by Simons. We will also prove that an auxiliary condition used by the authors to prove the restricted Brondsted-Rockafellar property is equivalent to the assumption of the conjugate of the Fitzpatrick function to majorize the duality product., Comment: Submited for publication on April 2008

Conjugation, or Legendre transformation, is a basic tool in convex analysis, rational mechanics, economics and optimization. It maps a function on a linear topological space into another one, defined in the dual of the linear space by coupling these space by meas of the duality product. Generalized conjugation extends classical conjugation to any pair of domains, using an arbitrary coupling function between these spaces. This generalization of conjugation is now being widely used in optima transportation problems, variational analysis and also optimization. If the coupled spaces are equal, generalized conjugations define order reversing maps of a family of functions into itself. In this case, is natural to ask for the existence of fixed points of the conjugation, that is, functions which are equal to their (generalized) conjugateds. Here we prove that any generalized symmetric conjugation has fixed points. The basic tool of the proof is a variational principle involving the order reversing feature of the conjugation. As an application of this abstract result, we will extend to real linear topological spaces a fixed-point theorem for Fitzpatrick's functions, previously proved in Banach spaces., Comment: 14 pages

In this work we are concerned with maximality of monotone operators representable by certain convex functions in non-reflexive Banach spaces. We also prove that these maximal monotone operators satisfy a Bronsted-Rockafellar type property. We show that if a function in XxX^* and its conjugate are above the duality product in their respective domains, then this function represents a maximal monotone operator., Comment: extends to non-reflexive Banach space a previous result proved in reflexive Banach spaces

Recently, the authors studied the connection between each maximal monotone operator T and a family H(T) of convex functions. Each member of this family characterizes the operator and satisfies two particular inequalities. The aim of this paper is to establish the converse of the latter fact. Namely, that every convex function satisfying those two particular inequalities is associated to a unique maximal monotone operator., Comment: 8 pages, corrected author's names

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex representation of the operator which is a fixed point of this conjugation., Comment: 13 pages, updated references. Submited in July 2002 to Proc. AMS

We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form. The method is based on algorithms for determining the canonical coset representative of a subgroup of the symmetric group. The complexity of our algorithm is polynomial on the number of indices and is useful for implementating general purpose tensor packages on the computer algebra systems., Comment: 10 pages, LaTeX

We analyse the one-loop fermionic contribution for the scalar effective potential in the temperature dependent Yukawa model. In order to regularize the model a mix between dimensional and analytic regularization procedures is used. We find a general expression for the fermionic contribution in arbitrary spacetime dimension. It is found that in D=3 this contribution is finite., Comment: 19 pages, Latex