Search results for "convergence"

showing 10 items of 655 documents

Weighted-Power p Nonlinear Subdivision Schemes

2012

In this paper we present and analyze a generalization of the Powerp subdivision schemes proposed in [3,12]. The Weighted-Powerp schemes are based on a harmonic weighted version of the Power<emp average considered in [12], and their development is motivated by the desire to generalize the nonlinear analysis in [3,5] to interpolatory subdivision schemes with higher than second order accuracy.

Discrete mathematicsNonlinear systemGeneralizationbusiness.industryConvergence (routing)MathematicsofComputing_NUMERICALANALYSISStability (learning theory)Order (group theory)Harmonic (mathematics)businessMathematicsPower (physics)Subdivision
researchProduct

Analysis of properties of recombination operators proposed for the node-depth encoding

2011

The node-depth encoding is a representation for evolutionary algorithms applied to tree problems. Its represents trees by storing the nodes and their depth in a proper ordered list. The original formulation of the node-depth encoding has only mutation operators as the search mechanism. Although it is computationally efficient, the exclusive use of mutation restricts the exploration of the search space and the algorithm convergence. Then, this work proposes two specific recombination operators to improve the convergence of the algorithm using the node-depth encoding representation. These operators are based on recombination operators for permutation representations. Analysis of the proposed …

Discrete mathematicsPermutationTree (data structure)Encoding (memory)Mutation (genetic algorithm)Convergence (routing)Evolutionary algorithmQuantitative Biology::Populations and EvolutionNode (circuits)Representation (mathematics)AlgorithmMathematicsProceedings of the 13th annual conference companion on Genetic and evolutionary computation
researchProduct

The existence of best proximity points in metric spaces with the property UC

2009

Abstract Eldred and Veeramani in [A.A. Eldred, P. Veeramani, Existence and convergence of best proximity points, J. Math. Anal. Appl., 323 (2006), 1001–1006. MR2260159] proved a theorem which ensures the existence of a best proximity point of cyclic contractions in the framework of uniformly convex Banach spaces. In this paper we introduce a notion of the property UC and extend the Eldred and Veeramani theorem to metric spaces with the property UC.

Discrete mathematicsProperty (philosophy)Applied MathematicsMathematical analysisBest proximity pointBanach spaceRegular polygonMetric spaceCyclic contractionSettore MAT/05 - Analisi MatematicaConvergence (routing)Point (geometry)Property UCAnalysisMathematics
researchProduct

Existence of Unconditional Bases in Spaces of Polynomials and Holomorphic Functions

2002

Our main result shows that every Montel Kothe echelon or coechelon space E of order 1 < p ≤ ∞ is nuclear if and only if for every (some) m ≥ 2 the space ((mE), τ0) of m-homegeneus polynomials on E endowed with the compact-open topology τ0 has an unconditional basis if and only if the space (ℋ(E), τδ) of holomorphic functions on E endowed with the bornological topology τδ associated to τ0 has an unconditional basis (for coechelon spaces τδ equals τ0). The main idea is to extend the concept of the Gordon-Lewis property from Banach to Frechet and (DF) spaces. In this way we obtain techniques which are used to characterize the existence of unconditional basis in spaces of m-th (symmetric) tenso…

Discrete mathematicsPure mathematicsPolynomialTensor productBasis (linear algebra)General MathematicsHolomorphic functionUnconditional convergenceInterpolation spaceOrder (group theory)Space (mathematics)MathematicsMathematische Nachrichten
researchProduct

Countably compact weakly Whyburn spaces

2015

The weak Whyburn property is a generalization of the classical sequential property that was studied by many authors. A space X is weakly Whyburn if for every non-closed set \({A \subset X}\) there is a subset \({B \subset A}\) such that \({\overline{B} \setminus A}\) is a singleton. We prove that every countably compact Urysohn space of cardinality smaller than the continuum is weakly Whyburn and show that, consistently, the Urysohn assumption is essential. We also give conditions for a (countably compact) weakly Whyburn space to be pseudoradial and construct a countably compact weakly Whyburn non-pseudoradial regular space, which solves a question asked by Angelo Bella in private communica…

Discrete mathematicsSingletonGeneralizationGeneral Mathematics010102 general mathematicsGeneral Topology (math.GN)Mathematics::General TopologyPrivate communicationUrysohn and completely Hausdorff spacesWeak Whyburn property convergence Lindelof P -space Urysohn countably compact pseudoradial.Space (mathematics)01 natural sciences010101 applied mathematicsCombinatoricsMathematics::LogicCardinalityFOS: MathematicsRegular spaceSettore MAT/03 - GeometriaContinuum (set theory)0101 mathematicsMathematicsMathematics - General Topology
researchProduct

