๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fraction Free Gaussian Elimination for Sparse Matrices

โœ Scribed by Hong R. Lee; B.David Saunders

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
291 KB
Volume
19
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

A variant of the fraction free form of Gaussian elimination is presented. This algorithm reduces the amount of arithmetic involved when the matrix has many zero entries. The advantage can be great for matrices with symbolic entries (integers, polynomials, expressions in trigonometric functions, etc.). These claims are supported with some analysis and experimental data.

๐Ÿ“œ SIMILAR VOLUMES

A Generalized Sylvester Identity and Fra
A Generalized Sylvester Identity and Fraction-free Random Gaussian Elimination
โœ Thom Mulders ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 278 KB

Sylvester's identity is a well-known identity that can be used to prove that certain Gaussian elimination algorithms are fraction free. In this paper we will generalize Sylvester's identity and use it to prove that certain random Gaussian elimination algorithms are fraction free. This can be used to