ScholarLens Back to search
2014•Unpublished venueRequires access

ABS Algorithms for Integer WZ Factorization

Effat Golpar-Raboky

Open publisher page 2 citations

Abstract

Classes of integer ABS algorithms have been introduced for solving linear Diophantine equations. The algorithms are powerful methods for developing all matrix factorizations. Here, we provide the conditions for the existence of the integer WZ and ZW factorizations of an integer matrix. Then, we present algorithms based on the integer ABS algorithms for computing the integer WZ and ZW factorizations of an integer matrix as well as the integer XZ Z T and XW W T factorizations of a

About this research paper

What this paper is about

Classes of integer ABS algorithms have been introduced for solving linear Diophantine equations. The algorithms are powerful methods for developing all matrix factorizations. Here, we provide the conditions for the existence of the integer WZ and ZW factorizations of an integer matrix. Then, we present algorithms based on the integer ABS algorithms for computing the integer WZ and ZW factorizations of an integer matrix as well as the integer XZ Z T and XW W T factorizations of a

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Classes of integer ABS algorithms have been introduced for solving linear Diophantine equations. The algorithms are powerful methods for developing all matrix factorizations. Here, we provide the conditions for the existence of the integer WZ and ZW factorizations of an integer matrix. Then, we present algorithms based on the integer ABS algorithms for computing the integer WZ and ZW factorizations of an integer matrix as well as the integer XZ Z T and XW W T factorizations of a

Key concepts: Integer (computer science), Radical of an integer, Integer matrix, Integer points in convex polyhedra, Integer factorization, Mathematics, Diophantine equation, Algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
ABS Algorithms for Integer WZ Factorization — Research Paper | ScholarLens