Search results for "numeri"

showing 10 items of 2138 documents

Factorization of (q,p)-summing polynomials through Lorentz spaces

2017

[EN] We present a vector valued duality between factorable (q,p)-summing polynomials and (q,p)-summing linear operators on symmetric tensor products of Banach spaces. Several applications are provided. First, we prove a polynomial characterization of cotype of Banach spaces. We also give a variant of Pisier's factorization through Lorentz spaces of factorable (q,p)-summing polynomials from C(K)-spaces. Finally, we show a coincidence result for (q,p)-concave polynomials.(c) 2016 Elsevier Inc. All rights reserved.

Discrete mathematicsMathematics::Functional AnalysisPure mathematicsApplied MathematicsDiscrete orthogonal polynomials010102 general mathematicsBanach space010103 numerical & computational mathematics01 natural sciencesClassical orthogonal polynomialsDifference polynomialsFactorizationPisier's theoremWilson polynomialsOrthogonal polynomialsSymmetric tensorSumming polynomialsFactorization0101 mathematicsMATEMATICA APLICADAAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

P-matrix completions under weak symmetry assumptions

2000

An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …

Discrete mathematicsMatrix completionNumerical AnalysisAlgebra and Number TheorySymmetric graphCombinatorial symmetry010102 general mathematicsComparability graphIncidence matrix010103 numerical & computational mathematics01 natural sciencesGraphCombinatoricsVertex-transitive graphP-matrixGraph powerDiscrete Mathematics and CombinatoricsRegular graphAdjacency matrixGeometry and Topology0101 mathematicsComplement graphMathematicsLinear Algebra and its Applications
researchProduct

Domination spaces and factorization of linear and multilinear summing operators

2015

[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.

Discrete mathematicsMultilinear mapPietsch's domination theoremMultilinear summing operators010102 general mathematicsMathematics::Classical Analysis and ODEs010103 numerical & computational mathematicsPietsch's domination theorem factorization of operators multilinear summing operators.Factorization of operators01 natural sciencesFunctional Analysis (math.FA)Mathematics - Functional AnalysisMathematics (miscellaneous)FactorizationFOS: Mathematics0101 mathematicsMATEMATICA APLICADAMathematics
researchProduct

Certain subclasses of multivalent analytic functions defined by multiplier transforms

2010

By making use of the principle of subordination between analytic functions and a family of multiplier transforms, we introduce and investigate some new subclasses of multivalent analytic functions. Such results as inclusion relationships, subordination and superordination properties, integral-preserving properties, argument estimates and convolution properties are proved.

Discrete mathematicsMultiplier (Fourier analysis)Computational MathematicsPure mathematicsApplied MathematicsNumerical analysisAnalytic functionMathematicsApplied Mathematics and Computation
researchProduct

Tensor product multiresolution analysis with error control for compact image representation

2002

A class of multiresolution representations based on nonlinear prediction is studied in the multivariate context based on tensor product strategies. In contrast to standard linear wavelet transforms, these representations cannot be thought of as a change of basis, and the error induced by thresholding or quantizing the coefficients requires a different analysis. We propose specific error control algorithms which ensure a prescribed accuracy in various norms when performing such operations on the coefficients. These algorithms are compared with standard thresholding, for synthetic and real images.

Discrete mathematicsMultiresolution analysisMathematicsofComputing_NUMERICALANALYSISWavelet transformImage processingReal imageThresholdingTensor productControl and Systems EngineeringSignal ProcessingComputer Vision and Pattern RecognitionElectrical and Electronic EngineeringChange of basisAlgorithmSoftwareMathematicsImage compressionSignal Processing
researchProduct

The λ-Error Order in Multivariate Interpolation

2005

The aim of this article is to introduce and to study a generalization of the error order of interpolation, named λ – error order of interpolation. This generalization makes possible a deeper analysis of the error in the interpolation process. We derived the general form of the λ – error order of interpolation and then we applied it for many choices of the functional λ.

Discrete mathematicsNearest-neighbor interpolationMathematicsofComputing_NUMERICALANALYSISTrilinear interpolationApplied mathematicsBilinear interpolationStairstep interpolationLinear interpolationSpline interpolationComputingMethodologies_COMPUTERGRAPHICSMultivariate interpolationInterpolationMathematics
researchProduct

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

On the Russo-Dye Theorem for positive linear maps

2019

Abstract We revisit a classical result, the Russo-Dye Theorem, stating that every positive linear map attains its norm at the identity.

Discrete mathematicsNumerical AnalysisAlgebra and Number Theory010102 general mathematics010103 numerical & computational mathematics01 natural sciencesFunctional Analysis (math.FA)Linear mapMathematics - Functional Analysis47A30 15A60Norm (mathematics)FOS: MathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology0101 mathematicsMathematics
researchProduct

Some properties of [tr(Q2p)]12p with application to linear minimax estimation

1990

Abstract A nondifferentiable minimization problem is considered which occurs in linear minimax estimation. This problem is solved by replacing the nondifferentiable maximal eigenvalue of a real nonnegative definite matrix Q with [tr( Q 2 p )] 1/2 p . It is shown that any descent algorithm with inexact step-length rule can be used to obtain linear minimax estimators for the parameter vector of a parameter-restricted linear model.

Discrete mathematicsNumerical AnalysisAlgebra and Number TheoryMinimization problemLinear modelMathematics::Optimization and ControlMinimaxMinimax approximation algorithmMatrix (mathematics)Discrete Mathematics and CombinatoricsGeometry and TopologyMinimax estimatorDescent algorithmEigenvalues and eigenvectorsMathematicsLinear Algebra and its Applications
researchProduct

The structure of the state representation of shift invariant controllable and observable group codes

2000

AbstractIn this paper an investigation on the structure of the canonical trellis section of shift invariant, l-controllable and m-observable group codes is carried out. Necessary and sufficient conditions for a set of group homomorphisms in order that they represent the trellis section of this class of codes are established.

Discrete mathematicsNumerical AnalysisAlgebra and Number TheoryObservableCanonical representationsBehavioral analysisGroup codeGroup codesDiscrete Mathematics and CombinatoricsHomomorphismCanonical formGeometry and TopologyInvariant (mathematics)Behavioral approachState representationComputer Science::Information TheoryMathematics
researchProduct