Results 31 to 40 of about 1,502,182 (290)
Some Method for Constructing Cycles in a Graph
Современные информационные технологии и IT-образование, 2022 Multidimensional matrices are a powerful tool for solving various fundamental scientific problems and applied scientific and technical problems. As examples of the use of multidimensional matrices in various fields, one can cite the work of the creator ...
Victor Munerman, Daniel Munerman
doaj +1 more source
A note on optimal block-scaling of matrices [PDF]
, 1984 Elsner L. A note on optimal block-scaling of matrices. Numerische Mathematik. 1984;44(1):127-128.After pointing out that two recent results on optimal blockscaling are equivalent, a new short and simple proof of both results is ...
Elsner, Ludwig
core +1 more source
Some Basic Concepts of Neutrosophic Soft Block Matrices [PDF]
Neutrosophic Sets and Systems, 2022 The main focus of this article is to discuss the concept of neutrosophic sets, neutrosophic soft sets , neutrosophic soft matrices theory and neutrosophic soft block matrix which are very useful and applicable in various situations involving ...
Mamoni Dhar
doaj +1 more source
Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations [PDF]
, 1991 Elsner L, Mehrmann V. Convergence of block iterative methods for linear systems arising in the numerical solution of Euler equations. Numerische Mathematik.
Mehrmann, Volker, Elsner, Ludwig
core +1 more source
Inverses and Determinants of n × n Block Matrices
Mathematics, 2023 Block matrices play an important role in all branches of pure and applied mathematics. In this paper, we study the two fundamental concepts: inverses and determinants of general n×n block matrices.
Müge Saadetoğlu, Şakir Mehmet Dinsev
doaj +1 more source
Formalized Mathematics, 2008 Summary. In this paper I present basic properties of block diagonal matrices over a set. In my approach the finite sequence of matrices in a block diagonal matrix is not restricted to square matrices. Moreover, the o-diagonal blocks need not be zero matrices, but also with another arbitrary fixed value.
openaire +1 more source
Convex Cone Conditions on the Structure of Designs [PDF]
, 2003 Various known and original inequalities concerning the structure of combinatorial designs are established using polyhedral cones generated by incidence matrices. This work begins by giving definitions and elementary facts concerning t-designs.
Dukes, Peter James
core +1 more source
Subset selection for matrices with fixed blocks [PDF]
Israel Journal of Mathematics, 2021 Subset selection for matrices is the task of extracting a column sub-matrix from a given matrix $B\in\mathbb{R}^{n\times m}$ with $m>n$ such that the pseudoinverse of the sampled matrix has as small Frobenius or spectral norm as possible. In this paper, we consider a more general problem of subset selection for matrices that allows a block to be ...
Jiaxin Xie, Zhiqiang Xu
openaire +2 more sources
Deficiency Indices of Block Jacobi Matrices: Survey
Современная математика: Фундаментальные направления, 2021 The paper is a survey and concerns with infinite symmetric block Jacobi matrices J with m×m-matrix entries. We discuss several results on general block Jacobi matrices to be either self-adjoint or have maximal as well as intermediate deficiency indices ...
Viktoriya S. Budyka +2 more
doaj +1 more source