MTL Index

Concept index

ColumnMatrix A Column-Oriented MTL Matrix DiagonalMatrix A Diagonally-Oriented Matrix IndexedIterator IndexedIterator Indexer Maps from Matrix coordinates to TwoD coordinates Iteration Iteration Matrix The MTL Matrix Concept Offset Maps from TwoD coordinates to linear memory OneDIndexer OneDIndexer Preconditioner Preconitioner RowMatrix A Row-Oriented MTL Matrix TwoDStorage The MTL TwoD Storage Concept Vector The MTL Vector Concept

Class index

ILU<Matrix> Incomplete LU without fill-in Preconditioner. ILUT<Matrix> ILUT: Incomplete LU with threshold and K fill-in Preconditioner. SSOR<Matrix> SSOR preconditioner. __mult__8<int M, int N> __mult_fixn<int M> _bogus add<int N> Add y <- x + y add_op<int M, IterY> array<OneD = dense<>, int MemLoc=internal> Array storage type selectors array2D<OneD_> Array 2-D Container band_view<Matrix> Band View Matrix Type Constructor banded<int MemLoc=internal> banded shape type selectors, also banded storage type selectors banded_indexer<size_type, Orien> banded_offset<size_t, int MM, int NN> Banded Offset Class banded_tag Identifies banded matrices banded_view<int MemLoc=internal> Banded view storage type selectors banded_view_offset<size_t, int MM, int NN> Banded View Offset Class blk<int BM, int BN> block2D<Block, OffsetGen> Block View TwoD Storage block_view<Matrix, int BM = 0, int BN = 0> Block View Matrix Type Constructor cholesky< Matrix > Incomplete Cholesky Preconditioner. choose<Cat> column_major Column major ordering type selectors column_matrix<TwoDGen, IndexerGen> column matrix column_matrix_traits<Matrix> Column Matrix Traits column_tag Identifies a column-major Matrix columns_type<Matrix> compressed Compressed sparse storage type selectors (for both OneD and TwoD) compressed1D<T, SizeType = int, int IND_OFFSET = index_from_zero> Compressed Sparse Vector compressed2D<T, SizeType, int IND_OFFSET> Sparse matrix storage format with internal storage compressed_iter<int isConst, Value, Index, int IND_OFFSET> Compressed Storage Iterator conj_func<T> const_sparse_iterator<Iterator, T> constant_stride_generator<RandomAccessIterator> copy<int N> Copy y <- x copy__2<int M, int N> Copy B <- A count<int NN> The static size count class dense<int MemLoc=internal> Dense storage type selectors (for both TwoD and OneD storage) dense2D<T, OffsetGen, int MM = 0, int NN = 0> Dense2D Storage Type dense_iterator<RandomAccessIterator, int IND_OFFSET=0, SizeType=int> dense iterator dense_iterator__2<T, int isConst, int IND_OFFSET=0, SizeType=int> dense_tag Identifies a dense Matrix or Vector diagonal<int MemLoc=internal> diagonal shape type selectors diagonal_indexer<size_type, Orien> diagonal_matrix<TwoDGen, IndexerGen> Diagonal Matrix diagonal_matrix_traits<Matrix> Diagonal Matrix Traits diagonal_tag Identifies diagonal matrices dimension<sizet, int MM = 0, int NN = 0> The Dimension Class dims<int MM, int NN> Row Orientation dims__2<int MM, int NN> Column Orientation dot<int N> Dot Product s <- x . y entry1<T> entry1_value_less envelope<int MemLoc=internal> Envelope storage type selectors ext_comp2D<T, SizeType, int IND_OFFSET> Sparse matrix storage format with external storage external2D<T, OffsetGen, int MM = 0, int NN = 0> External2D Storage Type external_tag Identifies the Matrix as not owning its data external_vec<T, int NN = 0, SizeType=unsigned int> External 1-D Container general_stride_iterator<RandomAccessIterator, StrideGen> generic_comp2D<ValsType, ValPtr, IndType, IndPtr, int IND_OFFSET> Compressed 2-D Container generic_dense2D<RepType, RepPtr, OffsetGen, int MM, int NN> Generic Dense 2-D Container givens_rotation<T> Givens Plane Rotation givens_rotation__2<T> The specialization for complex numbers. givens_rotation__3 The specialization for complex numbers. givens_rotation__4 The specialization for complex numbers. harwell_boeing_stream<T> A Matrix File Input Stream for Harwell-Boeing Matrix Files hermitian<int Uplo = dynamic_uplo> hermitian shape type selectors hermitian_tag Identifies hermitian matrices householder_transform<T> Householder Transform insert_iterator internal_tag Identifies the Matrix as owning its data interval<Tnum> Interval Class lapack_matrix<T, int External=mtl::internal> Lapack Matrix linalg_traits<Linalg> Linear Algebra Object (Matrix and Vector) Traits linalg_vec<RepType, RepPtr = RepType*, int NN = 0> Linalg Vector Adaptor linked_list Index-Value Pair Sparse Vector implemented with std::list matrix< T, Shape = rectangle<>, Storage = dense<>, Orientation = row_major > Matrix type generators class. matrix_implementation<TwoDGen, IndexerGen> The main MTL matrix implementation type. matrix_market_stream<T> A Matrix File Input Stream for Matrix Market Files matrix_traits<Matrix> The "traits" class for MTL matrices. modified_givens<T> Modified Givens Transformation mtl_multiplies<S, T, R> mult<int M, int N> Multiplication y <- A x + y mult__2<int M, int N, int K> Multiplication C <- A * B mult_fixn<int M> not_strideable Identifies matrices that can not be used with the rows and columns functions not_strided_tag number_traits<number_type> number_traits__2<T> numeric_limits<Tnum> Interval Numeric Limits oned_tag Identifies linear algebra objects as 1D (Vector) packed<int MemLoc=internal> Packed storage type selectors packed_offset<size_t, int MM, int NN> Packed Offset Class rank_one<int M, int N> Rank One Update A <- A + x * y^T rect_indexer<size_type, Orien, int MM, int NN> rect_offset<size_t, int MM, int NN> Rectangular Offset Class rectangle<int MM = 0, int NN = 0> rectangle shape type selector rectangle_tag Identifies rectangular matrices row_major Row major ordering type selectors row_matrix<TwoDGen, IndexerGen> row matrix row_matrix_traits<Matrix> Row Matrix Traits row_tag Identifies a row-major Matrix rows_type<Matrix> scale_iterator<RandomAccessIterator, T> scale iterator scale_iterator__2<Iterator, T> scaled1D<RandomAccessContainerRef> Scaled Container scaled2D<TwoD, T> Scaled 2D container adaptor set<int N> Set elements of vector x to alpha set__2<int M, int N> Set matrix A to alpha sparse1D<RepType> Sparse 1-D Container Adaptor sparse_iterator<Iterator, T> Sparse Vector Iterator sparse_pair Index-Value Pair Sparse Vector implemented with mtl::dense1D sparse_tag Identifies a sparse Matrix or Vector stride_iterator<RandomAccessIterator> strideable Identifies matrices that can be used with the rows and columns functions strided1D<RandomAccessContainerRef> Strided Vector Adaptor strided_band_view_offset<size_t, int MM, int NN> Strided Band View Offset Class strided_iterator<RandomAccessIterator, int isConst> strided iterator strided_offset<size_t, int MM, int NN> Strided Rectangular Offset Class strided_tag symmetric<int Uplo = dynamic_uplo> symmetric shape type selectors symmetric_matrix<Base_, Uplo> symmetric symmetric_tag Identifies symmetric matrices symmetric_view<Matrix, int Uplo> Symmetric View Matrix Type Constructor transform_iterator<Iterator, UnaryFunction> Tranforming Iterator transform_iterator__2<RandomAccessIterator, UnaryFunction> tree Index-Value Pair Sparse Vector implemented with std::set tri_view<int Uplo> Triangle View Creation Helper Fuctor triangle<int Uplo = dynamic_uplo> triangle shape type selectors triangle_matrix<Base_, Uplo> triangle triangle_tag Identifies triangular matrices triangle_view<Matrix, int Uplo> Triangle View Matrix Type Constructor twod_tag Identifies linear algebra objects as 2D (Matrix)

