Scalable Total BETI based algorithm for 3D coercive contact problems of linear elastostatics

Authors:
J. Bouchala;Z. Dostál;M. Sadowská
Affiliations:
VŠB, Technical University of Ostrava, Department of Applied Mathematics, Ostrava, Czech Republic;VŠB, Technical University of Ostrava, Department of Applied Mathematics, Ostrava, Czech Republic;VŠB, Technical University of Ostrava, Department of Applied Mathematics, Ostrava, Czech Republic
Venue:
Computing
Year:
2009

Citing 21
Cited 1

A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds

SIAM Journal on Numerical Analysis
An unconventional domain decomposition method for an efficient parallel solution of large-scale finite element systems

SIAM Journal on Scientific and Statistical Computing - Special issue on iterative methods in numerical linear algebra
Iterative solution methods

Iterative solution methods
Solving the Signorini problem on the basis of domain decomposition techniques

Computing
A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices

Computing
A symmetric boundary method for contact problems with friction

Mathematics and Computers in Simulation - Special issue from IMACS sponsored conference: “Modelling '98”
Duality-based domain decomposition with natural coarse-space for variational inequalities0

Journal of Computational and Applied Mathematics
Scalability and FETI based algorithm for large discretized variational inequalities

Mathematics and Computers in Simulation - MODELLING 2001 - Second IMACS conference on mathematical modelling and computational methods in mechanics, physics, biomechanics and geodynamics
Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints

SIAM Journal on Optimization
Adaptive low-rank approximation of collocation matrices

Computing
Monotone Multigrid Methods on Nonmatching Grids for Nonlinear Multibody Contact Problems

SIAM Journal on Scientific Computing
Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination

Computational Optimization and Applications
An Optimal Algorithm for Bound and Equality Constrained Quadratic Programming Problems with Bounded Spectrum

Computing
The Fast Solution of Boundary Integral Equations (Mathematical and Analytical Techniques with Applications to Engineering)

The Fast Solution of Boundary Integral Equations (Mathematical and Analytical Techniques with Applications to Engineering)
Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities

SIAM Journal on Numerical Analysis
Applications of a fast multipole Galerkin in boundary element method in linear elastostatics

Computing and Visualization in Science
Theoretically supported scalable BETI method for variational inequalities

Computing
Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities

Optimal Quadratic Programming Algorithms: With Applications to Variational Inequalities
A scalable FETI-DP algorithm for a coercive variational inequality

Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
Adaptive hp-versions of BEM for Signorini problems

Applied Numerical Mathematics - Selected papers from the 16th Chemnitz finite element symposium 2003
Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints

Computational Optimization and Applications

An Optimal Algorithm for Minimization of Quadratic Functions with Bounded Spectrum Subject to Separable Convex Inequality and Linear Equality Constraints

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A Total BETI (TBETI) based domain decomposition algorithm with the preconditioning by a natural coarse grid of the rigid body motions is adapted for the solution of contact problems of linear elastostatics and proved to be scalable for the coercive problems, i.e., the cost of the solution is asymptotically proportional to the number of variables. The analysis is based on the original results by Langer and Steinbach on the scalability of BETI for linear problems and our development of optimal quadratic programming algorithms for bound and equality constrained problems. Both theoretical results and numerical experiments indicate a high efficiency of the algorithms presented.