Computing the null space of finite element problems

DOI10.1016/J.CMA.2009.05.012MaRDI QIDQ658296zbMATH OpenOpenAlexFDO

Authors Gil Shklarski, Sivan Toledo

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

singular linear systemslinear constraintsnull spacefinite element modelsfretsaw preconditionerrigid-body motions

Mathematics Subject Classification ID

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

Recommendations

• The null space and non-conventional basis functions in the mixed finite element method
• scientific article; zbMATH DE number 3854346
• scientific article; zbMATH DE number 3890866
• The finite element method for initial value problems: mathematics and computations
• scientific article; zbMATH DE number 3932338
• Finite element solution of nonlinear elliptic problems
• scientific article; zbMATH DE number 763380
• scientific article; zbMATH DE number 1008667
• Finite elements. Theory and algorithms
• Finite element approximation of some indefinite elliptic problems

Cites work

• scientific article; zbMATH DE number 554762 (Why is no real title available?)
• scientific article; zbMATH DE number 2161246 (Why is no real title available?)
• A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
• A direct flexibility method
• A method of finite element tearing and interconnecting and its parallel solution algorithm
• Acceleration of convergence of a two-level algorithm by smoothing transfer operators
• Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
• Algorithm 832
• An efficient graph theoretical method for plate bending finite element analysis via force method
• An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics.
• Balancing domain decomposition
• Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
• Computing a Sparse Basis for the Null Space
• Computing an Eigenvector with Inverse Iteration
• Factoring matrices with a tree-structured sparsity pattern
• Mechanism free domain decomposition
• Nested-dissection orderings for sparse LU with partial pivoting
• On the Complexity of Sparse QR and LU Factorization of Finite-Element Matrices
• On the Computation of Null Spaces of Sparse Rectangular Matrices
• On the general solution by a direct method of a large-scale singular system of linear equations: application to the analysis of floating structures
• 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
• Sparse Multifrontal Rank Revealing QR Factorization
• Sparse null basis computations in structural optimization
• Support Theory for Preconditioning
• The Null Space Problem I. Complexity
• The construction of free–free flexibility matrices as generalized stiffness inverses
• The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems
• Using Perturbed QR Factorizations to Solve Linear Least-Squares Problems

Cited in

(3)

• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block
• The null space and non-conventional basis functions in the mixed finite element method
• A Symbolic Approach to Compute a Null-Space Basis in the Projection Method

Describes a project that uses

Uses Software

• ML
• TetGen
• BLOPEX
• UMFPACK
• Matlab

This page was built for publication: Computing the null space of finite element problems

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