RandNLA

swMATH41749MaRDI QIDQ5974088FDOQ5974088

Author name not available (Why is that?)

Cited In (25)

• An efficient algorithm for computing the approximate t-URV and its applications
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches
• Structural Convergence Results for Approximation of Dominant Subspaces from Block Krylov Spaces
• The Computation of Low Multilinear Rank Approximations of Tensors via Power Scheme and Random Projection
• Randomized Algorithms for Low-Rank Tensor Decompositions in the Tucker Format
• Unbiased predictive risk estimation of the Tikhonov regularization parameter: convergence with increasing rank approximations of the singular value decomposition
• Convexification with bounded gap for randomly projected quadratic optimization
• Newton-type methods for non-convex optimization under inexact Hessian information
• Linear dimension reduction approximately preserving a function of the $1$-norm
• Efficient randomized algorithms for the fixed-precision low-rank matrix approximation
• Subspaces analysis for random projection UTV framework
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
• Randomized Dynamic Mode Decomposition
• Randomized algorithms for the low multilinear rank approximations of tensors
• Optimal Sampling for Generalized Linear Models Under Measurement Constraints
• An efficient randomized algorithm for computing the approximate Tucker decomposition
• Randomized local model order reduction
• Randomized model order reduction
• A consistency theorem for randomized singular value decomposition
• Randomized Discrete Empirical Interpolation Method for Nonlinear Model Reduction
• Structural conditions for projection-cost preservation via randomized matrix multiplication
• Sparse principal component analysis via variable projection
• Randomized Kaczmarz for tensor linear systems
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap

This page was built for software: RandNLA