This folder demonstrates cuSOLVER APIs usage.
-
The sample solves linear system by LU Decomposition, with partial pivoting (
getrf
andgetrs
). See example for detailed description.
-
The sample solves linear system by Cholesky factorization (
potrf
andpotrs
). See example for detailed description.
-
The sample provides three examples to demonstrate multiGPU standard symmetric eigenvalue solver. See example for detailed description.
-
The sample computes singular value decomposition, using 64-bit APIs. See example for detailed description.
-
The sample computes singular value decomposition, in combination with polar decomposition, using 64-bit APIs. See example for detailed description.
-
The sample computes approximated rank-k singular value decomposition, using 64-bit APIs. See example for detailed description.
-
The sample solves linear system by LU Decomposition, with partial pivoting (
getrf
andgetrs
), using 64-bit APIs. See example for detailed description.
-
The sample demonstrates standard symmetric eigenvalue solver, using 64-bit APIs. See example for detailed description.
-
The sample demonstrates standard symmetric eigenvalue solver, using 64-bit APIs. See example for detailed description.
-
The sample provides two examples to demonstrate batched sparse qr factorization. See example for detailed description.
-
The sample demonstrates iterative refinement solver example for solving linear systems with multiple right hand sides. See example for detailed description.
-
The sample computes singular value decomposition. See example for detailed description.
-
The sample computes a strided, batched approximate singular value decomposition. See example for detailed description.
-
The sample computes singular value decomposition, via Jacobi method. See example for detailed description.
-
The sample computes batched singular value decomposition, via Jacobi method. See example for detailed description.
-
The sample solves linear system by LU Decomposition, with partial pivoting (
getrf
andgetrs
). See example for detailed description.
-
The sample computes complete orthgonalization (
geqrf
andorgqr
). See example for detailed description.
-
The sample computes dense QR orthgonalization (
geqrf
,ormqr
, andtrsm
). See example for detailed description.
-
The sample solves linear system by Cholesky factorization (
potrfBatched
andpotrsBatched
). See example for detailed description.
-
The sample demonstrates standard symmetric eigenvalue solver. See example for detailed description.
-
The sample demonstrates standard symmetric eigenvalue solver, via Jacobi method. See example for detailed description.
-
The sample demonstrates batched standard symmetric eigenvalue solver, via Jacobi method. See example for detailed description.
-
The sample demonstrates generalized symmetric-definite dense eigenvalue solver. See example for detailed description.
-
The sample demonstrates generalized symmetric-definite dense eigenvalue solver, (via Jacobi method). See example for detailed description.
-
The sample preforms triangular matrix mnversion. See example for detailed description.