Matrices with Tunable Infinity-Norm Condition Number and No Need for Pivoting in LU Factorization
نویسندگان
چکیده
We propose a two-parameter family of nonsymmetric dense $n\times n$ matrices $A(\alpha,\beta)$ for which LU factorization without pivoting is numerically stable, and we show how to choose $\alpha$ $\beta$ achieve any value the $\infty$-norm condition number. The matrix can be formed from simple formula in $O(n^2)$ flops. suitable use HPL-AI Mixed-Precision Benchmark, requires an extreme scale test (dimension $n>10^7$) that has controlled number safely used pivoting. It also interest as general-purpose matrix.
منابع مشابه
Parallel Symbolic Factorization for Sparse LU Factorization with Static Pivoting
In this paper we consider a direct method to solve a sparse unsymmetric system of linear equations Ax = b, which is the Gaussian elimination. This elimination consists in explicitly factoring the matrix A into the product of L and U , where L is a unit lower triangular matrix, and U is an upper triangular matrix, followed by solving LUx = b one factor at a time. One of the main characteristics ...
متن کاملParallel Symbolic Factorization for Sparse LU with Static Pivoting
This paper presents the design and implementation of a memory scalable parallel symbolic factorization algorithm for general sparse unsymmetric matrices. Our parallel algorithm uses a graph partitioning approach, applied to the graph of |A|+ |A| , to partition the matrix in such a way that is good for sparsity preservation as well as for parallel factorization. The partitioning yields a so-call...
متن کاملA Comparison of Pivoting Strategies for the Direct LU Factorization
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usual Gaussian elimination and show that two so-called total scaled and total pivoting strategies can be employed in addition to the traditional pivoting strategies: partial scaled, partial, and direct diagonal. In this paper we o er a general LU factorization with total scaled pivoting algorithm fr...
متن کاملStability and sensitivity of tridiagonal LU factorization without pivoting
In this paper the accuracy of LU factorization of tridiagonal matrices without pivoting is considered. Two types of componentwise condition numbers for the L and U factors of tridiadonal matrices are presented and compared. One type is a condition number with respect to small relative perturbations of each entry of the matrix. The other type is a condition number with respect to small component...
متن کاملPivoting strategy for fast LU decomposition of sparse block matrices
Solving large linear systems is a fundamental task in many interesting problems, including finite element methods (FEM) or (non-)linear least squares (NLS) for inference in graphical models such as simultaneous localization and mapping (SLAM) in robotics or bundle adjustment (BA) in computer vision. Furthermore, the problems of interest here are sparse. The most time-consuming parts are sparse ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2021
ISSN: ['1095-7162', '0895-4798']
DOI: https://doi.org/10.1137/20m1357238