The cross-product matrix-based CJ-FEAST SVDsolver proposed previously by the authors is shown to compute the left singular vector possibly much less accurately than the right singular vector and ma…
The joint bidiagonalization (JBD) method has been used to compute some extreme generalized singular values and vectors of a large regular matrix pair . We make a numerical analysis of the underlyi…
Consider the optimal subspace expansion problem for the matrix eigenvalue problem Ax=λx: Which vector w in the current subspace V, after multiplied by A, provides an optimal subspace expansion for…
Solving the trust-region subproblem (TRS) plays a key role in numerical optimization and many other applications. The generalized Lanczos trust-region (GLTR) method is a well-known Lanczos type app…