Related papers: Efficient Photo-heating Algorithms in Time-depende…
Photomosaic images are a type of images consisting of various tiny images. A complete form can be seen clearly by viewing it from a long distance. Small tiny images which replace blocks of the original image can be seen clearly by viewing…
For many applications of pulsed radiation, the time-history of the radiation intensity must be optimized to induce a desired time-history of conditions. This optimization is normally performed using multi-physics simulations of the system.…
We propose adaptive, line search-free second-order methods with optimal rate of convergence for solving convex-concave min-max problems. By means of an adaptive step size, our algorithms feature a simple update rule that requires solving…
Many problems in science and engineering require an efficient numerical approximation of integrals or solutions to differential equations. For systems with rapidly changing dynamics, an equidistant discretization is often inadvisable as it…
Quasi-dynamic energy flow calculation is an indispensable tool for the heat and electricity integrated energy system (HE-IES) analysis. One solves the nonlinear partial differential algebraic equations to obtain thermal, hydraulic and…
Innovative numerical scheme studied in this work enables to overcome two main limitations of Building Performance Simulation (BPS) programs as high computational cost and the choice of a very fine numerical grid. The method, called…
We present a class of new explicit and stable numerical algorithms to solve the spatially discretized linear heat or diffusion equation. After discretizing the space and the time variables like conventional finite difference methods, we do…
Adaptive Computation (AC) has been shown to be effective in improving the efficiency of Open-Domain Question Answering (ODQA) systems. However, current AC approaches require tuning of all model parameters, and training state-of-the-art ODQA…
This paper introduces a novel method for approximating the dynamics of a large autonomous system projected onto a fixed subspace. The core contribution is a novel recursive algorithm to construct an effective time-dependent generator that…
We study a hardware-efficient variational quantum algorithm ansatz tailored for the trapped-ion quantum simulator, HEA-TI. We leverage programmable single-qubit rotations and global spin-spin interactions among all ions, reducing the…
Imaginary-time evolution plays an important role in algorithms for computing ground-state and thermal equilibrium properties of quantum systems, but can be challenging to simulate on classical computers. Many quantum algorithms for…
To approximate convolutions which occur in evolution equations with memory terms, a variable-stepsize algorithm is presented for which advancing N steps requires only O(N log(N)) operations and O(log(N)) active memory, in place of O(N^2)…
Recently, gradient-based discrete sampling has emerged as a highly efficient, general-purpose solver for various combinatorial optimization (CO) problems, achieving performance comparable to or surpassing the popular data-driven approaches.…
This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…
We revisit adaptive time stepping, one of the classical topics of numerical analysis and computational engineering. While widely used in application and subject of many theoretical works, a complete understanding is still missing. Apart…
A numerical method is developed to solve the time-dependent Dirac equation in cylindrical coordinates for 3-D axisymmetric systems. The time evolution is treated by a splitting scheme in coordinate space using alternate direction iteration,…
The cryptanalysis of various cipher problems can be formulated as NP-Hard combinatorial problem. Solving such problems requires time and/or memory requirement which increases with the size of the problem. Techniques for solving…
We propose a new algorithm to compute the X-ray transform of an image represented by unit (pixel/voxel) basis functions. The fundamental issue is equivalently calculating the intersection lengths of the ray with associated units. For any…
An extension of the multi-level hp Finite Cell Method is proposed for the simulation of thermoviscoplastic problems with temperature-dependent material behavior. The approach combines hierarchical adaptive refinement with a non-negative…
We describe a photon-conserving radiative transfer algorithm, using a spatially-adaptive ray tracing scheme, and its parallel implementation into the adaptive mesh refinement (AMR) cosmological hydrodynamics code, Enzo. By coupling the…