Pages that link to "Item:Q93618"
From MaRDI portal
The following pages link to Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions (Q93618):
Displaying 50 items.
- IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM (Q3101550) (← links)
- (Q3115854) (redirect page) (← links)
- Cost-efficient cutoff method for tensor renormalization group with randomized singular value decomposition (Q3121423) (← links)
- A Randomized Maximum A Posteriori Method for Posterior Sampling of High Dimensional Nonlinear Bayesian Inverse Problems (Q3130408) (← links)
- Randomized Local Model Order Reduction (Q3174769) (← links)
- Hierarchical Interpolative Factorization for Elliptic Operators: Differential Equations (Q3185925) (← links)
- Computing Fundamental Matrix Decompositions Accurately via the Matrix Sign Function in Two Iterations: The Power of Zolotarev's Functions (Q3186101) (← links)
- Compressed Absorbing Boundary Conditions via Matrix Probing (Q3196612) (← links)
- Approximating Spectral Clustering via Sampling: A Review (Q3297374) (← links)
- Optimal experimental design under irreducible uncertainty for linear inverse problems governed by PDEs (Q3298402) (← links)
- Geometric Methods on Low-Rank Matrix and Tensor Manifolds (Q3300541) (← links)
- Randomization and Reweighted $\ell_1$-Minimization for A-Optimal Design of Linear Inverse Problems (Q3300853) (← links)
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- 6 The Loewner framework for system identification and reduction (Q3384276) (← links)
- Hierarchical Decompositions for the Computation of High-Dimensional Multivariate Normal Probabilities (Q3391110) (← links)
- A Computationally Efficient Projection-Based Approach for Spatial Generalized Linear Mixed Models (Q3391151) (← links)
- Multidimensional Scaling With Very Large Datasets (Q3391174) (← links)
- Compressed and Penalized Linear Regression (Q3391428) (← links)
- Fast Algorithms for Hyperspectral Diffuse Optical Tomography (Q3447464) (← links)
- Scalable Low-Rank Representation (Q3449316) (← links)
- Probabilistic Bounds for the Matrix Condition Number with Extended Lanczos Bidiagonalization (Q3449798) (← links)
- Optimal Low-rank Approximations of Bayesian Linear Inverse Problems (Q3452481) (← links)
- Fast Structured Direct Spectral Methods for Differential Equations with Variable Coefficients, I. The One-Dimensional Case (Q3460272) (← links)
- An approximate linear solver in least square support vector machine using randomized singular value decomposition (Q3461640) (← links)
- Variational Gaussian approximation for Poisson data (Q4607825) (← links)
- Spatio-temporal proper orthogonal decomposition of turbulent channel flow (Q4625974) (← links)
- Sharp error bounds for Ritz vectors and approximate singular vectors (Q4960077) (← links)
- Data-driven resolvent analysis (Q4989070) (← links)
- Hierarchical algorithms on hierarchical architectures (Q4993506) (← links)
- Numerical algorithms for high-performance computational science (Q4993515) (← links)
- Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
- Analysis of amplification mechanisms and cross-frequency interactions in nonlinear flows via the harmonic resolvent (Q5116504) (← links)
- Randomized matrix approximation to enhance regularized projection schemes in inverse problems (Q5117403) (← links)
- Shallow neural networks for fluid flow reconstruction with limited sensors (Q5160984) (← links)
- Acoustic full-waveform inversion and its uncertainty estimation based on a vector-version square-root variable metric method (Q5193504) (← links)
- Flip-flop spectrum-revealing QR factorization and its applications to singular value decomposition (Q5218403) (← links)
- A scalable estimator of sets of integral operators (Q5236688) (← links)
- Fast approximate computations with Cauchy matrices and polynomials (Q5270834) (← links)
- The engine behind (wall) turbulence: perspectives on scale interactions (Q5364640) (← links)
- Fast Estimation of Approximate Matrix Ranks Using Spectral Densities (Q5380703) (← links)
- Continuous-time Random Walks for the Numerical Solution of Stochastic Differential Equations (Q5383902) (← links)
- An inverse‐free ADI algorithm for computing Lagrangian invariant subspaces (Q5739755) (← links)
- Randomized algorithms for generalized Hermitian eigenvalue problems with application to computing Karhunen–Loève expansion (Q5739763) (← links)
- Block classical Gram–Schmidt-based block updating in low-rank matrix approximation (Q5742723) (← links)
- Fast state tomography with optimal error bounds (Q5869977) (← links)
- Efficient global resolvent analysis via the one-way Navier–Stokes equations (Q5876152) (← links)
- Spectral decomposition of atomic structures in heterogeneous cryo-EM (Q5876570) (← links)
- Sketching for a low-rank nonnegative matrix approximation: numerical study (Q6038456) (← links)
- Scalable subspace methods for derivative-free nonlinear least-squares optimization (Q6038650) (← links)
- Dynamically Orthogonal Runge–Kutta Schemes with Perturbative Retractions for the Dynamical Low-Rank Approximation (Q6039249) (← links)
