Results 1 to 10 of about 192,329 (259)
Generalized Statistical Convergence and Convergence Free Spaces
The statistical convergence was introduced by H. Fast in 1951. Since then this notion has been studied by many authors including J. Connor, J. A. Fridy, H. I. Miller, A. R. Freedman, J. J. Sember, I. J. Maddox, T. Salat, etc. In this paper, by using the concepts of convergence free spaces, cofilters and filters based on a countably infinite set, the ...
Nuray, F, Ruckle, WH
openaire +3 more sources
On the convergence of multi-scale free energy simulations [PDF]
In this work we employ simple model systems to evaluate the relative performance of two of the most important free energy methods: The Zwanzig equation (also known as "Free energy perturbation") and Bennett's acceptance ratio method (BAR). Although our examples should be transferable to other kinds of free energy simulations, we focus on applications ...
Gerhard KÖNIG +2 more
exaly +4 more sources
Democratic Convergence and Free Trade [PDF]
Even if a democracy were more likely to pursue free trade than an autocracy (an unproven generalization), the simultaneous spread of democracy in the world would not necessarily yield a reduction in protection, but might in fact cause an increase. The reason for this paradoxical outcome is the fact that democratic convergence creates power profiles ...
VERDIER, Daniel
openaire +4 more sources
Global convergence of triangularized orthogonalization-free method
This paper proves the global convergence of a triangularized orthogonalization-free method (TriOFM). TriOFM, in general, applies a triangularization idea to the gradient of an objective function and removes the rotation invariance in minimizers. More precisely, in this paper, the TriOFM works as an eigensolver for sizeable sparse matrices and obtains ...
Weiguo Gao, Yingzhou Li, Bichen Lu
openaire +4 more sources
Subobjects and Compactness in Point-Free Convergence
We consider subobjects in the context of point-free convergence (in the sense of Goubault-Larrecq and Mynard), characterizing extremal monomorphisms in the opposite category of that of convergence lattices. It turns out that special ones are needed to capture the notion of subspace.
Emilio Angulo, Frédéric Mynard
openaire +3 more sources
Incoherent convergence of diffraction free fields [PDF]
We describe a method for the synthesis of diffraction free fields by means of an ensemble of optical fields mutually incoherent. The constituent optical fields are generated by controlling the angular correlation function between two points distributed on a circle in the frequency space.
Gabriel Martínez Niconoff +3 more
openaire +2 more sources
Measuring the convergence of Monte Carlo free-energy calculations [PDF]
The nonequilibrium work fluctuation theorem provides the way for calculations of (equilibrium) free energy based on work measurements of nonequilibrium, finite-time processes and their reversed counterparts by applying Bennett's acceptance ratio method.
Hahn, Aljoscha M., Then, H
openaire +5 more sources
Loop-Free Convergence With Unordered Updates
This paper studies the feasibility of minimizing convergence delay and forwarding disruption without carrying any additional bits in the IP header, to provide high availability despite link failures in traditional IP networks. Previously proposed mechanisms achieve two of these three objectives by trading off the other objective.
Glenn Robertson +4 more
openaire +2 more sources
Γ-convergence of free-discontinuity problems [PDF]
We study the Γ-convergence of sequences of free-discontinuity functionals depending on vector-valued functions u which can be discontinuous across hypersurfaces whose shape and location are not known a priori. The main novelty of our result is that we work under very general assumptions on the integrands which, in
Filippo Cagnetti +3 more
openaire +4 more sources
Gradient-free distributed optimization with exact convergence
In this paper, a gradient-free distributed algorithm is introduced to solve a set constrained optimization problem under a directed communication network. Specifically, at each time-step, the agents locally compute a so-called pseudo-gradient to guide the updates of the decision variables, which can be applied in the fields where the gradient ...
Pang, Yipeng, Hu, Guoqiang
openaire +3 more sources

