Diagonal similarity and equivalence for matrices over groups with 0
Diagonal similarity of matrices
Diagonal transformations
Die Adjunktenbildung von Matrizen als Bündelprojektion.
Die allgemeine lineare Transformation der Liniencoordinaten
Die Einbettung von Mittelwertstrukturen in Q-Vektorräume.
Die Lösung der Matrizengleichung X - AXB = C durch Integration.
Die neuere Algebra und die Ausdehnungslehre
Die Reduction linearer homogener Substitutionen von endlicher Periode auf ihre kanonische Form.
Diffeomorphisms of Rn with oscillatory jacobians.
The paper presents, mainly, two results: a new proof of the spectral properties of oscillatory matrices and a transversality theorem for diffeomorphisms of Rn with oscillatory jacobian at every point and such that NM(f(x) - f(y)) ≤ NM(x - y) for all elements x,y ∈ Rn, where NM(x) - 1 denotes the maximum number of sign changes in the components zi of z ∈ Rn, where all zi are non zero and z varies in a small neighborhood of x. An application to a semiimplicit discretization of the scalar heat equation...
Differencial equations for the analytic singular value decomposition of a matrix.
Digital image reconstruction in the spectral domain utilizing the Moore-Penrose inverse.
Dimension of non-Archimedean Banach spaces
Direct and Inverse Spectral Problems for (2N + 1)-Diagonal, Complex, Symmetric, Non-Hermitian Matrices
2000 Mathematics Subject Classification: 42C05.We give an easy procedure for solving of the direct and the inverse spectral problems for the equation. Guseynov used a procedure of the Gelfand-Levitan type for the case N = 1. We use another procedure and this procedure is more easy and transparent.
Direct iterative methods for linear systems using weak splittings
Direct methods for matrix Sylvester and Lyapunov equations.
Direct summands of systems of continuous linear transformations [Book]
Directed forests with application to algorithms related to Markov chains
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
Discrete linear regulator revisited