Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities
DOI10.1007/S11075-022-01281-3zbMATH Open1502.65198OpenAlexW4223925419MaRDI QIDQ2674580FDOQ2674580
Authors: David Horák, Jakub Kružík, T. Brzobohatý, Oldřich Vlach, Z. Dostál 
Publication date: 14 September 2022
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-022-01281-3
Recommendations
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- Scalability and FETI based algorithm for large discretized variational inequalities
- Scalable BETI for variational inequalities
- Scalable FETI with optimal dual penalty for a variational inequality
- A scalable FETI-DP algorithm for a coercive variational inequality
Parallel numerical computation (65Y05) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Unilateral problems for linear elliptic equations and variational inequalities with linear elliptic operators (35J86) Numerical methods for variational inequalities and related problems (65K15) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50) PDE constrained optimization (numerical aspects) (49M41)
Cites Work
- Solution of variational inequalities in mechanics
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Title not available (Why is that?)
- Iterative Solution Methods
- Dual-primal FETI methods for linear elasticity
- A method of finite element tearing and interconnecting and its parallel solution algorithm
- Title not available (Why is that?)
- Highly scalable parallel domain decomposition methods with an application to biomechanics
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- On the decrease of a quadratic function along the projected-gradient path
- Conjugate gradient method with preconditioning by projector
- FETI-DP, BDDC, and block Cholesky methods
- Augmented Lagrangians with Adaptive Precision Control for Quadratic Programming with Simple Bounds and Equality Constraints
- An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum
- Optimal quadratic programming algorithms. With applications to variational inequalities
- The condition number of the Schur complement in domain decomposition
- A proportioning based algorithm with rate of convergence for bound constrained quadratic programming
- Scalable algorithms for contact problems
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- A Parallel Implementation of Dual‐Primal FETI Methods for Three‐Dimensional Linear Elasticity Using a Transformation of Basis
- Finite and boundary element tearing and interconnecting solvers for multiscale problems
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- An Unconventional Domain Decomposition Method for an Efficient Parallel Solution of Large-Scale Finite Element Systems
- Projector preconditioning and transformation of basis in FETI-DP algorithms for contact problems
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Toward Extremely Scalable Nonlinear Domain Decomposition Methods for Elliptic Partial Differential Equations
- Reorthogonalization‐based stiffness preconditioning in FETI algorithms with applications to variational inequalities
- Two domain decomposition methods for auxiliary linear problems of a multibody elliptic variational inequality
- On conditioning of Schur complements of H-TFETI clusters for 2D problems governed by Laplacian.
- An accelerated augmented Lagrangian algorithm with adaptive orthogonalization strategy for bound and equality constrained quadratic programming and its application to large-scale contact problems of elasticity
- Schur complement spectral bounds for large hybrid FETI-DP clusters and huge three-dimensional scalar problems
- A hybrid approach to 3‐level FETI
- Bounds on the spectra of Schur complements of large H‐TFETI‐DP clusters for 2D Laplacian
Cited In (5)
- On favorable bounds on the spectrum of discretized Steklov-Poincaré operator and applications to domain decomposition methods in 2D
- Scalability and FETI based algorithm for large discretized variational inequalities
- On the spectrum of Schur complements of 2D elastic clusters joined by rigid edge modes and hybrid domain decomposition
- Duality-based domain decomposition with natural coarse-space for variational inequalities
- Hybrid TFETI domain decomposition with the clusters joined by faces' rigid modes for solving huge 3D elastic problems
Uses Software
This page was built for publication: Highly scalable hybrid domain decomposition method for the solution of huge scalar variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2674580)
