Index of values

add ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y adds n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

add ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y adds n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

add ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y adds n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

add ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y adds n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

add_const c ?m ?n ?br ?bc ?b ?ar ?ac a adds constant c to the designated m by n submatrix in a and stores the result in the designated submatrix in b.

add_const c ?n ?ofsy ?incy ?y ?ofsx ?incx x adds constant c to the n elements of vector x and stores the result in y, using incx and incy as incremental steps respectively.

add_const c ?m ?n ?br ?bc ?b ?ar ?ac a adds constant c to the designated m by n submatrix in a and stores the result in the designated submatrix in b.

add_const c ?n ?ofsy ?incy ?y ?ofsx ?incx x adds constant c to the n elements of vector x and stores the result in y, using incx and incy as incremental steps respectively.

add_const c ?m ?n ?br ?bc ?b ?ar ?ac a adds constant c to the designated m by n submatrix in a and stores the result in the designated submatrix in b.

add_const c ?n ?ofsy ?incy ?y ?ofsx ?incx x adds constant c to the n elements of vector x and stores the result in y, using incx and incy as incremental steps respectively.

add_const c ?m ?n ?br ?bc ?b ?ar ?ac a adds constant c to the designated m by n submatrix in a and stores the result in the designated submatrix in b.

add_const c ?n ?ofsy ?incy ?y ?ofsx ?incx x adds constant c to the n elements of vector x and stores the result in y, using incx and incy as incremental steps respectively.

amax ?n ?ofsx ?incx x

amax ?n ?ofsx ?incx x

amax ?n ?ofsx ?incx x

amax ?n ?ofsx ?incx x

append v1 v2

append v1 v2

append v1 v2

append v1 v2

as_vec mat

as_vec mat

as_vec mat

as_vec mat

asum ?n ?ofsx ?incx x see BLAS documentation!

asum ?n ?ofsx ?incx x see BLAS documentation!

axpy ?alpha ?m ?n ?xr ?xc x ?yr ?yc y BLAS axpy function for matrices.

axpy ?alpha ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

axpy ?alpha ?m ?n ?xr ?xc x ?yr ?yc y BLAS axpy function for matrices.

axpy ?alpha ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

axpy ?alpha ?m ?n ?xr ?xc x ?yr ?yc y BLAS axpy function for matrices.

axpy ?alpha ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

axpy ?alpha ?m ?n ?xr ?xc x ?yr ?yc y BLAS axpy function for matrices.

axpy ?alpha ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

col m n

col m n

col m n

col m n

concat vs

concat vs

concat vs

concat vs

copy ?n ?ofsy ?incy ?y ?ofsx ?incx x see BLAS documentation!

copy ?n ?ofsy ?incy ?y ?ofsx ?incx x see BLAS documentation!

copy ?n ?ofsy ?incy ?y ?ofsx ?incx x see BLAS documentation!

copy ?n ?ofsy ?incy ?y ?ofsx ?incx x see BLAS documentation!

copy_diag m

copy_diag m

copy_diag m

copy_diag m

copy_row ?vec mat int

copy_row ?vec mat int

copy_row ?vec mat int

copy_row ?vec mat int

cos ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the cosine of n elements of the vector x using incx as incremental steps.

cos ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the cosine of n elements of the vector x using incx as incremental steps.

create m n

create n

create m n

create n

create m n

create n

create m n

create n

create_int32_vec n

create_int_vec n

create_mvec m

create_mvec m

create_mvec m

create_mvec m

detri ?up ?n ?ar ?ac a takes a triangular (sub-)matrix a, i.e.

detri ?up ?n ?ar ?ac a takes a triangular (sub-)matrix a, i.e.

detri ?up ?n ?ar ?ac a takes a triangular (sub-)matrix a, i.e.

detri ?up ?n ?ar ?ac a takes a triangular (sub-)matrix a, i.e.

dim x

dim x

dim x

dim x

dim1 m

dim1 m

dim1 m

dim1 m

dim2 m

dim2 m

dim2 m

dim2 m

div ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y divides n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

div ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y divides n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

div ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y divides n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

div ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y divides n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

dot ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

dot ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

dotc ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

dotc ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

dotu ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

dotu ?n ?ofsx ?incx x ?ofsy ?incy y see BLAS documentation!

empty, the empty matrix.

empty, the empty vector.

empty, the empty matrix.

empty, the empty vector.

empty, the empty matrix.

empty, the empty vector.

empty, the empty matrix.

empty, the empty vector.

exp ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the exponential of n elements of the vector x using incx as incremental steps.

exp ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the exponential of n elements of the vector x using incx as incremental steps.

fill ?m ?n ?ar ?ac a x fills the specified sub-matrix in a with value x.

fill ?n ?ofsx ?incx x a fills vector x with value a in the designated range.

fill ?m ?n ?ar ?ac a x fills the specified sub-matrix in a with value x.

fill ?n ?ofsx ?incx x a fills vector x with value a in the designated range.

fill ?m ?n ?ar ?ac a x fills the specified sub-matrix in a with value x.

fill ?n ?ofsx ?incx x a fills vector x with value a in the designated range.

fill ?m ?n ?ar ?ac a x fills the specified sub-matrix in a with value x.

fill ?n ?ofsx ?incx x a fills vector x with value a in the designated range.

fold f a ?n ?ofsx ?incx x is f (... (f (f a x.{ofsx}) x.{ofsx + incx}) ...) x.{ofsx + (n-1)*incx} if incx > 0 and the same in the reverse order of appearance of the x values if incx < 0.

fold f a ?n ?ofsx ?incx x is f (... (f (f a x.{ofsx}) x.{ofsx + incx}) ...) x.{ofsx + (n-1)*incx} if incx > 0 and the same in the reverse order of appearance of the x values if incx < 0.

fold f a ?n ?ofsx ?incx x is f (... (f (f a x.{ofsx}) x.{ofsx + incx}) ...) x.{ofsx + (n-1)*incx} if incx > 0 and the same in the reverse order of appearance of the x values if incx < 0.

fold f a ?n ?ofsx ?incx x is f (... (f (f a x.{ofsx}) x.{ofsx + incx}) ...) x.{ofsx + (n-1)*incx} if incx > 0 and the same in the reverse order of appearance of the x values if incx < 0.

fold_cols f ?n ?ac acc a

fold_cols f ?n ?ac acc a

fold_cols f ?n ?ac acc a

fold_cols f ?n ?ac acc a

from_col_vec v

from_col_vec v

from_col_vec v

from_col_vec v

from_row_vec v

from_row_vec v

from_row_vec v

from_row_vec v

gbmv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a kl ku ?ofsx ?incx x see BLAS documentation!

gbmv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a kl ku ?ofsx ?incx x see BLAS documentation!

gbmv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a kl ku ?ofsx ?incx x see BLAS documentation!

gbmv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a kl ku ?ofsx ?incx x see BLAS documentation!

gbsv ?n ?ipiv ?abr ?abc ab kl ku ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is a band matrix of order n with kl subdiagonals and ku superdiagonals, and X and b are n-by-nrhs matrices.

gbsv ?n ?ipiv ?abr ?abc ab kl ku ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is a band matrix of order n with kl subdiagonals and ku superdiagonals, and X and b are n-by-nrhs matrices.

