8 problems

The IDA algorithm is a parallel algorithm for solving flow-routing and drainage-area linear systems, while the high-to-low method solves the corresponding system on a single core.…

Let the inverse participation ratio (IPR) measure the concentration of the residual, and consider power-weighted sampling in an asynchronous randomized Jacobi method. Dual-role con…

The proposed reduced-order modeling ideas use randomized, time-parallel generation of reduced basis functions for a time-dependent problem. Computational-savings conjecture. The pr…

Consider a quantum parallel computation performed by a quantum parallel random-access machine, or QPRAM, and let its efficiency be the ratio of the serial work to the product of th…

Consider sweeping preconditioners for the high-frequency Helmholtz equation, used to solve a problem with a single right-hand side in a distributed-memory parallel computational en…

Large-batchsize parallelisation conjecture. In many scenarios, it will be better to use a large batchsize to reap the benefits of parallelisation.

Maximum-to-expected iteration-time conjecture. A more useful indicator of the overlap parameter could be the maximum iteration time divided by the expected iteration time.

The numerical tests compare serial methods with the parallel PIRK10 method for solving ordinary differential equations, including the HO, HH, and HH100 problems. The parallel overh…