42 results
Search Results
2. Extrapolation methods for multilinear PageRank
3. A Kogbetliantz-type algorithm for the hyperbolic SVD
4. Discrete non-commutative hungry Toda lattice and its application in matrix computation
5. Structure-preserving joint Lanczos bidiagonalization with thick-restart for the partial quaternion GSVD
6. Spectral characterizations and integer powers of tridiagonal 2-Toeplitz matrices
7. A nonnegativity preserving algorithm for multilinear systems with nonsingular ℳ-tensors.
8. On the accurate computation of the Newton form of the Lagrange interpolant
9. A Riemannian inexact Newton dogleg method for constructing a symmetric nonnegative matrix with prescribed spectrum.
10. Perron communicability and sensitivity of multilayer networks.
11. On choices of formulations of computing the generalized singular value decomposition of a large matrix pair
12. A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix.
13. Regularization properties of Krylov iterative solvers CGME and LSMR for linear discrete ill-posed problems with an application to truncated randomized SVDs
14. Descent Perry conjugate gradient methods for systems of monotone nonlinear equations
15. Hybrid iterative refined restarted Lanczos bidiagonalization methods
16. Harmonic multi-symplectic Lanczos algorithm for quaternion singular triplets
17. Decompositions and coalescing eigenvalues of symmetric definite pencils depending on parameters.
18. Two-step inexact Newton-type method for inverse singular value problems.
19. Global uniqueness and solvability of tensor complementarity problems for ℋ+-tensors.
20. Randomized block Krylov subspace algorithms for low-rank quaternion matrix approximations.
21. Optimization algorithms for stabilization of multi-input vibration system with time delay using eigenvalues assignment technique
22. Refined and refined harmonic Jacobi–Davidson methods for computing several GSVD components of a large regular matrix pair
23. Two non-parameter iterative algorithms for identifying strong ℋ-tensors.
24. Further results on generalized centro-invertible matrices.
25. Convergence of a Ulm-like method for square inverse singular value problems with multiple and zero singular values.
26. On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity
27. Verified error bounds for eigenvalues of geometric multiplicity q and corresponding invariant subspaces.
28. An efficient approximation to the Cauchy radius.
29. On the condition number of Vandermonde matrices with pairs of nearly-colliding nodes
30. Parallel reduction of four matrices to condensed form for a generalized matrix eigenvalue algorithm
31. Error bounds of Rayleigh-Ritz type contour integral-based eigensolver for solving generalized eigenvalue problems.
32. A fast SVD for multilevel block Hankel matrices with minimal memory storage.
33. Some results on certain generalized circulant matrices.
34. Verified error bounds for eigenvalues of geometric multiplicity q and corresponding invariant subspaces
35. Computing eigenvalues of semi-infinite quasi-Toeplitz matrices.
36. Accelerated dynamical approaches for finding the unique positive solution of KS-tensor equations.
37. The joint bidiagonalization process with partial reorthogonalization.
38. Iterative filtering as a direct method for the decomposition of nonstationary signals.
39. A self-adaptive trust region method for extreme ℬ-eigenvalues of symmetric tensors.
40. Coalescing points for eigenvalues of banded matrices depending on parameters with application to banded random matrix functions.
41. A new Brauer-type Z-eigenvalue inclusion set for tensors.
42. A block algorithm for computing antitriangular factorizations of symmetric matrices.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.