Search results for "LYN"

showing 10 items of 910 documents

POLYNOMIAL NUMERICAL INDEX FOR SOME COMPLEX VECTOR-VALUED FUNCTION SPACES

2007

We study in this paper the relation between the polynomial numerical indices of a complex vector-valued function space and the ones of its range space. It is proved that the spaces C(K,X), and L∞(μ,X) have the same polynomial numerical index as the complex Banach space X for every compact Hausdorff space K and every σ-finite measure μ, which does not hold any more in the real case. We give an example of a complex Banach space X such that, for every k > 2, the polynomial numerical index of order k of X is the greatest possible, namely 1, while the one of X∗∗ is the least possible, namely k k 1−k . We also give new examples of Banach spaces with the polynomial Daugavet property, namely L∞(μ,X…

PolynomialRange (mathematics)Pure mathematicsFunction spaceGeneral MathematicsMathematical analysisBanach spaceHausdorff spaceOrder (group theory)Space (mathematics)Measure (mathematics)MathematicsThe Quarterly Journal of Mathematics
researchProduct

Locally tame plane polynomial automorphisms

2010

Abstract For automorphisms of a polynomial ring in two variables over a domain R , we show that local tameness implies global tameness provided that every 2-generated locally free R -module of rank 1 is free. We give examples illustrating this property.

PolynomialRank (linear algebra)Polynomial ringPolynomial automorphismsCommutative Algebra (math.AC)01 natural sciencesCombinatoricsMathematics - Algebraic GeometryFOS: MathematicsAlgebra en Topologie0101 mathematicsAlgebraic Geometry (math.AG)MathematicsAlgebra and TopologyAlgebra and Number TheoryPlane (geometry)local tameness010102 general mathematicsA domainMathematics - Commutative AlgebraAutomorphism[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]010101 applied mathematicsComputingMethodologies_DOCUMENTANDTEXTPROCESSING[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]14R10Journal of Pure and Applied Algebra
researchProduct

Varieties of special Jordan algebras of almost polynomial growth

2019

Abstract Let J be a special Jordan algebra and let c n ( J ) be its corresponding codimension sequence. The aim of this paper is to prove that in case J is finite dimensional, such a sequence is polynomially bounded if and only if the variety generated by J does not contain U J 2 , the special Jordan algebra of 2 × 2 upper triangular matrices. As an immediate consequence, we prove that U J 2 is the only finite dimensional special Jordan algebra that generates a variety of almost polynomial growth.

PolynomialSequenceCodimension (Mathematics)Algebra and Number TheoryJordan algebra010102 general mathematicsTriangular matrixCodimensão (Matemática)CodimensionPolynomial identity01 natural sciencesIdentidade polinomialCombinatoricsSettore MAT/02 - AlgebraPolynomial identity codimension sequence Jordan algebra almost polynomial growthIdentityBounded functionIdentidade0103 physical sciencesArtigo original010307 mathematical physics0101 mathematicsVariety (universal algebra)Mathematics
researchProduct

Symbolic Worst Case Execution Times

2011

In immediate or hard real-time systems the correctness of an operation depends not only upon its logical correctness, but also on the time in which it is computed. In such systems, it is imperative that operations are performed within a given deadline because missing this deadline constitutes the failure of the complete system. Such systems include medical systems, flight control systems and other systems whose failure in responding punctually results in a high economical loss or even in the loss of human lives. These systems are usually analyzed in a sequence of steps in which first, a socalled control flow graph (CFG) is constructed that represents possible program flows. Furthermore, bou…

PolynomialSequenceCorrectnessWorst-case execution timeComputer scienceCode (cryptography)Control flow graphInteger programmingAlgorithmLongest path problem
researchProduct

Wavelet Frames Generated by Perfect Reconstruction Filter Banks

2015

It was indicated in Sect. 2.2 that oversampled perfect reconstruction (PR) filter banks generate specific types of frames in the signal space. In this chapter, a family of tight and semi-tight frames is presented. The three- and four-channel filter banks that generate the framed originate from polynomial and discrete splines. Those frames have properties, which are attractive for signal processing, such as symmetry, interpolation, flat spectra. These properties are combined with fine time-domain localization and efficient implementation. This family includes framelets, that have any number of discrete vanishing moments. Non-compactness of their supports is compensated by exponential decay o…

PolynomialSignal processingWaveletComputer scienceInterpolation (computer graphics)Filter (signal processing)Symmetry (geometry)Filter bankSignalAlgorithm
researchProduct

Non-Gaussian Approach for Stochastic Analysis of Offshore Structures

1995

An approach that is able to obtain the stochastic characteristics in terms of, stochastic momen.ts of a SDOF system excited by loads due to a fluid-structure mteraction is presented. In This approach the fluid horizontal velocity is considered as a filtered white noise, and the actual load expression is replaced by a Thirddegree polynomial of this velocity. The tools needed to p.romptly obtain the filters parameters and the equations governing the response moments are also presented; in particular, if the structure is sufficiently stiff, It is shown that these equations do not need any closure scheme III order to be solved. © ASCE.

PolynomialStochastic processMechanical EngineeringGaussianClosure (topology)White noiseStability (probability)Expression (mathematics)symbols.namesakeMechanics of MaterialsFluid–structure interactionsymbolsApplied mathematicsMechanics of MaterialAlgorithmMathematicsJournal of Engineering Mechanics
researchProduct

Three solutions for parametric problems with nonhomogeneous (a,2)-type differential operators and reaction terms sublinear at zero

2019

Abstract We consider parametric Dirichlet problems driven by the sum of a Laplacian and a nonhomogeneous differential operator ( ( a , 2 ) -type equation) and with a reaction term which exhibits arbitrary polynomial growth and a nonlinear dependence on the parameter. We prove the existence of three distinct nontrivial smooth solutions for small values of the parameter, providing sign information for them: one is positive, one is negative and the third one is nodal.

PolynomialSublinear functionApplied Mathematics010102 general mathematicsMathematical analysisDifferential operator01 natural sciencesDirichlet distribution010101 applied mathematicssymbols.namesakeNonlinear systemSettore MAT/05 - Analisi Matematica(a2)-operator Constant sign solutions Nodal solutions Multiplicity of solutions Nonhomogeneous operatorsymbols0101 mathematicsLaplace operatorAnalysisSign (mathematics)MathematicsParametric statisticsJournal of Mathematical Analysis and Applications
researchProduct

A Characterization of Quintic Helices

2005

A polynomial curve of degree 5, @a, is a helix if and only if both @[email protected]^'@? and @[email protected]^'@[email protected]^''@? are polynomial functions.

PolynomialTheorem of LancreteducationComputingMilieux_LEGALASPECTSOFCOMPUTINGCharacterization (mathematics)behavioral disciplines and activitiesMathematics::Algebraic TopologyCombinatoricsMathematics - Geometric TopologyTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYhealth services administrationComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONFOS: Mathematicshealth care economics and organizationsMathematicsPhysics::Biological PhysicsQuantitative Biology::BiomoleculesDegree (graph theory)InformationSystems_INFORMATIONSYSTEMSAPPLICATIONSApplied MathematicsMathematical analysisGeometric Topology (math.GT)Pythagorean hodograph curveshumanitiesQuintic functionComputational MathematicsGeneralized polynomial helices
researchProduct

Principal polynomial analysis for remote sensing data processing

2011

Inspired by the concept of Principal Curves, in this paper, we define Principal Polynomials as a non-linear generalization of Principal Components to overcome the conditional mean independence restriction of PCA. Principal Polynomials deform the straight Principal Components by minimizing the regression error (or variance) in the corresponding orthogonal subspaces. We propose to use a projection on a series of these polynomials to set a new nonlinear data representation: the Principal Polynomial Analysis (PPA). We prove that the dimensionality reduction error in PPA is always lower than in PCA. Lower truncation error and increased independence suggest that unsupervised PPA features can be b…

PolynomialTruncation errorbusiness.industryFeature vectorDimensionality reductionPattern recognitionLinear discriminant analysisLinear subspaceProjection (linear algebra)Principal component analysisLife ScienceArtificial intelligencebusinessMathematicsRemote sensing
researchProduct

Non Linear Fitting Methods for Machine Learning

2017

This manuscript presents an analysis of numerical fitting methods used for solving classification problems as discriminant functions in machine learning. Non linear polynomial, exponential, and trigonometric models are mathematically deduced and discussed. Analysis about their pros and cons, and their mathematical modelling are made on what method to chose for what type of highly non linear multi-dimension problems are more suitable to be solved. In this study only deterministic models with analytic solutions are involved, or parameters calculation by numeric methods, which the complete model can subsequently be treated as a theoretical model. Models deduction are summarised and presented a…

PolynomialWake-sleep algorithmbusiness.industryComputer scienceOnline machine learningType (model theory)Machine learningcomputer.software_genreExponential functionNonlinear systemDiscriminantArtificial intelligenceTrigonometrybusinesscomputer
researchProduct