gbsv ?n ?ipiv ?abr ?abc ab kl ku ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is a band matrix of order n with kl subdiagonals and ku superdiagonals, and X and b are n-by-nrhs matrices.

gbsv ?n ?ipiv ?abr ?abc ab kl ku ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is a band matrix of order n with kl subdiagonals and ku superdiagonals, and X and b are n-by-nrhs matrices.

gecon ?n ?norm ?anorm ?work ?rwork ?ar ?ac a

gecon ?n ?norm ?anorm ?work ?rwork ?ar ?ac a

gecon ?n ?norm ?anorm ?work ?rwork ?ar ?ac a

gecon ?n ?norm ?anorm ?work ?rwork ?ar ?ac a

gecon_min_liwork n

gecon_min_liwork n

gecon_min_lrwork n

gecon_min_lrwork n

gecon_min_lwork n

gecon_min_lwork n

gecon_min_lwork n

gecon_min_lwork n

gees ?n ?jobvs ?sort ?w ?vsr ?vsc ?vs ?work ?ar ?ac a See gees-function for details about arguments.

gees ?n ?jobvs ?sort ?w ?vsr ?vsc ?vs ?work ?ar ?ac a See gees-function for details about arguments.

gees ?n ?jobvs ?sort ?w ?vsr ?vsc ?vs ?work ?ar ?ac a See gees-function for details about arguments.

gees ?n ?jobvs ?sort ?w ?vsr ?vsc ?vs ?work ?ar ?ac a See gees-function for details about arguments.

geev ?work ?rwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofsw w ?ar ?ac a

geev ?work ?rwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofsw w ?ar ?ac a

geev ?work ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofswr wr ?ofswi wi ?ar ?ac a

geev ?work ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofswr wr ?ofswi wi ?ar ?ac a

geev_min_lrwork n

geev_min_lrwork n

geev_min_lwork n

geev_min_lwork n

geev_min_lwork vectors n

geev_min_lwork vectors n

geev ?work ?rwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofsw w ?ar ?ac a See geev-function for details about arguments.

geev ?work ?rwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofsw w ?ar ?ac a See geev-function for details about arguments.

geev_opt_lwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofswr wr ?ofswi wi ?ar ?ac a See geev-function for details about arguments.

geev_opt_lwork ?n ?vlr ?vlc ?vl ?vrr ?vrc ?vr ?ofswr wr ?ofswi wi ?ar ?ac a See geev-function for details about arguments.

gels ?m ?n ?work ?trans ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gels ?m ?n ?work ?trans ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gels ?m ?n ?work ?trans ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gels ?m ?n ?work ?trans ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gels_min_lwork ~m ~n ~nrhs

gels_min_lwork ~m ~n ~nrhs

gels_min_lwork ~m ~n ~nrhs

gels_min_lwork ~m ~n ~nrhs

gels_opt_lwork ?m ?n ?trans ?ar ?ac a ?nrhs ?br ?bc b

gels_opt_lwork ?m ?n ?trans ?ar ?ac a ?nrhs ?br ?bc b

gels_opt_lwork ?m ?n ?trans ?ar ?ac a ?nrhs ?br ?bc b

gels_opt_lwork ?m ?n ?trans ?ar ?ac a ?nrhs ?br ?bc b

gelsd ?m ?n ?rcond ?ofss ?s ?ofswork ?work ?ar ?ac a ?nrhs b see LAPACK documentation!

gelsd ?m ?n ?rcond ?ofss ?s ?ofswork ?work ?ar ?ac a ?nrhs b see LAPACK documentation!

gelsd_min_iwork m n

gelsd_min_iwork m n

gelsd_min_lwork ~m ~n ~nrhs

gelsd_min_lwork ~m ~n ~nrhs

gelsd_opt_lwork ?m ?n ?ar ?ac a ?nrhs b

gelsd_opt_lwork ?m ?n ?ar ?ac a ?nrhs b

gelss ?m ?n ?rcond ?ofss ?s ?ofswork ?work ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gelss ?m ?n ?rcond ?ofss ?s ?ofswork ?work ?ar ?ac a ?nrhs ?br ?bc b see LAPACK documentation!

gelss_min_lwork ~m ~n ~nrhs

gelss_min_lwork ~m ~n ~nrhs

gelss_opt_lwork ?ar ?ac a ?m ?n ?nrhs ?br ?bc b

gelss_opt_lwork ?ar ?ac a ?m ?n ?nrhs ?br ?bc b

gelsy ?m ?n ?ar ?ac a ?rcond ?jpvt ?ofswork ?work ?nrhs b see LAPACK documentation!

gelsy ?m ?n ?ar ?ac a ?rcond ?jpvt ?ofswork ?work ?nrhs b see LAPACK documentation!

gelsy_min_lwork ~m ~n ~nrhs

gelsy_min_lwork ~m ~n ~nrhs

gelsy_opt_lwork ?m ?n ?ar ?ac a ?nrhs ?br ?bc b

gelsy_opt_lwork ?m ?n ?ar ?ac a ?nrhs ?br ?bc b

gemm ?m ?n ?k ?beta ?cr ?cc ?c ?transa ?alpha ?ar ?ac a ?transb ?br ?bc b see BLAS documentation!

gemm ?m ?n ?k ?beta ?cr ?cc ?c ?transa ?alpha ?ar ?ac a ?transb ?br ?bc b see BLAS documentation!

gemm ?m ?n ?k ?beta ?cr ?cc ?c ?transa ?alpha ?ar ?ac a ?transb ?br ?bc b see BLAS documentation!

gemm ?m ?n ?k ?beta ?cr ?cc ?c ?transa ?alpha ?ar ?ac a ?transb ?br ?bc b see BLAS documentation!

gemm_diag ?n ?k ?beta ?ofsy ?y ?transa ?transb ?alpha ?ar ?ac a ?br ?bc b computes the diagonal of the product of the (sub-)matrices a and b (taking into account potential transposing), multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

gemm_diag ?n ?k ?beta ?ofsy ?y ?transa ?transb ?alpha ?ar ?ac a ?br ?bc b computes the diagonal of the product of the (sub-)matrices a and b (taking into account potential transposing), multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

gemm_diag ?n ?k ?beta ?ofsy ?y ?transa ?transb ?alpha ?ar ?ac a ?br ?bc b computes the diagonal of the product of the (sub-)matrices a and b (taking into account potential transposing), multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

gemm_diag ?n ?k ?beta ?ofsy ?y ?transa ?transb ?alpha ?ar ?ac a ?br ?bc b computes the diagonal of the product of the (sub-)matrices a and b (taking into account potential transposing), multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

gemm_trace ?n ?k ?transa ?ar ?ac a ?transb ?br ?bc b computes the trace of the product of the (sub-)matrices a and b (taking into account potential transposing).

gemm_trace ?n ?k ?transa ?ar ?ac a ?transb ?br ?bc b computes the trace of the product of the (sub-)matrices a and b (taking into account potential transposing).

gemm_trace ?n ?k ?transa ?ar ?ac a ?transb ?br ?bc b computes the trace of the product of the (sub-)matrices a and b (taking into account potential transposing).

