RandNLA

swMATH41749MaRDI QIDQ5974088FDOQ5974088

Author name not available (Why is that?)

Cited In (25)

• Efficient Randomized Algorithms for the Fixed-Precision Low-Rank Matrix Approximation
• An efficient algorithm for computing the approximate t-URV and its applications
• Efficient alternating least squares algorithms for low multilinear rank approximation of tensors
• Randomized Local Model Order Reduction
• Stochastic sampling for deterministic structural topology optimization with many load cases: density-based and ground structure approaches
• Subspaces Analysis for Random Projection UTV Framework
• 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
• Newton-type methods for non-convex optimization under inexact Hessian information
• Linear dimension reduction approximately preserving a function of the $1$-norm
• Fast Randomized Non-Hermitian Eigensolvers Based on Rational Filtering and Matrix Partitioning
• Randomized Dynamic Mode Decomposition
• Sparse Principal Component Analysis via Variable Projection
• 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 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
• Convexification with Bounded Gap for Randomly Projected Quadratic Optimization
• Randomized Kaczmarz for tensor linear systems
• Low-Rank Matrix Approximations Do Not Need a Singular Value Gap

This page was built for software: RandNLA