Pages that link to "Item:Q4895598"

The following pages link to A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method (Q4895598):

Displaying 50 items.

• Towards Monte Carlo preconditioning approach and hybrid Monte Carlo algorithms for matrix computations (Q2006553) (← links)
• Efficient solution of time-fractional differential equations with a new adaptive multi-term discretization of the generalized Caputo-Dzherbashyan derivative (Q2009757) (← links)
• A generalization of the optimal diagonal approximate inverse preconditioner (Q2013784) (← links)
• Optimized sparse approximate inverse smoothers for solving Laplacian linear systems (Q2093517) (← links)
• Scalable preconditioning for the stabilized contact mechanics problem (Q2137954) (← links)
• A null-space approach for large-scale symmetric saddle point systems with a small and non zero \((2, 2)\) block (Q2159428) (← links)
• Supporting theory for a block approximate inverse preconditioner (Q2229496) (← links)
• Superresolution image reconstruction using fast inpainting algorithms (Q2371326) (← links)
• Robust dropping criteria for F-norm minimization based sparse approximate inverse preconditioning (Q2434936) (← links)
• Superoptimal approximation for unbounded symbols (Q2465322) (← links)
• Parallel preconditioned conjugate gradient optimization of the Rayleigh quotient for the solution of sparse eigenproblems (Q2493739) (← links)
• A class of incomplete orthogonal factorization methods. II: Implemetation and results (Q2568630) (← links)
• AINV and BILUM preconditioning techniques (Q2571679) (← links)
• Approximate inverse preconditioner by computing approximate solution of Sylvester equation (Q2573571) (← links)
• Estimates of the \(l_2\) norm of the error in the conjugate gradient algorithm (Q2583220) (← links)
• A scalable preconditioning framework for stabilized contact mechanics with hydraulically active fractures (Q2671394) (← links)
• Robust approximate inverse preconditioning for the conjugate gradient method (Q2706438) (← links)
• Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency (Q2760369) (← links)
• Iterative solutions methods for elasticity equations in mechanics and biomechanics, IMMB'98: Part 2. (Q2760375) (← links)
• The convergence rate and complexity fo explicit preconditioned conjugate gradient methods based on approximate inverse banded matrix techniques (Q2784157) (← links)
• A sparse approximate inverse preconditioner for nonsymmetric linear systems (Q2815637) (← links)
• Factorized approximate inverses with adaptive dropping (Q2815689) (← links)
• Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations (Q2831075) (← links)
• An Algorithm for solving Equation Set Based on Approximate Inverse (Q2831811) (← links)
• Three optimization models for multisplitting preconditioner (Q2846486) (← links)
• Divide and conquer low-rank preconditioners for symmetric matrices (Q2855656) (← links)
• A sparse approximate inverse preconditioner for nonsymmetric positive definite matrices (Q2868952) (← links)
• Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method (Q2901137) (← links)
• Implicit purification for temperature-dependent density matrices (Q2901553) (← links)
• Schur complement-based domain decomposition preconditioners with low-rank corrections (Q2955978) (← links)
• Localization in Matrix Computations: Theory and Applications (Q2971627) (← links)
• A power sparse approximate inverse preconditioning procedure for large sparse linear systems (Q3011675) (← links)
• Incremental incomplete LU factorizations with applications (Q3090800) (← links)
• Factorized parallel preconditioner for the saddle point problem (Q3098465) (← links)
• Algorithms for construction of preconditioners based on incomplete block-factorizations of the matrix (Q3197194) (← links)
• Efficient Preconditioner Updates for Semilinear Space–Time Fractional Reaction–Diffusion Equations (Q3294697) (← links)
• On Monte Carlo and Quasi-Monte Carlo for Matrix Computations (Q3297445) (← links)
• On the Preconditioned Quasi-Monte Carlo Algorithm for Matrix Computations (Q3304776) (← links)
• A new approximate inverse preconditioner based on the Vaidya’s maximum spanning tree for matrix equation AXB = C (Q3389578) (← links)
• Preconditioners for the conjugate gradient algorithm using Gram–Schmidt and least squares methods (Q3438806) (← links)
• ILU preconditioning based on the FAPINV algorithm (Q3459016) (← links)
• A Factored Sparse Approximate Inverse Preconditioned Conjugate Gradient Solver on Graphics Processing Units (Q3464428) (← links)
• An assessment of some preconditioning techniques in shell problems (Q4225901) (← links)
• An Efficient Solver for Multi--Right-Hand-Side Linear Systems Based on the CCCG($\eta$) Method with Applications to Implicit Time-Dependent Partial Differential Equations (Q4389232) (← links)
• Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques (Q4389261) (← links)
• Approximate Inverse Preconditioners for the Conjugate Gradient Method (Q4531367) (← links)
• LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING (Q4532715) (← links)
• A Novel Algebraic Multigrid Approach Based on Adaptive Smoothing and Prolongation for Ill-Conditioned Systems (Q4646457) (← links)
• Numerical performance of preconditioning techniques for the solution of complex sparse linear systems (Q4795134) (← links)
• A robust AINV-type method for constructing sparse approximate inverse preconditioners in factored form. (Q4814579) (← links)