Linear systems with a large number of sparse constraints with applications to incompressible materials
From MaRDI portal
Publication:1241109
DOI10.1016/0045-7825(77)90036-6zbMath0364.73069OpenAlexW2001320870MaRDI QIDQ1241109
Publication date: 1977
Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0045-7825(77)90036-6
Related Items
Finite element analyses of three-dimensional fully plastic solutions using quasi-nonsteady algorithm and tetrahedral elements, A numerical procedure for a nonlinear elastic problem for incompressible material based on a perturbation method, On accurate stress calculation in static and dynamic problems using the natural factor approach, On the numerical solution of the Stokes equations using the finite element method, Recent finite element studies in plasticity and fracture mechanics, On Penalty methods for interelement constraints, Isochoric constant strain finite elements, A finite element method for plane strain deformations of incompressible solids, Mixed finite element methods - reduced and selective integration techniques: a unification of concepts, Numerical solution of transient nonlinear problems, Note on large strain applications of modified constant strain finite elements, Finite element method - The natural approach, The use of optimization techniques in the analysis of cracked members by the finite element displacement and stress methods, Neural network‐based parameter estimation for non‐linear finite element analyses
Cites Work
- The economical storage of plane rotations
- On numerically accurate finite element solutions in the fully plastic range
- Large natural strains and some special difficulties due to non-linearity and incompressibility in finite elements
- Computational aspects of F. L. Bauer's simultaneous iteration method
- Note on symmetric decomposition of some special symmetric matrices
- Non-linear oscillations using the finite element technique
- A criterion for truncation of theQR-decomposition algorithm for the singular linear least squares problem
- Least Squares Computations by Givens Transformations Without Square Roots
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item