Block computation and representation of a sparse nullspace basis of a rectangular matrix

DOI10.1016/J.LAA.2007.11.025zbMATH Open1142.65041OpenAlexW2113599268MaRDI QIDQ924318FDOQ924318

Authors: Sabine Le Borne 

Publication date: 15 May 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2007.11.025

Recommendations

• On the Computation of Null Spaces of Sparse Rectangular Matrices
• An algorithm to compute a sparse basis of the null space
• Combinatorial algorithms for computing column space bases that have sparse inverses
• The Null Space Problem II. Algorithms
• Computing a Sparse Basis for the Null Space

zbMATH Keywords

numerical resultssparse matrixalgorithmfinite elementhierarchical matricesorthogonal basisorthogonal factorizationnullspaceblock QR factorizationdiscrete divergence operator

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)

Cites Work

• Sparse QR factorization in MATLAB
• Title not available (Why is that?)
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Nested Dissection of a Regular Finite Element Mesh
• Construction and arithmetics of \(\mathcal H\)-matrices
• Domain decomposition based \({\mathcal H}\)-LU preconditioning
• Introduction to hierarchical matrices with applications.
• On Row and Column Orderings for Sparse Least Squares Problems
• Nested Dissection for Sparse Nullspace Bases
• An introduction to hierarchical matrices
• On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
• Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
• Hierarchical Cholesky decomposition of sparse matrices arising from curl–curl-equation
• Why Finite Element Discretizations Can Be Factored by Triangular Hierarchical Matrices
• A Data Structure for Sparse $QR$ and $LU$ Factorizations
• Multifrontal Computation with the Orthogonal Factors of Sparse Matrices
• Separators and structure prediction in sparse orthogonal factorization
• Low-rank approximation of FE matrix inverses for operators with jumping coefficients
• Hierarchical Divergence-Free Bases and Their Application to Particulate Flows

Cited In (9)

• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
• On the descriptor variable observation of rectangular implicit representations, in the presence of column minimal indices blocks
• A high-throughput hybrid task and data parallel Poisson solver for large-scale simulations of incompressible turbulent flows on distributed GPUs
• On the Computation of Null Spaces of Sparse Rectangular Matrices
• Computing the block triangular form of a sparse matrix
• How to overcome indetermination and interpenetration in granular systems via nonsmooth contact dynamics. An exploratory investigation
• High-order accurate solution of the incompressible Navier-Stokes equations on massively parallel computers
• Iterative Solution of Saddle-Point Systems from Radial Basis Function (RBF) Interpolation
• An efficient algorithm for sparse null space basis problem using ABS methods

Uses Software

• SPARSE-QR

This page was built for publication: Block computation and representation of a sparse nullspace basis of a rectangular matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924318)