LQ-Schur Projection on Large Sparse Matrix Equations
1999-12-21
Loading...
View/Download File
Persistent link to this item
Statistics
View StatisticsJournal Title
Journal ISSN
Volume Title
Title
LQ-Schur Projection on Large Sparse Matrix Equations
Authors
Published Date
1999-12-21
Publisher
Type
Report
Abstract
A new paradigm for the solution of nonsymmetric large sparse systems oflinear equations is proposed. The paradigm is based on an LQfactorization of the matrix of coefficients, i.e.~factoring the matrixof coefficients into the product of a lower triangular matrix and anorthogonal matrix. We show how the system of linear equations can bedecomposed into a collection of smaller independent problems which canthen beused to construct an iterative method for a system of smallerdimensionality. We show that the conditioning of the reducedproblem cannot be worse than that of the original, unlike Schurcomplement methods in the nonsymmetric case. The paradigm depends onthe existence of an ordering of the rows representing the equationsinto blocks of rows which are mutually structurely orthogonal, exceptfor a last block row which is coupled to all other rows in a limitedway.
Keywords
Description
Related to
Replaces
License
Series/Report Number
Funding information
Isbn identifier
Doi identifier
Previously Published Citation
Suggested citation
Boley, Daniel; Goehring, Todd. (1999). LQ-Schur Projection on Large Sparse Matrix Equations. Retrieved from the University Digital Conservancy, https://hdl.handle.net/11299/215391.
Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.