{"id":{"repo_id":"msu","oai_identifier":"oai:d.lib.msu.edu:etd_3921"},"canonical_url":"https://search.ndltd.org/etd/msu/oai:d.lib.msu.edu:etd_3921","repository":{"repo_id":"msu","name":"Michigan State University","base_url":"https://d.lib.msu.edu/oai"},"display":{"title":"A linear homotopy method for computing generalized tensor eigenpairs","abstract":"A tensor is a multidimensional array. In general, an $m$th-order and $n$-dimensional tensor can be indexed as $\\cA = (A_{i_1i_2\\dots i_m})$, where $A_{i_1i_2\\dots i_m} \\in \\bC$ for $1 \\le i_1, i_2, \\dots, i_m \\le n$. Let ${\\mathcal A}$ be an $m$th order $n$-dimensional tensor and ${\\mathcal B}$ be an $m'$th order $n$-dimensional tensor. A scalar $\\lambda \\in {\\mathbb C} $ and a vector $x \\in {\\mathbb C}^n \\backslash \\{0\\}$ is called a generalized ${\\mathcal B}$-eigenpair of ${\\mathcal A}$ if ${\\mathcal A} x^{m-1} = \\lambda {\\mathcal B} x^{m'-1}$ with ${\\mathcal B}x^{m'} =1$ when $m \\ne m'$. Different choices of $\\cB$ yield different versions of the tensor eigenvalue problem. As one can see, computing tensor eigenpairs amounts to solving a polynomial system. To find all solutions of a polynomial system, the homotopy continuation methods are very useful in terms of computational cost and storage space. By taking advantage of the solution structure of the tensor eigenproblem, two easy-to-implement linear homotopy methods which follow the optimal number of paths will be proposed to solve the generalized tensor eigenproblem when $m \\ne m'$. With proper implementation, these methods can find all equivalence classes of isolated eigenpairs. A MATLAB software package \\texttt{TenEig 2.0} has been developed to implement these methods. Numerical results are provided to show its efficiency and effectiveness.","abstract_html":"A tensor is a multidimensional array. In general, an $m$th-order and $n$-dimensional tensor can be indexed as <span class=\"etd-inline-math\">\\cA = (A<sub>i<sub>1</sub>i<sub>2</sub>\\dots i<sub>m</sub></sub>)</span>, where <span class=\"etd-inline-math\">A<sub>i<sub>1</sub>i<sub>2</sub>\\dots i<sub>m</sub></sub> \\in \\bC</span> for <span class=\"etd-inline-math\">1 \\le i<sub>1</sub>, i<sub>2</sub>, \\dots, i<sub>m</sub> \\le n</span>. Let ${\\mathcal A}$ be an $m$th order $n$-dimensional tensor and ${\\mathcal B}$ be an $m&#x27;$th order $n$-dimensional tensor. A scalar $\\lambda \\in {\\mathbb C} $ and a vector <span class=\"etd-inline-math\">x \\in {\\mathbb C}<sup>n</sup> \\backslash \\{0\\}</span> is called a generalized ${\\mathcal B}$-eigenpair of ${\\mathcal A}$ if <span class=\"etd-inline-math\">{\\mathcal A} x<sup>m-1</sup> = \\lambda {\\mathcal B} x<sup>m&#x27;-1</sup></span> with <span class=\"etd-inline-math\">{\\mathcal B}x<sup>m&#x27;</sup> =1</span> when $m \\ne m&#x27;$. Different choices of $\\cB$ yield different versions of the tensor eigenvalue problem. As one can see, computing tensor eigenpairs amounts to solving a polynomial system. To find all solutions of a polynomial system, the homotopy continuation methods are very useful in terms of computational cost and storage space. By taking advantage of the solution structure of the tensor eigenproblem, two easy-to-implement linear homotopy methods which follow the optimal number of paths will be proposed to solve the generalized tensor eigenproblem when $m \\ne m&#x27;$. With proper implementation, these methods can find all equivalence classes of isolated eigenpairs. A MATLAB software package \\texttt{TenEig 2.0} has been developed to implement these methods. Numerical results are provided to show its efficiency and effectiveness.","abstract_has_math":true,"creators":["Chen, Liping"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Li, Tien-Yien","Chiu, Chichia","Lamm, Patricia","Nagy, Gabriel","Tang, Moxun"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-11-18T18:44:51Z","subjects":["Homotopy theory","Tensor algebra"],"languages":["English"],"rights":["In Copyright"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:3921","isbn:9781339692456","isbn:1339692457","oclc:961269406","umi:10105794","local:Chen_grad.msu_0128D_14446"],"render_values":[{"text":"etd:3921","href":null,"code":true},{"text":"isbn:9781339692456","href":null,"code":true},{"text":"isbn:1339692457","href":null,"code":true},{"text":"oclc:961269406","href":null,"code":true},{"text":"umi:10105794","href":null,"code":true},{"text":"local:Chen_grad.msu_0128D_14446","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":null,"outbound_label":null,"outbound_source":null,"record_url":null,"record_label":null,"record_kind":null,"record_source":null,"download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://d.lib.msu.edu/oai?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Ad.lib.msu.edu%3Aetd_3921","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Li, Tien-Yien","Chiu, Chichia","Lamm, Patricia","Nagy, Gabriel","Tang, Moxun"]},{"key":"dc:creator","label":"Author","values":["Chen, Liping"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2016"]},{"key":"dc:relation","label":"Dc Relation","values":["Electronic Theses & Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Text","Theses"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Homotopy theory","Tensor algebra"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["etd:3921","isbn:9781339692456","isbn:1339692457","oclc:961269406","umi:10105794","local:Chen_grad.msu_0128D_14446"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["A tensor is a multidimensional array. In general, an $m$th-order and $n$-dimensional tensor can be indexed as $\\cA = (A_{i_1i_2\\dots i_m})$, where $A_{i_1i_2\\dots i_m} \\in \\bC$ for $1 \\le i_1, i_2, \\dots, i_m \\le n$. Let ${\\mathcal A}$ be an $m$th order $n$-dimensional tensor and ${\\mathcal B}$ be an $m'$th order $n$-dimensional tensor. A scalar $\\lambda \\in {\\mathbb C} $ and a vector $x \\in {\\mathbb C}^n \\backslash \\{0\\}$ is called a generalized ${\\mathcal B}$-eigenpair of ${\\mathcal A}$ if ${\\mathcal A} x^{m-1} = \\lambda {\\mathcal B} x^{m'-1}$ with ${\\mathcal B}x^{m'} =1$ when $m \\ne m'$. Different choices of $\\cB$ yield different versions of the tensor eigenvalue problem. As one can see, computing tensor eigenpairs amounts to solving a polynomial system. To find all solutions of a polynomial system, the homotopy continuation methods are very useful in terms of computational cost and storage space. By taking advantage of the solution structure of the tensor eigenproblem, two easy-to-implement linear homotopy methods which follow the optimal number of paths will be proposed to solve the generalized tensor eigenproblem when $m \\ne m'$. With proper implementation, these methods can find all equivalence classes of isolated eigenpairs. A MATLAB software package \\texttt{TenEig 2.0} has been developed to implement these methods. Numerical results are provided to show its efficiency and effectiveness.","Thesis (Ph. D.)--Michigan State University. Applied Mathematics, 2016","Includes bibliographical references (pages 76-78)"]},{"key":"dc:format","label":"Dc Format","values":["vii, 78 pages","application/pdf"]},{"key":"dc:title","label":"Title","values":["A linear homotopy method for computing generalized tensor eigenpairs"]}]}],"canonical_facts":{"dc:contributor":["Li, Tien-Yien","Chiu, Chichia","Lamm, Patricia","Nagy, Gabriel","Tang, Moxun"],"dc:creator":["Chen, Liping"],"dc:date":["2016"],"dc:description":["A tensor is a multidimensional array. In general, an $m$th-order and $n$-dimensional tensor can be indexed as $\\cA = (A_{i_1i_2\\dots i_m})$, where $A_{i_1i_2\\dots i_m} \\in \\bC$ for $1 \\le i_1, i_2, \\dots, i_m \\le n$. Let ${\\mathcal A}$ be an $m$th order $n$-dimensional tensor and ${\\mathcal B}$ be an $m'$th order $n$-dimensional tensor. A scalar $\\lambda \\in {\\mathbb C} $ and a vector $x \\in {\\mathbb C}^n \\backslash \\{0\\}$ is called a generalized ${\\mathcal B}$-eigenpair of ${\\mathcal A}$ if ${\\mathcal A} x^{m-1} = \\lambda {\\mathcal B} x^{m'-1}$ with ${\\mathcal B}x^{m'} =1$ when $m \\ne m'$. Different choices of $\\cB$ yield different versions of the tensor eigenvalue problem. As one can see, computing tensor eigenpairs amounts to solving a polynomial system. To find all solutions of a polynomial system, the homotopy continuation methods are very useful in terms of computational cost and storage space. By taking advantage of the solution structure of the tensor eigenproblem, two easy-to-implement linear homotopy methods which follow the optimal number of paths will be proposed to solve the generalized tensor eigenproblem when $m \\ne m'$. With proper implementation, these methods can find all equivalence classes of isolated eigenpairs. A MATLAB software package \\texttt{TenEig 2.0} has been developed to implement these methods. Numerical results are provided to show its efficiency and effectiveness.","Thesis (Ph. D.)--Michigan State University. Applied Mathematics, 2016","Includes bibliographical references (pages 76-78)"],"dc:format":["vii, 78 pages","application/pdf"],"dc:identifier":["etd:3921","isbn:9781339692456","isbn:1339692457","oclc:961269406","umi:10105794","local:Chen_grad.msu_0128D_14446"],"dc:language":["English"],"dc:relation":["Electronic Theses & Dissertations"],"dc:rights":["In Copyright"],"dc:subject":["Homotopy theory","Tensor algebra"],"dc:title":["A linear homotopy method for computing generalized tensor eigenpairs"],"dc:type":["Text","Theses"]},"updated_at":"2026-11-18T18:44:51Z"}