gemm_trace ?n ?k ?transa ?ar ?ac a ?transb ?br ?bc b computes the trace of the product of the (sub-)matrices a and b (taking into account potential transposing).

gemv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation! BEWARE that the 1988 BLAS-2 specification mandates that this function has no effect when n=0 while the mathematically expected behabior is y ← beta * y.

gemv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation! BEWARE that the 1988 BLAS-2 specification mandates that this function has no effect when n=0 while the mathematically expected behabior is y ← beta * y.

gemv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation! BEWARE that the 1988 BLAS-2 specification mandates that this function has no effect when n=0 while the mathematically expected behabior is y ← beta * y.

gemv ?m ?n ?beta ?ofsy ?incy ?y ?trans ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation! BEWARE that the 1988 BLAS-2 specification mandates that this function has no effect when n=0 while the mathematically expected behabior is y ← beta * y.

geqrf ?m ?n ?work ?tau ?ar ?ac a computes a QR factorization of a real m-by-n matrix a.

geqrf ?m ?n ?work ?tau ?ar ?ac a computes a QR factorization of a real m-by-n matrix a.

geqrf ?m ?n ?work ?tau ?ar ?ac a computes a QR factorization of a real m-by-n matrix a.

geqrf ?m ?n ?work ?tau ?ar ?ac a computes a QR factorization of a real m-by-n matrix a.

geqrf_min_lwork ~n

geqrf_min_lwork ~n

geqrf_min_lwork ~n

geqrf_min_lwork ~n

geqrf_opt_lwork ?m ?n ?ar ?ac a

geqrf_opt_lwork ?m ?n ?ar ?ac a

geqrf_opt_lwork ?m ?n ?ar ?ac a

geqrf_opt_lwork ?m ?n ?ar ?ac a

ger ?m ?n ?alpha ?ofsx ?incx x ?ofsy ?incy y n ?ar ?ac a see BLAS documentation!

ger ?m ?n ?alpha ?ofsx ?incx x ?ofsy ?incy y n ?ar ?ac a see BLAS documentation!

gesdd_min_lwork ?jobz ~m ~n

gesdd_min_lwork ?jobz ~m ~n

gesv ?n ?ipiv ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n matrix and X and b are n-by-nrhs matrices.

gesv ?n ?ipiv ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n matrix and X and b are n-by-nrhs matrices.

gesv ?n ?ipiv ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n matrix and X and b are n-by-nrhs matrices.

gesv ?n ?ipiv ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n matrix and X and b are n-by-nrhs matrices.

gesvd_lrwork m n

gesvd_lrwork m n

gesvd_min_lwork ~m ~n

gesvd_min_lwork ~m ~n

gesvd_min_lwork ~m ~n

gesvd_min_lwork ~m ~n

getrf ?m ?n ?ipiv ?ar ?ac a computes an LU factorization of a general m-by-n matrix a using partial pivoting with row interchanges.

getrf ?m ?n ?ipiv ?ar ?ac a computes an LU factorization of a general m-by-n matrix a using partial pivoting with row interchanges.

getrf ?m ?n ?ipiv ?ar ?ac a computes an LU factorization of a general m-by-n matrix a using partial pivoting with row interchanges.

getrf ?m ?n ?ipiv ?ar ?ac a computes an LU factorization of a general m-by-n matrix a using partial pivoting with row interchanges.

getri ?n ?ipiv ?work ?ar ?ac a computes the inverse of a matrix using the LU factorization computed by Lacaml_C.getrf.

getri ?n ?ipiv ?work ?ar ?ac a computes the inverse of a matrix using the LU factorization computed by Lacaml_Z.getrf.

getri ?n ?ipiv ?work ?ar ?ac a computes the inverse of a matrix using the LU factorization computed by Lacaml_S.getrf.

getri ?n ?ipiv ?work ?ar ?ac a computes the inverse of a matrix using the LU factorization computed by Lacaml_D.getrf.

getri_min_lwork n

getri_min_lwork n

getri_min_lwork n

getri_min_lwork n

getri_opt_lwork ?n ?ar ?ac a

getri_opt_lwork ?n ?ar ?ac a

getri_opt_lwork ?n ?ar ?ac a

getri_opt_lwork ?n ?ar ?ac a

getrs ?n ?ipiv ?trans ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a * X = b or a' * X = b with a general n-by-n matrix a using the LU factorization computed by Lacaml_C.getrf.

getrs ?n ?ipiv ?trans ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a * X = b or a' * X = b with a general n-by-n matrix a using the LU factorization computed by Lacaml_Z.getrf.

getrs ?n ?ipiv ?trans ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a * X = b or a' * X = b with a general n-by-n matrix a using the LU factorization computed by Lacaml_S.getrf.

getrs ?n ?ipiv ?trans ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a * X = b or a' * X = b with a general n-by-n matrix a using the LU factorization computed by Lacaml_D.getrf.

gtsv ?n ?ofsdl dl ?ofsd d ?ofsdu du ?nrhs ?br ?bc b solves the equation a * X = b where a is an n-by-n tridiagonal matrix, by Gaussian elimination with partial pivoting.

gtsv ?n ?ofsdl dl ?ofsd d ?ofsdu du ?nrhs ?br ?bc b solves the equation a * X = b where a is an n-by-n tridiagonal matrix, by Gaussian elimination with partial pivoting.

gtsv ?n ?ofsdl dl ?ofsd d ?ofsdu du ?nrhs ?br ?bc b solves the equation a * X = b where a is an n-by-n tridiagonal matrix, by Gaussian elimination with partial pivoting.

gtsv ?n ?ofsdl dl ?ofsd d ?ofsdu du ?nrhs ?br ?bc b solves the equation a * X = b where a is an n-by-n tridiagonal matrix, by Gaussian elimination with partial pivoting.

hankel n

hankel n

hilbert n

hilbert n

iamax ?n ?ofsx ?incx x see BLAS documentation!

iamax ?n ?ofsx ?incx x see BLAS documentation!

iamax ?n ?ofsx ?incx x see BLAS documentation!

iamax ?n ?ofsx ?incx x see BLAS documentation!

identity n

identity n

identity n

identity n

init n f

init n f

init n f

init n f

init_cols m n f

init_cols m n f

init_cols m n f

init_cols m n f

init_cols m n f

init_cols m n f

init_cols m n f

init_cols m n f

iter ?n ?ofsx ?incx f x applies function f in turn to all elements of vector x.

iter ?n ?ofsx ?incx f x applies function f in turn to all elements of vector x.

iter ?n ?ofsx ?incx f x applies function f in turn to all elements of vector x.

iter ?n ?ofsx ?incx f x applies function f in turn to all elements of vector x.

iteri ?n ?ofsx ?incx f x same as iter but additionally passes the index of the element as first argument and the element itself as second argument.

iteri ?n ?ofsx ?incx f x same as iter but additionally passes the index of the element as first argument and the element itself as second argument.

iteri ?n ?ofsx ?incx f x same as iter but additionally passes the index of the element as first argument and the element itself as second argument.

iteri ?n ?ofsx ?incx f x same as iter but additionally passes the index of the element as first argument and the element itself as second argument.

