Fast generalized Bruhat decomposition

DOI10.1007/978-3-642-15274-0_16MaRDI QIDQ3589076zbMATH OpenOpenAlexFDO

Authors Gennadi I. Malaschonok

Publication date 10 September 2010

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1702.07242

Mathematics Subject Classification ID

Parallel numerical computation (65Y05)

Abstract: The deterministic recursive pivot-free algorithms for the computation of 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.

Recommendations

• Generalized Bruhat decomposition in commutative domains
• Triangular decomposition of matrices in a domain
• Bruhat Decomposition and Numerical Stability
• scientific article; zbMATH DE number 766236
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm

Cites work

• scientific article; zbMATH DE number 4217769 (Why is no real title available?)
• scientific article; zbMATH DE number 1256710 (Why is no real title available?)
• scientific article; zbMATH DE number 1504614 (Why is no real title available?)
• scientific article; zbMATH DE number 766236 (Why is no real title available?)
• Additive complexity in directed computations
• Computation of the Adjoint Matrix
• Gaussian elimination is not optimal
• Triangular Factorization and Inversion by Fast Matrix Multiplication

Cited in

(11)

• Hopf-theoretic approach to motives of twisted flag varieties
• Fast computation of the rank profile matrix and the generalized Bruhat decomposition
• scientific article; zbMATH DE number 766236 (Why is no real title available?)
• A Further Refinement of the Bruhat Decomposition
• Generalized Bruhat decomposition in commutative domains
• Triangular decomposition of matrices in a domain
• Showcasing straight-line programs with memory via matrix Bruhat decomposition
• Time and space efficient generators for quasiseparable matrices
• Matrix Bruhat decompositions with a remark on the QR(GR) algorithm
• A practical approach to the secure computation of the Moore-Penrose pseudoinverse over the rationals
• Expedited Broda-Damas bracket abstraction

Describes a project that uses

Uses Software

• ParCA

This page was built for publication: Fast generalized Bruhat decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589076)