Search results for "Operator"

showing 10 items of 1427 documents

Magnetic exchange interaction in clusters of orbitally degenerate ions. II. Application of the irreducible tensor operator technique

2001

Abstract The irreducible tensor operator technique in R3 group is applied to the problem of kinetic exchange between transition metal ions possessing orbitally degenerate ground states in the local octahedral surrounding. Along with the effective exchange Hamiltonian, the related interactions (low-symmetry crystal field terms, Coulomb interaction between unfilled electronic shells, spin–orbit coupling and Zeeman interaction) are also taken into account within a unified computational scheme. Extension of this approach to high-nuclearity systems consisting of transition metal ions in the orbital triplet ground states is also demonstrated. As illustrative examples, the corner-shared D4h dimers…

Zeeman effectChemistryDegenerate energy levelsGeneral Physics and AstronomyKinetic energyIonsymbols.namesakeMagnetic anisotropysymbolsCoulombPhysical and Theoretical ChemistryAtomic physicsHamiltonian (quantum mechanics)Tensor operatorChemical Physics
researchProduct

Semantic-based Merging of RSS Items

2009

Merging XML documents can be of key importance in several applications. For instance, merging the RSS news from same or different sources and providers can be beneficial for end-users in various scenarios. In this paper, we address this issue and explore the relatedness measure between RSS elements. We show here how to define and compute exclusive relations between any two elements and provide several predefined merging operators that can be extended and adapted to human needs. We also provide a set of experiments conducted to validate our approach. © Springer Science+Business Media, LLC 2009.

[ INFO.INFO-IR ] Computer Science [cs]/Information Retrieval [cs.IR][INFO.INFO-WB] Computer Science [cs]/WebComputer Networks and CommunicationsComputer sciencecomputer.internet_protocolRSS[ INFO.INFO-WB ] Computer Science [cs]/Web[SCCO.COMP]Cognitive science/Computer science02 engineering and technologycomputer.software_genreClusteringMergingSet (abstract data type)[SCCO.COMP] Cognitive science/Computer science020204 information systems0202 electrical engineering electronic engineering information engineering[INFO.INFO-DB] Computer Science [cs]/Databases [cs.DB]Cluster analysisComputingMilieux_MISCELLANEOUS[ INFO.INFO-MM ] Computer Science [cs]/Multimedia [cs.MM]Measure (data warehouse)[INFO.INFO-MM] Computer Science [cs]/Multimedia [cs.MM][INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]Document relatedne[INFO.INFO-WB]Computer Science [cs]/Web[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]computer.file_formatRSSMerging operator[ INFO.INFO-DB ] Computer Science [cs]/Databases [cs.DB]Hardware and Architecture[ SCCO.COMP ] Cognitive science/Computer science[INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR]Key (cryptography)020201 artificial intelligence & image processingData mining[INFO.INFO-IR] Computer Science [cs]/Information Retrieval [cs.IR]computerSoftwareXML
researchProduct

Interior Eigenvalue Density of Jordan Matrices with Random Perturbations

2017

International audience; We study the eigenvalue distribution of a large Jordan block subject to a small random Gaussian perturbation. A result by E. B. Davies and M. Hager shows that as the dimension of the matrix gets large, with probability close to 1, most of the eigenvalues are close to a circle.We study the expected eigenvalue density of the perturbed Jordan block in the interior of that circle and give a precise asymptotic description.; Nous étudions la distribution de valeurs propres d’un grand bloc de Jordan soumis à une petite perturbation gaussienne aléatoire. Un résultat de E. B. Davies et M. Hager montre que quand la dimension de la matrice devient grande, alors avec probabilité…

[ MATH ] Mathematics [math]Jordan matrixSpectral theoryGaussian010102 general mathematicsMathematical analysisPerturbation (astronomy)Mathematics::Spectral Theory01 natural sciences010104 statistics & probabilityMatrix (mathematics)symbols.namesakesymbolsRandom perturbations[MATH]Mathematics [math]MSC: 47A10 47B80 47H40 47A550101 mathematicsDivide-and-conquer eigenvalue algorithmSpectral theoryEigenvalue perturbationEigenvalues and eigenvectorsNon-self-adjoint operatorsMathematics
researchProduct