lacpy ?uplo ?m ?n ?br ?bc ?b ?ar ?ac a copy a (triangular) (sub-)matrix a (to an optional (sub-)matrix b).

lacpy ?uplo ?m ?n ?br ?bc ?b ?ar ?ac a copy a (triangular) (sub-)matrix a (to an optional (sub-)matrix b).

lacpy ?uplo ?m ?n ?br ?bc ?b ?ar ?ac a copy a (triangular) (sub-)matrix a (to an optional (sub-)matrix b).

lacpy ?uplo ?m ?n ?br ?bc ?b ?ar ?ac a copy a (triangular) (sub-)matrix a (to an optional (sub-)matrix b).

lamch cmach see LAPACK documentation!

lamch cmach see LAPACK documentation!

lange ?m ?n ?norm ?work ?ar ?ac a

lange ?m ?n ?norm ?work ?ar ?ac a

lange ?m ?n ?norm ?work ?ar ?ac a

lange ?m ?n ?norm ?work ?ar ?ac a

lange_min_lwork m norm

lange_min_lwork m norm

lange_min_lwork m norm

lange_min_lwork m norm

lansy ?n ?up ?norm ?work ?ar ?ac a see LAPACK documentation!

lansy ?n ?up ?norm ?work ?ar ?ac a see LAPACK documentation!

lansy ?norm ?up ?n ?ar ?ac ?work a see LAPACK documentation!

lansy ?norm ?up ?n ?ar ?ac ?work a see LAPACK documentation!

lansy_min_lwork m norm

lansy_min_lwork m norm

lansy_min_lwork m norm

lansy_min_lwork m norm

larnv ?idist ?iseed ?n ?ofsx ?x ()

larnv ?idist ?iseed ?n ?ofsx ?x ()

larnv ?idist ?iseed ?n ?ofsx ?x ()

larnv ?idist ?iseed ?n ?ofsx ?x ()

lassq ?n ?ofsx ?incx ?scale ?sumsq

lassq ?n ?ofsx ?incx ?scale ?sumsq

lassq ?n ?ofsx ?incx ?scale ?sumsq

lassq ?n ?ofsx ?incx ?scale ?sumsq

lauum ?up ?n ?ar ?ac a computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array a.

lauum ?up ?n ?ar ?ac a computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array a.

lauum ?up ?n ?ar ?ac a computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array a.

lauum ?up ?n ?ar ?ac a computes the product U * U**T or L**T * L, where the triangular factor U or L is stored in the upper or lower triangular part of the array a.

linspace ?z a b n

linspace ?z a b n

linspace ?z a b n

linspace ?z a b n

log ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the logarithm of n elements of the vector x using incx as incremental steps.

log ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the logarithm of n elements of the vector x using incx as incremental steps.

logspace ?z a b base n

logspace ?z a b base n

logspace ?z a b base n

logspace ?z a b base n

make m n x

make n x

make m n x

make n x

make m n x

make n x

make m n x

make n x

make0 m n x

make0 n x

make0 m n x

make0 n x

make0 m n x

make0 n x

make0 m n x

make0 n x

make_mvec m x

make_mvec m x

make_mvec m x

make_mvec m x

map f ?m ?n ?br ?bc ?b ?ar ?ac a

map f ?n ?ofsx ?incx x

map f ?m ?n ?br ?bc ?b ?ar ?ac a

map f ?n ?ofsx ?incx x

map f ?m ?n ?br ?bc ?b ?ar ?ac a

map f ?n ?ofsx ?incx x

map f ?m ?n ?br ?bc ?b ?ar ?ac a

map f ?n ?ofsx ?incx x

mat_from_vec a converts the vector a into a matrix with Array1.dim a rows and 1 column.

max ?n ?ofsx ?incx x computes the greater of the n elements in vector x (2-norm), separated by incx incremental steps.

max ?n ?ofsx ?incx x computes the greater of the n elements in vector x (2-norm), separated by incx incremental steps.

max ?n ?ofsx ?incx x computes the greater of the n elements in vector x (2-norm), separated by incx incremental steps.

max ?n ?ofsx ?incx x computes the greater of the n elements in vector x (2-norm), separated by incx incremental steps.

min ?n ?ofsx ?incx x computes the smaller of the n elements in vector x (2-norm), separated by incx incremental steps.

min ?n ?ofsx ?incx x computes the smaller of the n elements in vector x (2-norm), separated by incx incremental steps.

min ?n ?ofsx ?incx x computes the smaller of the n elements in vector x (2-norm), separated by incx incremental steps.

min ?n ?ofsx ?incx x computes the smaller of the n elements in vector x (2-norm), separated by incx incremental steps.

mul ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y multiplies n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

mul ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y multiplies n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

mul ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y multiplies n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

mul ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y multiplies n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

mvec_of_array ar

mvec_of_array ar

mvec_of_array ar

mvec_of_array ar

mvec_to_array mat

mvec_to_array mat

mvec_to_array mat

mvec_to_array mat

neg ?n ?ofsy ?incy ?y ?ofsx ?incx x negates n elements of the vector x using incx as incremental steps.

neg ?n ?ofsy ?incy ?y ?ofsx ?incx x negates n elements of the vector x using incx as incremental steps.

neg ?n ?ofsy ?incy ?y ?ofsx ?incx x negates n elements of the vector x using incx as incremental steps.

neg ?n ?ofsy ?incy ?y ?ofsx ?incx x negates n elements of the vector x using incx as incremental steps.

nrm2 ?n ?ofsx ?incx x see BLAS documentation!

nrm2 ?n ?ofsx ?incx x see BLAS documentation!

nrm2 ?n ?ofsx ?incx x see BLAS documentation!

nrm2 ?n ?ofsx ?incx x see BLAS documentation!

of_array ar

of_array ar

of_array ar

of_array ar

of_array ar

of_array ar

of_array ar

of_array ar

of_col_vecs ar

of_col_vecs ar

of_col_vecs ar

of_col_vecs ar

of_diag v

of_diag v

of_diag v

of_diag v

of_list l

of_list l

of_list l

of_list l

orgqr ?m ?n ?k ?work ~tau ?ar ?ac a see LAPACK documentation!

orgqr ?m ?n ?k ?work ~tau ?ar ?ac a see LAPACK documentation!

orgqr_min_lwork ~n

orgqr_min_lwork ~n

orgqr_opt_lwork ?m ?n ?k ~tau ?ar ?ac a

orgqr_opt_lwork ?m ?n ?k ~tau ?ar ?ac a

ormqr ?side ?trans ?m ?n ?k ?work ~tau ?ar ?ac a ?cr ?cc c see LAPACK documentation!

ormqr ?side ?trans ?m ?n ?k ?work ~tau ?ar ?ac a ?cr ?cc c see LAPACK documentation!

ormqr_opt_lwork ?side ?trans ?m ?n ?k ~tau ?ar ?ac a ?cr ?cc c

ormqr_opt_lwork ?side ?trans ?m ?n ?k ~tau ?ar ?ac a ?cr ?cc c

packed ?up ?n ?ar ?ac a

packed ?up ?n ?ar ?ac a

packed ?up ?n ?ar ?ac a

packed ?up ?n ?ar ?ac a

pascal n

pascal n

