Computing the null space of finite element problems

DOI10.1016/j.cma.2009.05.012zbMath1229.74139OpenAlexW2007668648MaRDI QIDQ658296

Sivan Toledo, Gil Shklarski

Publication date: 11 January 2012

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cma.2009.05.012

zbMATH Keywords

finite element modelslinear constraintssingular linear systemsnull spacefretsaw preconditionerrigid-body motions

Mathematics Subject Classification ID

Finite element methods applied to problems in solid mechanics (74S05)

Related Items

A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block

Uses Software

• Matlab
• UMFPACK
• BLOPEX
• TetGen
• ML

Cites Work

• Unnamed Item
• Unnamed Item
• Factoring matrices with a tree-structured sparsity pattern
• Sparse null basis computations in structural optimization
• Acceleration of convergence of a two-level algorithm by smoothing transfer operators
• A direct flexibility method
• Mechanism free domain decomposition
• The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• Nested-Dissection Orderings for Sparse LU with Partial Pivoting
• Sparse Multifrontal Rank Revealing QR Factorization
• Balancing domain decomposition
• A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
• Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
• Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
• Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
• Rigidity in Finite-Element Matrices: Sufficient Conditions for the Rigidity of Structures and Substructures
• On the Computation of Null Spaces of Sparse Rectangular Matrices
• The Null Space Problem I. Complexity
• Computing a Sparse Basis for the Null Space
• On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
• A method of finite element tearing and interconnecting and its parallel solution algorithm
• The construction of free–free flexibility matrices as generalized stiffness inverses
• Computing an Eigenvector with Inverse Iteration
• On the general solution by a direct method of a large-scale singular system of linear equations: application to the analysis of floating structures
• Support Theory for Preconditioning
• An efficient graph theoretical method for plate bending finite element analysis via force method
• Algorithm 832
• An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics.