Computing the null space of finite element problems
type: Item
instance of: scholarly article
title: Computing the null space of finite element problems
zbMATH Open document ID: 1229.74139
author: Gil Shklarski
author: Sivan Toledo
published in: Computer Methods in Applied Mechanics and Engineering
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 74S05
zbMATH DE Number: 5996664
zbMATH Keywords: rigid-body motions
zbMATH Keywords: null space
zbMATH Keywords: linear constraints
zbMATH Keywords: finite element models
zbMATH Keywords: singular linear systems
zbMATH Keywords: fretsaw preconditioner
describes a project that uses: Matlab
describes a project that uses: UMFPACK
describes a project that uses: TetGen
describes a project that uses: ML
describes a project that uses: BLOPEX
MaRDI profile type: Publication
full work available at URL: j.cma.2009.05.012
OpenAlex ID: W2007668648
cites work: Using Perturbed $QR$ Factorizations to Solve Linear Least-Squares Problems
cites work: Q4671207
cites work: Q4288578
cites work: Support Theory for Preconditioning
cites work: Nested-dissection orderings for sparse LU with partial pivoting
cites work: The construction of free–free flexibility matrices as generalized stiffness inverses
cites work: The Null Space Problem I. Complexity
cites work: Mechanism free domain decomposition
cites work: Algorithm 832
cites work: Factoring matrices with a tree-structured sparsity pattern
cites work: The second generation FETI methods and their application to the parallel solution of large-scale linear and geometrically non-linear structural analysis problems
cites work: On the general solution by a direct method of a large-scale singular system of linear equations: application to the analysis of floating structures
cites work: A method of finite element tearing and interconnecting and its parallel solution algorithm
cites work: A direct flexibility method
cites work: On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element Matrices
cites work: Computing a Sparse Basis for the Null Space
cites work: On the Computation of Null Spaces of Sparse Rectangular Matrices
cites work: Ordering techniques for singly bordered block diagonal forms for unsymmetric parallel sparse direct solvers
cites work: Computing an Eigenvector with Inverse Iteration
cites work: An efficient graph theoretical method for plate bending finite element analysis via force method
cites work: Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
cites work: Balancing domain decomposition
cites work: A Scheme for Handling Rank-Deficiency in the Solution of Sparse Linear Least Squares Problems
cites work: An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics.
cites work: Sparse Multifrontal Rank Revealing QR Factorization
cites work: Sparse null basis computations in structural optimization
cites work: Rigidity in Finite-Element Matrices: Sufficient Conditions for the Rigidity of Structures and Substructures
cites work: Acceleration of convergence of a two-level algorithm by smoothing transfer operators
cites work: Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems
DOI: 10.1016/J.CMA.2009.05.012
Recommended article: The null space and non-conventional basis functions in the mixed finite element method
Recommended article: Q3323187
Recommended article: Q3347420
Recommended article: Q4689141
Recommended article: Q3704848
Recommended article: Finite element solution of nonlinear elliptic problems
Recommended article: Q4835008
Recommended article: Q4336433
Recommended article: Finite Elements
Recommended article: Finite element approximation of some indefinite elliptic problems
description: scientific article; zbMATH DE number 5996664