Nonlinear algebraic multigrid for constrained solid mechanics problems using Trilinos
Michael W. Gee,Raymond S. Tuminaro +1 more
- 01 Apr 2006
TL;DR: This paper focuses on a variational nonlinear multigrid approach that adopts the smoothed aggregation algebraic multi grid method to generate a hierachy of coarse grids in a purely algebraic manner.
read more
Abstract: The application of the finite element method to nonlinear solid mechanics problems results in the neccessity to repeatedly solve a lar ge nonlinear set of equations. In this paper we limit ourself to problems arising in constrained solid mechanics problems. It is common to apply some variant of Newton’ s method or a Newton‐ Krylov method to such problems. Often, an analytic Jacobian matrix is formed and used in the above mentioned methods. However, if no analytic Jacobian is given, Newton methods might not be the method of choice. Here, we focus on a variational nonlinear multigrid approach that adopts the smoothed aggregation algebraic multi grid method to generate a hierachy of coarse grids in a purely algebraic manner . We use preconditioned nonlinear conjugent gradient methods and/or quasi‐Newton methods as nonlinear smoothers on fine and coarse grids. In addition we discuss the possibility to augment this basic algorithm with an automatically generated Jacobian by applying a block colored finite dif ferencing scheme. After outlining the fundamental algorithms we give some examples and provide documentation for the parallel implementation of the described method within the Trilinos framework.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Smoothed aggregation multigrid for cloth simulation
Rasmus Tamstorf,Toby Jones,Stephen F. McCormick +2 more
- 26 Oct 2015
TL;DR: The algebraic multigrid method known as smoothed aggregation, agnostic to the underlying tessellation, which can even vary over time, is applied to cloth simulation, and it only requires the user to provide a fine-level mesh.
99
Computational fluid dynamics based numerical study to determine the performance of triangular solar air heater duct having perforated baffles in V-down pattern mounted underneath absorber plate
Sachin Faujdar,Muskan Agrawal +1 more
TL;DR: In this article, the effect of perforated baffles in V-down pattern as artificial roughness on the thermal and hydraulic response of a solar air heater having equilateral triangular passage has been examined.
23
Subdivision-Based Nonlinear Multiscale Cloth Simulation
TL;DR: The mechanical behavior of cloth objects can be modeled by the Kirchhoff method and it is shown that cloth simulation is an important topic for many applications in computer graphics, animation, and augmented virtual reality.
16
A point collocation method for geometrically nonlinear membranes
Kyle F. Kolsti,Donald L. Kunz +1 more
TL;DR: The scheme has several features not commonly seen in structural finite element analysis: the point collocation method, group formulation, and a staggered mesh, and was suitable for accurately predicting sub-hyperelastic deformations.
5
Patent
Algebraic multigrid method for cloth simulation
Rasmus Tamstorf,Tobias Jones,Stephen F. McCormick +2 more
- 01 Jun 2016
TL;DR: In this paper, a method and system for simulation of deformation of a thin-shelled member are presented, which includes information identifying a discretization of the computer-generated object.
4
References
•Book
Practical Methods of Optimization
Roger Fletcher
- 01 Jan 2009
TL;DR: The aim of this book is to provide a Discussion of Constrained Optimization and its Applications to Linear Programming and Other Optimization Problems.
9.3K
Multi-level adaptive solutions to boundary-value problems
TL;DR: In this paper, the boundary value problem is discretized on several grids (or finite-element spaces) of widely different mesh sizes, and interactions between these levels enable us to solve the possibly nonlinear system of n discrete equations in 0(n) operations (40n additions and shifts for Poisson problems); and conveniently adapt the discretization (the local mesh size, local order of approximation, etc.) to the evolving solution in a nearly optimal way, obtaining "°°-order" approximations and low n, even when singularities are present.
An Introduction to the Conjugate Gradient Method Without the Agonizing Pain
Jonathan Richard Shewchuk
- 01 Mar 1994
TL;DR: The Conjugate Gradient Method as discussed by the authors is the most prominent iterative method for solving sparse systems of linear equations and is a composite of simple, elegant ideas that almost anyone can understand.
A multigrid tutorial: second edition
William L. Briggs,Van Emden Henson,Steve F. McCormick +2 more
- 01 Jun 2000
1.5K