EuDML | Browse

Items

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

Previous Page 4 Next

Displaying 61 – 80 of 89

Direct methods for matrix Sylvester and Lyapunov equations.

Sorensen, Danny C., Zhou, Yunkai (2003)

Journal of Applied Mathematics

Direct summands of systems of continuous linear transformations [Book]

Uri Fixman, Frank A. Zorzitto (1979)

Directed forests with application to algorithms related to Markov chains

Piotr Pokarowski (1999)

Applicationes Mathematicae

This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.

Directed graphs and matrix equations

Juraj Bosák (1978)

Mathematica Slovaca

Discrepancy of matrices of zeros ond ones.

Brualdi, Richard A., Shen, Jian (1999)

The Electronic Journal of Combinatorics [electronic only]

Discrete linear regulator revisited

Vladimír Kučera (1981)

Kybernetika

Discrete orthogonal polynomial ensembles and the Plancherel measure.

Johansson, Kurt (2001)

Annals of Mathematics. Second Series

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

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. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Discriminant algebras and adjoints of quadratic forms.

Loos, Ottmar (1997)

Beiträge zur Algebra und Geometrie

Displacement Structure of Generalized Inverse At,s(1,2)

Mei Qin, Yimin Wei (2002)

Matematički Vesnik

Dissident algebras

Ernst Dieterich (1999)

Colloquium Mathematicae

Given a euclidean vector space V = (V,〈〉) and a linear map η: V ∧ V → V, the anti-commutative algebra (V,η) is called dissident in case η(v ∧ w) ∉ ℝv ⊕ ℝw for each pair of non-proportional vectors (v,w) ∈ $V^{2}$ . For any dissident algebra (V,η) and any linear form ξ: V ∧ V → ℝ, the vector space ℝ × V, endowed with the multiplication (α,v)(β,w) = (αβ -〈v,w〉+ ξ(v ∧ w), αw + βv + η(v ∧ w)), is a quadratic division algebra. Up to isomorphism, each real quadratic division algebra arises in this way. Vector...

Dissident maps on the seven-dimensional Euclidean space

Ernst Dieterich, Lars Lindberg (2003)

Colloquium Mathematicae

Our article contributes to the classification of dissident maps on ℝ ⁷, which in turn contributes to the classification of 8-dimensional real division algebras. We study two large classes of dissident maps on ℝ ⁷. The first class is formed by all composed dissident maps, obtained from a vector product on ℝ ⁷ by composition with a definite endomorphism. The second class is formed by all doubled dissident maps, obtained as the purely imaginary parts of the structures of those 8-dimensional...

Distance matrices perturbed by Laplacians

Balaji Ramamurthy, Ravindra Bhalchandra Bapat, Shivani Goel (2020)

Applications of Mathematics

Let $T$ be a tree with $n$ vertices. To each edge of $T$ we assign a weight which is a positive definite matrix of some fixed order, say, $s$ . Let $D_{i j}$ denote the sum of all the weights lying in the path connecting the vertices $i$ and $j$ of $T$ . We now say that $D_{i j}$ is the distance between $i$ and $j$ . Define $D : = [D_{i j}]$ , where $D_{i i}$ is the $s \times s$ null matrix and for $i \neq j$ , $D_{i j}$ is the distance between $i$ and $j$ . Let $G$ be an arbitrary connected weighted graph with $n$ vertices, where each weight is a positive definite matrix of order $s$ . If $i$ and...

Distances on the tropical line determined by two points

María Jesús de la Puente (2014)

Kybernetika

Let $p^{'}$ and $q^{'}$ be points in $ℝ^{n}$ . Write $p^{'} \sim q^{'}$ if $p^{'} - q^{'}$ is a multiple of $(1, ..., 1)$ . Two different points $p$ and $q$ in $ℝ^{n} / \sim$ uniquely determine a tropical line $L (p, q)$ passing through them and stable under small perturbations. This line is a balanced unrooted semi-labeled tree on $n$ leaves. It is also a metric graph. If some representatives $p^{'}$ and $q^{'}$ of $p$ and $q$ are the first and second columns of some real normal idempotent order $n$ matrix $A$ , we prove that the tree $L (p, q)$ is described by a matrix $F$ , easily obtained from $A$ . We also prove that...

Distribution of values of permanent and standard forms of (0,1)-matrices

Wandi Wei, Benfu Yang, Shuhong Gao (1989)

Banach Center Publications

Distributions homogènes sur des espaces de matrices

Mustapha Rais (1972)

Mémoires de la Société Mathématique de France

Divisibility properties of Smith matrices

Shaofang Hong, Jianrong Zhao, Youzhan Yin (2008)

Acta Arithmetica

Divisible ℤ-modules

Yuichi Futa, Yasunari Shidama (2016)

Formalized Mathematics

In this article, we formalize the definition of divisible ℤ-module and its properties in the Mizar system [3]. We formally prove that any non-trivial divisible ℤ-modules are not finitely-generated.We introduce a divisible ℤ-module, equivalent to a vector space of a torsion-free ℤ-module with a coefficient ring ℚ. ℤ-modules are important for lattice problems, LLL (Lenstra, Lenstra and Lovász) base reduction algorithm [15], cryptographic systems with lattices [16] and coding theory [8].

Dodgon's determinant-evaluation rule proved by TWO-TIMING MEN and WOMEN.

Zeilberger, Doron (1997)

The Electronic Journal of Combinatorics [electronic only]

Domains of analytic continuation for the top Lyapunov exponent

Yuval Peres (1992)

Annales de l'I.H.P. Probabilités et statistiques

Currently displaying 61 – 80 of 89

Previous Page 4 Next