Skip to search formSkip to main contentSkip to account menu
  • Publications
  • Influence
Component averaging: An efficient iterative parallel algorithm for large and sparse unstructured problems
View via Publisher
NESTA, The NICTA Energy System Test Case Archive
TLDR
This report surveys all of the publicly available AC transmission system test cases, to the best of the authors' knowledge, and finds that many of the traditional test cases are missing key network operation constraints, such as line thermal limits and generator capability curves.
View PDF on arXiv
Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
TLDR
A formal proof of convergence is presented: It is shown that the component-averaging operations are equivalent to row projections in a certain superspace, so the convergence properties of CARP are identical to those of Kaczmarz's algorithm in the superspace.
View via Publisher
Curie-temperature depth estimation using a self-similar magnetization model
SUMMARY The Earth's crust is magnetized down to the Curie-temperature depth at about 10 to 50 km. This limited depth extent of the crustal magnetization is discernible in the power spectra of…
View via Publisher
Compact 2D and 3D sixth order schemes for the Helmholtz equation with variable wave number
View via Publisher
Accurate control of ball screw drives using pole-placement vibration damping and a novel trajectory prefilter
View via Publisher
Strong underrelaxation in Kaczmarz's method for inconsistent systems
SummaryWe investigate the behavior of Kaczmarz's method with relaxation for inconsistent systems. We show that when the relaxation parameter goes to zero, the limits of the cyclic subsequences…
View on Springer
BICAV: An Inherently Parallel Algorithm for Sparse Systems with Pixel-Dependent Weighting
TLDR
When BICAV is optimized for block size and relaxation parameters, its very first iterates are far superior to those of CAV, and more or less on a par with ART.
View via Publisher
Efficient Self Simulation Algorithms for Reconfigurable Arrays
TLDR
This work gives several positive answers to the self simulation problem on dynamically reconfigurable meshes, showing that the simulation of a reconfiguring mesh by a smaller one can be carried optimally, by using standard methods, on meshes such that buses are established along rows or along columns.
View via Publisher
CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs
View via Publisher
...
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License