Public

If the given result is different to cublasStatus.CUBLAS_STATUS_SUCCESS and
exceptions have been enab

checkResult

Obtain the current CUBLAS status by calling cublasGetErrorNative, and store the
result as the lastRe

checkResultBLAS

cublasAllocNative

cublasCaxpyNative

cublasCcopyNative

cublasCdotcNative

cublasCdotuNative

cublasCgbmvNative

cublasCgemmNative

cublasCgemvNative

cublasCgercNative

cublasCgeruNative

cublasChbmvNative

cublasChemmNative

cublasChemvNative

cublasCher2Native

cublasCher2kNative

cublasCherNative

cublasCherkNative

cublasChpr2Native

Gson

Reading from database using SQL prepared statement

Wraps an existing Reader and buffers the input. Expensive interaction with the
underlying reader is 

java.io.BufferedReader

Wraps an existing Writer and buffers the output. Expensive interaction with the
underlying reader is

java.io.BufferedWriter

Produces concatenated messages in language-neutral way. New code should probably
use java.util.Forma

java.text.MessageFormat

 Collection is the root of the collection hierarchy. It defines operations on
data collections and t

java.util.Collection

HashSet is an implementation of a Set. All optional operations (adding and
removing) are supported. 

java.util.HashSet

Operations on java.lang.String that arenull safe.

 * IsEmpty/IsBlank - checks if a String contains 

org.apache.commons.lang.StringUtils

getContentResolver

Return the original filename in the client's filesystem.This may contain path
information depending 

getOriginalFilename

findViewById

/**
     * <pre>
     * void
     * cublasCtpsv (char uplo, char trans, char diag, int n, const cuComplex *AP,
     *              cuComplex *X, int incx)
     *
     * solves one of the systems of equations op(A)*x = b, where op(A) is either
     * op(A) = A , op(A) = transpose(A) or op(A) = conjugate(transpose)). b and
     * x are n element complex vectors, and A is an n x n unit or non-unit,
     * upper or lower triangular matrix. No test for singularity or near-singularity
     * is included in this routine. Such tests must be performed before calling this routine.
     *
     * Input
     * -----
     * uplo   specifies whether the matrix is an upper or lower triangular matrix
     *        as follows: If uplo == 'U' or 'u', A is an upper triangluar matrix.
     *        If uplo == 'L' or 'l', A is a lower triangular matrix.
     * trans  specifies op(A). If trans == 'N' or 'n', op(A) = A. If trans == 'T'
     *        or 't', op(A) = transpose(A). If trans == 'C' or 'c', op(A) =
     *        conjugate(transpose(A)).
     * diag   specifies whether A is unit triangular. If diag == 'U' or 'u', A is
     *        assumed to be unit triangular; thas is, diagonal elements are not
     *        read and are assumed to be unity. If diag == 'N' or 'n', A is not
     *        assumed to be unit triangular.
     * n      specifies the number of rows and columns of the matrix A. n must be
     *        at least zero.
     * AP     single precision complex array with at least ((n*(n+1))/2) elements.
     *        If uplo == 'U' or 'u', the array AP contains the upper triangular
     *        matrix A, packed sequentially, column by column; that is, if i <= j, then
     *        A[i,j] is stored is AP[i+(j*(j+1)/2)]. If uplo == 'L' or 'L', the
     *        array AP contains the lower triangular matrix A, packed sequentially,
     *        column by column; that is, if i >= j, then A[i,j] is stored in
     *        AP[i+((2*n-j+1)*j)/2]. When diag = 'U' or 'u', the diagonal elements
     *        of A are not referenced and are assumed to be unity.
     * x      single precision complex array of length at least (1+(n-1)*abs(incx)).
     * incx   storage spacing between elements of x. It must not be zero.
     *
     * Output
     * ------
     * x      updated to contain the solution vector x that solves op(A) * x = b.
     *
     * Reference: http://www.netlib.org/blas/ctpsv.f
     *
     * Error status for this function can be retrieved via cublasGetError().
     *
     * Error Status
     * ------------
     * CUBLAS_STATUS_NOT_INITIALIZED  if CUBLAS library has not been initialized
     * CUBLAS_STATUS_INVALID_VALUE    if incx == 0 or if n < 0 or n > 2035
     * CUBLAS_STATUS_EXECUTION_FAILED if function failed to launch on GPU
     * </pre>
     */

/**
   * <pre>
   * void 
   * cublasCtpsv (char uplo, char trans, char diag, int n, const cuComplex *AP, 
   *              cuComplex *X, int incx)
   *
   * solves one of the systems of equations op(A)*x = b, where op(A) is either 
   * op(A) = A , op(A) = transpose(A) or op(A) = conjugate(transpose)). b and
   * x are n element complex vectors, and A is an n x n unit or non-unit,
   * upper or lower triangular matrix. No test for singularity or near-singularity
   * is included in this routine. Such tests must be performed before calling this routine.
   *
   * Input
   * -----
   * uplo   specifies whether the matrix is an upper or lower triangular matrix
   *        as follows: If uplo == 'U' or 'u', A is an upper triangluar matrix.
   *        If uplo == 'L' or 'l', A is a lower triangular matrix.
   * trans  specifies op(A). If trans == 'N' or 'n', op(A) = A. If trans == 'T'
   *        or 't', op(A) = transpose(A). If trans == 'C' or 'c', op(A) = 
   *        conjugate(transpose(A)).
   * diag   specifies whether A is unit triangular. If diag == 'U' or 'u', A is
   *        assumed to be unit triangular; thas is, diagonal elements are not
   *        read and are assumed to be unity. If diag == 'N' or 'n', A is not
   *        assumed to be unit triangular.
   * n      specifies the number of rows and columns of the matrix A. n must be
   *        at least zero.
   * AP     single precision complex array with at least ((n*(n+1))/2) elements.
   *        If uplo == 'U' or 'u', the array AP contains the upper triangular
   *        matrix A, packed sequentially, column by column; that is, if i <= j, then 
   *        A[i,j] is stored is AP[i+(j*(j+1)/2)]. If uplo == 'L' or 'L', the 
   *        array AP contains the lower triangular matrix A, packed sequentially,
   *        column by column; that is, if i >= j, then A[i,j] is stored in 
   *        AP[i+((2*n-j+1)*j)/2]. When diag = 'U' or 'u', the diagonal elements
   *        of A are not referenced and are assumed to be unity.
   * x      single precision complex array of length at least (1+(n-1)*abs(incx)).
   * incx   storage spacing between elements of x. It must not be zero.
   *
   * Output
   * ------
   * x      updated to contain the solution vector x that solves op(A) * x = b.
   *
   * Reference: http://www.netlib.org/blas/ctpsv.f
   *
   * Error status for this function can be retrieved via cublasGetError().
   *
   * Error Status
   * ------------
   * CUBLAS_STATUS_NOT_INITIALIZED  if CUBLAS library has not been initialized
   * CUBLAS_STATUS_INVALID_VALUE    if incx == 0 or if n < 0 or n > 2035 
   * CUBLAS_STATUS_EXECUTION_FAILED if function failed to launch on GPU
   * </pre>
   */

How to use cublasCtpsvNativemethodin jcuda.jcublas.JCublas

Best Java code snippets using jcuda.jcublas.JCublas.cublasCtpsvNative (Showing top 6 results out of 315)

How to use
cublasCtpsvNative
method
in
jcuda.jcublas.JCublas