Pages that link to "Item:Q1923328"
From MaRDI portal
The following pages link to Computing the generalized singular values/vectors of large sparse or structured matrix pairs (Q1923328):
Displaying 16 items.
- Two projection methods for regularized total least squares approximation (Q406473) (← links)
- An iterative method for Tikhonov regularization with a general linear regularization operator (Q616671) (← links)
- The joint bidiagonalization process with partial reorthogonalization (Q820739) (← links)
- Tikhonov regularization via flexible Arnoldi reduction (Q906959) (← links)
- A Jacobi-Davidson type method for the generalized singular value problem (Q1025866) (← links)
- Large sparse symmetric eigenvalue problems with homogeneous linear constraints: The Lanczos process with inner-outer iterations (Q1976920) (← links)
- On choices of formulations of computing the generalized singular value decomposition of a large matrix pair (Q2028035) (← links)
- A joint bidiagonalization based iterative algorithm for large scale general-form Tikhonov regularization (Q2192617) (← links)
- Two harmonic Jacobi-Davidson methods for computing a partial generalized singular value decomposition of a large matrix pair (Q2676809) (← links)
- A cross-product free Jacobi-Davidson type method for computing a partial generalized singular value decomposition of a large matrix pair (Q2680320) (← links)
- A Generalized CUR Decomposition for Matrix Pairs (Q5070854) (← links)
- Necessary Conditions and Tight Two-level Convergence Bounds for Parareal and Multigrid Reduction in Time (Q5232109) (← links)
- The Joint Bidiagonalization Method for Large GSVD Computations in Finite Precision (Q5885819) (← links)
- Thick-restarted joint Lanczos bidiagonalization for the GSVD (Q6126037) (← links)
- The Joint Bidiagonalization of a Matrix Pair with Inaccurate Inner Iterations (Q6180360) (← links)
- Randomized GCUR decompositions (Q6614936) (← links)
