English
Related papers

Related papers: Efficient Sequential and Parallel Algorithms for E…

200 papers

In this paper, we explore how numerical calculations can be accelerated by implementing several numerical methods of fractional-order systems using parallel computing techniques. We investigate the feasibility of parallel computing…

Dynamical Systems · Mathematics 2016-11-29 A. Baban , C. Bonchiş , A. Fikl , F. Roşu

Quantum phase estimation (QPE) is the key subroutine of several quantum computing algorithms as well as a central ingredient in quantum computational chemistry and quantum simulation. While QPE strategies have focused on the estimation of a…

Quantum Physics · Physics 2021-07-26 Valentin Gebhart , Augusto Smerzi , Luca Pezzè

We present a novel parallelisation scheme that simplifies the adaptation of learning algorithms to growing amounts of data as well as growing needs for accurate and confident predictions in critical applications. In contrast to other…

Machine Learning · Computer Science 2018-10-09 Michael Kamp , Mario Boley , Olana Missura , Thomas Gärtner

By a high-order numerical homogenization method, a heterogeneous multiscale scheme was developed in Jin & Li (2022) for evolving differential equations containing two time scales. In this paper, we further explore the technique to propose…

Numerical Analysis · Mathematics 2025-09-25 Bojin Chen , Zeyu Jin , Ruo Li

We discuss how string sorting algorithms can be parallelized on modern multi-core shared memory machines. As a synthesis of the best sequential string sorting algorithms and successful parallel sorting algorithms for atomic objects, we…

Data Structures and Algorithms · Computer Science 2013-05-07 Timo Bingmann , Peter Sanders

We propose HAMSI (Hessian Approximated Multiple Subsets Iteration), which is a provably convergent, second order incremental algorithm for solving large-scale partially separable optimization problems. The algorithm is based on a local…

Persistent homology is a crucial invariant that is used in many areas to understand data. The $O(N^4)$ run time is a hindrance to its use on most large datasets. We give a parallelization method to utilize multi-core machines and clusters.…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-03-10 Michael G. Rawson

Clustering is one of the most crucial problems in unsupervised learning, and the well-known $k$-means clustering algorithm has been shown to be implementable on a quantum computer with a significant speedup. However, many clustering…

Quantum Physics · Physics 2023-01-03 Qingyu Li , Yuhan Huang , Shan Jin , Xiaokai Hou , Xiaoting Wang

We introduce a higher order phase averaging method for nonlinear oscillatory systems. Phase averaging is a technique to filter fast motions from the dynamics whilst still accounting for their effect on the slow dynamics. Phase averaging is…

Dynamical Systems · Mathematics 2022-03-09 Werner Bauer , Colin J. Cotter , Beth Wingate

We present a real-time method for robust estimation of multiple instances of geometric models from noisy data. Geometric models such as vanishing points, planar homographies or fundamental matrices are essential for 3D scene analysis.…

Computer Vision and Pattern Recognition · Computer Science 2024-01-29 Florian Kluger , Bodo Rosenhahn

High utility sequential pattern mining (HUSPM) is a significant and valuable activity in knowledge discovery and data analytics with many real-world applications. In some cases, HUSPM can not provide an excellent measure to predict what…

Artificial Intelligence · Computer Science 2022-09-28 Chunkai Zhang , Maohua Lyu , Wensheng Gan , Philip S. Yu

In this paper we solve on GPUs massive problems with large amount of data, which are not appropriate for solution with the SIMD technology. For the given problem we consider a three-level parallelization. The multithreading of CPU is used…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-02-18 Natalya Litvinenko

We present an efficient separable approach to the estimation and reconstruction of the bispectrum and the trispectrum from observational (or simulated) large scale structure data. This is developed from general CMB (poly-)spectra methods…

Cosmology and Nongalactic Astrophysics · Physics 2013-05-30 J. R. Fergusson , D. M. Regan , E. P. S. Shellard

Cycles are one of the fundamental subgraph patterns and being able to enumerate them in graphs enables important applications in a wide variety of fields, including finance, biology, chemistry, and network science. However, to enable cycle…

Data Structures and Algorithms · Computer Science 2023-07-18 Jovan Blanuša , Kubilay Atasu , Paolo Ienne

A high-performance parallel algorithm is proposed for modeling the propagation of acoustic and elastic waves in inhomogeneous media. An initial boundary-value problem is replaced by a series of boundary-value problems for a constant…

Numerical Analysis · Mathematics 2011-01-25 Alexey G. Fatyanov , Andrew V. Terekhov

High-order clustering aims to identify heterogeneous substructures in multiway datasets that arise commonly in neuroimaging, genomics, social network studies, etc. The non-convex and discontinuous nature of this problem pose significant…

Methodology · Statistics 2022-10-11 Rungang Han , Yuetian Luo , Miaoyan Wang , Anru R. Zhang

In the area of Pattern Recognition and Matching, finding a Longest Common Subsequence plays an important role. In this paper, we have proposed one algorithm based on parallel computation. We have used OpenMP API package as middleware to…

Data Structures and Algorithms · Computer Science 2013-06-20 Tirtharaj Dash , Tanistha Nayak

In this paper we propose a new parallel algorithm for solving global optimization (GO) multidimensional problems. The method unifies two powerful approaches for accelerating the search: parallel computations and local tuning on the behavior…

Optimization and Control · Mathematics 2011-03-31 Yaroslav D. Sergeyev

In this paper we propose a multiscale method for the acoustic wave equation in highly oscillatory media. We use a higher-order extension of the localized orthogonal decomposition method combined with a higher-order time stepping scheme and…

Numerical Analysis · Mathematics 2024-07-23 Felix Krumbiegel , Roland Maier

We show that the Hausdorff distance for two sets of non-intersecting line segments can be computed in parallel in $O(\log^2 n)$ time using O(n) processors in a CREW-PRAM computation model. We discuss how some parts of the sequential…

Computational Geometry · Computer Science 2012-07-18 Helmut Alt , Ludmila Scharf