pbsv ?n ?up ?kd ?abr ?abc ab ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite band matrix and X and b are n-by-nrhs matrices.

pbsv ?n ?up ?kd ?abr ?abc ab ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite band matrix and X and b are n-by-nrhs matrices.

pbsv ?n ?up ?kd ?abr ?abc ab ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite band matrix and X and b are n-by-nrhs matrices.

pbsv ?n ?up ?kd ?abr ?abc ab ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite band matrix and X and b are n-by-nrhs matrices.

pocon ?n ?up ?anorm ?work ?rwork ?ar ?ac a

pocon ?n ?up ?anorm ?work ?rwork ?ar ?ac a

pocon ?n ?up ?anorm ?work ?iwork ?ar ?ac a

pocon ?n ?up ?anorm ?work ?iwork ?ar ?ac a

pocon_min_liwork n

pocon_min_liwork n

pocon_min_lrwork n

pocon_min_lrwork n

pocon_min_lwork n

pocon_min_lwork n

pocon_min_lwork n

pocon_min_lwork n

posv ?n ?up ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix and X and b are n-by-nrhs matrices.

posv ?n ?up ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix and X and b are n-by-nrhs matrices.

posv ?n ?up ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix and X and b are n-by-nrhs matrices.

posv ?n ?up ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix and X and b are n-by-nrhs matrices.

potrf ?n ?up ?ar ?ac ?jitter a factorizes symmetric positive definite matrix a (or the designated submatrix) using Cholesky factorization.

potrf ?n ?up ?ar ?ac ?jitter a factorizes symmetric positive definite matrix a (or the designated submatrix) using Cholesky factorization.

potrf ?n ?up ?ar ?ac ?jitter a factorizes symmetric positive definite matrix a (or the designated submatrix) using Cholesky factorization.

potrf ?n ?up ?ar ?ac ?jitter a factorizes symmetric positive definite matrix a (or the designated submatrix) using Cholesky factorization.

potri ?n ?up ?ar ?ac ?factorize ?jitter a computes the inverse of the real symmetric positive definite matrix a using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_C.potrf.

potri ?n ?up ?ar ?ac ?factorize ?jitter a computes the inverse of the real symmetric positive definite matrix a using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_Z.potrf.

potri ?n ?up ?ar ?ac ?factorize ?jitter a computes the inverse of the real symmetric positive definite matrix a using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_S.potrf.

potri ?n ?up ?ar ?ac ?factorize ?jitter a computes the inverse of the real symmetric positive definite matrix a using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_D.potrf.

potrs ?n ?up ?ar ?ac a ?nrhs ?br ?bc ?factorize ?jitter b solves a system of linear equations a*X = b, where a is symmetric positive definite matrix, using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_C.potrf.

potrs ?n ?up ?ar ?ac a ?nrhs ?br ?bc ?factorize ?jitter b solves a system of linear equations a*X = b, where a is symmetric positive definite matrix, using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_Z.potrf.

potrs ?n ?up ?ar ?ac a ?nrhs ?br ?bc ?factorize ?jitter b solves a system of linear equations a*X = b, where a is symmetric positive definite matrix, using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_S.potrf.

potrs ?n ?up ?ar ?ac a ?nrhs ?br ?bc ?factorize ?jitter b solves a system of linear equations a*X = b, where a is symmetric positive definite matrix, using the Cholesky factorization a = U**T*U or a = L*L**T computed by Lacaml_D.potrf.

fprintf ppf "(%G, %Gi)" el.re el.im

fprintf ppf "%G" el

fprintf ppf "%ld" el

Pretty-printer for matrices.

Pretty-printer for matrices.

Pretty-printer for matrices.

Pretty-printer for matrices.

pp_mat_gen ?pp_open ?pp_close ?pp_head ?pp_foot ?pp_end_row ?pp_end_col ?pp_left ?pp_right ?pad pp_el ppf mat

pp_num ppf el is equivalent to fprintf ppf "(%G, %Gi)" el.re el.im.

pp_num ppf el is equivalent to fprintf ppf "(%G, %Gi)" el.re el.im.

pp_num ppf el is equivalent to fprintf ppf "%G" el.

pp_num ppf el is equivalent to fprintf ppf "%G" el.

pp_omat ppf pp_el mat prints matrix mat to formatter ppf in OCaml-style using the element printer pp_el.

pp_ovec ppf pp_el vec prints the column vector vec to formatter ppf in OCaml-style using the element printer pp_el.

pp_rovec ppf pp_el vec prints the row vector vec to formatter ppf in OCaml-style using the element printer pp_el.

Pretty-printer for column vectors.

Pretty-printer for column vectors.

Pretty-printer for column vectors.

Pretty-printer for column vectors.

ppsv ?n ?up ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix stored in packed format and X and b are n-by-nrhs matrices.

ppsv ?n ?up ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix stored in packed format and X and b are n-by-nrhs matrices.

ppsv ?n ?up ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix stored in packed format and X and b are n-by-nrhs matrices.

ppsv ?n ?up ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric positive definite matrix stored in packed format and X and b are n-by-nrhs matrices.

Precision for this submodule C.

Precision for this submodule Z.

Precision for this submodule S.

Precision for this submodule D.

prod ?n ?ofsx ?incx x computes the product of the n elements in vector x, separated by incx incremental steps.

prod ?n ?ofsx ?incx x computes the product of the n elements in vector x, separated by incx incremental steps.

prod ?n ?ofsx ?incx x computes the product of the n elements in vector x, separated by incx incremental steps.

prod ?n ?ofsx ?incx x computes the product of the n elements in vector x, separated by incx incremental steps.

ptsv ?n ?ofsd d ?ofse e ?nrhs ?br ?bc b computes the solution to the real system of linear equations a*X = b, where a is an n-by-n symmetric positive definite tridiagonal matrix, and X and b are n-by-nrhs matrices.

ptsv ?n ?ofsd d ?ofse e ?nrhs ?br ?bc b computes the solution to the real system of linear equations a*X = b, where a is an n-by-n symmetric positive definite tridiagonal matrix, and X and b are n-by-nrhs matrices.

ptsv ?n ?ofsd d ?ofse e ?nrhs ?br ?bc b computes the solution to the real system of linear equations a*X = b, where a is an n-by-n symmetric positive definite tridiagonal matrix, and X and b are n-by-nrhs matrices.

ptsv ?n ?ofsd d ?ofse e ?nrhs ?br ?bc b computes the solution to the real system of linear equations a*X = b, where a is an n-by-n symmetric positive definite tridiagonal matrix, and X and b are n-by-nrhs matrices.

random ?rnd_state ?re_from ?re_range ?im_from ?im_range m n

random ?rnd_state ?re_from ?re_range ?im_from ?im_range n

random ?rnd_state ?re_from ?re_range ?im_from ?im_range m n

random ?rnd_state ?re_from ?re_range ?im_from ?im_range n

random ?rnd_state ?from ?range m n

random ?rnd_state ?from ?range n

random ?rnd_state ?from ?range m n

random ?rnd_state ?from ?range n

reci ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the reciprocal value of n elements of the vector x using incx as incremental steps.

reci ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the reciprocal value of n elements of the vector x using incx as incremental steps.

reci ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the reciprocal value of n elements of the vector x using incx as incremental steps.

