EIGIFP
From MaRDI portal
Software:12998
swMATH235MaRDI QIDQ12998FDOQ12998
Author name not available (Why is that?)
Cited In (48)
- A block Arnoldi method for the \(SP_N\) equations
- Preconditioned gradient iterations for the eigenproblem of definite matrix pairs
- Computing eigenpairs of Hermitian matrices in perfect Krylov subspaces
- On local quadratic convergence of inexact simplified Jacobi-Davidson method for interior eigenpairs of Hermitian eigenproblems
- Quantum algorithms for the generalized eigenvalue problem
- Triangularized orthogonalization-free method for solving extreme eigenvalue problems
- Rayleigh quotient minimization method for symmetric eigenvalue problems
- The power method and beyond
- The generalized trust region subproblem
- Generalized Preconditioned Locally Harmonic Residual Method for Non-Hermitian Eigenproblems
- Toward quantifying vertex similarity in networks
- Iterative minimization of the Rayleigh quotient by block steepest descent iterations
- TRPL+K: Thick-Restart Preconditioned Lanczos+K Method for Large Symmetric Eigenvalue Problems
- A Rayleigh-Ritz style method for large-scale discriminant analysis
- Preconditioned Lanczos method for generalized Toeplitz eigenvalue problems
- 3-D nested eigenanalysis on finite element grids
- Computing the smallest singular triplets of a large matrix
- On Chebyshev-Davidson method for symmetric generalized eigenvalue problems
- Preconditioned locally harmonic residual method for computing interior eigenpairs of certain classes of Hermitian matrices
- An efficient algorithm for solving the generalized trust region subproblem
- Computing eigenpairs in augmented Krylov subspace produced by Jacobi-Davidson correction equation
- \(n\)-widths, sup-infs, and optimality ratios for the \(k\)-version of the isogeometric finite element method
- Continuous methods for symmetric generalized eigenvalue problems
- On generalizing trace minimization principles
- A method for computing a few eigenpairs of large generalized eigenvalue problems
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- An inexact spectral bundle method for convex quadratic semidefinite programming
- A simple extrapolation method for clustered eigenvalues
- Deflation by restriction for the inverse-free preconditioned Krylov subspace method
- Updating component reduction bases of static and vibration modes using preconditioned iterative techniques
- Goal-oriented optimal approximations of Bayesian linear inverse problems
- Augmented block Householder Arnoldi method
- On global convergence of subspace projection methods for Hermitian eigenvalue problems
- Optimal low-rank approximations of Bayesian linear inverse problems
- Analysis of an alignment algorithm for nonlinear dimensionality reduction
- Applications of gauge duality in robust principal component analysis and semidefinite programming
- Linear response eigenvalue problem solved by extended locally optimal preconditioned conjugate gradient methods
- Locally optimal and heavy ball GMRES methods
- A refined variant of the inverse-free Krylov subspace method for symmetric generalized eigenvalue problems
- A new justification of the Jacobi-Davidson method for large eigenproblems
- Fixed support positive-definite modification of covariance matrix estimators via linear shrinkage
- A block inverse-free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
- On local quadratic convergence of inexact simplified Jacobi-Davidson method
- Preconditioned eigensolvers for large-scale nonlinear Hermitian eigenproblems with variational characterizations. II. Interior eigenvalues
- A preconditioned hybrid SVD method for accurately computing singular triplets of large matrices
- ADMM for the SDP relaxation of the QAP
- PRIMME\_SVDS: a high-performance preconditioned SVD solver for accurate large-scale computations
- A truncated-CG style method for symmetric generalized eigenvalue problems
This page was built for software: EIGIFP
