English
Related papers

Related papers: Parallel Gauss-Jordan Elimination and System Reduc…

200 papers

This paper proposes a GPU-accelerated optimization framework for collision avoidance problems where the controlled objects and the obstacles can be modeled as the finite union of convex polyhedra. A novel collision avoidance constraint is…

Robotics · Computer Science 2024-06-12 Zeming Wu , Zhuping Wang , Hao Zhang

Multi-task/Multi-output learning seeks to exploit correlation among tasks to enhance performance over learning or solving each task independently. In this paper, we investigate this problem in the context of Gaussian Processes (GPs) and…

Machine Learning · Statistics 2018-05-10 Weitong Ruan , Eric L. Miller

Computer models (simulators) are vital tools for investigating physical processes. Despite their utility, the prohibitive run-time of simulators hinders their direct application for uncertainty quantification. Gaussian process emulators…

Computation · Statistics 2024-11-25 Conor Crilly , Oliver Johnson , Alexander Lewis , Jonathan Rougier

Discrete variational methods show excellent performance in numerical simulations of different mechanical systems. In this paper, we introduce an iterative procedure for the solution of discrete variational equations for boundary value…

Optimization and Control · Mathematics 2022-06-22 Sebastián J. Ferraro , David Martín de Diego , Rodrigo Takuro Sato Martín de Almagro

Gaussian Processes (GPs) are powerful kernelized methods for non-parameteric regression used in many applications. However, their use is limited to a few thousand of training samples due to their cubic time complexity. In order to scale GPs…

Machine Learning · Statistics 2021-12-20 Manuel Schürch , Dario Azzimonti , Alessio Benavoli , Marco Zaffalon

In this paper, we investigate power-constrained sensing matrix design in a sparse Gaussian linear dimensionality reduction framework. Our study is carried out in a single--terminal setup as well as in a multi--terminal setup consisting of…

Information Theory · Computer Science 2015-10-28 Amirpasha Shirazinia , Subhrakanti Dey

The computational burden of running a complex computer model can make optimization impractical. Gaussian Processes (GPs) are statistical surrogates (also known as emulators) that alleviate this issue since they cheaply replace the computer…

Computation · Statistics 2019-09-11 Theodoros Mathikolonis , Serge Guillas

In this paper, we consider the composition of two independent processes : one process corresponds to position and the other one to time. Such processes will be called iterated processes. We first propose an algorithm based on the Euler…

Probability · Mathematics 2017-05-03 Michèle Thieullen , Alexis Vigot

We study faster algorithms for producing the minimum degree ordering used to speed up Gaussian elimination. This ordering is based on viewing the non-zero elements of a symmetric positive definite matrix as edges of an undirected graph, and…

Data Structures and Algorithms · Computer Science 2017-11-23 Matthew Fahrbach , Gary L. Miller , Richard Peng , Saurabh Sawlani , Junxing Wang , Shen Chen Xu

3D Gaussian Splatting (3DGS) based Simultaneous Localization and Mapping (SLAM) systems can largely benefit from 3DGS's state-of-the-art rendering efficiency and accuracy, but have not yet been adopted in resource-constrained edge devices…

Hardware Architecture · Computer Science 2025-10-10 Leshu Li , Jiayin Qin , Jie Peng , Zishen Wan , Huaizhi Qu , Ye Han , Pingqing Zheng , Hongsen Zhang , Yu Cao , Tianlong Chen , Yang Katie Zhao

Variational formulations of reconstruction in computed tomography have the notable drawback of requiring repeated evaluations of both the forward Radon transform and either its adjoint or an approximate inverse transform which are…

Numerical Analysis · Mathematics 2017-05-23 Richard C. Barnard , Rick Archibald

Gaussian processes (GP) are a widely used model for regression problems in supervised machine learning. Implementation of GP regression typically requires $O(n^3)$ logic gates. We show that the quantum linear systems algorithm [Harrow et…

Quantum Physics · Physics 2019-05-29 Zhikuan Zhao , Jack K. Fitzsimons , Joseph F. Fitzsimons

In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…

Quantum Physics · Physics 2022-02-10 P. H. Lundow , K. Markström

Scalable surrogate models enable efficient emulation of computer models (or simulators), particularly when dealing with large ensembles of runs. While Gaussian process (GP) models are commonly employed for emulation, they face limitations…

Methodology · Statistics 2025-10-07 Grant Hutchings , Derek Bingham , Kellin Rumsey , Earl Lawrence

The classical simulation of quantum algorithms is a crucial tool for circuit development, testing, and validation. Although acceleration using GPUs significantly reduces simulation time, most high-performance simulators rely on…

Many iterative parallel-in-time algorithms have been shown to be highly efficient for diffusion-dominated partial differential equations (PDEs), but are inefficient or even divergent when applied to advection-dominated PDEs. We consider the…

Numerical Analysis · Mathematics 2022-04-26 H. De Sterck , R. D. Falgout , O. A. Krzysik

Recently, a so-called E-MS algorithm was developed for model selection in the presence of missing data. Specifically, it performs the Expectation step (E step) and Model Selection step (MS step) alternately to find the minimum point of the…

Methodology · Statistics 2021-06-22 Ping-Feng Xu , Lai-Xu Shang , Man-Lai Tang , Na Shan , Guoliang Tian

Multi-output Gaussian process regression has become an important tool in uncertainty quantification, for building emulators of computationally expensive simulators, and other areas such as multi-task machine learning. We present a holistic…

Methodology · Statistics 2025-02-17 Daria Semochkina , Samuel E. Jackson , David C. Woods

We introduce a novel method for strong classical simulation of quantum circuits based on optimally k-partitioning ZX-diagrams, reducing each part individually, and then efficiently cross-referencing their results to conclude the overall…

Quantum Physics · Physics 2024-09-04 Matthew Sutcliffe

To address the computational complexity associated with state-vector simulation for quantum circuits, we propose a combination of advanced techniques to accelerate circuit execution. Quantum gate matrix caching reduces the overhead of…