Search results for "Computational Mathematic"

showing 10 items of 987 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

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

The Rotation χ-Lattice of Ternary Trees

2001

This paper generalizes to k-ary trees the well-known rotation transformation on binary trees. For brevity, only the ternary case is developped. The rotation on ternary trees is characterized using some codings of trees. Although the corresponding poset is not a lattice, we show that it is a χ-lattice in the sense of Leutola–Nieminen. Efficient algorithms are exhibited to compute meets and joins choosen in a particular way.

Discrete mathematicsNumerical AnalysisBinary treeTernary treeWeight-balanced treeComputer Science ApplicationsTheoretical Computer ScienceCombinatoricsComputational MathematicsComputational Theory and MathematicsTernary search treeTernary operationTamari latticePartially ordered setRotation (mathematics)SoftwareMathematicsComputing
researchProduct

Error analysis for a special X-spline

1979

Clenshaw and Negus [1] defined the cubic X-spline, and they applied it to an interpolation problem. In the present paper, for the same interpolation problem, an interpolating splinew is considered by combining two specialX-splines. The construction ofw is such that the computational labour for its determination, in the case of piecewise equally spaced knots, is less than that of the conventional cubic splines c . A complete error analysis ofw is done. One of the main results is that, in the case of piecewise equally spaced knots,w ands c have essentially the same error estimates.

Discrete mathematicsNumerical AnalysisMathematics::Numerical AnalysisComputer Science ApplicationsTheoretical Computer ScienceComputational MathematicsSpline (mathematics)Computational Theory and MathematicsError analysisPiecewiseApplied mathematicsMathematical Physics and MathematicsComputer communication networksSoftwareMathematicsInterpolationComputing
researchProduct

Property (gab) through localized SVEP

2015

In this article we study the property (gab) for a bounded linear operator T 2 L(X) on a Banach space X which is a stronger variant of Browder's theorem. We shall give several characterizations of property (gab). These characterizations are obtained by using typical tools from local spectral theory. We also show that property (gab) holds for large classes of operators and prove the stability of property (gab) under some commuting perturbations. 2010 Mathematics Subject Classication. Primary 47A10, 47A11; Secondary 47A53, 47A55.

Discrete mathematicsNumerical AnalysisPure mathematicsControl and OptimizationSpectral theoryProperty (philosophy)Property (gab) local spectral subspaces Browder type theorems.Applied Mathematics010102 general mathematicsBanach space010103 numerical & computational mathematics01 natural sciencesStability (probability)Bounded operatorSettore MAT/05 - Analisi Matematica0101 mathematicsAnalysisMathematics
researchProduct

Rank structured approximation method for quasi--periodic elliptic problems

2016

We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…

Discrete mathematicsNumerical AnalysisRank (linear algebra)PreconditionerApplied Mathematicsprecondition methodsguaranteed error boundsOrder (ring theory)65F30 65F50 65N35 65F10tensor type methods010103 numerical & computational mathematicsNumerical Analysis (math.NA)elliptic problems with periodic and quasi-periodic coefficients01 natural sciencesFinite element method010101 applied mathematicsComputational MathematicsOperator (computer programming)Simple (abstract algebra)FOS: MathematicsBoundary value problemTensorMathematics - Numerical Analysis0101 mathematicsMathematics
researchProduct

Common fixed points of generalized contractions on partial metric spaces and an application

2011

Abstract In this paper, common fixed point theorems for four mappings satisfying a generalized nonlinear contraction type condition on partial metric spaces are proved. Presented theorems extend the very recent results of I. Altun, F. Sola and H. Simsek [Generalized contractions on partial metric spaces, Topology and its applications 157 (18) (2010) 2778–2785]. As application, some homotopy results for operators on a set endowed with a partial metric are given.

Discrete mathematicsPartial metric spaceHomotopy.Applied MathematicsInjective metric space010102 general mathematicsEquivalence of metricsCommon fixed point01 natural sciencesCoincidence pointConvex metric spaceIntrinsic metric010101 applied mathematicsComputational MathematicsMetric spaceSettore MAT/05 - Analisi MatematicaMetric (mathematics)Metric mapWeakly compatible pair of mapping0101 mathematicsMetric differentialMathematicsApplied Mathematics and Computation
researchProduct