Entity usage

Showing below up to 50 results in range #1 to #50.

1. Nonnegative low multi-rank third-order tensor approximation via transformation.: Label: en
2. Error bounds for the approximation of matrix functions with rational Krylov methods.: Label: en
3. Mass-lumping discretization and solvers for distributed elliptic optimal control problems.: Label: en
4. Least angle regression, relaxed lasso, and elastic net for algebraic multigrid of systems of elliptic partial differential equations.: Label: en
5. Anderson acceleration with approximate calculations: applications to scientific computing.: Label: en
6. Convergence of the block Lanczos method for the trust-region subproblem in the hard case.: Label: en
7. Accelerated schemes of compact difference methods for space-fractional sine-Gordon equations with distributed delay.: Label: en
8. Sub-sampled adaptive trust region method on Riemannian manifolds.: Label: en
9. Double saddle-point preconditioning for Krylov methods in the inexact sequential homotopy method.: Label: en
10. Leveraging the Hankel norm approximation and data-driven algorithms in reduced order modeling.: Label: en
11. On the Polyak momentum variants of the greedy deterministic single and multiple row-action methods.: Label: en
12. Total positivity and least squares problems in the Lagrange basis.: Label: en
13. Some preconditioning techniques for a class of double saddle point problems.: Label: en
14. Total positivity and high relative accuracy for several classes of Hankel matrices.: Label: en
15. Preconditioned discontinuous Galerkin method and convection-diffusion-reaction problems with guaranteed bounds to resulting spectra.: Label: en
16. Normalized Newton method to solve generalized tensor eigenvalue problems.: Label: en
17. Matrix-less methods for the spectral approximation of large non-Hermitian Toeplitz matrices: a concise theoretical analysis and a numerical study.: Label: en
18. Practical sketching-based randomized tensor ring decomposition.: Label: en
19. Robust block diagonal preconditioners for poroelastic problems with strongly heterogeneous material.: Label: en
20. Generalizing reduction-based algebraic multigrid.: Label: en
21. An iterative algorithm for low-rank tensor completion problem with sparse noise and missing values.: Label: en
22. Practical alternating least squares for tensor ring decomposition.: Label: en
23. Preconditioned weighted full orthogonalization method for solving singular linear systems from PageRank problems.: Label: en
24. Quasi-Newton variable preconditioning for nonlinear elasticity systems in 3D.: Label: en
25. Algebra preconditionings for 2D Riesz distributed-order space-fractional diffusion equations on convex domains.: Label: en
26. A two-step matrix splitting iteration paradigm based on one single splitting for solving systems of linear equations.: Label: en
27. Multilevel‐in‐width training for deep neural network regression: Label: en
28. Preconditioned tensor format conjugate gradient squared and biconjugate gradient stabilized methods for solving stein tensor equations: Label: en
29. A conforming auxiliary space preconditioner for the mass conserving stress‐yielding method: Label: en
30. A closed‐form multigrid smoothing factor for an additive Vanka‐type smoother applied to the Poisson equation: Label: en
31. Anderson accelerated fixed‐point iteration for multilinear PageRank: Label: en
32. High relative accuracy with some special matrices related to Γ and β functions: Label: en
33. Solution methods to the nearest rotation matrix problem in ℝ3: A comparative survey: Label: en
34. A flexible block classical Gram–Schmidt skeleton with reorthogonalization: Label: en
35. A unified rational Krylov method for elliptic and parabolic fractional diffusion problems: Label: en
36. Nonconvex optimization for third‐order tensor completion under wavelet transform: Label: en
37. The Lawson‐Hanson algorithm with deviation maximization: Finite convergence and sparse recovery: Label: en
38. QR algorithm with two‐sided Rayleigh quotient shifts: Label: en
39. Analysis of optimal preconditioners for CutFEM: Label: en
40. Multi‐view side information‐incorporated tensor completion: Label: en
41. Inexact inner–outer Golub–Kahan bidiagonalization method: A relaxation strategy: Label: en
42. A fast and accurate algorithm for solving linear systems associated with a class of negative matrix: Label: en
43. Total positivity and accurate computations with Gram matrices of Said‐Ball bases: Label: en
44. Nonlinear approximation of functions based on nonnegative least squares solver: Label: en
45. Tensor train completion: Local recovery guarantees via Riemannian optimization: Label: en
46. Data‐driven linear complexity low‐rank approximation of general kernel matrices: A geometric approach: Label: en
47. Optimal polynomial smoothers for multigrid V‐cycles: Label: en
48. Blockwise acceleration of alternating least squares for canonical tensor decomposition: Label: en
49. The generalized residual cutting method and its convergence characteristics: Label: en
50. A Vanka‐based parameter‐robust multigrid relaxation for the Stokes–Darcy Brinkman problems: Label: en