Fast generalized bruhat decomposition

Authors:
Gennadi Malaschonok
Affiliations:
Tambov State University, Tambov, Russia
Venue:
CASC'10 Proceedings of the 12th international conference on Computer algebra in scientific computing
Year:
2010

Citing 4
Cited 1

Processor efficient parallel solution of linear systems over an abstract field

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Pivot-Free Block Matrix Inversion

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Processor-efficient parallel solution of linear systems. II. The positive characteristic and singular cases

SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Computation of the adjoint matrix

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II

Simultaneous computation of the row and column rank profiles

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The deterministic recursive pivot-free algorithms for computing the generalized Bruhat decomposition of the matrix in the field and for the computation of the inverse matrix are presented. This method has the same complexity as algorithm of matrix multiplication, and it is suitable for the parallel computer systems.