Applied/ACMS/absF21: Difference between revisions

From UW-Math Wiki
Jump to navigation Jump to search
(Created page with "= ACMS Abstracts: Fall 2021 = === Di Fang (UC-Berkeley) === Title: Time-dependent unbounded Hamiltonian simulation with vector norm scaling Abstract: Hamiltonian simulation...")
 
Line 1: Line 1:
= ACMS Abstracts: Fall 2021 =
= ACMS Abstracts: Fall 2021 =
=== Jiuhua Hu (TAMY and UW) ===
Title: Wavelet-based Edge Multiscale Parareal Algorithm for Parabolic Equations with Heterogeneous Coefficients
Abstract: In this talk, I will talk about the Wavelet-based Edge Multiscale Parareal Algorithm to solve parabolic equations with heterogeneous coefficients. This algorithm combines the advantages of multiscale methods that can deal with heterogeneity in the spatial domain effectively, and the strength of parareal algorithms for speeding up time evolution problems. We derive the convergence rate of this algorithm and present extensive numerical tests to demonstrate the performance of our algorithm. This is a joint work with Guanglian Li (The University of Hong Kong).


=== Di Fang (UC-Berkeley) ===
=== Di Fang (UC-Berkeley) ===

Revision as of 18:07, 22 August 2021

ACMS Abstracts: Fall 2021

Jiuhua Hu (TAMY and UW)

Title: Wavelet-based Edge Multiscale Parareal Algorithm for Parabolic Equations with Heterogeneous Coefficients

Abstract: In this talk, I will talk about the Wavelet-based Edge Multiscale Parareal Algorithm to solve parabolic equations with heterogeneous coefficients. This algorithm combines the advantages of multiscale methods that can deal with heterogeneity in the spatial domain effectively, and the strength of parareal algorithms for speeding up time evolution problems. We derive the convergence rate of this algorithm and present extensive numerical tests to demonstrate the performance of our algorithm. This is a joint work with Guanglian Li (The University of Hong Kong).

Di Fang (UC-Berkeley)

Title: Time-dependent unbounded Hamiltonian simulation with vector norm scaling

Abstract: Hamiltonian simulation is a basic task in quantum computation. The accuracy of such simulation is usually measured by the error of the unitary evolution operator in the operator norm, which in turn depends on certain norm of the Hamiltonian. For unbounded operators, after suitable discretization, the norm of the Hamiltonian can be very large, which significantly increases the simulation cost. However, the operator norm measures the worst-case error of the quantum simulation, while practical simulation concerns the error with respect to a given initial vector at hand. We demonstrate that under suitable assumptions of the Hamiltonian and the initial vector, if the error is measured in terms of the vector norm, the computational cost may not increase at all as the norm of the Hamiltonian increases using Trotter type methods. In this sense, our result outperforms all previous error bounds in the quantum simulation literature. We also clarify the existence and the importance of commutator scalings of Trotter and generalized Trotter methods for time-dependent Hamiltonian simulations.