Pages that link to "Item:Q2882786"

The following pages link to Communication-optimal parallel and sequential QR and LU factorizations (Q2882786):

Displaying 50 items.

• Random projections for Bayesian regression (Q144017) (← links)
• A parallel algorithm for calculation of determinants and minors using arbitrary precision arithmetic (Q285264) (← links)
• Simultaneous multidiagonalization for the CS decomposition (Q398589) (← links)
• FaIMS: a fast algorithm for the inverse medium problem with multiple frequencies and multiple sources for the scalar Helmholtz equation (Q441933) (← links)
• Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing (Q608851) (← links)
• A novel parallel algorithm based on the Gram-Schmidt method for tridiagonal linear systems of equations (Q624683) (← links)
• Backward error analysis of the AllReduce algorithm for Householder QR decomposition (Q692038) (← links)
• Towards dense linear algebra for hybrid GPU accelerated manycore systems (Q991102) (← links)
• Randomized algorithms for distributed computation of principal component analysis and singular value decomposition (Q1633018) (← links)
• Parallel \(\mathcal {H}\)-matrix arithmetic on distributed-memory systems (Q1684960) (← links)
• High-performance implementation of Chebyshev filter diagonalization for interior eigenvalue computations (Q1685101) (← links)
• Varying the \(s\) in your \(s\)-step GMRES (Q1744315) (← links)
• Fast multipole preconditioners for sparse matrices arising from elliptic equations (Q1790219) (← links)
• Block Gram-Schmidt algorithms and their stability properties (Q2074959) (← links)
• The red-blue pebble game on trees and DAGs with large input (Q2097342) (← links)
• A parallel and streaming dynamic mode decomposition algorithm with finite precision error analysis for large data (Q2214545) (← links)
• GMRES with embedded ensemble propagation for the efficient solution of parametric linear systems in uncertainty quantification of computational models (Q2236142) (← links)
• Linear-time CUR approximation of BEM matrices (Q2292005) (← links)
• Benefits from using mixed precision computations in the ELPA-AEO and ESSEX-II eigensolver projects (Q2318531) (← links)
• GMRES algorithms over 35 years (Q2698151) (← links)
• Enlarged Krylov subspace conjugate gradient methods for reducing communication (Q2813336) (← links)
• A randomized blocked algorithm for efficiently computing rank-revealing factorizations of matrices (Q2830627) (← links)
• Considerations on the Implementation and Use of Anderson Acceleration on Distributed Memory and GPU-based Parallel Computers (Q2833052) (← links)
• A distributed and incremental SVD algorithm for agglomerative data analysis on large networks (Q2834696) (← links)
• LU factorization with panel rank revealing pivoting and its communication avoiding version (Q2866242) (← links)
• Gram-Schmidt orthogonalization: 100 years and more (Q2931519) (← links)
• Data Driven Modal Decompositions: Analysis and Enhancements (Q3174790) (← links)
• Cholesky and Gram-Schmidt Orthogonalization for Tall-and-Skinny QR Factorizations on Graphics Processors (Q3297572) (← links)
• Increasing the Performance of the Jacobi--Davidson Method by Blocking (Q3457832) (← links)
• The Singular Value Decomposition: Anatomy of Optimizing an Algorithm for Extreme Scale (Q4554900) (← links)
• Low Rank Approximation of a Sparse Matrix Based on LU Factorization with Column and Row Tournament Pivoting (Q4610132) (← links)
• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
• Introduction to Communication Avoiding Algorithms for Direct Methods of Factorization in Linear Algebra (Q4637194) (← links)
• Adapting Regularized Low-Rank Models for Parallel Architectures (Q4646456) (← links)
• Communication lower bounds and optimal algorithms for numerical linear algebra (Q4683913) (← links)
• Numerical algorithms for high-performance computational science (Q4993515) (← links)
• Rounding Error Analysis of Mixed Precision Block Householder QR Algorithms (Q4997375) (← links)
• Parallel Algorithms for Tensor Train Arithmetic (Q5028405) (← links)
• Scaling Up Parallel Computation of Tiled QR Factorizations by a Distributed Scheduling Runtime System and Analytical Modeling (Q5087840) (← links)
• Performance of the Low-Rank TT-SVD for Large Dense Tensors on Modern MultiCore CPUs (Q5095475) (← links)
• GPU parameter tuning for tall and skinny dense linear least squares problems (Q5113719) (← links)
• Randomized Projection for Rank-Revealing Matrix Factorizations and Low-Rank Approximations (Q5137221) (← links)
• Parallel <i>QR</i> Factorization of Block-Tridiagonal Matrices (Q5146680) (← links)
• Iteratively Reweighted FGMRES and FLSQR for Sparse Reconstruction (Q5161735) (← links)
• Shifted Cholesky QR for Computing the QR Factorization of Ill-Conditioned Matrices (Q5220401) (← links)
• Communication-Efficient Distributed Statistical Inference (Q5231495) (← links)
• Scalable Linear Solvers Based on Enlarged Krylov Subspaces with Dynamic Reduction of Search Directions (Q5240796) (← links)
• Robust and Accurate Stopping Criteria for Adaptive Randomized Sampling in Matrix-Free Hierarchically Semiseparable Construction (Q5241244) (← links)
• Block Modified Gram--Schmidt Algorithms and Their Analysis (Q5243515) (← links)
• Communication Avoiding ILU0 Preconditioner (Q5254468) (← links)