reci ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the reciprocal value of n elements of the vector x using incx as incremental steps.

rev x reverses vector x (non-destructive).

rev x reverses vector x (non-destructive).

rev x reverses vector x (non-destructive).

rev x reverses vector x (non-destructive).

rosser n

rosser n

sbev ?n ?vectors ?zr ?zc ?z ?up ?ofswork ?work ?ofsw ?w ?abr ?abc ab computes all the eigenvalues and, optionally, eigenvectors of the real symmetric band matrix ab.

sbev ?n ?vectors ?zr ?zc ?z ?up ?ofswork ?work ?ofsw ?w ?abr ?abc ab computes all the eigenvalues and, optionally, eigenvectors of the real symmetric band matrix ab.

sbev_min_lwork n

sbev_min_lwork n

sbgv ?n ?ka ?kb ?zr ?zc ?z ?up ?work ?ofsw ?w ?ar ?ac a ?br ?bc b computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form a*x=(lambda)*b*x.

sbgv ?n ?ka ?kb ?zr ?zc ?z ?up ?work ?ofsw ?w ?ar ?ac a ?br ?bc b computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite banded eigenproblem, of the form a*x=(lambda)*b*x.

sbmv ?n ?k ?ofsy ?incy ?y ?ar ?ac a ?up ?alpha ?beta ?ofsx ?incx x see BLAS documentation!

sbmv ?n ?k ?ofsy ?incy ?y ?ar ?ac a ?up ?alpha ?beta ?ofsx ?incx x see BLAS documentation!

scal ?m ?n alpha ?ar ?ac a BLAS scal function for (sub-)matrices.

scal ?n alpha ?ofsx ?incx x see BLAS documentation!

scal ?m ?n alpha ?ar ?ac a BLAS scal function for (sub-)matrices.

scal ?n alpha ?ofsx ?incx x see BLAS documentation!

scal ?m ?n alpha ?ar ?ac a BLAS scal function for (sub-)matrices.

scal ?n alpha ?ofsx ?incx x see BLAS documentation!

scal ?m ?n alpha ?ar ?ac a BLAS scal function for (sub-)matrices.

scal ?n alpha ?ofsx ?incx x see BLAS documentation!

scal_cols ?m ?n ?ar ?ac a ?ofs alphas column-wise scal function for matrices.

scal_cols ?m ?n ?ar ?ac a ?ofs alphas column-wise scal function for matrices.

scal_cols ?m ?n ?ar ?ac a ?ofs alphas column-wise scal function for matrices.

scal_cols ?m ?n ?ar ?ac a ?ofs alphas column-wise scal function for matrices.

scal_rows ?m ?n ?ofs alphas ?ar ?ac a row-wise scal function for matrices.

scal_rows ?m ?n ?ofs alphas ?ar ?ac a row-wise scal function for matrices.

scal_rows ?m ?n ?ofs alphas ?ar ?ac a row-wise scal function for matrices.

scal_rows ?m ?n ?ofs alphas ?ar ?ac a row-wise scal function for matrices.

sin ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the sine of n elements of the vector x using incx as incremental steps.

sin ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the sine of n elements of the vector x using incx as incremental steps.

sort ?cmp ?n ?ofsx ?incx x sorts the array x in increasing order according to the comparison function cmp.

sort ?cmp ?n ?ofsx ?incx x sorts the array x in increasing order according to the comparison function cmp.

sort ?cmp ?n ?ofsx ?incx x sorts the array x in increasing order according to the comparison function cmp.

sort ?cmp ?n ?ofsx ?incx x sorts the array x in increasing order according to the comparison function cmp.

spsv ?n ?up ?ipiv ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric matrix stored in packed format and X and b are n-by-nrhs matrices.

spsv ?n ?up ?ipiv ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric matrix stored in packed format and X and b are n-by-nrhs matrices.

spsv ?n ?up ?ipiv ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric matrix stored in packed format and X and b are n-by-nrhs matrices.

spsv ?n ?up ?ipiv ?ofsap ap ?nrhs ?br ?bc b computes the solution to the real system of linear equations a * X = b, where a is an n-by-n symmetric matrix stored in packed format and X and b are n-by-nrhs matrices.

sqr ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the square of n elements of the vector x using incx as incremental steps.

sqr ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the square of n elements of the vector x using incx as incremental steps.

sqr_nrm2 ?stable ?n ?c ?ofsx ?incx x computes the square of the 2-norm (Euclidean norm) of vector x separated by incx incremental steps.

sqr_nrm2 ?stable ?n ?c ?ofsx ?incx x computes the square of the 2-norm (Euclidean norm) of vector x separated by incx incremental steps.

sqr_nrm2 ?stable ?n ?c ?ofsx ?incx x computes the square of the 2-norm (Euclidean norm) of vector x separated by incx incremental steps.

sqr_nrm2 ?stable ?n ?c ?ofsx ?incx x computes the square of the 2-norm (Euclidean norm) of vector x separated by incx incremental steps.

sqrt ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the square root of n elements of the vector x using incx as incremental steps.

sqrt ?n ?ofsy ?incy ?y ?ofsx ?incx x computes the square root of n elements of the vector x using incx as incremental steps.

ssqr ?n ?c ?ofsx ?incx x computes the sum of squared differences of the n elements in vector x from constant c, separated by incx incremental steps.

ssqr ?n ?c ?ofsx ?incx x computes the sum of squared differences of the n elements in vector x from constant c, separated by incx incremental steps.

ssqr ?n ?c ?ofsx ?incx x computes the sum of squared differences of the n elements in vector x from constant c, separated by incx incremental steps.

ssqr ?n ?c ?ofsx ?incx x computes the sum of squared differences of the n elements in vector x from constant c, separated by incx incremental steps.

ssqr_diff ?n ?ofsx ?incx x ?ofsy ?incy y returns the sum of squared differences of n elements of vectors x and y, using incx and incy as incremental steps respectively.

ssqr_diff ?n ?ofsx ?incx x ?ofsy ?incy y returns the sum of squared differences of n elements of vectors x and y, using incx and incy as incremental steps respectively.

ssqr_diff ?n ?ofsx ?incx x ?ofsy ?incy y returns the sum of squared differences of n elements of vectors x and y, using incx and incy as incremental steps respectively.

ssqr_diff ?n ?ofsx ?incx x ?ofsy ?incy y returns the sum of squared differences of n elements of vectors x and y, using incx and incy as incremental steps respectively.

sub ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y subtracts n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

sub ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y subtracts n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

sub ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y subtracts n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

sub ?n ?ofsz ?incz ?z ?ofsx ?incx x ?ofsy ?incy y subtracts n elements of vectors x and y elementwise, using incx and incy as incremental steps respectively.

sum ?m ?n ?ar ?ac a computes the sum of all elements in the m-by-n submatrix starting at row ar and column ac.

sum ?n ?ofsx ?incx x computes the sum of the n elements in vector x, separated by incx incremental steps.

sum ?m ?n ?ar ?ac a computes the sum of all elements in the m-by-n submatrix starting at row ar and column ac.

sum ?n ?ofsx ?incx x computes the sum of the n elements in vector x, separated by incx incremental steps.

