English
Related papers

Related papers: Optical Solver of Combinatorial Problems: Nano-Tec…

200 papers

Analog photonic solutions offer unique opportunities to address complex computational tasks with unprecedented performance in terms of energy dissipation and speeds, overcoming current limitations of modern computing architectures based on…

We report recent research on computing with biology-based neural network models by means of physics-based opto-electronic hardware. New technology provides opportunities for very-high-speed computation and uncovers problems obstructing the…

Neural and Evolutionary Computing · Computer Science 2010-06-09 A. Steven Younger , Emmett Redd

Miniaturized optical resonators with spatial dimensions of the order of the wavelength of the trapped light offer prospects for a variety of new applications like quantum processing or construction of meta-materials. Light propagation in…

Computational Physics · Physics 2009-05-28 L. Zschiedrich , S. Burger , B. Kettner , F. Schmidt

Optical computing accelerators may help alleviate bandwidth and power consumption bottlenecks in electronics. We show an approach to implementing logarithmic-type analog co-processors in silicon photonics and use it to perform the…

Optics · Physics 2016-04-20 Yunshan Jiang , Peter T. S. DeVore , Bahram Jalali

The accelerating growth of global data generation demands data storage platforms that offer high capacity, long lifespan, and low energy consumption beyond the limits of electronic memory technologies. Optical storage provides an attractive…

Solving large-scale computationally hard optimization problems using existing computers has hit a bottleneck. A promising alternative approach uses physics-based phenomena to naturally solve optimization problems wherein the physical…

In order to formulate mathematical conjectures likely to be true, a number of base cases must be determined. However, many combinatorial problems are NP-hard and the computational complexity makes this research approach difficult using a…

Data Structures and Algorithms · Computer Science 2015-12-18 Victoria Horan , Steve Adachi , Stanley Bak

We present a new algorithm for computing hyperexponential solutions of ordinary linear differential equations with polynomial coefficients. The algorithm relies on interpreting formal series solutions at the singular points as analytic…

Symbolic Computation · Computer Science 2013-01-14 Fredrik Johansson , Manuel Kauers , Marc Mezzarobba

There have been several algorithms designed to optimise matrix multiplication. From schoolbook method with complexity $O(n^3)$ to advanced tensor-based tools with time complexity $O(n^{2.3728639})$ (lowest possible bound achieved), a lot of…

Data Structures and Algorithms · Computer Science 2019-01-30 Shrohan Mohapatra

Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations…

Photonic computing, with potentials of high parallelism, low latency and high energy efficiency, have gained progressive interest at the forefront of neural network (NN) accelerators. However, most existing photonic computing accelerators…

Optics · Physics 2024-04-16 Ziyu Zhan , Hao Wang , Qiang Liu , Xing Fu

A class of algorithms for the solution of discrete material optimization problems in electromagnetic applications is discussed. The idea behind the algorithm is similar to that of the sequential programming. However, in each major iteration…

Optimization and Control · Mathematics 2017-07-14 Johannes Semmler , Lukas Pflug , Michael Stingl

Mathematical optimization, although often leading to NP-hard models, is now capable of solving even large-scale instances within reasonable time. However, the primary focus is often placed solely on optimality. This implies that while…

Optimization and Control · Mathematics 2025-12-23 Kevin-Martin Aigner , Marc Goerigk , Michael Hartisch , Frauke Liers , Arthur Miehlich , Florian Rösel

We describe recent progress in developing practical ab initio methods for which the computer effort is proportional to the number of atoms: linear scaling or O(N) methods. It is shown that the locality property of the density matrix gives a…

Condensed Matter · Physics 2007-05-23 D. R. Bowler , I. J. Bush , M. J. Gillan

This paper offers a matrix-free first-order numerical method to solve large-scale conic optimization problems. Solving systems of linear equations pose the most computationally challenging part in both first-order and second-order numerical…

Optimization and Control · Mathematics 2022-03-11 Muhammad Adil , Ramtin Madani , Sasan Tavakkol , Ali Davoudi

Bridging logical and algorithmic reasoning with modern machine learning techniques is a fundamental challenge with potentially transformative impact. On the algorithmic side, many NP-hard problems can be expressed as integer programs, in…

Machine Learning · Computer Science 2024-12-16 Anselm Paulus , Michal Rolínek , Vít Musil , Brandon Amos , Georg Martius

Nonlinear computation is essential for various information processing tasks. Optical implementations are attractive because passive light propagation can manipulate high-dimensional signals with extreme throughput and parallelism; yet…

Optics is a promising platform in which to help realise the next generation of fast, parallel and energy-efficient computation. We demonstrate a reconfigurable free-space optical multiplier that is capable of over 3000 computations in…

Optics · Physics 2020-11-23 James Spall , Xianxin Guo , Thomas D. Barrett , A. I. Lvovsky

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…

Optimization and Control · Mathematics 2016-10-31 Insoon Yang , Samuel A. Burden , Ram Rajagopal , S. Shankar Sastry , Claire J. Tomlin

We formalize the problem of selecting the optimal set of options for planning as that of computing the smallest set of options so that planning converges in less than a given maximum of value-iteration passes. We first show that the problem…

Artificial Intelligence · Computer Science 2019-03-19 Yuu Jinnai , David Abel , D Ellis Hershkowitz , Michael Littman , George Konidaris