Decomposability of Tensors

Tensor decomposition is a relevant topic, both for theoretical and applied mathematics, due to its interdisciplinary nature, which ranges from multilinear algebra and algebraic geometry to numerical analysis, algebraic statistics, quantum physics, signal processing, artificial intelligence, etc. The...

Full description

Saved in:
Bibliographic Details
:
Year of Publication:2019
Language:English
Physical Description:1 electronic resource (160 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
id 993543960704498
ctrlnum (CKB)4920000000095033
(oapen)https://directory.doabooks.org/handle/20.500.12854/44618
(EXLCZ)994920000000095033
collection bib_alma
record_format marc
spelling Luca Chiantini (Ed.) auth
Decomposability of Tensors
MDPI - Multidisciplinary Digital Publishing Institute 2019
1 electronic resource (160 p.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
Tensor decomposition is a relevant topic, both for theoretical and applied mathematics, due to its interdisciplinary nature, which ranges from multilinear algebra and algebraic geometry to numerical analysis, algebraic statistics, quantum physics, signal processing, artificial intelligence, etc. The starting point behind the study of a decomposition relies on the idea that knowledge of elementary components of a tensor is fundamental to implement procedures that are able to understand and efficiently handle the information that a tensor encodes. Recent advances were obtained with a systematic application of geometric methods: secant varieties, symmetries of special decompositions, and an analysis of the geometry of finite sets. Thanks to new applications of theoretic results, criteria for understanding when a given decomposition is minimal or unique have been introduced or significantly improved. New types of decompositions, whose elementary blocks can be chosen in a range of different possible models (e.g., Chow decompositions or mixed decompositions), are now systematically studied and produce deeper insights into this topic. The aim of this Special Issue is to collect papers that illustrate some directions in which recent researches move, as well as to provide a wide overview of several new approaches to the problem of tensor decomposition.
English
border rank and typical rank
Tensor analysis
Rank
Complexity
3-03897-590-7
language English
format eBook
author Luca Chiantini (Ed.)
spellingShingle Luca Chiantini (Ed.)
Decomposability of Tensors
author_facet Luca Chiantini (Ed.)
author_variant l c e lce
author_sort Luca Chiantini (Ed.)
title Decomposability of Tensors
title_full Decomposability of Tensors
title_fullStr Decomposability of Tensors
title_full_unstemmed Decomposability of Tensors
title_auth Decomposability of Tensors
title_new Decomposability of Tensors
title_sort decomposability of tensors
publisher MDPI - Multidisciplinary Digital Publishing Institute
publishDate 2019
physical 1 electronic resource (160 p.)
isbn 3-03897-591-5
3-03897-590-7
illustrated Not Illustrated
work_keys_str_mv AT lucachiantinied decomposabilityoftensors
status_str n
ids_txt_mv (CKB)4920000000095033
(oapen)https://directory.doabooks.org/handle/20.500.12854/44618
(EXLCZ)994920000000095033
carrierType_str_mv cr
is_hierarchy_title Decomposability of Tensors
_version_ 1787548485433688064
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02280nam-a2200313z--4500</leader><controlfield tag="001">993543960704498</controlfield><controlfield tag="005">20231214133523.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr|mn|---annan</controlfield><controlfield tag="008">202102s2019 xx |||||o ||| 0|eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3-03897-591-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(CKB)4920000000095033</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(oapen)https://directory.doabooks.org/handle/20.500.12854/44618</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(EXLCZ)994920000000095033</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Luca Chiantini (Ed.)</subfield><subfield code="4">auth</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decomposability of Tensors</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="b">MDPI - Multidisciplinary Digital Publishing Institute</subfield><subfield code="c">2019</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 electronic resource (160 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Tensor decomposition is a relevant topic, both for theoretical and applied mathematics, due to its interdisciplinary nature, which ranges from multilinear algebra and algebraic geometry to numerical analysis, algebraic statistics, quantum physics, signal processing, artificial intelligence, etc. The starting point behind the study of a decomposition relies on the idea that knowledge of elementary components of a tensor is fundamental to implement procedures that are able to understand and efficiently handle the information that a tensor encodes. Recent advances were obtained with a systematic application of geometric methods: secant varieties, symmetries of special decompositions, and an analysis of the geometry of finite sets. Thanks to new applications of theoretic results, criteria for understanding when a given decomposition is minimal or unique have been introduced or significantly improved. New types of decompositions, whose elementary blocks can be chosen in a range of different possible models (e.g., Chow decompositions or mixed decompositions), are now systematically studied and produce deeper insights into this topic. The aim of this Special Issue is to collect papers that illustrate some directions in which recent researches move, as well as to provide a wide overview of several new approaches to the problem of tensor decomposition.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">English</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">border rank and typical rank</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Tensor analysis</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Rank</subfield></datafield><datafield tag="653" ind1=" " ind2=" "><subfield code="a">Complexity</subfield></datafield><datafield tag="776" ind1=" " ind2=" "><subfield code="z">3-03897-590-7</subfield></datafield><datafield tag="906" ind1=" " ind2=" "><subfield code="a">BOOK</subfield></datafield><datafield tag="ADM" ind1=" " ind2=" "><subfield code="b">2023-12-15 05:56:34 Europe/Vienna</subfield><subfield code="f">system</subfield><subfield code="c">marc21</subfield><subfield code="a">2019-11-10 04:18:40 Europe/Vienna</subfield><subfield code="g">false</subfield></datafield><datafield tag="AVE" ind1=" " ind2=" "><subfield code="i">DOAB Directory of Open Access Books</subfield><subfield code="P">DOAB Directory of Open Access Books</subfield><subfield code="x">https://eu02.alma.exlibrisgroup.com/view/uresolver/43ACC_OEAW/openurl?u.ignore_date_coverage=true&amp;portfolio_pid=5337500780004498&amp;Force_direct=true</subfield><subfield code="Z">5337500780004498</subfield><subfield code="b">Available</subfield><subfield code="8">5337500780004498</subfield></datafield></record></collection>