Convergence rate of a relaxed inertial proximal algorithm for convex minimization

2018

International audience; In a Hilbert space setting, the authors recently introduced a general class of relaxed inertial proximal algorithms that aim to solve monotone inclusions. In this paper, we specialize this study in the case of non-smooth convex minimization problems. We obtain convergence rates for values which have similarities with the results based on the Nesterov accelerated gradient method. The joint adjustment of inertia, relaxation and proximal terms plays a central role. In doing so, we highlight inertial proximal algorithms that converge for general monotone inclusions, and which, in the case of convex minimization, give fast convergence rates of values in the worst case.

[ MATH.MATH-OC ] Mathematics [math]/Optimization and Control [math.OC]Class (set theory)Control and OptimizationInertial frame of referenceLyapunov analysis0211 other engineering and technologies02 engineering and technologyManagement Science and Operations Research01 natural sciencessymbols.namesakenonsmooth convex minimizationrelaxationweak-convergence0101 mathematics[MATH]Mathematics [math]point algorithmMathematics021103 operations researchWeak convergence[QFIN]Quantitative Finance [q-fin]Applied MathematicsHilbert space[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]dynamicsmaximally monotone operatorsInertial proximal method010101 applied mathematicsMonotone polygonRate of convergenceConvex optimizationmaximal monotone-operatorssymbolsRelaxation (approximation)[MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]subdifferential of convex functionsAlgorithm
researchProduct

$PT$-symmetry and Schrödinger operators. The double well case

2016

International audience; We study a class of $PT$-symmetric semiclassical Schrodinger operators, which are perturbations of a selfadjoint one. Here, we treat the case where the unperturbed operator has a double-well potential. In the simple well case, two of the authors have proved in [6] that, when the potential is analytic, the eigenvalues stay real for a perturbation of size $O(1)$. We show here, in the double-well case, that the eigenvalues stay real only for exponentially small perturbations, then bifurcate into the complex domain when the perturbation increases and we get precise asymptotic expansions. The proof uses complex WKB-analysis, leading to a fairly explicit quantization condi…

[ MATH.MATH-SP ] Mathematics [math]/Spectral Theory [math.SP]MSC: 35P20 81Q12 81Q20 35Q40Complex WKB analysis[ MATH.MATH-MP ] Mathematics [math]/Mathematical Physics [math-ph]EigenvaluesMathematics::Spectral TheoryPT-symmetryMathematics - Spectral Theory[MATH.MATH-MP]Mathematics [math]/Mathematical Physics [math-ph]35P20 35Q40 81Q12 81Q20Quantization conditonSchrödinger operatorsMathematical Physics[MATH.MATH-SP]Mathematics [math]/Spectral Theory [math.SP]
researchProduct

Using of a uncertainty model of an polyarticulated coordinates measuring arm to validate the measurement in a manufacturing processsus

2014

International audience; Coordinates Measuring Arms (CMA) are increasingly used to control industrial parts and are often an alternative to CMM controls that require conditions of laboratory measurement and involve significant costs. However, the control of uncertainties is often not guaranteed because the measurement process is complex and there is no standard for setting a framework qualification process of the measurement process.The proposed study, in this paper, is a first approach to model the measurement uncertainties of a CMA with contact sensor. The problem is complex because there are many sources of uncertainty, largely due to variability in the handling carried out by the operato…

[ SPI.MECA.GEME ] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph]0209 industrial biotechnologyEngineeringMonte Carlo method02 engineering and technologyMetrology01 natural sciences010309 opticsCMA Modelling020901 industrial engineering & automationOperator (computer programming)Control theory0103 physical sciencesCalibration[SPI.MECA.GEME] Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph]SimulationGeneral Environmental Sciencebusiness.industryProcess (computing)UncertaintyCovarianceMetrology[SPI.MECA.GEME]Engineering Sciences [physics]/Mechanics [physics.med-ph]/Mechanical engineering [physics.class-ph]NoiseGeneral Earth and Planetary SciencesbusinessEncoderMonte Carlo Method
researchProduct

