Results 21 to 30 of about 12,308 (240)
A relaxed block splitting preconditioner for complex symmetric indefinite linear systems
Open Mathematics, 2018 In this paper, we propose a relaxed block splitting preconditioner for a class of complex symmetric indefinite linear systems to accelerate the convergence rate of the Krylov subspace iteration method and the relaxed preconditioner is much closer to the ...
Huang Yunying, Chen Guoliang
doaj +1 more source
Analogues of the Newton formulas for the block-symmetric polynomials on $\ell_p(\mathbb{C}^s)$
Carpathian Mathematical Publications, 2020 The classical Newton formulas gives recurrent relations between algebraic bases of symmetric polynomials. They are true, of course, for symmetric polynomials on infinite-dimensional sequences Banach space. In this paper we consider block-symmetric polynomials (or MacMahon symmetric polynomials) on Banach spaces $\ell_p(\mathbb{C}^s),$ $1\le p\le \infty.
openaire +3 more sources
The invariants of the third symmetric power representation of SL_2(F_p) [PDF]
, 2010 For a prime p>3, we compute a finite generating set for the SL_2(F_p)-invariants of the third symmetric power representation. The proof relies on the construction of an infinite SAGBI basis and uses the Hilbert series calculation of Hughes and ...
R. James Shank +3 more
core +1 more source
Decomposing symmetric powers of certain modular representations of cyclic groups [PDF]
, 2009 For a prime number p, we construct a generating set for the ring of invariants for the p+1 dimensional indecomposable modular representation of a cyclic group of order p^2.
David L. Wehlau +3 more
core +1 more source
Discrete-time symmetric polynomial equations with complex coefficients [PDF]
, 2002 summary:Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated.
Henrion, Didier +2 more
core +1 more source
The equivalence of two graph polynomials and a symmetric function
, 2009 The U-polynomial, the polychromate and the symmetric function generalization of the Tutte polynomial due to Stanley are known to be equivalent in the sense that the coefficients of any one of them can be obtained as a function of the coefficients of any ...
Noble, SD +5 more
core +1 more source
On convergence of the maximum block improvement method
, 2015 . The MBI (maximum block improvement) method is a greedy approach to solving optimization problems where the decision variables can be grouped into a finite number of blocks. Assuming that optimizing over one block of variables while fixing all others is
Shuzhong Zhang +5 more
core +1 more source
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Advanced Engineering Materials, EarlyView.Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source
, 2017 For each square matrix polynomial $P(λ)$ of odd degree, a block-symmetric block-tridiagonal pencil $\mathcal{T}_{P}(λ)$ was introduced by Antoniou and Vologiannidis in 2004, and a variation $\mathcal{R}_P(λ)$ was introduced by Mackey et al. in 2010. These two pencils have several appealing properties, namely they are always strong linearizations of $P ...
Bueno, M. I. +3 more
openaire +2 more sources
Faster One Block Quantifier Elimination for Regular Polynomial Systems of Equations
, 2021 International audienceQuantifier elimination over the reals is a central problem incomputational real algebraic geometry, polynomial system solving andsymbolic computation.
Le, Huu Phuoc, Safey El Din, Mohab
core +1 more source