The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
From MaRDI portal
(Redirected from Publication:4554900)
Recommendations
- Memory hierarchy exploration for accelerating the parallel computation of SVDs
- New Fast and Accurate Jacobi SVD Algorithm. I
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- scientific article; zbMATH DE number 1497146
- A Parallel Algorithm for Computing the Singular Value Decomposition of a Matrix
Cites work
- A Divide and Conquer method for the symmetric tridiagonal eigenproblem
- A Divide-and-Conquer Algorithm for the Bidiagonal SVD
- A framework for the \(\text{MR}^3\) algorithm: theory and implementation
- A One-Sided Jacobi Algorithm for Computing the Singular Value Decomposition on a Vector Computer
- A parallel ring ordering algorithm for efficient one-sided Jacobi SVD computations
- A randomized algorithm for principal component analysis
- A set of level 3 basic linear algebra subprograms
- A Stable and Efficient Algorithm for the Rank-One Modification of the Symmetric Eigenproblem
- A Storage-Efficient WY Representation for Products of Householder Transformations
- Accelerating the reduction to upper Hessenberg, tridiagonal, and bidiagonal forms through hybrid GPU-based computing
- Accelerating the SVD block-Jacobi method
- Accuracy of the Kogbetliantz method for scaled diagonally dominant triangular matrices
- Accuracy of two SVD algorithms for \(2\times 2\) triangular matrices
- Accurate singular values and differential qd algorithms
- Accurate Singular Values of Bidiagonal Matrices
- Algorithm 807
- Algorithm 977: A QR-preconditioned QR SVD method for computing the SVD with high accuracy
- An accelerated divide-and-conquer algorithm for the bidiagonal SVD problem
- An extended set of FORTRAN basic linear algebra subprograms
- An Improved Algorithm for Computing the Singular Value Decomposition
- An updated set of basic linear algebra subprograms (BLAS)
- Basic Linear Algebra Subprograms for Fortran Usage
- Block reduction of matrices to condensed forms for eigenvalue computations
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*
- BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS II: MESHES∗
- Cache efficient bidiagonalization using BLAS 2.5 operators
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Communication-optimal parallel and sequential QR and LU factorizations
- Computing an Eigenvector with Inverse Iteration
- Computing the Bidiagonal SVD Through an Associated Tridiagonal Eigenproblem
- Computing the Bidiagonal SVD Using Multiple Relatively Robust Representations
- Computing the Singular Value Decomposition of a Product of Two Matrices
- Computing the singular value decomposition on a distributed system of vector processors
- Computing the singular value decomposition with high relative accuracy
- Computing the Singular-Value Decomposition on the ILLIAC IV
- Der Quotienten-Differenzen-Algorithmus
- Dynamic ordering for a parallel block-Jacobi SVD algorithm
- Efficient parallel reduction to bidiagonal form.
- Families of Algorithms for Reducing a Matrix to Condensed Form
- Fernando's solution to Wilkinson's problem: An application of double factorization
- High-performance bidiagonal reduction using tile algorithms on homogeneous multicore architectures
- scientific article; zbMATH DE number 3963085 (Why is no real title available?)
- scientific article; zbMATH DE number 3988608 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 3438258 (Why is no real title available?)
- scientific article; zbMATH DE number 780780 (Why is no real title available?)
- scientific article; zbMATH DE number 3349178 (Why is no real title available?)
- scientific article; zbMATH DE number 3199190 (Why is no real title available?)
- Inversion of Matrices by Biorthogonalization and Related Results
- Jacobi’s Method is More Accurate than QR
- LAPACK Users' Guide
- Matrix eigensystem routines - EISPACK guide. 2nd ed
- Matrix eigensystem routines. EISPACK guide extension
- More accurate bidiagonal reduction for computing the singular value decomposition
- Multiple representations to compute orthogonal eigenvectors of symmetric tridiagonal matrices
- New dynamic orderings for the parallel one-sided block-Jacobi SVD algorithm
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- Note on the quadratic convergence of the cyclic Jacobi process
- Numerically stable generation of correlation matrices and their factors
- On high relative accuracy of the Kogbetliantz method
- On iterative QR pre-processing in the parallel block-Jacobi SVD algorithm
- On Jacobi and Jacobi-Like Algorithms for a Parallel Computer
- On Jacobi Methods for Singular Value Decompositions
- On One-Sided Jacobi Methods for Parallel Computation
- On Parallel Jacobi Orderings
- On the Convergence of the Jacobi Method for Arbitrary Orderings
- On the correctness of some bisection-like parallel eigenvalue algorithms in floating point arithmetic
- On the Early History of the Singular Value Decomposition
- On the Spectral Decomposition of Hermitian Matrices Modified by Low Rank Perturbations with Applications
- Orthogonal Eigenvectors and Relative Gaps
- Parallel reduction of banded matrices to bidiagonal form
- Principal component analysis in linear systems: Controllability, observability, and model reduction
- Restructuring the tridiagonal and bidiagonal QR algorithms for performance
- ScaLAPACK Users' Guide
- Singular value decomposition and least squares solutions
- Solution of linear equations by diagonalization of coefficients matrix
- Some Modified Matrix Eigenvalue Problems
- The Cyclic Jacobi Method for Computing the Principal Values of a Complex Matrix
- The design and implementation of the MRRR algorithm
- The design of a parallel dense linear algebra software library: Reduction to Hessenberg, tridiagonal, and bidiagonal form
- The Efficient Generation of Random Orthogonal Matrices with an Application to Condition Estimators
- The Solution of Singular-Value and Symmetric Eigenvalue Problems on Multiprocessor Arrays
- The WY Representation for Products of Householder Matrices
Cited in
(23)- Point data reconstruction and smoothing using cubic splines and clusterization
- Modified parareal method for solving the two-dimensional nonlinear shallow water equations using finite volumes
- PACF: a precision-adjustable computational framework for solving singular values
- Nonlinear transform induced tensor nuclear norm for tensor completion
- ROCKET: exceptionally fast and accurate time series classification using random convolutional kernels
- Backward error and condition number of a generalized Sylvester equation, with application to the stochastic Galerkin method
- Low-rank nonnegative tensor approximation via alternating projections and sketching
- Limited memory block Krylov subspace optimization for computing dominant singular value decompositions
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Memory hierarchy exploration for accelerating the parallel computation of SVDs
- Reducing the Computations of the Singular Value Decomposition Array Given by Brent and Luk
- scientific article; zbMATH DE number 663830 (Why is no real title available?)
- scientific article; zbMATH DE number 833644 (Why is no real title available?)
- Sparsity-promoting algorithms for the discovery of informative Koopman-invariant subspaces
- Convergence to singular triplets in the two-sided block-Jacobi SVD algorithm with dynamic ordering
- A QDWH-based SVD software framework on distributed-memory manycore systems
- A high performance QDWH-SVD solver using hardware accelerators
- An efficient randomized QLP algorithm for approximating the singular value decomposition
- On relative accuracy of the one-sided block-Jacobi SVD algorithm
- Convergence of the complex block Jacobi methods under the generalized serial pivot strategies
- Distributed-parallel proper orthogonal/dynamic mode decompositions of large flow data
- Rounding error analysis of block orthogonalization in the one-sided block Jacobi SVD method
- A characterization of optimal scaling for structured singular value computation
Describes a project that uses
Uses Software
This page was built for publication: The singular value decomposition: anatomy of optimizing an algorithm for extreme scale
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4554900)