Modeling by the finite element method of acoustic radiation in waveguides lined with locally or non locally reacting absorbent materials in the prese…

2011

Our concern in this work is the problem of acoustic propagation in guides lined with locally or non locally reacting materials with the presence of mean fluid flow. In several industrial systems such as aircraft jet engines, mufflers exhaust and ventilation systems, noise is mostly channeled outside by guides of more or less complex geometries. A study of waveguides makes it possible to predict and understand the physical phenomena such as refraction, convection, absorption and wave attenuation. In waveguides studies, guides are often considered infinitely long to get rid of some phenomena (reflection for example) at their ends. Solving the problem of acoustic propagation in infinite guides…

[ SPI.OTHER ] Engineering Sciences [physics]/Other[SPI.OTHER] Engineering Sciences [physics]/OtherTransparent boundary conditionAcoustic propagation in waveguidesLocally or non locally reacting absorbent materialEquivalent fluid model[ PHYS.COND.CM-GEN ] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]Condition limite transparentePropagation acoustique dans des guides d'ondesMatériau absorbant à réaction localisée ou non localiséeOpérateur DtN[PHYS.COND.CM-GEN] Physics [physics]/Condensed Matter [cond-mat]/Other [cond-mat.other]DtN operatorModèle du fluide équivalent
researchProduct

A note on Hilbert’s weak nullstellensatz

2015

In this article, through a suitable generalization of the well-known notion of spectrum of an element of an arbitrary normed algebra of Operator Theory, it will be possible to give another simple proof of the Hilbert’s Weak Nullstellensatz.

[MATH.MATH-AC] Mathematics [math]/Commutative Algebra [math.AC]lcsh:MathematicsSpectrum[MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA]lcsh:Descriptive and experimental mechanicsOperator algebraComputer Science::Computational GeometryComputer Science::Data Structures and Algorithmslcsh:QA1-939Ideallcsh:QC120-168.85
researchProduct

On Gelfand-Mazur Theorem

2015

From a suitable extension of the notion of spectrum drew from normed algebra theory, it will be possible, among other things, to provide some generalizations of the well-known Gelfand-Mazur theorem. In this brief research report, we wish to pursue one of these, as achieved in I,4.

[MATH.MATH-AC] Mathematics [math]/Commutative Algebra [math.AC]topology[MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC]Gelfand-Mazur theorem[MATH.MATH-OA]Mathematics [math]/Operator Algebras [math.OA][MATH.MATH-FA] Mathematics [math]/Functional Analysis [math.FA][MATH.MATH-FA]Mathematics [math]/Functional Analysis [math.FA][MATH.MATH-OA] Mathematics [math]/Operator Algebras [math.OA]ComputingMilieux_MISCELLANEOUSspectrum
researchProduct

A Symplectic Kovacic's Algorithm in Dimension 4

2018

Let $L$ be a $4$th order differential operator with coefficients in $\mathbb{K}(z)$, with $\mathbb{K}$ a computable algebraically closed field. The operator $L$ is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions $X$ satisfies $X^t J X=J$ where $J$ is the standard symplectic matrix. It is called projectively symplectic when it is projectively equivalent to a symplectic operator. We design an algorithm to test if $L$ is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order $4$. Moreover, using Klein's Theorem, algebraic solution…

[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]010102 general mathematicsDynamical Systems (math.DS)Differential operator01 natural sciencesSymplectic matrixDifferential Galois theory34M15Operator (computer programming)Fundamental matrix (linear differential equation)Mathematics - Symplectic Geometry0103 physical sciencesFOS: MathematicsSymplectic Geometry (math.SG)010307 mathematical physicsMathematics - Dynamical Systems0101 mathematicsAlgebraically closed fieldAlgebraic numberMathematics::Symplectic GeometryAlgorithmMathematicsSymplectic geometryProceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
researchProduct