Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.05254

Nonlinear static isogeometric analysis of arbitrarily curved Kirchhoff-Love shells

G. Radenković·A. Borković·B. Marussig
View original source ↗Read source document ↗Export metadata ↓

Abstract

The geometrically rigorous nonlinear analysis of elastic shells is considered in the context of finite, but small, strain theory. The research is focused on the introduction of the full shell metric and examination of its influence on the nonlinear structural response. The exact relation between the reference and equidistant strains is employed and the complete analytic elastic constitutive relation between energetically conjugated forces and strains is derived via the reciprocal shift tensor. Utilizing these strict relations, the geometric stiffness matrix is derived explicitly by the variation of the unknown metric. Moreover, a compact form of this matrix is presented. Despite the linear displacement distribution due to the Kirchhoff-Love hypothesis, a nonlinear strain distribution arises along the shell thickness. This fact is sometimes disregarded for the nonlinear analysis of thin shells based on the initial geometry, thereby ignoring the strong curviness of a shell at some subsequent configuration. We show that the curviness of a shell at each configuration determines the appropriate shell formulation. For shells that become strongly curved at some configurations during deformation, the nonlinear distribution of strain throughout the thickness must be considered in order to obtain accurate results. We investigate four computational models: one based on the full analytical constitutive relation, and three simplified ones. Robustness, efficiency and accuracy of the presented formulation are examined via selected numerical experiments. Our main finding is that the employment of the full metric is often required when the complete response of the shells is sought, even for the initially thin shells. Finally, the simplified model that provided the best balance between efficiency and accuracy is suggested for the nonlinear analysis of strongly curved shells.

Explore related subjects

math.NAcs.CEcs.NA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Radenković, A. Borković, B. Marussig. 2021-01-20. Nonlinear static isogeometric analysis of arbitrarily curved Kirchhoff-Love shells. https://doi.org/10.1016/j.cma.2014.12.013

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

How many continuous measurements are needed to learn a vector?

One can recover vectors from $\mathbb{R}^m$ with arbitrary precision, using only $\lceil \log_2(m)\rceil +1$ continuous measurements that are chosen adaptively. This surprising result is explained and discussed, and we present applications to infinite-dimensional approximation problems.

math.NA↗
arXiv2026

IterativeCUR: Large Rank-Adaptive Approximation From a Small Recycled Sketch

The computation of accurate low-rank matrix approximations is central to improving the scalability of various techniques in machine learning, uncertainty quantification, and control. Traditionally, low-rank approximations are constructed using SVD-based approaches such as truncated SVD or Randomized SVD. Although these SVD approaches---especially Randomized SVD---have proven to be very computationally efficient, other low-rank approximation methods can offer even greater performance. One such approach is the CUR decomposition, which forms a low-rank approximation using direct row and column subsets of a matrix. Because CUR uses direct matrix subsets, it is also often better able to preserve native matrix structures like sparsity or non-negativity than SVD-based approaches and can facilitate data interpretation in many contexts. This paper introduces IterativeCUR, which draws on previous work in randomized numerical linear algebra to build a new algorithm that is highly competitive compared to prior work. IterativeCUR is adaptive in the sense that it takes as an input parameter the desired tolerance $ε$ and outputs (with arbitrarily high probability) an approximation of error bounded by $ε$, rather than requiring an a priori guess of the numerical rank. IterativeCUR typically runs significantly faster than both existing CUR algorithms and techniques such as Randomized SVD. Its asymptotic complexity is $\mathcal{O}(mn + (m+n)r^2)$ for an $m\times n$ matrix of output rank $r$. IterativeCUR relies on a single small sketch from the matrix that is successively downdated as the algorithm proceeds. We demonstrate through extensive experiments that IterativeCUR achieves up to $4\times$ speed-up over state-of-the-art pivoting-on-sketch approaches with no loss of accuracy, and up to $40\times$ speed-up over rank-adaptive randomized SVD approaches.

math.NA↗
arXiv2026

Multigrid with Linear Storage Complexity

As the discretization error for the solution of a partial differential equation (PDE) decreases, the precision required to store the corresponding coefficients naturally increases. Storing the solution's finite element coefficients explicitly requires $\mathcal O(n \log n)$ bits of storage, where $n$ is the number of degrees of freedom (DoFs). This paper presents a full multigrid method to compute the solution in a compressed format that reduces the storage complexity of the solution and intermediate vectors to $\mathcal O(n)$ bits. This reduction allows a matrix-free implementation to solve elliptic PDEs with an overall linear space complexity. For problems limited by the memory capacity of current supercomputers, we expect a memory footprint reduction of about an order of magnitude compared to state-of-the-art mixed-precision methods. We demonstrate the applicability of our algorithm by solving two model problems. Depending on the PDE and polynomial degree, but irrespective of the problem size, the solution vector on the finest grid requires between 4 and 12 bits per DoF, and the residual and correction require 3 to 6 bits each. Additional data is stored on the coarse grids with modestly increasing bit widths toward coarser grids.

math.NA↗