Search results for "Iterated function"

showing 10 items of 62 documents

Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces

2011

We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.

Discrete mathematicsT57-57.97QA299.6-433Containment (computer programming)Pure mathematicsSequenceApplied mathematics. Quantitative methodsApplied MathematicsFixed-point theoremConstruct (python library)Fuzzy metric space property (E.A.) common property (E.A.) common fixed point generalized fuzzy contractionRange (mathematics)Differential geometryIterated functionSettore MAT/05 - Analisi MatematicaCommon propertyGeometry and TopologyAnalysisMathematics
researchProduct

Finding k -dissimilar paths with minimum collective length

2018

Shortest path computation is a fundamental problem in road networks. However, in many real-world scenarios, determining solely the shortest path is not enough. In this paper, we study the problem of finding k-Dissimilar Paths with Minimum Collective Length (kDPwML), which aims at computing a set of paths from a source s to a target t such that all paths are pairwise dissimilar by at least \theta and the sum of the path lengths is minimal. We introduce an exact algorithm for the kDPwML problem, which iterates over all possible s-t paths while employing two pruning techniques to reduce the prohibitively expensive computational cost. To achieve scalability, we also define the much smaller set …

FOS: Computer and information sciencesComputer scienceDatabases (cs.DB)0102 computer and information sciences02 engineering and technology01 natural sciencesSet (abstract data type)Exact algorithmComputer Science - Databases010201 computation theory & mathematicsIterated function020204 information systemsComputer Science - Data Structures and AlgorithmsShortest path problemScalabilityPath (graph theory)0202 electrical engineering electronic engineering information engineeringData Structures and Algorithms (cs.DS)Pairwise comparisonPruning (decision trees)AlgorithmProceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
researchProduct

Randomized Block Frank–Wolfe for Convergent Large-Scale Learning

2017

Owing to their low-complexity iterations, Frank-Wolfe (FW) solvers are well suited for various large-scale learning tasks. When block-separable constraints are present, randomized block FW (RB-FW) has been shown to further reduce complexity by updating only a fraction of coordinate blocks per iteration. To circumvent the limitations of existing methods, the present work develops step sizes for RB-FW that enable a flexible selection of the number of blocks to update per iteration while ensuring convergence and feasibility of the iterates. To this end, convergence rates of RB-FW are established through computational bounds on a primal sub-optimality measure and on the duality gap. The novel b…

FOS: Computer and information sciencesMathematical optimization0102 computer and information sciences02 engineering and technology01 natural sciencesMeasure (mathematics)Machine Learning (cs.LG)Convergence (routing)FOS: Mathematics0202 electrical engineering electronic engineering information engineeringFraction (mathematics)Electrical and Electronic EngineeringMathematics - Optimization and ControlMathematicsSequenceDuality gapComputer Science - Numerical Analysis020206 networking & telecommunicationsNumerical Analysis (math.NA)Stationary pointSupport vector machineComputer Science - LearningOptimization and Control (math.OC)010201 computation theory & mathematicsIterated functionSignal ProcessingAlgorithmIEEE Transactions on Signal Processing
researchProduct

Weak separation condition, Assouad dimension, and Furstenberg homogeneity

2015

We consider dimensional properties of limit sets of Moran constructions satisfying the finite clustering property. Just to name a few, such limit sets include self-conformal sets satisfying the weak separation condition and certain sub-self-affine sets. In addition to dimension results for the limit set, we manage to express the Assouad dimension of any closed subset of a self-conformal set by means of the Hausdorff dimension. As an interesting consequence of this, we show that a Furstenberg homogeneous self-similar set in the real line satisfies the weak separation condition. We also exhibit a self-similar set which satisfies the open set condition but fails to be Furstenberg homogeneous.

General MathematicsHomogeneity (statistics)ta111Open setPrimary 28A80 Secondary 37C45 28D05 28A50Moran constructioniterated function systemSet (abstract data type)CombinatoricsDimension (vector space)dimensionMathematics - Classical Analysis and ODEsweak separation conditionClassical Analysis and ODEs (math.CA)FOS: MathematicsLimit (mathematics)Limit setCluster analysisReal lineMathematics
researchProduct

Modified Operators Interpolating at Endpoints

2021

Some classical operators (e.g., Bernstein) preserve the affine functions and consequently interpolate at the endpoints. Other classical operators (e.g., Bernstein–Durrmeyer) have been modified in order to preserve the affine functions. We propose a simpler modification with the effect that the new operators interpolate at endpoints although they do not preserve the affine functions. We investigate the properties of these modified operators and obtain results concerning iterates and their limits, Voronovskaja-type results and estimates of several differences.

General MathematicsOrder (ring theory)iteratesIterated functionMarkov operatorsComputer Science (miscellaneous)QA1-939Applied mathematicsdifferences of operatorsAffine transformationEngineering (miscellaneous)MathematicsMathematicsVoronovskaja-type resultsMathematics
researchProduct

Mathematical properties of nested residues and their application to multi-loop scattering amplitudes

2021

Journal of high energy physics 02(2), 112 (2021). doi:10.1007/JHEP02(2021)112

