public interface Level1
Modifier and Type | Method and Description |
---|---|
IComplexNumber |
asum(IComplexNDArray arr)
computes the sum of magnitudes
of all vector elements or, for a complex vector x, the sum
|
double |
asum(INDArray arr)
computes the sum of magnitudes of all vector elements or, for a complex vector x, the sum
|
void |
axpy(int n,
double alpha,
INDArray x,
INDArray y)
computes a vector-scalar product and adds the result to a vector.
|
void |
axpy(int n,
IComplexNumber alpha,
IComplexNDArray x,
IComplexNDArray y)
computes a vector-scalar product and adds the result to a vector.
|
void |
copy(IComplexNDArray x,
IComplexNDArray y) |
void |
copy(INDArray x,
INDArray y)
swaps a vector with another vector.
|
double |
dot(int n,
double alpha,
INDArray X,
INDArray Y)
computes a vector-vector dot product.
|
IComplexNumber |
dot(int n,
IComplexNumber alpha,
IComplexNDArray X,
IComplexNDArray Y)
computes a vector-vector dot product.
|
int |
iamax(IComplexNDArray arr)
finds the element of a vector that has the largest absolute value.
|
int |
iamax(INDArray arr)
finds the element of a
vector that has the largest absolute value.
|
int |
iamax(int n,
INDArray arr,
int stride)
finds the element of a
vector that has the largest absolute value.
|
int |
iamin(IComplexNDArray arr)
finds the element of a vector that has the minimum absolute value.
|
int |
iamin(INDArray arr)
finds the element of a vector that has the minimum absolute value.
|
IComplexNumber |
nrm2(IComplexNDArray arr)
computes the Euclidean norm of a vector.
|
double |
nrm2(INDArray arr)
computes the Euclidean norm of a vector.
|
void |
rot(int N,
IComplexNDArray X,
IComplexNDArray Y,
IComplexNumber c,
IComplexNumber s)
performs rotation of points in the plane.
|
void |
rot(int N,
INDArray X,
INDArray Y,
double c,
double s)
performs rotation of points in the plane.
|
void |
rotg(INDArray a,
INDArray b,
INDArray c,
INDArray s)
computes parameters for a Givens rotation.
|
void |
rotmg(IComplexNDArray d1,
IComplexNDArray d2,
IComplexNDArray b1,
IComplexNumber b2,
IComplexNDArray P)
computes the modified parameters for a Givens rotation.
|
void |
rotmg(INDArray d1,
INDArray d2,
INDArray b1,
double b2,
INDArray P)
computes the modified parameters for a Givens rotation.
|
void |
scal(int N,
double alpha,
INDArray X)
computes a vector by a scalar product.
|
void |
scal(int N,
IComplexNumber alpha,
IComplexNDArray X)
computes a vector by a scalar product.
|
void |
swap(IComplexNDArray x,
IComplexNDArray y) |
void |
swap(INDArray x,
INDArray y)
swaps a vector with another vector.
|
double dot(int n, double alpha, INDArray X, INDArray Y)
n
- alpha
- X
- Y
- IComplexNumber dot(int n, IComplexNumber alpha, IComplexNDArray X, IComplexNDArray Y)
n
- alpha
- X
- Y
- double nrm2(INDArray arr)
arr
- IComplexNumber nrm2(IComplexNDArray arr)
arr
- double asum(INDArray arr)
arr
- IComplexNumber asum(IComplexNDArray arr)
arr
- int iamax(INDArray arr)
arr
- int iamax(int n, INDArray arr, int stride)
n
- the length to iterate forarr
- the array to get the max
index forstride
- the stride for the arrayint iamax(IComplexNDArray arr)
arr
- int iamin(INDArray arr)
arr
- int iamin(IComplexNDArray arr)
arr
- void swap(IComplexNDArray x, IComplexNDArray y)
void copy(IComplexNDArray x, IComplexNDArray y)
void axpy(int n, double alpha, INDArray x, INDArray y)
n
- alpha
- x
- y
- void axpy(int n, IComplexNumber alpha, IComplexNDArray x, IComplexNDArray y)
n
- alpha
- x
- y
- void rotg(INDArray a, INDArray b, INDArray c, INDArray s)
a
- b
- c
- s
- void rot(int N, INDArray X, INDArray Y, double c, double s)
N
- X
- Y
- c
- s
- void rot(int N, IComplexNDArray X, IComplexNDArray Y, IComplexNumber c, IComplexNumber s)
N
- X
- Y
- c
- s
- void rotmg(INDArray d1, INDArray d2, INDArray b1, double b2, INDArray P)
d1
- d2
- b1
- b2
- P
- void rotmg(IComplexNDArray d1, IComplexNDArray d2, IComplexNDArray b1, IComplexNumber b2, IComplexNDArray P)
d1
- d2
- b1
- b2
- P
- void scal(int N, double alpha, INDArray X)
N
- alpha
- X
- void scal(int N, IComplexNumber alpha, IComplexNDArray X)
N
- alpha
- X
- Copyright © 2015. All Rights Reserved.