Generalized Bruhat decomposition in commutative domains

02/23/2017
by   Gennadi Malaschonok, et al.
0

Deterministic recursive algorithms for the computation of generalized Bruhat decomposition of the matrix in commutative domain are presented. This method has the same complexity as the algorithm of matrix multiplication.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/23/2017

Fast generalized Bruhat decomposition

The deterministic recursive pivot-free algorithms for the computation of...
research
02/23/2017

Triangular Decomposition of Matrices in a Domain

Deterministic recursive algorithms for the computation of matrix triangu...
research
03/29/2017

Recursive Method for the Solution of Systems of Linear Equations

New solution method for the systems of linear equations in commutative i...
research
01/08/2019

Fast generalized DFTs for all finite groups

For any finite group G, we give an arithmetic algorithm to compute gener...
research
10/12/2016

Recursive Diffeomorphism-Based Regression for Shape Functions

This paper proposes a recursive diffeomorphism based regression method f...
research
04/19/2020

On the decomposition of generalized semiautomata

Semi-automata are abstractions of electronic devices that are determinis...
research
08/25/2021

Matrix form of nonlocal OSM for electromagnetics

The goal of the present paper is twofold. First, we revisit the derivati...

Please sign up or login with your details

Forgot password? Click here to reset