All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1 Next

Displaying 1 – 20 of 48

Showing per page

Facial structures of separable and PPT states

Seung-Hyeok Kye (2011)

Banach Center Publications

A positive semi-definite block matrix (a state if it is normalized) is said to be separable if it is the sum of simple tensors of positive semi-definite matrices. A state is said to be entangled if it is not separable. It is very difficult to detect the border between separable and entangled states. The PPT (positive partial transpose) criterion tells us that the partial transpose of a separable state is again positive semi-definite, as was observed by M. D. Choi in 1982 from...

Factorizable matrices

Miroslav Fiedler, Frank J. Hall (2013)

Special Matrices

We study square matrices which are products of simpler factors with the property that any ordering of the factors yields a matrix cospectral with the given matrix. The results generalize those obtained previously by the authors.

Falseness of the finiteness property of the spectral subradius

Adam Czornik, Piotr Jurgas (2007)

International Journal of Applied Mathematics and Computer Science

We prove that there exist infinitely may values of the real parameter α for which the exact value of the spectral subradius of the set of two matrices (one matrix with ones above and on the diagonal and zeros elsewhere, and one matrix with α below and on the diagonal and zeros elsewhere, both matrices having two rows and two columns) cannot be calculated in a finite number of steps. Our proof uses only elementary facts from the theory of formal languages and from linear algebra, but it is not constructive...

Fault tolerant control for uncertain time-delay systems based on sliding mode control

Jun Sheng Wu, Zhengxin Weng, Zuo Hua Tian, Song Jiao Shi (2008)

Kybernetika

Fault tolerant control for uncertain systems with time varying state-delay is studied in this paper. Based on sliding mode controller design, a fault tolerant control method is proposed. By means of the feasibility of some linear matrix inequalities (LMIs), delay dependent sufficient condition is derived for the existence of a linear sliding surface which guarantees quadratic stability of the reduced-order equivalent system restricted to the sliding surface. A reaching motion controller, which can...

Fermat's Equation in Matrices

Khazanov, Alex (1995)

Serdica Mathematical Journal

The Fermat equation is solved in integral two by two matrices of determinant one as well as in finite order integral three by three matrices.

Fiedler vectors with unbalanced sign patterns

Sooyeong Kim, Stephen J. Kirkland (2021)

Czechoslovak Mathematical Journal

In spectral bisection, a Fielder vector is used for partitioning a graph into two connected subgraphs according to its sign pattern. We investigate graphs having Fiedler vectors with unbalanced sign patterns such that a partition can result in two connected subgraphs that are distinctly different in size. We present a characterization of graphs having a Fiedler vector with exactly one negative component, and discuss some classes of such graphs. We also establish an analogous result for regular graphs...

Filter factors of truncated TLS regularization with multiple observations

Iveta Hnětynková, Martin Plešinger, Jana Žáková (2017)

Applications of Mathematics

The total least squares (TLS) and truncated TLS (T-TLS) methods are widely known linear data fitting approaches, often used also in the context of very ill-conditioned, rank-deficient, or ill-posed problems. Regularization properties of T-TLS applied to linear approximation problems A x ≈ b were analyzed by Fierro, Golub, Hansen, and O’Leary (1997) through the so-called filter factors allowing to represent the solution in terms of a filtered pseudoinverse of A applied to b . This paper focuses on the situation...

Finiteness results for Abelian tree models

Jan Draisma, Rob H. Eggermont (2015)

Journal of the European Mathematical Society

Equivariant tree models are statistical models used in the reconstruction of phylogenetic trees from genetic data. Here equivariant§ refers to a symmetry group imposed on the root distribution and on the transition matrices in the model. We prove that if that symmetry group is Abelian, then the Zariski closures of these models are defined by polynomial equations of bounded degree, independent of the tree. Moreover, we show that there exists a polynomial-time membership test for that Zariski closure....

Currently displaying 1 – 20 of 48

Page 1 Next