On approximation of a class of stochastic integrals and interpolation

2004

Given a diffusion Y = (Y_{t})_{t \in [0,T]} we give different equivalent conditions so that a stochastic integral has an L 2-approximation rate of n −η, {\rm \eta \in (0,1/2],} if one approximates by integrals over piece-wise constant integrands where equidistant time nets of cardinality n + 1 are used. In particular, we obtain assertions in terms of smoothness properties of g(Y T ) in the sense of Malliavin calculus. After optimizing over non-equidistant time-nets of cardinality n + 1 in case {\rm \eta > 0} , it turns out that one always obtains a rate of n^{ - 1/2}, which is optimal. This applies to all functions g obtained in an appropriate way by the real interpolation method between th…

Discrete mathematicsSobolev spaceSmoothness (probability theory)CardinalityRate of convergenceEquidistantConstant (mathematics)Malliavin calculusInterpolationMathematicsStochastics and Stochastic Reports
researchProduct

QUANTITATIVE CONVERGENCE RATES FOR SUBGEOMETRIC MARKOV CHAINS

2015

We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.

Discrete mathematicsStatistics and ProbabilityMarkov chain mixing timeMarkov chainVariable-order Markov modelGeneral Mathematicsta111Markov chain010102 general mathematicsErgodicity01 natural sciencesInhomogeneous010104 statistics & probability60J05Polynomial ergodicitySubgeometric ergodicityConvergence (routing)60J22Examples of Markov chainsStatistical physics0101 mathematicsStatistics Probability and UncertaintyMathematics
researchProduct

Completeness number of families of subsets of convergence spaces

2016

International audience; Compactoid and compact families generalize both convergent filters and compact sets. This concept turned out to be useful in various quests, like Scott topologies, triquotient maps and extensions of the Choquet active boundary theorem.The completeness number of a family in a convergence space is the least cardinality of collections of covers for which the family becomes complete. 0-completeness amounts to compactness, finite completeness to relative local compactness and countable completeness to Čech completeness. Countably conditional countable completeness amounts to pseudocompleteness of Oxtoby. Conversely, each completeness class of families can be represented a…

Discrete mathematics[ MATH ] Mathematics [math]CompletenessClass (set theory)Complete partial orderCompactness010102 general mathematicsBoundary (topology)Characterization (mathematics)01 natural sciences010101 applied mathematicsConvergence theoryCompact spaceCardinalityCompleteness (order theory)Countable setGeometry and Topology0101 mathematics[MATH]Mathematics [math]Mathematics
researchProduct

On an iterative method for a class of integral equations of the first kind

1987

In this paper, we investigate an iterative method which has been proposed [1] for the numerical solution of a special class of integral equations of the first kind, where one of the essential assumptions is the positivity of the kernel and the given right-hand side. Integral equations of this special type occur in experimental physics, astronomy, medical tomography and other fields where density functions cannot be measured directly, but are related to observable functions via integral equations. In order to take into account the non-negativity of density functions, the proposed iterative scheme was defined in such a way that only non-negative solutions can be approximated. The first part o…

DiscretizationIterative methodGeneral MathematicsConvergence (routing)Mathematical analysisGeneral EngineeringFunctional integrationDaniell integralSummation equationIntegral equationMathematicsLocal convergenceComputing and Computers
researchProduct

Approximation of Elliptic Hemivariational Inequalities

1999

From the previous chapter we know that there exist many important problems in mechanics in which constitutive laws are expressed by means of nonmonotone, possibly multivalued relations (nonmonotone multivalued stress-strain or reaction-displacement relations,e.g). The resulting mathematical model leads to an inclusion type problem involving multivalued nonmonotone mappings or to a substationary type problem for a nonsmooth, nonconvex superpotential expressed in terms of calculus of variation. It is the aim of this chapter to give a detailed study of a discretization of such a type of problems including the convergence analysis. Here we follow closely Miettinen and Haslinger, 1995, Miettinen…

DiscretizationMathematical analysisConvergence (routing)Variational inequalitySuperpotentialApplied mathematicsCalculus of variationsType (model theory)Bilinear formFinite element methodMathematics
researchProduct