Fast structured LU factorization for nonsymmetric matrices
From MaRDI portal
Publication:2450863
DOI10.1007/s00211-013-0582-0zbMath1290.65022OpenAlexW2081782543MaRDI QIDQ2450863
Li-Zhi Cheng, Ming Gu, Sheng-Guo Li
Publication date: 23 May 2014
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00211-013-0582-0
complexitynumerical resultsSchur complementorthogonal transformationsnonsymmetric matricesLU factorization algorithm
Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (4)
Approximate inversion of discrete Fourier integral operators ⋮ Second‐order accurate hierarchical approximate factorizations for solving sparse linear systems ⋮ Pointwise error estimates of numerical solutions to linear quadratic optimal control problems ⋮ An algebraic multifrontal preconditioner that exploits the low‐rank property
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
- Rang revealing QR factorizations
- A randomized algorithm for the decomposition of matrices
- Hierarchical matrices. A means to efficiently solve elliptic boundary value problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
- A sparse \({\mathcal H}\)-matrix arithmetic. II: Application to multi-dimensional problems
- On the Complexity of Some Hierarchical Structured Matrix Algorithms
- The university of Florida sparse matrix collection
- Randomized algorithms for the low-rank approximation of matrices
- Direction-Preserving and Schur-Monotonic Semiseparable Approximations of Symmetric Positive Definite Matrices
- Robust Approximate Cholesky Factorization of Rank-Structured Symmetric Positive Definite Matrices
- Fast algorithms for hierarchically semiseparable matrices
- A Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Algorithm 876
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Some Applications of the Rank Revealing QR Factorization
- High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
- New Efficient and Robust HSS Cholesky Factorization of SPD Matrices
- A Fast $ULV$ Decomposition Solver for Hierarchically Semiseparable Representations
- Efficient Structured Multifrontal Factorization for General Large Sparse Matrices
- On the Compression of Low Rank Matrices
- Some Fast Algorithms for Sequentially Semiseparable Representations
- Numerical solution of an integral equation with a logarithmic kernel
This page was built for publication: Fast structured LU factorization for nonsymmetric matrices
