Sparse null basis computations in structural optimization
From MaRDI portal
Publication:1115103
DOI10.1007/BF01398913zbMath0664.65040MaRDI QIDQ1115103
Publication date: 1989
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133368
bipartite graphstructural optimizationmatchingfinite elementsparse matrixstructure graphequilibrium graphforce methodequilibrium matricesrigid joined skeletal structuressparse null basestriangular algorithm
Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Optimization problems in solid mechanics (74P99)
Related Items
A new four-node quadrilateral plate bending element for highly sparse and banded flexibility matrices, An efficient graph‐theoretical force method for three‐dimensional finite element analysis, Sparsity and Nullity: Paradigms for Analysis Dictionary Learning, A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block, Efficient finite element analysis of models comprised of higher order triangular elements, An orthogonal self-stress matrix for efficient analysis of cyclically symmetric space truss structures via force method, Computing the null space of finite element problems, Efficient finite element analysis using graph-theoretical force method; rectangular plane stress and plane strain Lagrange family elements, Construction of null bases for the divergence operator associated with incompressible Navier-Stokes equations, Damage Identification of Truss Structures Based on Force Method, An efficient graph theoretical method for plate bending finite element analysis via force method, Efficient graph-theoretical force method for two-dimensional rectangular finite element analysis
Cites Work
- Unnamed Item
- An algorithm to compute a sparse basis of the null space
- A combinatorial optimization problem: optimal generalized cycle bases
- Sparse Orthogonal Schemes for Structural Optimization Using the Force Method
- The Dual Variable Method for the Solution of Compressible Fluid Flow Problems
- The Null Space Problem I. Complexity
- A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
- Computing a Sparse Basis for the Null Space
- The Null Space Problem II. Algorithms
- Algorithms for Generating Fundamental Cycles in a Graph
- Cycle bases for the flexibility analysis of structures
- A Problem in Applied Topology: on the Selection of Cycles for the Flexibility Analysis of Skeletal Structures