Displaying 121 – 140 of 147

Showing per page

Exploiting tensor rank-one decomposition in probabilistic inference

Petr Savický, Jiří Vomlel (2007)

Kybernetika

We propose a new additive decomposition of probability tables – tensor rank-one decomposition. The basic idea is to decompose a probability table into a series of tables, such that the table that is the sum of the series is equal to the original table. Each table in the series has the same domain as the original table but can be expressed as a product of one- dimensional tables. Entries in tables are allowed to be any real number, i. e. they can be also negative numbers. The possibility of having...

Exponential polynomial inequalities and monomial sum inequalities in p -Newton sequences

Charles R. Johnson, Carlos Marijuán, Miriam Pisonero, Michael Yeh (2016)

Czechoslovak Mathematical Journal

We consider inequalities between sums of monomials that hold for all p-Newton sequences. This continues recent work in which inequalities between sums of two, two-term monomials were combinatorially characterized (via the indices involved). Our focus is on the case of sums of three, two-term monomials, but this is very much more complicated. We develop and use a theory of exponential polynomial inequalities to give a sufficient condition for general monomial sum inequalities, and use the sufficient...

Exponents of two-colored digraphs

Yan Ling Shao, Yubin Gao (2009)

Czechoslovak Mathematical Journal

We consider the primitive two-colored digraphs whose uncolored digraph has n + s vertices and consists of one n -cycle and one ( n - 3 ) -cycle. We give bounds on the exponents and characterizations of extremal two-colored digraphs.

Extrapolated positive definite and positive semi-definite splitting methods for solving non-Hermitian positive definite linear systems

Raheleh Shokrpour, Ghodrat Ebadi (2022)

Applications of Mathematics

Recently, Na Huang and Changfeng Ma in (2016) proposed two kinds of typical practical choices of the PPS method. In this paper, we extrapolate two versions of the PPS iterative method, and we introduce the extrapolated Hermitian and skew-Hermitian positive definite and positive semi-definite splitting (EHPPS) iterative method and extrapolated triangular positive definite and positive semi-definite splitting (ETPPS) iterative method. We also investigate convergence analysis and consistency of the...

Extremal inverse eigenvalue problem for matrices described by a connected unicyclic graph

Bijoya Bardhan, Mausumi Sen, Debashish Sharma (2024)

Applications of Mathematics

In this paper, we deal with the construction of symmetric matrix whose corresponding graph is connected and unicyclic using some pre-assigned spectral data. Spectral data for the problem consist of the smallest and the largest eigenvalues of each leading principal submatrices. Inverse eigenvalue problem (IEP) with this set of spectral data is generally known as the extremal IEP. We use a standard scheme of labeling the vertices of the graph, which helps in getting a simple relation between the characteristic...

Currently displaying 121 – 140 of 147