JADAMILU: a software code for computing selected eigenvalues of large sparse symmetric matrices
From MaRDI portal
Publication:710112
DOI10.1016/j.cpc.2007.08.004zbMath1196.65072OpenAlexW2143258955MaRDI QIDQ710112
Yvan Notay, Matthias Bollhöfer
Publication date: 18 October 2010
Published in: Computer Physics Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cpc.2007.08.004
preconditioningsparse matricesnumerical softwareeigenvalue computation\texttt{JADAMILU}discrete energy statesJacobi-davidson
Computational methods for sparse matrices (65F50) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Packaged methods for numerical algorithms (65Y15)
Related Items
Increasing the Performance of the Jacobi--Davidson Method by Blocking, A hybrid Jacobi-Davidson method for interior cluster eigenvalues with large null-space in three dimensional lossless drude dispersive metallic photonic crystals, Accelerating Convergence by Augmented Rayleigh--Ritz Projections For Large-Scale Eigenpair Computation, \(\text{He}^{3+}_{2}\) and \(\text{HeH}^{2+}\) molecular ions in a strong magnetic field: The Lagrange-mesh approach, Low-dimensional life of critical Anderson electron, On optimizing Jacobi-Davidson method for calculating eigenvalues in low dimensional structures using eight band \(\mathbf{k}\cdot\mathbf{p}\) model, The Lagrange-mesh method, Numerical studies for localization-delocalization transition in vibrational spectra, A Parallel Implementation of the Jacobi-Davidson Eigensolver for Unsymmetric Matrices, A Thick-Restart Lanczos Algorithm with Polynomial Filtering for Hermitian Eigenvalue Problems, JADAMILU, The Eigenvalues Slicing Library (EVSL): Algorithms, Implementation, and Software, Feast Eigensolver for Non-Hermitian Problems, An Efficient Gauss--Newton Algorithm for Symmetric Low-Rank Product Matrix Approximations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- PRIMME
- Numerical simulation of three dimensional pyramid quantum dot
- Basis selection in LOBPCG
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Improved algorithms for the lowest few eigenvalues and associated eigenvectors of large matrices
- The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices
- Efficient expansion of subspaces in the Jacobi-Davidson method for standard and generalized eigenproblems
- Restarting techniques for the (Jacobi-)Davidson symmetric eigenvalue method
- A Davidson program for finding a few selected extreme eigenpairs of a large, sparse, real, symmetric matrix
- Computing eigenvalues occurring in continuation methods with the Jacobi-Davidson QZ method
- Computational experience with sequential and parallel, preconditioned Jacobi--Davidson for large, sparse symmetric matrices
- Numerical methods for semiconductor heterostructures with band nonparabolicity
- New methods for calculations of the lowest eigenvalues of the real symmetric generalized eigenvalue problem
- Preconditioning eigenvalues and some comparison of solvers
- Preconditioning techniques for large linear systems: A survey
- Software for simplified Lanczos and QMR algorithms
- Robust preconditioning of large, sparse, symmetric eigenvalue problems
- Jacobi-Davidson algorithm and its application to modeling RF-microwave detection circuits
- Eigenmode solution of 2-D and 3-D electromagnetic cavities containing absorbing materials using the Jacobi-Davidson algorithm
- A finite integration method for conformal, structured-grid, electromagnetic simulation
- Iterative projection methods for computing relevant energy states of a quantum dot
- Preconditioning Highly Indefinite and Nonsymmetric Matrices
- Matrix Algorithms
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Large-Scale Normal Coordinate Analysis for Molecular Structures
- On Large-Scale Diagonalization Techniques for the Anderson Model of Localization
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- The Jacobi-Davidson method
- Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices
- An Incomplete Factorization Technique for Positive Definite Linear Systems
- Jacobi--Davidson Style QR and QZ Algorithms for the Reduction of Matrix Pencils
- Asymptotic Convergence of Conjugate Gradient Methods for the Partial Symmetric Eigenproblem
- ARPACK Users' Guide
- Quadratic Residual Bounds for the Hermitian Eigenvalue Problem
- Convergence Analysis of Inexact Rayleigh Quotient Iteration
- A Jacobi--Davidson Iteration Method for Linear Eigenvalue Problems
- Templates for the Solution of Algebraic Eigenvalue Problems
- Is Jacobi--Davidson Faster than Davidson?
- Preconditioning the Lanczos Algorithm for Sparse Symmetric Eigenvalue Problems
- The Design and Use of Algorithms for Permuting Large Entries to the Diagonal of Sparse Matrices
- An Approximate Minimum Degree Ordering Algorithm
- Iterative Krylov Methods for Large Linear Systems
- A Jacobi–Davidson Iteration Method for Linear Eigenvalue Problems
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- Combination of Jacobi–Davidson and conjugate gradients for the partial symmetric eigenproblem
- Nearly Optimal Preconditioned Methods for Hermitian Eigenproblems under Limited Memory. Part I: Seeking One Eigenvalue
- Multilevel Preconditioners Constructed From Inverse-Based ILUs
- Weighted Matchings for Preconditioning Symmetric Indefinite Linear Systems
- Strategies for Scaling and Pivoting for Sparse Symmetric Indefinite Problems
- Methods of conjugate gradients for solving linear systems
