Bartholdi zeta functions of fractal graphs.
BDF neboli věta o hlavních osách v nekonečné dimenzi
Bemerkung zu Definition des Vektorraumes
Bemerkung zu einem Satz von Glaubermann.
Bemerkungen zu Determinanten-Theorie. Auszug aus Briefen an Herrn Baltzer.
Benchmarking aggregation AMG for linear systems in CFD simulations of compressible internal flows.
Berkowitz's algorithm and clow sequences.
Beweis, dass jede Covariante und Invariante einer binären Form eine ganze Function mit numerischen Coefficienten einer endlichen Anzahl solcher Formen ist.
Bigradients, Hankel determinants and the Newton-Padé table.
Bilateral polynomial equations with unimodular right-hand-side matrices
Necessary and sufficient conditions are established for the existence of a solution to some bilateral polynomial matrix equations with unimodular right-hand-side matrices. A procedure for the computation of the solution is derived and illustrated by a numerical example. Two examples of applications of bilateral polynomial matrix equations are presented.
Bilinear characterizations of companion matrices
Companion matrices of the second type are characterized by properties that involve bilinear maps.
Bilinéarité et géométrie affine attachées aux espaces de spineurs complexes, minkowskiens ou autres
Binary Moore-Penrose inverses of set inclusion incidence matrices.
Block diagonalization
We study block diagonalization of matrices induced by resolutions of the unit matrix into the sum of idempotent matrices. We show that the block diagonal matrices have disjoint spectra if and only if each idempotent matrix in the inducing resolution double commutes with the given matrix. Applications include a new characterization of an eigenprojection and of the Drazin inverse of a given matrix.
Block Factorization of Hankel Matrices and Euclidean Algorithm
It is shown that a real Hankel matrix admits an approximate block diagonalization in which the successive transformation matrices are upper triangular Toeplitz matrices. The structure of this factorization was first fully discussed in [1]. This approach is extended to obtain the quotients and the remainders appearing in the Euclidean algorithm applied to two polynomials u(x) and v(x) of degree n and m, respectively, whith m < ...
Block matrix approximation via entropy loss function
The aim of the paper is to present a procedure for the approximation of a symmetric positive definite matrix by symmetric block partitioned matrices with structured off-diagonal blocks. The entropy loss function is chosen as approximation criterion. This procedure is applied in a simulation study of the statistical problem of covariance structure identification.
Block representations of the Drazin inverse of a bipartite matrix.
Block-Iterative Methods for Consistent and Inconsistent Linear Equations.
Book Reviews
Boosting the inverse interpolation problem by a sum of decaying exponentials using an algebraic approach.