Search results for " computational"

showing 10 items of 661 documents

Non-consistent cell-average multiresolution operators with application to image processing

2016

In recent years different techniques to process signal and image have been designed and developed. In particular, multiresolution representations of data have been studied and used successfully for several applications such as compression, denoising or inpainting. A general framework about multiresolution representation has been presented by Harten (1996) 20. Harten's schemes are based on two operators: decimation, D , and prediction, P , that satisfy the consistency property D P = I , where I is the identity operator. Recently, some new classes of multiresolution operators have been designed using learning statistical tools and weighted local polynomial regression methods obtaining filters…

Polynomial regressionDecimationTheoretical computer scienceApplied MathematicsInpaintingImage processing010103 numerical & computational mathematics01 natural sciences010101 applied mathematicsComputational MathematicsOperator (computer programming)Consistency (statistics)0101 mathematicsRepresentation (mathematics)AlgorithmMathematicsImage compressionApplied Mathematics and Computation
researchProduct

Superinvolutions on upper-triangular matrix algebras

2018

Let UTn(F) be the algebra of n×n upper-triangular matrices over an algebraically closed field F of characteristic zero. In [18], the authors described all abelian G-gradings on UTn(F) by showing that any G-grading on this algebra is an elementary grading. In this paper, we shall consider the algebra UTn(F) endowed with an elementary Z2-grading. In this way, it has a structure of superalgebra and our goal is to completely describe the superinvolutions which can be defined on it. To this end, we shall prove that the superinvolutions and the graded involutions (i.e., involutions preserving the grading) on UTn(F) are strictly related through the so-called superautomorphisms of this algebra. We …

PolynomialPure mathematicsAlgebra and Number Theory010102 general mathematicsPolynomial identity superinvolution upper-triangular matrices.Zero (complex analysis)Triangular matrixStructure (category theory)010103 numerical & computational mathematicsSingle class01 natural sciencesSuperalgebraSettore MAT/02 - Algebrapolynomial identity superinvolutions upper triangular matrices cocharacter0101 mathematicsAbelian groupAlgebraically closed fieldMathematics
researchProduct

The Two Loop Crossed Ladder Vertex Diagram with Two Massive Exchanges

2008

We compute the (three) master integrals for the crossed ladder diagram with two exchanged quanta of equal mass. The differential equations obeyed by the master integrals are used to generate power series expansions centered around all the singular (plus some regular) points, which are then matched numerically with high accuracy. The expansions allow a fast and precise numerical calculation of the three master integrals (better than 15 digits with less than 30 terms in the whole real axis). A conspicuous relation with the equal-mass sunrise in two dimensions is found. Comparison with a previous large momentum expansion is made finding complete agreement.

Power seriesgeneralized harmonic polilogarithmsNuclear and High Energy Physicsmaster integrals530 PhysicsDifferential equationFOS: Physical sciencesloop calculationsMomentumnon planar two loop massive vertexsymbols.namesakeMultiHigh Energy Physics - Phenomenology (hep-ph)Quantum mechanicsFeynman diagramLaporta method3106 Nuclear and High Energy PhysicsFeynman diagramsPhysicsDiagramMathematical analysisLoop (topology)High Energy Physics - Phenomenology10231 Institute for Computational SciencesymbolsVertex (curve)Complex planenon planar two loop massive vertex; Laporta method; generalized harmonic polilogarithms; master integrals
researchProduct

An Efficient Numerical Method for Time Domain Computational Electromagnetic Simulation

2018

In this paper an efficient numerical method in approximating the electric and magnetic fields is provided. The method is based on an implicit leapfrog arrangement in time and without mesh in space. Moreover, a projection scheme is introduced in order to improve the accuracy of the proposed approach and applied into the computational electromagnetic (CEM) framework. The PDEs governing the process are solved and some numerical results are reported to validate the numerical process.

Projection schemeEnvironmental EngineeringRenewable Energy Sustainability and the EnvironmentComputer scienceNumerical analysisCEMProcess (computing)Finite difference methodEnergy Engineering and Power Technology010103 numerical & computational mathematicsSpace (mathematics)01 natural sciencesIndustrial and Manufacturing EngineeringProjection (linear algebra)Magnetic field010101 applied mathematicsSettore ING-IND/31 - ElettrotecnicaSettore MAT/08 - Analisi NumericaKernel (linear algebra)Hardware and ArchitectureApplied mathematicsNumerical accuracyTime domainElectrical and Electronic Engineering0101 mathematics2018 IEEE International Conference on Environment and Electrical Engineering and 2018 IEEE Industrial and Commercial Power Systems Europe (EEEIC / I&CPS Europe)
researchProduct

Computational study of dimethyl- and trimethyl-tin(IV) complexes of porphyrin derivatives

2001

The molecular geometry, energetics and electronic charge distribution of diorgano- and triorgano-tin(IV) complexes of [protoporphyrin-IX] and [meso-tetra(4-carboxyphenyl)porphine] derivatives were determined at semi-empirical and ab initio levels. To study the molecular details of the complexes, simpler molecule models were calculated by the ab initio pseudo-potential method. The molecular properties of these complexes are essentially independent of the presence of the peripheral tin atoms. Agreement was always found among the results of the different computational approaches, as well as between the theoretical and the experimental findings on the molecular geometry of the hypothesized comp…

