Abstract
The paper analyzes the sparsity pattern of triangular factors of the reduced Bruhat decomposition of a non-singular matrix over a field, which is an alternative to the commonly used LU decomposition. Bounds for the length of the Bruhat permutation of a matrix providing upper bounds for the number of nonzero entries in the reduced triagular factor of its Bruhat decomposition are also presented. Bibliography: 6 titles.
Similar content being viewed by others
Literature Cited
Z. I. Borevich, “A description of subgroups of the general linear group containing the group of diagonal matrices,” in: Rings and Modules,Zap. Nauchn. Semin. LOMI,64, 12–29 (1976).
D. Yu. Grigor'ev, “Additive complexity in directed computations,”Theor. Comput. Sci.,19, 39–67 (1982).
L. Yu. Kolotilina, “On the sparsity of triangular factors of the Bruhat decomposition of nonsingular matrices,” in:Actual Problems of Numerical and Applied Mathematics, Abstracts of the All-Union Conference, Novosibirsk (1987), pp. 101–102.
L. Yu. Kolotilina and A. Yu. Yeremin, “Bruhat decomposition and solution of linear algebraic systems with sparse matrices,”Sov. J. Numer. Anal. Math. Model.,2, 421–436 (1987).
R. Steinberg, “Lectures on Chevalley Groups,” Yale University (1967).
N. A. Vavilov, “Bruhat decomposition for subgroups containing the group of diagonal matrices. II,” in: Modules and Algebraic Groups,Zap. Nauchn. Semin. LOMI,114, 50–61 (1982).
Additional information
Translated by L. Yu. Kolotilina.
Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 202, 1992, pp. 5–17.
Rights and permissions
About this article
Cite this article
Kolotilina, L.Y. The sparsity of Bruhat decomposition factors of nonsingular matrices. J Math Sci 79, 1035–1042 (1996). https://doi.org/10.1007/BF02366125
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366125