# Eigen Tensors
Tensors are multidimensional arrays of elements. Elements are typically scalars,
but more complex types such as strings are also supported.
[TOC]
## Tensor Classes
You can manipulate a tensor with one of the following classes. They all are in
the namespace ```::Eigen.```
### Class Tensor<data_type, rank>
This is the class to use to create a tensor and allocate memory for it. The
class is templatized with the tensor datatype, such as float or int, and the
tensor rank. The rank is the number of dimensions, for example rank 2 is a
matrix.
Tensors of this class are resizable. For example, if you assign a tensor of a
different size to a Tensor, that tensor is resized to match its new value.
#### Constructor Tensor<data_type, rank>(size0, size1, ...)
Constructor for a Tensor. The constructor must be passed ```rank``` integers
indicating the sizes of the instance along each of the the ```rank```
dimensions.
// Create a tensor of rank 3 of sizes 2, 3, 4. This tensor owns
// memory to hold 24 floating point values (24 = 2 x 3 x 4).
Tensor<float, 3> t_3d(2, 3, 4);
// Resize t_3d by assigning a tensor of different sizes, but same rank.
t_3d = Tensor<float, 3>(3, 4, 3);
#### Constructor Tensor<data_type, rank>(size_array)
Constructor where the sizes for the constructor are specified as an array of
values instead of an explicitly list of parameters. The array type to use is
```Eigen::array<Eigen::Index>```. The array can be constructed automatically
from an initializer list.
// Create a tensor of strings of rank 2 with sizes 5, 7.
Tensor<string, 2> t_2d({5, 7});
### Class TensorFixedSize<data_type, Sizes<size0, size1, ...>>
Class to use for tensors of fixed size, where the size is known at compile
time. Fixed sized tensors can provide very fast computations because all their
dimensions are known by the compiler. FixedSize tensors are not resizable.
If the total number of elements in a fixed size tensor is small enough the
tensor data is held onto the stack and does not cause heap allocation and free.
// Create a 4 x 3 tensor of floats.
TensorFixedSize<float, Sizes<4, 3>> t_4x3;
### Class TensorMap<Tensor<data_type, rank>>
This is the class to use to create a tensor on top of memory allocated and
owned by another part of your code. It allows to view any piece of allocated
memory as a Tensor. Instances of this class do not own the memory where the
data are stored.
A TensorMap is not resizable because it does not own the memory where its data
are stored.
#### Constructor TensorMap<Tensor<data_type, rank>>(data, size0, size1, ...)
Constructor for a Tensor. The constructor must be passed a pointer to the
storage for the data, and "rank" size attributes. The storage has to be
large enough to hold all the data.
// Map a tensor of ints on top of stack-allocated storage.
int storage[128]; // 2 x 4 x 2 x 8 = 128
TensorMap<Tensor<int, 4>> t_4d(storage, 2, 4, 2, 8);
// The same storage can be viewed as a different tensor.
// You can also pass the sizes as an array.
TensorMap<Tensor<int, 2>> t_2d(storage, 16, 8);
// You can also map fixed-size tensors. Here we get a 1d view of
// the 2d fixed-size tensor.
Tensor<float, Sizes<4, 5>> t_4x3;
TensorMap<Tensor<float, 1>> t_12(t_4x3, 12);
#### Class TensorRef
See Assigning to a TensorRef below.
## Accessing Tensor Elements
#### <data_type> tensor(index0, index1...)
Return the element at position ```(index0, index1...)``` in tensor
```tensor```. You must pass as many parameters as the rank of ```tensor```.
The expression can be used as an l-value to set the value of the element at the
specified position. The value returned is of the datatype of the tensor.
// Set the value of the element at position (0, 1, 0);
Tensor<float, 3> t_3d(2, 3, 4);
t_3d(0, 1, 0) = 12.0f;
// Initialize all elements to random values.
for (int i = 0; i < 2; ++i) {
for (int j = 0; j < 3; ++j) {
for (int k = 0; k < 4; ++k) {
t_3d(i, j, k) = ...some random value...;
}
}
}
// Print elements of a tensor.
for (int i = 0; i < 2; ++i) {
LOG(INFO) << t_3d(i, 0, 0);
}
## TensorLayout
The tensor library supports 2 layouts: ```ColMajor``` (the default) and
```RowMajor```. Only the default column major layout is currently fully
supported, and it is therefore not recommended to attempt to use the row major
layout at the moment.
The layout of a tensor is optionally specified as part of its type. If not
specified explicitly column major is assumed.
Tensor<float, 3, ColMajor> col_major; // equivalent to Tensor<float, 3>
TensorMap<Tensor<float, 3, RowMajor> > row_major(data, ...);
All the arguments to an expression must use the same layout. Attempting to mix
different layouts will result in a compilation error.
It is possible to change the layout of a tensor or an expression using the
```swap_layout()``` method. Note that this will also reverse the order of the
dimensions.
Tensor<float, 2, ColMajor> col_major(2, 4);
Tensor<float, 2, RowMajor> row_major(2, 4);
Tensor<float, 2> col_major_result = col_major; // ok, layouts match
Tensor<float, 2> col_major_result = row_major; // will not compile
// Simple layout swap
col_major_result = row_major.swap_layout();
eigen_assert(col_major_result.dimension(0) == 4);
eigen_assert(col_major_result.dimension(1) == 2);
// Swap the layout and preserve the order of the dimensions
array<int, 2> shuffle(1, 0);
col_major_result = row_major.swap_layout().shuffle(shuffle);
eigen_assert(col_major_result.dimension(0) == 2);
eigen_assert(col_major_result.dimension(1) == 4);
## Tensor Operations
The Eigen Tensor library provides a vast library of operations on Tensors:
numerical operations such as addition and multiplication, geometry operations
such as slicing and shuffling, etc. These operations are available as methods
of the Tensor classes, and in some cases as operator overloads. For example
the following code computes the elementwise addition of two tensors:
Tensor<float, 3> t1(2, 3, 4);
...set some values in t1...
Tensor<float, 3> t2(2, 3, 4);
...set some values in t2...
// Set t3 to the element wise sum of t1 and t2
Tensor<float, 3> t3 = t1 + t2;
While the code above looks easy enough, it is important to understand that the
expression ```t1 + t2``` is not actually adding the values of the tensors. The
expression instead constructs a "tensor operator" object of the class
TensorCwiseBinaryOp<scalar_sum>, which has references to the tensors
```t1``` and ```t2```. This is a small C++ object that knows how to add
```t1``` and ```t2```. It is only when the value of the expression is assigned
to the tensor ```t3``` that the addition is actually performed. Technically,
this happens through the overloading of ```operator=()``` in the Tensor class.
This mechanism for computing tensor expressions allows for lazy evaluation and
optimizations which are what make the tensor library very fast.
Of course, the tensor operators do nest, and the expression ```t1 + t2 *
0.3f``` is actually represented with the (approximate) tree of operators:
TensorCwiseBinaryOp<scalar_sum>(t1, TensorCwiseUnaryOp<scalar_mul>(t2, 0.3f))
### Tensor Operations and C++ "auto"
Because Tensor operations create tensor operators, the C++ ```auto``` keyword
does not have its intuitive meaning. Consider these 2 lines of code:
Tensor<float, 3> t3 = t1 + t2;
auto t4 = t1 + t2;
In the first line we allocate the tensor ```t3``` and it will contain the
result of the addition of ```t1``` and ```t2```. In the second line, ```t4```
is actually the tree of tensor operators that will compute the addition of
```t1``` and ```t2```. In fact, ```t4``` is *not* a tensor and you cannot get
the values of its elements:
Tensor<float, 3> t3 = t1 + t2
没有合适的资源?快使用搜索试试~ 我知道了~
资源详情
资源评论
资源推荐
收起资源包目录
vs2013_x64平台编译的ceres库 (2000个子文件)
gkregex.c 304KB
ut.c 246KB
GB_mex_errors.c 188KB
GB_subassign_kernel.c 145KB
ccolamd.c 136KB
GB_mx_builtin_semiring.c 108KB
null2.c 108KB
colamd.c 105KB
RBio.c 92KB
umf_colamd.c 91KB
umfpack_qsymbolic.c 89KB
klu_mex.c 78KB
camd_2.c 69KB
cholmod_nesdis.c 67KB
cholmod_check.c 65KB
amd_2.c 63KB
kwayfm.c 62KB
csr.c 61KB
umfpackmex.c 58KB
umf_local_search.c 57KB
GB_subref_template.c 55KB
cholmod_matlab.c 53KB
cholmod_updown.c 50KB
cholmod_solve.c 49KB
graph.c 48KB
solve.c 48KB
t_cholmod_gpu.c 47KB
cm.c 46KB
klutest.c 43KB
t_cholmod_super_numeric.c 41KB
GB_assign.c 40KB
cholmod_read.c 40KB
GB_transpose.c 38KB
cholmod_change_factor.c 38KB
GB_mx_string_to_BinaryOp.c 34KB
klu_kernel.c 33KB
cholmod_super_symbolic.c 33KB
umf_assemble.c 33KB
umf_solve.c 33KB
coarsen.c 32KB
cholmod_analyze.c 32KB
umf_dump.c 32KB
cholmod_transpose.c 30KB
getopt.c 30KB
test_ops.c 29KB
umfpack_xx_demo.c 29KB
umf_kernel_init.c 29KB
GB_mask.c 29KB
umfpack_zl_demo.c 28KB
umfpack_numeric.c 28KB
umfpack_zi_demo.c 28KB
umfpack_dl_demo.c 27KB
cholmod_factor.c 27KB
umfpack_get_numeric.c 27KB
umfpack_di_demo.c 26KB
umf_singletons.c 26KB
t_cholmod_lsolve.c 26KB
umf_store_lu.c 26KB
cholmod_metis.c 26KB
lpdemo.c 25KB
cholmod_rowfac.c 24KB
klu.c 24KB
btf_strongcomp.c 24KB
cholmod_common.c 24KB
parmetis.c 23KB
cholmod_l_demo.c 23KB
raw_factor.c 23KB
cholmod_triplet.c 23KB
umf_row_search.c 23KB
minconn.c 22KB
t_cholmod_ltsolve.c 22KB
GB_reduce_to_column.c 22KB
GB_matvec_check.c 21KB
GB_wait.c 21KB
GB_mex_subassign.c 21KB
contig.c 21KB
t_cholmod_updown_numkr.c 21KB
umf_garbage_collection.c 21KB
mmd.c 21KB
cholmod_write.c 21KB
tri_main.c 21KB
umfpack_report_info.c 20KB
cholmod_demo.c 20KB
ldl.c 20KB
ometis.c 20KB
umf_analyze.c 20KB
CMakeCCompilerId.c 20KB
CMakeCCompilerId.c 20KB
CMakeCCompilerId.c 20KB
kwayrefine.c 20KB
cholmod_dense.c 20KB
sfm.c 20KB
cholmod_rowadd.c 19KB
GB_build_factory.c 19KB
GB_AxB_heap_mask.c 19KB
ztbmv.c 19KB
fm.c 19KB
ctbmv.c 19KB
umf4_f77wrapper.c 18KB
klu_factor.c 18KB
共 2000 条
- 1
- 2
- 3
- 4
- 5
- 6
- 20
leaf_csdn
- 粉丝: 1108
- 资源: 12
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功
评论0