sum ?m ?n ?ar ?ac a computes the sum of all elements in the m-by-n submatrix starting at row ar and column ac.

sum ?n ?ofsx ?incx x computes the sum of the n elements in vector x, separated by incx incremental steps.

sum ?m ?n ?ar ?ac a computes the sum of all elements in the m-by-n submatrix starting at row ar and column ac.

sum ?n ?ofsx ?incx x computes the sum of the n elements in vector x, separated by incx incremental steps.

swap ?n ?ofsx ?incx ~x ?ofsy ?incy y see BLAS documentation!

swap ?n ?ofsx ?incx ~x ?ofsy ?incy y see BLAS documentation!

swap ?n ?ofsx ?incx ~x ?ofsy ?incy y see BLAS documentation!

swap ?n ?ofsx ?incx ~x ?ofsy ?incy y see BLAS documentation!

sycon ?n ?up ?ipiv ?anorm ?work ?ar ?ac a

sycon ?n ?up ?ipiv ?anorm ?work ?ar ?ac a

sycon ?n ?up ?ipiv ?anorm ?work ?iwork ?ar ?ac a

sycon ?n ?up ?ipiv ?anorm ?work ?iwork ?ar ?ac a

sycon_min_liwork n

sycon_min_liwork n

sycon_min_lwork n

sycon_min_lwork n

sycon_min_lwork n

sycon_min_lwork n

syev ?n ?vectors ?up ?ofswork ?work ?ofsw ?w ?ar ?ac a computes all eigenvalues and, optionally, eigenvectors of the real symmetric matrix a.

syev ?n ?vectors ?up ?ofswork ?work ?ofsw ?w ?ar ?ac a computes all eigenvalues and, optionally, eigenvectors of the real symmetric matrix a.

syev_min_lwork n

syev_min_lwork n

syev_opt_lwork ?n ?vectors ?up ?ar ?ac a

syev_opt_lwork ?n ?vectors ?up ?ar ?ac a

syevd ?n ?vectors ?up ?ofswork ?work ?iwork ?ofsw ?w ?ar ?ac a computes all eigenvalues and, optionally, eigenvectors of the real symmetric matrix a.

syevd ?n ?vectors ?up ?ofswork ?work ?iwork ?ofsw ?w ?ar ?ac a computes all eigenvalues and, optionally, eigenvectors of the real symmetric matrix a.

syevd_min_liwork vectors n

syevd_min_liwork vectors n

syevd_min_lwork vectors n

syevd_min_lwork vectors n

syevd_opt_l_li_iwork ?n ?vectors ?up ?ar ?ac a

syevd_opt_l_li_iwork ?n ?vectors ?up ?ar ?ac a

syevd_opt_liwork ?n ?vectors ?up ?ar ?ac a

syevd_opt_liwork ?n ?vectors ?up ?ar ?ac a

syevd_opt_lwork ?n ?vectors ?up ?ar ?ac a

syevd_opt_lwork ?n ?vectors ?up ?ar ?ac a

syevr ?n ?vectors ?range ?up ?abstol ?work ?iwork ?ofsw ?w ?zr ?zc ?z ?isuppz ?ar ?ac a range is either `A for computing all eigenpairs, `V (vl, vu) defines the lower and upper range of computed eigenvalues, `I (il, iu) defines the indexes of the computed eigenpairs, which are sorted in ascending order.

syevr ?n ?vectors ?range ?up ?abstol ?work ?iwork ?ofsw ?w ?zr ?zc ?z ?isuppz ?ar ?ac a range is either `A for computing all eigenpairs, `V (vl, vu) defines the lower and upper range of computed eigenvalues, `I (il, iu) defines the indexes of the computed eigenpairs, which are sorted in ascending order.

syevr_min_liwork n

syevr_min_liwork n

syevr_min_lwork n

syevr_min_lwork n

syevr_opt_l_li_iwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

syevr_opt_l_li_iwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

syevr_opt_liwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

syevr_opt_liwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

syevr_opt_lwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

syevr_opt_lwork ?n ?vectors ?range ?up ?abstol ?ar ?ac a

sygv ?n ?vectors ?up ?ofswork ?work ?ofsw ?w ?ar ?ac a computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form a*x=(lambda)*b*x, a*b*x=(lambda)*x, or b*a*x=(lambda)*x.

sygv ?n ?vectors ?up ?ofswork ?work ?ofsw ?w ?ar ?ac a computes all the eigenvalues, and optionally, the eigenvectors of a real generalized symmetric-definite eigenproblem, of the form a*x=(lambda)*b*x, a*b*x=(lambda)*x, or b*a*x=(lambda)*x.

sygv_opt_lwork ?n ?vectors ?up ?ar ?ac a ?br ?bc b

sygv_opt_lwork ?n ?vectors ?up ?ar ?ac a ?br ?bc b

symm ?m ?n ?side ?up ?beta ?cr ?cc ?c ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

symm ?m ?n ?side ?up ?beta ?cr ?cc ?c ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

symm ?m ?n ?side ?up ?beta ?cr ?cc ?c ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

symm ?m ?n ?side ?up ?beta ?cr ?cc ?c ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

symm2_trace ?n ?upa ?ar ?ac a ?upb ?br ?bc b computes the trace of the product of the symmetric (sub-)matrices a and b.

symm2_trace ?n ?upa ?ar ?ac a ?upb ?br ?bc b computes the trace of the product of the symmetric (sub-)matrices a and b.

symm2_trace ?n ?upa ?ar ?ac a ?upb ?br ?bc b computes the trace of the product of the symmetric (sub-)matrices a and b.

symm2_trace ?n ?upa ?ar ?ac a ?upb ?br ?bc b computes the trace of the product of the symmetric (sub-)matrices a and b.

symv ?n ?beta ?ofsy ?incy ?y ?up ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

symv ?n ?beta ?ofsy ?incy ?y ?up ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

symv ?n ?beta ?ofsy ?incy ?y ?up ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

symv ?n ?beta ?ofsy ?incy ?y ?up ?alpha ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

syr ?n ?alpha ?up ?ofsx ?incx x ?ar ?ac a see BLAS documentation!

syr ?n ?alpha ?up ?ofsx ?incx x ?ar ?ac a see BLAS documentation!

syr2k ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

syr2k ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

syr2k ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

syr2k ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a ?br ?bc b see BLAS documentation!

syrk ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a see BLAS documentation!

syrk ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a see BLAS documentation!

syrk ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a see BLAS documentation!

syrk ?n ?k ?up ?beta ?cr ?cc ?c ?trans ?alpha ?ar ?ac a see BLAS documentation!

syrk_diag ?n ?k ?beta ?ofsy ?y ?trans ?alpha ?ar ?ac a computes the diagonal of the symmetric rank-k product of the (sub-)matrix a, multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

syrk_diag ?n ?k ?beta ?ofsy ?y ?trans ?alpha ?ar ?ac a computes the diagonal of the symmetric rank-k product of the (sub-)matrix a, multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

syrk_diag ?n ?k ?beta ?ofsy ?y ?trans ?alpha ?ar ?ac a computes the diagonal of the symmetric rank-k product of the (sub-)matrix a, multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