Pseudo-potential method computational studygeometryporphyrin derivativeOrganotin(IV)-porphyrin complexewaterAb initiochemistry.chemical_elementElementary chargeInorganic Chemistrychemistry.chemical_compoundmetal complexComputational chemistryMoleculeCarboxylateSemi-empirical methodenergy transferarticleGeneral ChemistryPorphyrinBond lengthtin derivativeMolecular geometrychemistrySettore CHIM/03 - Chimica Generale E Inorganicamolecular interactionprotoporphyrinmathematical analysiTinchemical analysi
researchProduct

Cocharacters of group graded algebras and multiplicities bounded by one

2017

Let G be a finite group and A a G-graded algebra over a field F of characteristic zero. We characterize the (Formula presented.)-ideals (Formula presented.) of graded identities of A such that the multiplicities (Formula presented.) in the graded cocharacter of A are bounded by one. We do so by exhibiting a set of identities of the (Formula presented.)-ideal. As a consequence we characterize the varieties of G-graded algebras whose lattice of subvarieties is distributive.

Pure mathematics010103 numerical & computational mathematics01 natural sciencesGraded Lie algebraFiltered algebrasymbols.namesakeDifferential graded algebra0101 mathematicsAlgebra over a fieldMathematicsDiscrete mathematicsHilbert series and Hilbert polynomialFinite groupAlgebra and Number TheoryMathematics::Commutative AlgebraMathematics::Rings and Algebras010102 general mathematicsGraded ringPolynomial identitycocharactergraded polynomialSettore MAT/02 - AlgebraBounded functiongraded algebrasymbolsANÉIS E ÁLGEBRAS ASSOCIATIVOS
researchProduct

The diamond partial order in rings

2013

In this paper we introduce a new partial order on a ring, namely the diamond partial order. This order is an extension of a partial order defined in a matrix setting in [J.K. Baksalary and J. Hauke, A further algebraic version of Cochran's theorem and matrix partial orderings, Linear Algebra and its Applications, 127, 157--169, 1990]. We characterize the diamond partial order on rings and study its relationships with other partial orders known in the literature. We also analyze successors, predecessors and maximal elements under the diamond order.

Pure mathematics15A09Principal ideal010103 numerical & computational mathematicsengineering.material01 natural sciencesCombinatoricsMatrix (mathematics)Linear extensionPrincipal ideal0101 mathematicsCiências Naturais::MatemáticasMathematicsRing (mathematics)RingAlgebra and Number TheoryScience & Technology010102 general mathematicsAnells (Algebra)DiamondOrder (ring theory)Sharp partial orderStar partial orderMinus partial order06A06Linear algebraengineeringÀlgebra linealMATEMATICA APLICADAMaximal element:Matemáticas [Ciências Naturais]
researchProduct

Lie properties of symmetric elements in group rings

2009

Abstract Let ∗ be an involution of a group G extended linearly to the group algebra KG . We prove that if G contains no 2-elements and K is a field of characteristic p ≠ 2 , then the ∗-symmetric elements of KG are Lie nilpotent (Lie n -Engel) if and only if KG is Lie nilpotent (Lie n -Engel).

Pure mathematicsAdjoint representation010103 numerical & computational mathematicsCentral series01 natural sciencesGraded Lie algebraMathematics::Group TheoryRepresentation of a Lie groupGroup ring LieLie nilpotentGroup algebra0101 mathematicsMathematics::Representation TheoryMathematicsDiscrete mathematicsAlgebra and Number TheorySimple Lie groupTEORIA DOS GRUPOSMathematics::Rings and Algebras010102 general mathematicsLie conformal algebraAdjoint representation of a Lie algebraLie n-EngelNilpotent groupSymmetric element
researchProduct

The associated graded module of the test module filtration

2017

We show that each direct summand of the associated graded module of the test module filtration $\tau(M, f^\lambda)_{\lambda \geq 0}$ admits a natural Cartier structure. If $\lambda$ is an $F$-jumping number, then this Cartier structure is nilpotent on $\tau(M, f^{\lambda -\varepsilon})/\tau(M, f^\lambda)$ if and only if the denominator of $\lambda$ is divisible by $p$. We also show that these Cartier structures coincide with certain Cartier structures that are obtained by considering certain $\mathcal{D}$-modules associated to $M$ that were used to construct Bernstein-Sato polynomials. Moreover, we point out that the zeros of the Bernstein-Sato polynomial $b_{M,f}$ attached to an \emph{$F$-…

Pure mathematicsAlgebra and Number TheoryMathematics::Commutative Algebra010102 general mathematicsGraded ring010103 numerical & computational mathematicsMathematics - Commutative AlgebraCommutative Algebra (math.AC)01 natural sciencesMathematics - Algebraic GeometryMathematics::Algebraic GeometryFiltration (mathematics)FOS: Mathematics0101 mathematicsAlgebraic Geometry (math.AG)Mathematics
researchProduct

Complexity of gauge bounded Cartier algebras

2019

We show that a gauge bounded Cartier algebra has finite complexity. We also give an example showing that the converse does not hold in general.Communicated by Graham J. Leuschke

Pure mathematicsAlgebra and Number TheoryMathematics::Commutative AlgebraHigh Energy Physics::Lattice010102 general mathematics010103 numerical & computational mathematicsGauge (firearms)Commutative Algebra (math.AC)Mathematics - Commutative Algebra01 natural sciencesMathematics::Algebraic GeometryBounded functionConverseFOS: Mathematics0101 mathematicsAlgebra over a fieldMathematics
researchProduct