AI Chat

Fast generalized Bruhat decomposition

02/23/2017

∙

by Gennadi Malaschonok, et al.

∙

∙

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.

page 1

page 2

page 3

page 4

∙ 02/23/2017

Generalized Bruhat decomposition in commutative domains

Deterministic recursive algorithms for the computation of generalized Br...

0 Gennadi Malaschonok, et al. ∙

∙ 06/06/2023

Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization

We present a randomized, inverse-free algorithm for producing an approxi...

0 James Demmel, et al. ∙

∙ 07/14/2023

Combinatorial and Recurrent Approaches for Efficient Matrix Inversion: Sub-cubic algorithms leveraging Fast Matrix products

In this paper, we introduce novel fast matrix inversion algorithms that ...

0 Mohamed Kamel RIAHI, et al. ∙

∙ 06/11/2020

Fast Coherent Point Drift

Nonrigid point set registration is widely applied in the tasks of comput...

0 Xiang-Wei Feng, et al. ∙

∙ 03/06/2019

PBBFMM3D: a parallel black-box algorithm for kernel matrix-vector multiplication

We introduce PBBFMM3D, a parallel black-box method for computing kernel ...

0 Ruoxi Wang, et al. ∙

∙ 04/23/2022

New features in MathPartner 2021

We introduce new features in the MathPartner service that have recently ...

0 Gennadi Malaschonok, et al. ∙

∙ 09/18/2019

On the Closed Form Expression of Elementary Symmetric Polynomials and the Inverse of Vandermonde Matrix

Inverse Vandermonde matrix calculation is a long-standing problem to sol...

0 Mahdi S. Hosseini, et al. ∙