scientific article
From MaRDI portal
Publication:2760344
DOI<109::AID-NLA150>3.0.CO;2-0 10.1002/(SICI)1099-1506(199903)6:2<109::AID-NLA150>3.0.CO;2-0zbMath0982.65055MaRDI QIDQ2760344
Publication date: 19 December 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmnumerical experimentsefficiencypreconditioningconjugate gradient methodaugmented LagrangianSSORsymmetric successive overrelaxationsymmetric positive definiteincomplete factorizationpenalized matrix
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20)
Related Items (13)
Mixed constraint preconditioning in computational contact mechanics ⋮ An optimal algorithm for bound and equality constrained quadratic programming problems with bounded spectrum ⋮ Optimal iterative QP and QPQC algorithms ⋮ On R-linear convergence of semi-monotonic inexact augmented Lagrangians for saddle point problems ⋮ An optimal algorithm for a class of equality constrained quadratic programming problems with bounded spectrum ⋮ A contact algorithm for voxel-based meshes using an implicit boundary representation ⋮ Theoretically supported scalable BETI method for variational inequalities ⋮ FETI-based algorithms for modelling of fibrous composite materials with debonding ⋮ Duality-based domain decomposition with natural coarse-space for variational inequalities ⋮ FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction ⋮ Semi-monotonic inexact augmented Lagrangians for quadratic programing with equality constraints ⋮ Solution of contact problems by FETI domain decomposition with natural coarse space projections ⋮ Scalability and FETI based algorithm for large discretized variational inequalities
This page was built for publication:
