An unsymmetrized multifrontal LU factorization

PDF Version Also Available for Download.

Description

A well-known approach to compute the LU factorization of a general unsymmetric matrix bf A is to build the elimination tree associated with the pattern of the symmetric matrix A + A{sup T} and use it as a computational graph to drive the numerical factorization. This approach, although very efficient on a large range of unsymmetric matrices, does not capture the unsymmetric structure of the matrices. We introduce a new algorithm which detects and exploits the structural unsymmetry of the submatrices involved during the process of the elimination tree. We show that with the new algorithm significant gains both in ... continued below

Physical Description

vp.

Creation Information

Amestoy, Patrick R. & Puglisi, Chiara July 17, 2000.

Context

This report is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. It has been viewed 13 times . More information about this report can be viewed below.

Who

People and organizations associated with either the creation of this report or its content.

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this report. Follow the links below to find similar items on the Digital Library.

Description

A well-known approach to compute the LU factorization of a general unsymmetric matrix bf A is to build the elimination tree associated with the pattern of the symmetric matrix A + A{sup T} and use it as a computational graph to drive the numerical factorization. This approach, although very efficient on a large range of unsymmetric matrices, does not capture the unsymmetric structure of the matrices. We introduce a new algorithm which detects and exploits the structural unsymmetry of the submatrices involved during the process of the elimination tree. We show that with the new algorithm significant gains both in memory and in time to perform the factorization can be obtained.

Physical Description

vp.

Notes

OSTI as DE00776628

Source

  • Other Information: PBD: 17 Jul 2000

Language

Item Type

Identifier

Unique identifying numbers for this report in the Digital Library or other systems.

  • Report No.: LBNL--46474
  • Grant Number: AC03-76SF00098
  • DOI: 10.2172/776628 | External Link
  • Office of Scientific & Technical Information Report Number: 776628
  • Archival Resource Key: ark:/67531/metadc715385

Collections

This report is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

What responsibilities do I have when using this report?

When

Dates and time periods associated with this report.

Creation Date

  • July 17, 2000

Added to The UNT Digital Library

  • Sept. 29, 2015, 5:31 a.m.

Description Last Updated

  • April 5, 2016, 4:53 p.m.

Usage Statistics

When was this report last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 13

Interact With This Report

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Amestoy, Patrick R. & Puglisi, Chiara. An unsymmetrized multifrontal LU factorization, report, July 17, 2000; California. (digital.library.unt.edu/ark:/67531/metadc715385/: accessed August 23, 2017), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.