Pages that link to "Item:Q3880191"
From MaRDI portal
The following pages link to Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients (Q3880191):
Displayed 28 items.
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors (Q579835) (← links)
- The importance of structure in incomplete factorization preconditioners (Q634121) (← links)
- The use of second degree normalized implicit conjugate gradient methods for solving large sparse systems of linear equations (Q796248) (← links)
- Solving linear finite element systems by normalized approximate matrix factorization semi-direct methods (Q1056207) (← links)
- Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems (Q1056521) (← links)
- A survey of the advances in the exploitation of the sparsity in the solution of large problems (Q1099926) (← links)
- Towards a cost-effective ILU preconditioner with high level fill (Q1198973) (← links)
- A chordal preconditioner for large-scale optimization (Q1262220) (← links)
- Implementation strategies for block recursive factorizations (Q1305155) (← links)
- Construction and efficient implementation of implicit preconditioning methods. II (Q1325303) (← links)
- Construction and efficient implementation of implicit preconditioning methods. I (Q1325450) (← links)
- Explicit preconditioned iterative methods for solving large unsymmetric finite element systems (Q1345431) (← links)
- Experimental study of ILU preconditioners for indefinite matrices (Q1379014) (← links)
- Explicit approximate inverse preconditioning techniques (Q1396235) (← links)
- \(LU\)-decomposition and numerical structure for solving large sparse nonsymmetric linear systems (Q1609048) (← links)
- An efficient method for constructing an ILU preconditioner for solving large sparse nonsymmetric linear systems by the GMRES method (Q1827264) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- Local Procrustes for manifold embedding: a measure of embedding quality and embedding algorithms (Q1959518) (← links)
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods (Q2643622) (← links)
- (Q2760356) (← links)
- A multiplicative Schwarz method with active subdomains for transient convection–diffusion problems (Q3075961) (← links)
- Optimization of unconstrained functions with sparse hessian matrices-newton-type methods (Q3324531) (← links)
- Specifying a Gaussian Markov Random Field by a Sparse Cholesky Triangle (Q3378032) (← links)
- Implementing cholesky factorization for interior point methods of linear programming (Q3835659) (← links)
- Drop tolerance preconditioning for incompressible viscous flow (Q4021072) (← links)
- Splitting dense columns of constraint matrix in interior point methods for large scale linear programming<sup>1</sup><sup>1</sup>The results discussed in the paper have been obtained when the author was staying at LAMSADE, University of Paris Dauphine, Pl (Q4327921) (← links)
- Efficient Solution of a Sparse Non-symmetric System of Linear Equations (Q4531360) (← links)
- A robust ILU with pivoting based on monitoring the growth of the inverse factors (Q5955657) (← links)