Cholesky decomposition of a positive semidefinite matrix with known kernel
DOI10.1016/J.AMC.2010.12.069zbMATH Open1211.65034OpenAlexW1984637275MaRDI QIDQ632820FDOQ632820
Authors: Z. Dostál, T. Kozubek, A. Markopoulos, Martin Menšík 
Publication date: 28 March 2011
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2010.12.069
Recommendations
- scientific article
- A direct proof for the matrix decomposition of chordal-structured positive semidefinite matrices
- scientific article; zbMATH DE number 4189084
- Cholesky factorization of semidefinite Toeplitz matrices
- On Positive Semidefinite Matrices with Known Null Space
- On positive semidefinite modification schemes for incomplete Cholesky factorization
- A Cholesky LR algorithm for the positive definite symmetric diagonal-plus-semiseparable eigenproblem
- Cholesky decomposition of the Hilbert matrix
- An incomplete Cholesky factorization for dense symmetric positive definite matrices
- Positive definite Hankel matrices using Cholesky factorization
Cholesky decompositionnumerical experimentsgeneralized inverselarge sparse matrixsymmetric positive semidefinite matrix
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Positive matrices and their generalizations; cones of matrices (15B48)
Cites Work
- Algorithm 837
- FETI-DP: A dual-prime unified FETI method. I: A faster alternative to the two-level FETI method
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- FETI based algorithms for contact problems: Scalability, large displacements and 3D Coulomb friction
- Scalable TFETI algorithm for the solution of multibody contact problems of elasticity
- On the Finite Element Solution of the Pure Neumann Problem
- Optimal quadratic programming algorithms. With applications to variational inequalities
- A formulation of general shell elements—the use of mixed interpolation of tensorial components
- On the existence and computation of rank-revealing LU factorizations
- A refined four-noded membrane element with rotational degrees of freedom
- Total FETI-an easier implementable variant of the FETI method for numerical solution of elliptic PDE
- Generalized Inverse Formulas Using the Schur Complement
- On the general solution by a direct method of a large-scale singular system of linear equations: application to the analysis of floating structures
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- BETI methods of domain decomposition with fast boundary element procedures and applications.
- Title not available (Why is that?)
- Theoretically supported scalable BETI method for variational inequalities
- An algorithm for profile and wavefront reduction of sparse matrices
- An algebraically partitioned FETI method for parallel structural analysis: performance evaluation
- Theoretically Supported Scalable FETI for Numerical Solution of Variational Inequalities
- An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics.
Cited In (13)
- On favorable bounds on the spectrum of discretized Steklov-Poincaré operator and applications to domain decomposition methods in 2D
- Parallel implementation of total-FETI DDM with application to medical image registration
- On large-scale generalized inverses in solving two-by-two block linear systems
- Domain decomposition methods and acceleration techniques for the phase field fracture staggered solver
- Development of Cholesky decomposition
- Solving Contact Mechanics Problems with PERMON
- Efficient implementation of total FETI solver for graphic processing units using Schur complement
- Treatment of singular matrices in the hybrid total FETI method
- On the use of graph centralities to compute generalized inverse of singular finite element operators: Applications to the analysis of floating substructures
- Cholesky decomposition with fixing nodes to stable computation of a generalized inverse of the stiffness matrix of a floating structure
- The impact of enabling multiple subdomains per MPI process in the TFETI domain decomposition method
- On Positive Semidefinite Matrices with Known Null Space
- Engineering Multibody Contact Problems Solved by Scalable TBETI
Uses Software
This page was built for publication: Cholesky decomposition of a positive semidefinite matrix with known kernel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632820)
