Fast multiplication, determinants, and inverses of arrowhead and diagonal-plus-rank-one matrices over associative fields

12/21/2022
by   Nevena Jakovcevic Stor, et al.
0

The article considers arrowhead and diagonal-plus-rank-one matrices in F^(nxn) where F in R,C or H. H is a non-commutative field of quaternions. We give unified formulas for fast matrix-vector multiplications, determinants, and inverses for considered matrices. The formulas are unified in the sense that the same formula holds in both, commutative and noncommutative algebras. Each formula requires O(n) arithmetic operations. Most of the formulas hold for block matrices, as well.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/12/2020

Fast computation of optimal damping parameters for linear vibrational systems

We formulate the quadratic eigenvalue problem underlying the mathematica...
research
05/31/2018

A faster hafnian formula for complex matrices and its benchmarking on the Titan supercomputer

We introduce new and simple algorithms for the calculation of the number...
research
03/10/2017

On matrices with displacement structure: generalized operators and faster algorithms

For matrices with displacement structure, basic operations like multipli...
research
10/11/2018

A Constraint Propagation Algorithm for Sums-of-Squares Formulas over the Integers

Sums-of-squares formulas over the integers have been studied extensively...
research
07/22/2019

Block-sparse Recovery of Semidefinite Systems and Generalized Null Space Conditions

This article considers the recovery of low-rank matrices via a convex nu...
research
03/20/2020

Localized sketching for matrix multiplication and ridge regression

We consider sketched approximate matrix multiplication and ridge regress...
research
09/04/2019

A Non-commutative Bilinear Model for Answering Path Queries in Knowledge Graphs

Bilinear diagonal models for knowledge graph embedding (KGE), such as Di...

Please sign up or login with your details

Forgot password? Click here to reset