• Journal of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.503-520
• /
• 2023

In this paper, using the theory of majorization, we discuss the Schur m power convexity for L-conjugate means of n variables and the Schur convexity for weighted L-conjugate means of n variables. As applications, we get several inequalities of general mean satisfying Schur convexity, and a few comparative inequalities about n variables Gini mean are established.

• Kyungpook Mathematical Journal
• /
• v.45 no.1
• /
• pp.73-85
• /
• 2005

In this paper a criterion for $L^1-convergence$ of a new modified sine sums is obtained by using $Ces{\grave{a}}ro$ means of integral and non-integral orders.

• Computers and Concrete
• /
• v.2 no.5
• /
• pp.345-366
• /
• 2005

This work presents an assessment of the computational performance of a vector-parallel implementation of probabilistic model for concrete cracking in 3D. This paper shows the continuing efforts towards code optimization as reported in earlier works Paz, et al. (2002a,b and 2003). The probabilistic crack approach is based on the direct Monte Carlo method. Cracking is accounted by means of 3D interface elements. This approach considers that all nonlinearities are restricted to interface elements modeling cracks. The heterogeneity governs the overall cracking behavior and related size effects on concrete fracture. Computational kernels in the implementation are the inexact Newton iterative driver to solve the non-linear problem and a preconditioned conjugate gradient (PCG) driver to solve linearized equations, using an element by element (EBE) strategy to compute matrix-vector products. In particular the paper analyzes code behavior using OpenMP directives in parallel vector processors (PVP), such as the CRAY SV1 and CRAY T94. The impact of the memory architecture on code performance, and also some strategies devised to circumvent this issue are addressed by numerical experiment.