Related papers: Comment on "Accurate and Scalable O(N) Algorithm f…
We reply to the recent comment cond-mat/9809184 on our original paper `Non-universal exponents in interface growth', Phys. Rev. Lett, 79, 2261 (1997).
This is a position paper written as an introduction to the special volume on quantum algorithms I edited for the journal Mathematical Structures in Computer Science (Volume 20 - Special Issue 06 (Quantum Algorithms), 2010).
In this article we introduce a novel coupled algorithm for massively parallel direct numerical simulations of electrophoresis in microfluidic flows. This multiphysics algorithm employs an Eulerian description of fluid and ions, combined…
Reply to a comment by T. Rakovszky, F. Pollmann, and C. W von Keyserlingk [arXiv:2010.07969].
The parallel and distributed processing are becoming de facto industry standard, and a large part of the current research is targeted on how to make computing scalable and distributed, dynamically, without allocating the resources on…
Comment on "Revision of Bubble Bursting: Universal Scaling Laws of Top Jet Drop Size and Speed"
The constant increase in parallelism available on large-scale distributed computers poses major scalability challenges to many scientific applications. A common strategy to improve scalability is to express the algorithm in terms of…
Reply to the comment, cond-mat/0209398 by by N.W. Watkins, S.C. Chapman, and G. Rowlands
We perform a proof-of-concept implementation of the massively parallel algorithm (P.M. Lushnikov, Opt. Lett., v. 27, 939 (2002)) for simulation of dispersion-managed wavelength-division-multiplexed optical fiber systems. Linear scalability…
We report a development of a new fast surface-based method for numerical calculations of solvation energy of biomolecules with a large number of charged groups. The procedure scales linearly with the system size both in time and memory…
A massively parallel order-N electronic structure theory was constructed by an interdisciplinary research between physics, applied mathematics and computer science. (1) A high parallel efficiency with ten-million-atom nanomaterials was…
Owing to the computational complexity of electronic structure algorithms running on classical digital computers, the range of molecular systems amenable to simulation remains tightly circumscribed even after many decades of work. Quantum…
A reply to the comment by Lee et al. [arXiv:1309.5367]
A comment on the paper Appl. Phys. Lett. 104, 161116 (2014).
Large machine learning models are revolutionary technologies of artificial intelligence whose bottlenecks include huge computational expenses, power, and time used both in the pre-training and fine-tuning process. In this work, we show that…
We present a hybrid OpenMP/Charm++ framework for solving the $\mathcal{O} (N)$ Self-Consistent-Field eigenvalue problem with parallelism in the strong scaling regime, $P\gg{N}$, where $P$ is the number of cores, and $N$ a measure of system…
Comment on ``Boosting Algorithms: Regularization, Prediction and Model Fitting'' [arXiv:0804.2752]
Modern atomic physics applications in science and technology pose ever higher demands on the precision of computations of properties of atoms and ions. Especially challenging is the modeling of electronic correlations within the…
An efficient parallelization approach to simulate optical properties of ensembles of quantum emitters in realistic electromagnetic environments is considered. It relies on balancing computing load of utilized processors and is built into…
The reply by Oughstun et al. [J. Opt. Soc. Am. B 28, 468-469 (2011)] to our comment [J. Opt. Soc. Am. B 28, 450-452 (2011)] on their recently published paper [J. Opt. Soc. Am. B 27, 1664-1670 (2010)] is shown to make no response to the main…