東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Structured Matrix Recovery and Appro...

Halikias, Diana,

Linked to FindBook

Google Book

Amazon

博客來

Structured Matrix Recovery and Approximation From Matrix-Vector Products /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Structured Matrix Recovery and Approximation From Matrix-Vector Products // Diana Halikias.
Author:	Halikias, Diana,
Description:	1 electronic resource (270 pages)
Notes:	Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
Contained By:	Dissertations Abstracts International86-12B.
Subject:	Mathematics. -
Online resource:	https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=32000082
ISBN:	9798283138428

Structured Matrix Recovery and Approximation From Matrix-Vector Products /
Halikias, Diana,

Structured Matrix Recovery and Approximation From Matrix-Vector Products /Diana Halikias. - 1 electronic resource (270 pages)

Source: Dissertations Abstracts International, Volume: 86-12, Section: B.

Algorithms and theory are developed for the task of recovering a structured, unknown matrix A from matrix-vector products x → Ax and y → A⊤y. Upper and lower bounds on the number of matrix-vector products necessary to recover many common structured matrix families, such as tridiagonal, Toeplitz, Hankel, low-rank, hierarchical, and sparse matrices, are provided. For sparse and hierarchical matrices, the more general problem of near-optimal approximation from matrix-vector products is analyzed. This research is motivated by the field of operator learning, where one wishes to recover an infinite-dimensional operator from only operator-function products. The problem of matrix recovery and approximation also encompasses important current research directions in numerical linear algebra, such as low-rank approximation and diagonal estimation.Algorithms and theory for hierarchical matrix recovery are extended to infinite dimensions for recovery of the Green's function of a uniformly elliptic PDE over a 3D domain with Lipschitz-smooth boundary subject to Dirichlet boundary conditions. We prove that one can accurately approximate the Green's function with relatively few input-output pairs of forcing terms and solutions by exploiting hierarchical low-rank structure and PDE theory.Throughout the work, it is a central question whether one can prove an accuracy guarantee for peeling algorithms, which recover hierarchical matrices from matrix-vector products using a recursive strategy that may result in a large accumulation of error. Upper bounds on the error of peeling-type algorithms are provided in both the finite and infinite-dimensional settings. In infinite dimensions, a combination of Green's function theory for elliptic PDEs and an adaptive adjustment of the target rank at each hierarchical level are needed. In finite dimensions, the choice of low-rank approximation algorithm is shown to be crucial, and a perforated sketch structure based on CountSketch is also employed. In each setting, perturbation analysis for low-rank approximation techniques such as the randomized SVD and generalized Nystrom method is provided. The first theoretical guarantees for the accuracy of peeling algorithms are presented, as well as the existence of hard cases for which these algorithms accumulate uncontrollable error.Lastly, motivated by realistic settings in PDE learning and numerical linear algebra, the assumption of access to the action of the transpose of a matrix, y → A⊤y, and adjoint of an operator is removed. Transpose-free techniques for matrix recovery and least squares problems are investigated, and transpose data is shown to be essential to each of these problems.

English

ISBN: 9798283138428Subjects--Topical Terms:

515831
Mathematics.
Subjects--Index Terms:

Hierarchical matrices

Structured Matrix Recovery and Approximation From Matrix-Vector Products /
LDR:04170nmm a22004453i 4500 001 2433478
005 20250825062340.5
006 m o d
007 cr|nu||||||||
008 261011s2025 miu||||||m |||||||eng d
020 $a 9798283138428
035 $a (MiAaPQD)AAI32000082
035 $a AAI32000082
040 $a MiAaPQD $b eng $c MiAaPQD $e rda
100 1 $a Halikias, Diana, $e author. $0 (orcid)0000-0001-7159-7770 $3 3823111
245 1 0 $a Structured Matrix Recovery and Approximation From Matrix-Vector Products / $c Diana Halikias.
264 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2025
300 $a 1 electronic resource (270 pages)
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
500 $a Source: Dissertations Abstracts International, Volume: 86-12, Section: B.
500 $a Advisors: Townsend, Alex Committee members: Damle, Anil; Saloff-Coste, Laurent.
502 $b Ph.D. $c Cornell University $d 2025.
520 $a Algorithms and theory are developed for the task of recovering a structured, unknown matrix A from matrix-vector products x → Ax and y → A⊤y. Upper and lower bounds on the number of matrix-vector products necessary to recover many common structured matrix families, such as tridiagonal, Toeplitz, Hankel, low-rank, hierarchical, and sparse matrices, are provided. For sparse and hierarchical matrices, the more general problem of near-optimal approximation from matrix-vector products is analyzed. This research is motivated by the field of operator learning, where one wishes to recover an infinite-dimensional operator from only operator-function products. The problem of matrix recovery and approximation also encompasses important current research directions in numerical linear algebra, such as low-rank approximation and diagonal estimation.Algorithms and theory for hierarchical matrix recovery are extended to infinite dimensions for recovery of the Green's function of a uniformly elliptic PDE over a 3D domain with Lipschitz-smooth boundary subject to Dirichlet boundary conditions. We prove that one can accurately approximate the Green's function with relatively few input-output pairs of forcing terms and solutions by exploiting hierarchical low-rank structure and PDE theory.Throughout the work, it is a central question whether one can prove an accuracy guarantee for peeling algorithms, which recover hierarchical matrices from matrix-vector products using a recursive strategy that may result in a large accumulation of error. Upper bounds on the error of peeling-type algorithms are provided in both the finite and infinite-dimensional settings. In infinite dimensions, a combination of Green's function theory for elliptic PDEs and an adaptive adjustment of the target rank at each hierarchical level are needed. In finite dimensions, the choice of low-rank approximation algorithm is shown to be crucial, and a perforated sketch structure based on CountSketch is also employed. In each setting, perturbation analysis for low-rank approximation techniques such as the randomized SVD and generalized Nystrom method is provided. The first theoretical guarantees for the accuracy of peeling algorithms are presented, as well as the existence of hard cases for which these algorithms accumulate uncontrollable error.Lastly, motivated by realistic settings in PDE learning and numerical linear algebra, the assumption of access to the action of the transpose of a matrix, y → A⊤y, and adjoint of an operator is removed. Transpose-free techniques for matrix recovery and least squares problems are investigated, and transpose data is shown to be essential to each of these problems.
546 $a English
590 $a School code: 0058
650 4 $a Mathematics. $3 515831
650 4 $a Applied mathematics. $3 2122814
650 4 $a Computational physics. $3 3343998
653 $a Hierarchical matrices
653 $a Low-rank matrices
653 $a Matrix recovery
653 $a Numerical linear algebra
653 $a Operator learning
653 $a PDE learning
690 $a 0405
690 $a 0364
690 $a 0216
710 2 $a Cornell University. $b Mathematics. $e degree granting institution. $3 3816358
720 1 $a Townsend, Alex $e degree supervisor.
773 0 $t Dissertations Abstracts International $g 86-12B.
790 $a 0058
791 $a Ph.D.
792 $a 2025
856 4 0 $u https://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=32000082