High Energy Physics - TheoryNuclear and High Energy PhysicscausalityComputationFeynman graphpoleFOS: Physical sciencesDuality (optimization)Mathematical proof01 natural sciences530Theoretical physicsHigh Energy Physics - Phenomenology (hep-ph)NLO Computations0103 physical sciencesddc:530lcsh:Nuclear and particle physics. Atomic energy. Radioactivitystructure010306 general physicsRepresentation (mathematics)Mathematical PhysicsPhysics010308 nuclear & particles physicsscattering amplitudeMathematical Physics (math-ph)QCD PhenomenologysingularityScattering amplitudeHigh Energy Physics - PhenomenologyHigh Energy Physics - Theory (hep-th)Iterated functionlcsh:QC770-798dualityGravitational singularityMathematical structure
researchProduct

Generalized countable iterated function systems

2011

One of the most common and most general way to generate fractals is by using iterated function systems which consists of a finite or infinitely many maps. Generalized countable iterated function systems (GCIFS) are a generalization of countable iterated function systems by considering contractions from X ? X into X instead of contractions on the metric space X to itself, where (X, d) is a compact metric space. If all contractions of a GCIFS are Lipschitz with respect to a parameter and the supremum of the Lipschitz constants is finite, then the associated attractor depends continuously on the respective parameter.

Hutchinson operatorDiscrete mathematicsMetric spaceIterated function systemCollage theoremGeneral MathematicsCountable setContraction mappingLipschitz continuityCosmic spaceMathematicsFilomat
researchProduct

Iterated function systems and well-posedness

2009

Abstract Fractals and multivalued fractals play an important role in biology, quantum mechanics, computer graphics, dynamical systems, astronomy and astrophysics, geophysics, etc. Especially, there are important consequences of the iterated function (or multifunction) systems in several topics of applied sciences [see for example: El Naschie MS. Iterated function systems and the two-slit experiment of quantum mechanics. Chaos, Solitons & Fractals 1994;4:1965–8; Iovane G. Cantorian spacetime and Hilbert space: Part I-Foundations. Chaos, Solitons & Fractals 2006;28:857–78; Iovane G. Cantorian space-time and Hilbert space: Part II-Relevant consequences. Chaos, Solitons & Fractals 2006;29:1–22;…

Hutchinson operatorDiscrete mathematicsPure mathematicsSpacetimeDynamical systems theoryGeneral MathematicsApplied MathematicsHilbert spaceGeneral Physics and AstronomyStatistical and Nonlinear PhysicsMetric spacesymbols.namesakeIterated function systemIterated functionsymbolsUniquenessMathematicsChaos, Solitons & Fractals
researchProduct

Adaptive memory programming for the dynamic bipartite drawing problem

2020

Abstract The bipartite drawing problem is a well-known NP-hard combinatorial optimization problem with numerous applications. The aim is to minimize the number of edge crossings in a two-layer graph, in which the edges are drawn as straight lines. We consider the dynamic variant of this problem, called the dynamic bipartite drawing problem (DBDP), which consists of adding (resp. or removing) vertices and edges to (resp. or from) a given bipartite drawing, thereby obtaining a new drawing with a layout similar to that of the original drawing. To solve this problem, we propose a tabu search method that incorporates adaptive memory to search the solution space efficiently. In this study, we com…

Information Systems and ManagementTheoretical computer scienceComputer science05 social sciences050301 education02 engineering and technologyGraphTabu searchComputer Science ApplicationsTheoretical Computer ScienceVertex (geometry)Artificial IntelligenceControl and Systems EngineeringIterated function0202 electrical engineering electronic engineering information engineeringBipartite graph020201 artificial intelligence & image processing0503 educationSoftwareAdaptive memory programmingInformation Sciences
researchProduct

Numerical study of the Kerr solution in rotating coordinates

2016

International audience; The Kerr solution in coordinates corotating with the horizon is studied as a testbed for a spacetime with a helical Killing vector in the Ernst picture. The solution is numerically constructed by solving the Ernst equation with a spectral method and a Newton iteration. We discuss convergence of the iteration for several initial iterates and different values of the Kerr parameters.

Kerr metricReduced wave-equationFOS: Physical sciencesGeneral Relativity and Quantum Cosmology (gr-qc)01 natural sciencesGeneral Relativity and Quantum CosmologyBinary-systemsRelativitysymbols.namesakeKilling vector fieldGeneral Relativity and Quantum CosmologyTheory of relativity0103 physical sciencesBoundary-conditionsBoundary value problemSpectral method010306 general physicsNewton's method[ SDU.ASTR ] Sciences of the Universe [physics]/Astrophysics [astro-ph]Physics[PHYS]Physics [physics][ PHYS ] Physics [physics]Spacetime[SDU.ASTR]Sciences of the Universe [physics]/Astrophysics [astro-ph]010308 nuclear & particles physicsClassical mechanicsIterated function[SDU]Sciences of the Universe [physics]symbolsSpectral method[ SDU ] Sciences of the Universe [physics]
researchProduct