منابع مشابه
Balancing Regular Matrix Pencils
In this paper we present a new diagonal balancing technique for regular matrix pencils λB − A, which aims at reducing the sensitivity of the corresponding generalized eigenvalues. It is inspired from the balancing technique of a square matrix A and has a comparable complexity. Upon convergence, the diagonally scaled pencil has row and column norms that are balanced in a precise sense. We also s...
متن کاملMechanisms balancing skeletal matrix synthesis and degradation.
Bone is regulated by evolutionarily conserved signals that balance continuous differentiation of bone matrix-producing cells against apoptosis and matrix removal. This is continued from embryogenesis, where the skeleton differentiates as a solid mass and is shaped into separate bones by cell death and proteolysis. The two major tissues of the skeleton are avascular cartilage, with an extracellu...
متن کاملA Fast Algorithm for Matrix Balancing
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the matrix can be balanced, that is we can find a diagonal scaling of A that is doubly stochastic. A number of algorithms have been proposed to achieve the balancing, the most well known of these being the Sinkhorn-Knopp algorithm. In this paper we derive new algorithms based on inner-outer iteration schemes. We...
متن کاملSparse matrix decomposition with optimal load balancing
Optimal load balancing in sparse matrix decomposition without disturbing the row/column ordering is investigated. Both asymptotically and run-time efficient exact algorithms are proposed and implemented for one-dimensional (1D) striping and two-dimensional (2D) jagged partitioning. Binary search method is successfully adopted to 1D striped decomposition by deriving and exploiting a good upper b...
متن کاملMatrix Balancing Problem and Binary Ahp
A matrix balancing problem and an eigenvalue problem are transformed into two minimumnorm point problems whose difference is only a norm. The matrix balancing problem is solved by scaling algorithms that are as simple as the power method of the eigenvalue problem. This study gives a proof of global convergence for scaling algorithms and applies the algorithm to Analytic Hierarchy process (AHP),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1971
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/14.3.280