Tensor computations with dimensionality manipulations
| dc.contributor.author | Shi, Tianyi | |
| dc.contributor.chair | Townsend, Alex John | |
| dc.contributor.committeeMember | Udell, Madeleine Richards | |
| dc.contributor.committeeMember | Bindel, David S. | |
| dc.date.accessioned | 2022-09-15T15:51:24Z | |
| dc.date.available | 2022-09-15T15:51:24Z | |
| dc.date.issued | 2022-05 | |
| dc.description | 200 pages | |
| dc.description.abstract | Methodologies that ensure the compressibility of tensors are introduced. Bounds on the storage costs with respect to various tensor formats are derived. A new algorithm combining data-sparse tensor formats and factored alternating direction implicit method is designed to solve Sylvester tensor equations, and incorporated in a fast spectral Poisson equation solver on cubes with optimal complexity. New parallelizable algorithms for computing the tensor-train decomposition of tensors in original format, streaming data, Tucker format, and that satisfy algebraic relations, are proposed. Based on the input format, the algorithms involve deterministic or probabilistic aspects, and all have guarantees of accuracy. Scaling analysis and numerical experiments are provided to demonstrate computational and storage efficiency. An ultraspherical spectral method is developed for fractional partial differential equations via the Caffarelli--Silvestre extension on disk and rectangular domains. A parallel domain decomposition solver is designed for multi-core performance of non-smooth functions. The discretized equation is solved via direct tensor equation solvers, and numerical performance is shown with a fractional PDE constrained optimization problem. Linear systems in electron correlation calculation from computational chemistry are converted into tensor equations to reduce computing and storage costs. Several algorithms are developed to exploit the sparsity and data-sparsity of chemical structures. Numerical results indicate that tensor equation solvers are competitive over traditional linear system solvers with both canonical and localized orbital bases formulations. The quantized tensor-train format of tensors is introduced to approximate analytic functions via Chebyshev polynomial expansions. Analysis of different types of singularities is carried out, leading to theoretical guarantees of coefficient storage compressibility. | |
| dc.identifier.doi | https://doi.org/10.7298/0j0x-1h70 | |
| dc.identifier.other | Shi_cornellgrad_0058F_13072 | |
| dc.identifier.other | http://dissertations.umi.com/cornellgrad:13072 | |
| dc.identifier.uri | https://hdl.handle.net/1813/111787 | |
| dc.language.iso | en | |
| dc.subject | Approximation theory | |
| dc.subject | Numerical analysis | |
| dc.subject | Numerical linear algebra | |
| dc.subject | Scientific computing | |
| dc.title | Tensor computations with dimensionality manipulations | |
| dc.type | dissertation or thesis | |
| dcterms.license | https://hdl.handle.net/1813/59810.2 | |
| thesis.degree.discipline | Applied Mathematics | |
| thesis.degree.grantor | Cornell University | |
| thesis.degree.level | Doctor of Philosophy | |
| thesis.degree.name | Ph. D., Applied Mathematics |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Shi_cornellgrad_0058F_13072.pdf
- Size:
- 2.56 MB
- Format:
- Adobe Portable Document Format