A contour integral-based algorithm for computing generalized singular values
From MaRDI portal
Cites work
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair
- A fast ``Monte-Carlo cross-validation procedure for large least squares problems with noisy data
- A fast contour-integral eigensolver for non-Hermitian matrices
- A FEAST SVDsolver based on Chebyshev-Jackson series for computing partial singular triplets of large matrices
- A Jacobi-Davidson type method for the generalized singular value problem
- A New Preprocessing Algorithm for the Computation of the Generalized Singular Value Decomposition
- A numerical method for polynomial eigenvalue problems using contour integral
- A projection method for generalized eigenvalue problems using numerical integration.
- A projection method for nonlinear eigenvalue problems using contour integrals
- A quadrature-based eigensolver with a Krylov subspace method for shifted linear systems for Hermitian eigenproblems in lattice QCD
- A Relationship between Linear Discriminant Analysis and the Generalized Minimum Squared Error Solution
- Algorithm 933
- An algorithm for the generalized singular value decomposition on massively parallel computers
- Applications of the generalized singular-value decomposition method on the eigenproblem using the incomplete boundary element formulation
- Block Locally Optimal Preconditioned Eigenvalue Xolvers (BLOPEX) in Hypre and PETSc
- Canonical correlations and generalized SVD: Applications and new algorithms
- ChASE: Chebyshev accelerated subspace iteration eigensolver for sequences of Hermitian eigenvalue problems
- CIRR: a Rayleigh-Ritz method with contour integral for generalized eigenvalue problems
- Computing eigenvalues of real symmetric matrices with rational filters in real arithmetic
- Computing the CS and the generalized singular value decompositions
- Computing the Generalized Singular Value Decomposition
- Computing the Generalized Singular Value Decomposition
- Computing the generalized singular values/vectors of large sparse or structured matrix pairs
- Efficient estimation of eigenvalue counts in an interval.
- Efficient parameter estimation and implementation of a contour integral-based eigensolver
- FEAST as a subspace iteration eigensolver accelerated by approximate spectral projection
- Generalizing the Singular Value Decomposition
- scientific article; zbMATH DE number 1049353 (Why is no real title available?)
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
- Parallel stochastic estimation method of eigenvalue distribution
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Regularization, GSVD and truncated GSVD
- Stable computation of the CS decomposition: Simultaneous bidiagonalization
- Structure Preserving Dimension Reduction for Clustered Text Data Based on the Generalized Singular Value Decomposition
- The exponentially convergent trapezoidal rule
- The general linear model of the generalized singular value decomposition
- The generalized singular value decomposition and the general (A- B)-problem
- The Generalized Singular Value Decomposition and the Method of Particular Solutions
- The matrix sign decomposition and its relation to the polar decomposition
- The Rotation of Eigenvectors by a Perturbation. III
- The University of Florida sparse matrix collection
- Toward the optimal preconditioned eigensolver: Locally optimal block preconditioned conjugate gradient method
- Towards a Generalized Singular Value Decomposition
- Zolotarev quadrature rules and load balancing for the FEAST eigensolver
This page was built for publication: A contour integral-based algorithm for computing generalized singular values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7250169)