syrk_diag ?n ?k ?beta ?ofsy ?y ?trans ?alpha ?ar ?ac a computes the diagonal of the symmetric rank-k product of the (sub-)matrix a, multiplying it with alpha and adding beta times y, storing the result in y starting at the specified offset.

syrk_trace ?n ?k ?ar ?ac a computes the trace of either a' * a or a * a', whichever is more efficient (results are identical), of the (sub-)matrix a multiplied by its own transpose.

syrk_trace ?n ?k ?ar ?ac a computes the trace of either a' * a or a * a', whichever is more efficient (results are identical), of the (sub-)matrix a multiplied by its own transpose.

syrk_trace ?n ?k ?ar ?ac a computes the trace of either a' * a or a * a', whichever is more efficient (results are identical), of the (sub-)matrix a multiplied by its own transpose.

syrk_trace ?n ?k ?ar ?ac a computes the trace of either a' * a or a * a', whichever is more efficient (results are identical), of the (sub-)matrix a multiplied by its own transpose.

sysv ?n ?up ?ipiv ?work ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an N-by-N symmetric matrix and X and b are n-by-nrhs matrices.

sysv ?n ?up ?ipiv ?work ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an N-by-N symmetric matrix and X and b are n-by-nrhs matrices.

sysv ?n ?up ?ipiv ?work ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an N-by-N symmetric matrix and X and b are n-by-nrhs matrices.

sysv ?n ?up ?ipiv ?work ?ar ?ac a ?nrhs ?br ?bc b computes the solution to a real system of linear equations a * X = b, where a is an N-by-N symmetric matrix and X and b are n-by-nrhs matrices.

sysv_opt_lwork ?n ?up ?ar ?ac a ?nrhs ?br ?bc b

sysv_opt_lwork ?n ?up ?ar ?ac a ?nrhs ?br ?bc b

sysv_opt_lwork ?n ?up ?ar ?ac a ?nrhs ?br ?bc b

sysv_opt_lwork ?n ?up ?ar ?ac a ?nrhs ?br ?bc b

sytrf ?n ?up ?ipiv ?work ?ar ?ac a computes the factorization of the real symmetric matrix a using the Bunch-Kaufman diagonal pivoting method.

sytrf ?n ?up ?ipiv ?work ?ar ?ac a computes the factorization of the real symmetric matrix a using the Bunch-Kaufman diagonal pivoting method.

sytrf ?n ?up ?ipiv ?work ?ar ?ac a computes the factorization of the real symmetric matrix a using the Bunch-Kaufman diagonal pivoting method.

sytrf ?n ?up ?ipiv ?work ?ar ?ac a computes the factorization of the real symmetric matrix a using the Bunch-Kaufman diagonal pivoting method.

sytrf_min_lwork ()

sytrf_min_lwork ()

sytrf_min_lwork ()

sytrf_min_lwork ()

sytrf_opt_lwork ?n ?up ?ar ?ac a

sytrf_opt_lwork ?n ?up ?ar ?ac a

sytrf_opt_lwork ?n ?up ?ar ?ac a

sytrf_opt_lwork ?n ?up ?ar ?ac a

sytri ?n ?up ?ipiv ?work ?ar ?ac a computes the inverse of the real symmetric indefinite matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_C.sytrf.

sytri ?n ?up ?ipiv ?work ?ar ?ac a computes the inverse of the real symmetric indefinite matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_Z.sytrf.

sytri ?n ?up ?ipiv ?work ?ar ?ac a computes the inverse of the real symmetric indefinite matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_S.sytrf.

sytri ?n ?up ?ipiv ?work ?ar ?ac a computes the inverse of the real symmetric indefinite matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_D.sytrf.

sytri_min_lwork n

sytri_min_lwork n

sytri_min_lwork n

sytri_min_lwork n

sytrs ?n ?up ?ipiv ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a*X = b with a real symmetric matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_C.sytrf.

sytrs ?n ?up ?ipiv ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a*X = b with a real symmetric matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_Z.sytrf.

sytrs ?n ?up ?ipiv ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a*X = b with a real symmetric matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_S.sytrf.

sytrs ?n ?up ?ipiv ?ar ?ac a ?nrhs ?br ?bc b solves a system of linear equations a*X = b with a real symmetric matrix a using the factorization a = U*D*U**T or a = L*D*L**T computed by Lacaml_D.sytrf.

tbtrs ?n ?kd ?up ?trans ?diag ?abr ?abc ab ?nrhs ?br ?bc b solves a triangular system of the form a * X = b or a**T * X = b, where a is a triangular band matrix of order n, and b is an n-by-nrhs matrix.

tbtrs ?n ?kd ?up ?trans ?diag ?abr ?abc ab ?nrhs ?br ?bc b solves a triangular system of the form a * X = b or a**T * X = b, where a is a triangular band matrix of order n, and b is an n-by-nrhs matrix.

tbtrs ?n ?kd ?up ?trans ?diag ?abr ?abc ab ?nrhs ?br ?bc b solves a triangular system of the form a * X = b or a**T * X = b, where a is a triangular band matrix of order n, and b is an n-by-nrhs matrix.

tbtrs ?n ?kd ?up ?trans ?diag ?abr ?abc ab ?nrhs ?br ?bc b solves a triangular system of the form a * X = b or a**T * X = b, where a is a triangular band matrix of order n, and b is an n-by-nrhs matrix.

to_array mat

to_array v

to_array mat

to_array v

to_array mat

to_array v

to_array mat

to_array v

to_col_vecs mat

to_col_vecs mat

to_col_vecs mat

to_col_vecs mat

to_list v

to_list v

to_list v

to_list v

toeplitz v

toeplitz v

tpmv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpmv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpmv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpmv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpsv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpsv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpsv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

tpsv ?n ?trans ?diag ?up ?ofsap ap ?ofsx ?incx x see BLAS documentation!

trace m

trace m

trace m

trace m

transpose ?m ?n ?ar ?ac aa

transpose ?m ?n ?ar ?ac aa

transpose ?m ?n ?ar ?ac aa

transpose ?m ?n ?ar ?ac aa

transpose_copy ?m ?n ?ar ?ac a ?br ?bc b copy the transpose of (sub-)matrix a into (sub-)matrix b.

transpose_copy ?m ?n ?ar ?ac a ?br ?bc b copy the transpose of (sub-)matrix a into (sub-)matrix b.

transpose_copy ?m ?n ?ar ?ac a ?br ?bc b copy the transpose of (sub-)matrix a into (sub-)matrix b.

transpose_copy ?m ?n ?ar ?ac a ?br ?bc b copy the transpose of (sub-)matrix a into (sub-)matrix b.

trmm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trmm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trmm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trmm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trmv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trmv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trmv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trmv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trsm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trsm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trsm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trsm ?m ?n ?side ?up ?transa ?diag ?alpha ?ar ?ac ~a ?br ?bc b see BLAS documentation!

trsv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trsv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trsv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trsv ?n ?trans ?diag ?up ?ar ?ac a ?ofsx ?incx x see BLAS documentation!

trtri ?n ?up ?diag ?ar ?ac a computes the inverse of a real upper or lower triangular matrix a.

trtri ?n ?up ?diag ?ar ?ac a computes the inverse of a real upper or lower triangular matrix a.