Conditioning analysis of positive definite matrices by approximate factorizations
The conditioning analysis of positive definite matrices by approximate LU factorizations is usually reduced to that of Stieltjes matrices by means of perturbation arguments like spectral equivalence. The authors define ``almost Stieltjes matrices \(A:=A_ 0+A_ 2,\) where \(A_ 0\) is a Stieltjes matrix while \(A_ 2\) is both nonnegative and nonnegative definite. They show that this class of matrices can be used as a reference class for the conditioning analysis. This is advantageous especially for the conditioning analysis of finite element approximations of large multidimensional steady-state diffusion problems.
- The approximate factorization of positive-definite matrix functions
- scientific article; zbMATH DE number 1422832
- Positive definite matrix approximation with condition number constraint
- scientific article; zbMATH DE number 1423788
- Publication:4870391
- Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
- scientific article; zbMATH DE number 1924346
- Approximation schemes for functions of positive-definite matrix values
- On the conditioning analysis of block approximate factorization methods
- A factorization method for completely positive matrices
- A class of first order factorization methods
- A generalized SSOR method
- scientific article; zbMATH DE number 3854346 (Why is no real title available?)
- scientific article; zbMATH DE number 3816913 (Why is no real title available?)
- Lower eigenvalue bounds for pencils of matrices
- On Axelsson's perturbations
- Upper eigenvalue bounds for pencils of matrices
- On the conditioning analysis of block approximate factorization methods
- Conditioning analysis of modified block incomplete factorizations
- Conditioning analysis of sparse block approximate factorizations
- Lower eigenvalue bounds for singular pencils of matrices
- Conditioning of Stieltjes matrices by S/P consistently ordered approximate factorizations
- Analytical bounds for block approximate factorization methods
- Approximate factorizations with S/P consistently ordered M-factors
- Incomplete factorizations of singular linear systems
- Graph perturbations
- Analog approach for the eigen-decomposition of positive definite matrices
- Iterative solution methods
- Solving systems of elastic bar structures by preconditioned conjugate gradient method
- Raffinement de la borne spectrale d'un faisceau de matrices
- On the robustness of modified incomplete factorization methods
- Preconditioning methods for very ill-conditioned three-dimensional linear elasticity problems
- scientific article; zbMATH DE number 741118 (Why is no real title available?)
- HIGH-PERFORMANCE PCG SOLVERS FOR FEM STRUCTURAL ANALYSIS
- scientific article; zbMATH DE number 1422832 (Why is no real title available?)
- Numerical experiences of solving elasticity systems by PCG methods.
- Special issue: Numerical methods and computational mechanics. Selected papers from the Eighth international conference (NMCM98), Miskolc, Hungary, August 24--27, 1998
- Modified block-approximate factorization strategies
This page was built for publication: Conditioning analysis of positive definite matrices by approximate factorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124278)