Function index

scaled Shortcut for Creating a Scaled Argument strided Shortcut for Creating a Strided Argument blocked Blocked Matrix Generator blocked Blocked Matrix Generator rows Access the row-wise view of the matrix columns Access the column-wise view of the matrix trans Swap the orientation of a matrix. sum Sum: s <- sum_i(x(i)) scale Scale: A <- alpha*A or x <- alpha x set_diagonal Set Diagonal: A(i,i) <- alpha two_norm Two Norm: s <- sqrt(sum_i(|x(i)^2|)) sum_squares Sum of the Squares one_norm One Norm: s <- sum(|x_i|) or s <- max_i(sum_j(|A(i,j)|)) infinity_norm Infinity Norm: s <- max_j(sum_i(|A(i,j)|)) or s <- max_i(|x(i)|) max_index Max Index: i <- index of max(|x(i)|) max_abs_index Maximum Absolute Index: i <- index of max(|x(i)|) min_index Minimum Index: i <- index of min(x(i)) min_abs_index Minimum Absolute Index: i <- index of min(|x(i)|) max Max Value: s <- max(x(i)) min Min Value: s <- min(x_i) generate_householder Generate Householder Transform transpose Transpose in Place: A <- A^T transpose Transpose: B <- A^T mult Multiplication: z <- A x + y __mult_dim Matrix Vector Multiplication: y <- A x matmat_mult Specialization for triangular matrices __mult_dim Matrix multiplication C <- C + A * B tri_solve Triangular Solve: x <- T^{-1} * x tri_solve Triangular Solve: B <- A^{-1} * B or B <- B * A^{-1} rank_one_update Rank One Update: A <- A + x * y^T rank_two_update Rank Two Update: A <- A + x * y^T + y * x^T scatter Scatter y <- x gather Gather y <- x copy Copy: B <- A or y <- x add Add: z <- x + y add Add: w <- x + y + z add Add: B <- A + B or y <- x + y ele_mult Element-wise Multiplication: z <- x O* y ele_mult Element-wise Multiply: B <- A O* B ele_div Element-wise Division: z <- x O/ y swap Swap: B <-> A or y <-> x dot Dot Product: s <- x . y + s dot Dot Product: s <- x . y dot Dot Product (extended precision): s <- x . y + s dot_conj Dot Conjugate: s <- x . conj(y) + s dot_conj Dot Conjugate: s <- x . conj(y) copy Copy transform Transform (one input iterator) transform Transform (two input iterators) fill Fill swap_ranges Swap Ranges accumulate Accumulate (with default operation) accumulate Accumulate (with user-supplied operation) inner_product Inner Product (user supplied operators) inner_product Inner Product (with default operators) lu_factor LU Factorization of a general (dense) matrix lu_solve LU Solve lu_inverse LU Inverse trans_iter Helper function for creating a transforming iterator read_dense_matlab Read a Dense Real Matrix from a Matlab file (.mat) write_dense_matlab Write a Dense Real Matrix to a Matlab file (.mat) read_sparse_matlab Read a Sparse Real Matrix from a Matlab file (.mat) write_sparse_matlab Write a Sparse Real Matrix to a Matlab file (.mat) gecon Estimate the reciprocal of the condition number of a general matrix. geev Compute the eigenvalues. geqpf QR Factorization with Column Pivoting. geqrf QR Factorization of a General Matrix gesv Solution to a linear system in a general matrix. getrf LU factorization of a general matrix A. getrs Solution to a system using LU factorization geequ Equilibrate and reduce condition number. gelqf Compute an LQ factorization. orglq Generate a matrix Q with orthonormal rows. orgqr Generate a matrix Q with orthonormal columns. cg Conjugate Gradient(CG) cgs Conjugate Gradient Squared bicg BiConjugate Gradient gmres Generalized Minimum Residual bicgstab BiConjugate Gradient Stabilized qmr Quasi-Minimal Residual tfqmr Transpose Free Quasi-Minimal Residual gcr Generalized Conjugate Residual cheby Chebyshev Iteration richardson Preconditioned Richardson isnan Is not a number empty Empty sign Sign left Left Constant Non-member Acessor right Right Constant Non-member Acessor inf Infinum Constant Non-member Acessor sup Suprenum Constant Non-member Acessor operator == Operator == operator == Operator == operator == Operator == operator != Operator != operator != Operator != operator != Operator != subset interval-interval Subset Specialization subset Subset (Interval in Interval) subset Subset (Tnum in Interval) proper_subset Proper Subset (Interval in Interval) proper_subset Proper Subset (Tnum in Interval) poslte Possibly Less Than Or Equal To poslte Possibly Less Than Or Equal To poslt Possibly Less Than poslt Possibly Less Than posgte Possibly Greater Than Or Equal To posgte Possibly Greater Than Or Equal To posgt Possibly Greater Than posgt Possibly Greater Than operator <= Operator <= operator <= Operator <= operator < Operator < operator < Operator < operator >= Operator >= operator >= Operator >= operator > Operator > operator > Operator > pos_half Positive Half neg_half Negative Half pred Pred (Interval) pred Pred (Tnum) succ Succ (Interval) succ Succ (Tnum) hull Hull of 2 Intervals hull Hull of an Interval and a Tnum hull Hull of a Tnum and an Interval hull Hull of 2 Tnums hull Hull of a Tnum sym_hull Symmetric Hull midpoint Midpoint bisect Bisect an Interval diameter Diameter abs Absolute Value dist Distance between 2 Intervals dist Distance between a number and an Interval dist Distance between a number and an Interval intersection Intersection of 2 Intervals operator + Operator x+y ( x+y = [inf(x)+inf(y),sup(x)+sup(y)] ) operator + Operator x+b ( x+b = [inf(x)+b,sup(x)+b] ) operator + Operator a+x ( x = [inf(x)+a,sup(x)+a] ) operator - Operator x-y ( x-y = [inf(x)-inf(y),sup(x)-sup(y)] ) operator - Operator x-b ( x-b = [inf(x)-b,sup(x)-b] ) operator - Operator a-y ( a-y = [a-inf(y),a-sup(y)] ) sqrt Square Root ( sqrt(x) = [sqrt(inf(x)),sqrt(sup(x))] ) exp Exponent ( exp(x) = [exp(inf(x),exp(sup(x))] ) log Log ( log(x) = [log(inf(x)),log(sup(c))] ) ln ln ( ln(x) = [ln(inf(x)),ln(sup(c))] ) operator & Operator & operator * Operator * operator * Operator x*y ( x*y = [inf(x)*y,sup(x)*y] ) operator * Operator x*y ( x*y = [x*inf(y),y*sup(y)] ) operator / Operator x/y operator / Operator x/b ( x/b = [inf(x)/b,sup(x)/b] ) operator / Operator a/y sqr Square tan Tangent ( tan(x) = [tan(inf(x)),tan(sup(x))] ) atan ArcTan ( arctan(x) = [arctan(inf(x)),arctan(sup(x))] ) sin Sine asin ArcSin ( asin(x) = [asin(inf(x)),asin(sup(x))] ) acos ArcCos ( acos(x) = [acos(inf(x)),acos(sup(x))] ) cos Cosine pow Power (interval^Tnum) pow Power ( pow(x,p) = [inf(x)^inf(p),sup(x)^sup(p)] )

Copyright © 1998,1999 University of Notre Dame. All Rights Reserved.