LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING

DOI10.1080/10637190208941433zbMath1004.68214OpenAlexW1963985842MaRDI QIDQ4532715

Giorgio Pini

Publication date: 29 October 2002

Published in: Parallel Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10637190208941433

zbMATH Keywords

sparse approximate inverseBi-CGSTAB method

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved iterative optimization technique for the leftmost eigenpairs of large symmetric matrices
• A parallel algorithm for the partial eigensolution of sparse symmetric matrices on the CRAY Y-MP
• Lanczos and Arnoldi methods for the solution of convection-diffusion equations
• The incomplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations
• Complex solution to nonideal contaminant transport through porous media
• A parallel Davidson-type algorithm for several eigenvalues
• Experimental study of ILU preconditioners for indefinite matrices
• Minimal eigenvalue of large sparse matrices by an efficient reverse power-conjugate gradient scheme
• Bifurcation of periodic solutions of the Navier-Stokes equations
• Arnoldi and Crank-Nicolson methods for integration in time of the transport equation
• Fast solution to finite element flow equations by newton iteration and modified conjugate gradient method
• Bi-CGSTAB: A Fast and Smoothly Converging Variant of Bi-CG for the Solution of Nonsymmetric Linear Systems
• A numerical eigenvalue study of preconditioned non-equilibrium transport equations
• Mixed finite elements and Newton-type linearizations for the solution of Richards' equation
• Parallel evaluation of leftmost eigenpairs of large unsymmetric matrices
• Nested Iterations for Symmetric Eigenproblems
• A Parallelizable Eigensolver for Real Diagonalizable Matrices with Real Eigenvalues
• Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
• A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
• Deflation Techniques for an Implicitly Restarted Arnoldi Iteration
• Numerical comparison of preconditionings for large sparse finite element problems
• Eigenproblem solution of damped structural systems
• A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
• A Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
• A Transpose-Free Quasi-Minimal Residual Algorithm for Non-Hermitian Linear Systems
• Solution methods for eigenvalue problems in structural mechanics
• Computational Variants of the Lanczos Method for the Eigenproblem
• Methods of conjugate gradients for solving linear systems

This page was built for publication: LEFTMOST EIGENVALUE OF REAL AND COMPLEX SPARSE MATRICES ON PARALLEL COMPUTER USING APPROXIMATE INVERSE PRECONDITIONING