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.
- Fast structured LU factorization for nonsymmetric matrices (Q2450863) (← links)
- Estimating the norms of random circulant and Toeplitz matrices and their inverses (Q2512809) (← links)
- An \(O(N)\) direct solver for integral equations on the plane (Q2512836) (← links)
- Stochastic boundary methods of fundamental solutions for solving PDEs (Q2520343) (← links)
- Randomized algorithms for the approximations of Tucker and the tensor train decompositions (Q2631991) (← links)
- Structure-preserving reduced-order modeling of Korteweg-de Vries equation (Q2664789) (← links)
- Golub-Kahan vs. Monte Carlo: a comparison of bidiagonlization and a randomized SVD method for the solution of linear discrete ill-posed problems (Q2665542) (← links)
- Randomized generalized singular value decomposition (Q2667344) (← links)
- MERACLE: constructive layer-wise conversion of a tensor train into a MERA (Q2667352) (← links)
- Coupled and uncoupled dynamic mode decomposition in multi-compartmental systems with applications to epidemiological and additive manufacturing problems (Q2670383) (← links)
- Exploring the common principal subspace of deep features in neural networks (Q2673330) (← links)
- H2Opus: a distributed-memory multi-GPU software package for non-local operators (Q2673500) (← links)
- Efficient algorithm for proper orthogonal decomposition of block-structured adaptively refined numerical simulations (Q2675596) (← links)
- A kernel-independent sum-of-exponentials method (Q2676808) (← links)
- On convergence rates of adaptive ensemble Kalman inversion for linear ill-posed problems (Q2676869) (← links)
- Bayesian operator inference for data-driven reduced-order modeling (Q2679294) (← links)
- Low-rank nonnegative tensor approximation via alternating projections and sketching (Q2685220) (← links)
- DeepCyto: a hybrid framework for cervical cancer classification by using deep feature fusion of cytology images (Q2686787) (← links)
- A fast direct solver for non-intrusive reduced order modeling of vibroacoustic problems (Q2691965) (← links)
- A GPU parallel randomized CUR compression method for the method of moments (Q2692476) (← links)
- A randomized singular value decomposition for third-order oriented tensors (Q2697009) (← links)
- Learning elliptic partial differential equations with randomized linear algebra (Q2697403) (← links)
- Parallelization of the inverse fast multipole method with an application to boundary element method (Q2698816) (← links)
- TeNeS: tensor network solver for quantum lattice systems (Q2700750) (← links)
- Random Projections for Low Multilinear Rank Tensors (Q2806290) (← links)
- Randomized Oversampling for Generalized Multiscale Finite Element Methods (Q2806415) (← links)
- A DEIM Induced CUR Factorization (Q2810324) (← links)
- Hierarchical Interpolative Factorization for Elliptic Operators: Integral Equations (Q2812291) (← links)
- Tikhonov Regularization and Randomized GSVD (Q2813331) (← links)
- Randomized Alternating Least Squares for Canonical Tensor Decompositions: Application to A PDE With Random Data (Q2818256) (← links)
- HOID: Higher Order Interpolatory Decomposition for Tensors Based on Tucker Representation (Q2818274) (← links)
- On the Stability of Some Hierarchical Rank Structured Matrix Algorithms (Q2827062) (← links)
- An Efficient Multicore Implementation of a Novel HSS-Structured Multifrontal Solver Using Randomized Sampling (Q2830621) (← links)
- A Randomized Blocked Algorithm for Efficiently Computing Rank-revealing Factorizations of Matrices (Q2830627) (← links)
- Parallel Randomized and Matrix-Free Direct Solvers for Large Structured Dense Linear Systems (Q2830628) (← links)
- ASKIT: An Efficient, Parallel Library for High-Dimensional Kernel Summations (Q2830640) (← links)
- Fast and accurate propagation of coherent light (Q2831299) (← links)
- Clustered Matrix Approximation (Q2834689) (← links)
- A Distributed and Incremental SVD Algorithm for Agglomerative Data Analysis on Large Networks (Q2834696) (← links)
- Active Subspace: Toward Scalable Low-Rank Learning (Q2840899) (← links)
- A literature survey of low-rank tensor approximation techniques (Q2864808) (← links)
- An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585) (← links)
- On preconditioners for the Laplace double-layer in 2D (Q2948092) (← links)
- A fast, memory efficient and robust sparse preconditioner based on a multifrontal approach with applications to finite‐element matrices (Q2952959) (← links)
- New fast divide-and-conquer algorithms for the symmetric tridiagonal eigenvalue problem (Q2955975) (← links)
- Efficient estimation of eigenvalue counts in an interval (Q2955976) (← links)
- A nonconvex approach to low-rank matrix completion using convex optimization (Q2955982) (← links)
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games (Q2960400) (← links)
- Optimal CUR Matrix Decompositions (Q2968164) (← links)
- Matrices with Hierarchical Low-Rank Structures (Q2971626) (← links)
