Results 1 to 10 of about 1,109 (88)

Spectra of algebras of block-symmetric analytic functions of bounded type [PDF]

open access: yesМатематичні Студії, 2022
We investigate algebras of block-symmetric analytic functions on spaces $\ell_{p}(\mathbb{C}^s)$ which are $\ell_{p}$-sums of $\mathbb{C}^{s}.$ We consider properties of algebraic bases of block-symmetric polynomials, intertwining operations on spectra ...
A. Zagorodnyuk, V. V. Kravtsiv
doaj   +4 more sources

Zeros of block-symmetric polynomials on Banach spaces

open access: yesМатематичні Студії, 2020
We investigate sets of zeros of block-symmetric polynomials on the direct sums of sequence spaces. Block-symmetric polynomials are more general objects than classical symmetric polynomials.
V. Kravtsiv
doaj   +4 more sources

Analogues of the Newton formulas for the block-symmetric polynomials on $\ell_p(\mathbb{C}^s)$

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 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 Banach sequence spaces.
V.V. Kravtsiv
doaj   +3 more sources

Representation of spectra of algebras of block-symmetric analytic functions of bounded type

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2016
The paper contains a description of symmetric convolution of the algebra of block-symmetric analytic functions of bounded type on $\ell_{1}$-sum of the space $\mathbb{C}^{2}.$ We show that the specrum of such algebra does not coincide of point evaluation
V.V. Kravtsiv, A.V. Zagorodnyuk
doaj   +8 more sources

On algebraic bases of algebras of block-symmetric polynomials on Banach spaces [PDF]

open access: yesМатематичні Студії, 2012
The paper contains a description of algebraic basis of algebra of block-symmetric polynomials on the l_1-sum of the copies of l_1.
V. V. Kravtsiv, A. V. Zagorodnyuk
doaj   +2 more sources

Continuous block-symmetric polynomials of degree at most two on the space $(L_\infty)^2$

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2016
We introduce block-symmetric polynomials on $(L_\infty)^2$ and prove that every continuous block-symmetric polynomial of degree at most two on $(L_\infty)^2$ can be uniquely represented by some "elementary" block-symmetric polynomials.
T.V. Vasylyshyn
doaj   +4 more sources

A block-symmetric linearization of odd degree matrix polynomials with optimal eigenvalue condition number and backward error [PDF]

open access: yesCalcolo, 2018
The standard way of solving numerically a polynomial eigenvalue problem (PEP) is to use a linearization and solve the corresponding generalized eigenvalue problem (GEP). In addition, if the PEP possesses one of the structures arising very often in applications, then the use of a linearization that preserves such structure combined with a structured ...
Froilan M Dopico, Susana Furtado
exaly   +4 more sources

Waring-Girard formulas for block-symmetric and block-supersymmetric polynomials

open access: yesМатематичні Студії
This paper investigates the structure and properties of block-symmetric and block-super\-symmetric polynomials in Banach spaces. The study extends classical symmetric polynomial results to infinite-dimensional settings, particularly in sequence spaces ...
V. V. Kravtsiv   +2 more
doaj   +2 more sources

A Block-Sparse Tensor Train Format for Sample-Efficient High-Dimensional Polynomial Regression

open access: yesFrontiers in Applied Mathematics and Statistics, 2021
Low-rank tensors are an established framework for the parametrization of multivariate polynomials. We propose to extend this framework by including the concept of block-sparsity to efficiently parametrize homogeneous, multivariate polynomials with low ...
Michael Götte   +2 more
doaj   +1 more source

Roots of Characteristic Polynomial Sequences in Iterative Block Cyclic Reductions

open access: yesMathematics, 2021
The block cyclic reduction method is a finite-step direct method used for solving linear systems with block tridiagonal coefficient matrices. It iteratively uses transformations to reduce the number of non-zero blocks in coefficient matrices.
Masato Shinjo   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy