Solving Tensor Structured Problems with Computational Tensor Algebra
نویسندگان
چکیده
Since its introduction by Gauss, Matrix Algebra has facilitated understanding of scientific problems, hiding distracting details and finding more elegant and efficient ways of computational solving. Todays largest problems, which often originate from multidimensional data, might profit from even higher levels of abstraction. We developed a framework for solving tensor structured problems with tensor algebra that unifies concepts from tensor analysis, multilinear algebra and multidimensional signal processing. In contrast to the conventional matrix approach, it allows the formulation of multidimensional problems, in a multidimensional way, preserving structure and data coherence; and the implementation of automated optimizations of solving algorithms, based on the commutativity of all tensor operations. Its ability to handle large scientific tasks is showcased by a real-world, 4D medical imaging problem, with more than 30 million unknown parameters solved on a current, inexpensive hardware. This significantly surpassed the best published matrix-based approach.
منابع مشابه
Adjunctions between Hom and Tensor as endofunctors of (bi-) module category of comodule algebras over a quasi-Hopf algebra.
For a Hopf algebra H over a commutative ring k and a left H-module V, the tensor endofunctors V k - and - kV are left adjoint to some kinds of Hom-endofunctors of _HM. The units and counits of these adjunctions are formally trivial as in the classical case.The category of (bi-) modules over a quasi-Hopf algebra is monoidal and some generalized versions of Hom-tensor relations have been st...
متن کاملPositive Cone in $p$-Operator Projective Tensor Product of Fig`a-Talamanca-Herz Algebras
In this paper we define an order structure on the $p$-operator projective tensor product of Herz algebras and we show that the canonical isometric isomorphism between $A_p(Gtimes H)$ and $A_p(G)widehat{otimes}^p A_p(H)$ is an order isomorphism for amenable groups $G$ and $H$.
متن کاملResidual norm steepest descent based iterative algorithms for Sylvester tensor equations
Consider the following consistent Sylvester tensor equation[mathscr{X}times_1 A +mathscr{X}times_2 B+mathscr{X}times_3 C=mathscr{D},]where the matrices $A,B, C$ and the tensor $mathscr{D}$ are given and $mathscr{X}$ is the unknown tensor. The current paper concerns with examining a simple and neat framework for accelerating the speed of convergence of the gradient-based iterative algorithm and ...
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملTensors-structured Numerical Methods in Scientific Computing: Survey on Recent Advances
In the present paper, we give a survey of the recent results and outline future prospects of the tensor-structured numerical methods in applications to multidimensional problems in scientific computing. The guiding principle of the tensor methods is an approximation of multivariate functions and operators relying on certain separation of variables. Along with the traditional canonical and Tucke...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1001.5460 شماره
صفحات -
تاریخ انتشار 2010