Search · four archives
Search · four archives
23 papers · ranked by Valyu relevance
Theodoros Anagnostopoulos, Evanthia Zervoudi, Christos Anagnostopoulos, Apostolos Christopoulos + 1 more
Linear regression analysis focuses on predicting a numeric regressand value based on certain regressor values. In this context, k-Nearest Neighbors (k-NN) is a common non-parametric regression algorithm, which achieves efficient performance when compared with other algorithms in literature. In this research effort an…
Mohamed Ahmed Ebrahim Mohamed, Shymaa Nasser Ahmed, Mohamed Eladly Metwally
'Mohamed Eladly Metwally'] This paper suggests an optimal maximum power point tracking (MPPT) control scheme for a grid-connected photovoltaic (PV) system using the arithmetic optimization algorithm (AOA). The parameters of the proportional-integral (PI) controller-based incremental conductance (IC) MPPT are optimally…
Daichi Mukunoki, Katsuhisa Ozaki
—To obtain accurate results in numerical computation, high-precision arithmetic is a straightforward approach. However, most processors lack hardware support for floatingpoint formats beyond double precision (FP64). Double-word arithmetic (Dekker 1971) extends precision by using standard floating-point operations to…
Renato J. Cintra, H. M. de Oliveira
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the proposed algorithms for the arithmetic Fourier transform are surveyed. A new…
Shri Prakash Dwivedi
—Multiplication is one of the most important operation in computer arithmetic. Many integer operations such as squaring, division and computing reciprocal require same order of time as multiplication whereas some other operations such as computing GCD and residue operation require at most a factor of log n time more…
Martin Schlather
Since the calculation of a genomic relationship matrix needs a large number of arithmetic operations, fast implementations are of interest. Our fastest algorithm is more accurate and 25× faster than a AVX double precision floating-point implementation.
Amal Altamimi, Belgacem Ben Youssef
The square root operation is indispensable in a myriad of computational science and engineering applications. Various computational techniques have been devised to approximate its value. In particular, convergence methods employed in this regard are highly affected by the initial approximation of the seed value.…
Hiroki Takizawa, Junichi Iwakiri, Kiyoshi Asai
The analysis of secondary structures is essential to understanding the function of RNAs. Because RNA molecules thermally fluctuate, it is necessary to analyze the probability distribution of secondary structures. Existing methods, however, are not applicable to long RNAs owing to their high computational complexity.…
Fábio Lourenço Romano
numbers, using floating-point arithmetic Authors: ['Fábio Lourenço Romano'] In this paper, an optimized version of classical Bombelli's algorithm for computing integer square roots is presented. In particular, floating-point arithmetic is used to compute the initial guess of each digit of the root, following similar…
Mikhail Selianinau, Yuriy Povstenko, Sergio Cruces, Rubén Martín-Clemente + 2 more
'Rubén Martín-Clemente' 'Andrzej Cichocki' 'Iván Durán-Díaz'] In this paper, we deal with the critical problems in residue arithmetic. The reverse conversion from a Residue Number System (RNS) to positional notation is a main non-modular operation, and it constitutes a basis of other non-modular procedures used to…
Koichi Miyamoto, Naoki Yamamoto, Yasubumi Sakakibara
We propose two quantum algorithms for a problem in bioinformatics, position weight matrix (PWM) matching, which aims to find segments (sequence motifs) in a biological sequence such as DNA and protein that have high scores defined by the PWM and are thus of informational importance related to biological function. The…
David Brust, Johannes J. Brust
Grouping samples with low prevalence of positives into pools and testing these pools can achieve considerable savings in testing resources compared with individual testing in the context of COVID-19. We review published pooling matrices, which encode the assignment of samples into pools and describe decoding…
M. Syafiq Johar
We define the regular Euclidean algorithm and the general form which leads to the method of least absolute remainders and also the method of negative remainders. We are going to show that if looked from the perspective of subtraction, the method of least absolute remainders and the regular method have the same number…
Xiaotong Wei, Ying Yang, Jie Chen, Alejandro Linares-Barranco
Division is generally regarded as a low-frequency, high-latency operation in integer operations. Division is also the operation that stalls the processor pipeline most frequently. In order to improve the overall performance of embedded processors, a low-delay divider for embedded processors was designed. Based on the…
Ali Baharev, Hermann Schichl, Endre Rév
The computations involving the noncentral-F distribution are notoriously difficult to implement properly in floating-point arithmetic: Catastrophic loss of precision, floating-point underflow and overflow, drastically increasing computation time and program hang-ups, and instability due to numerical cancellation have…
Gennadi Malaschonok
Among the set of known algorithms for the determinant computation, there is a subset, which allows us to carry out computations within the commutative ring generated by the coefficients of the system. Recently, interest in these algorithms grew due to computer algebra computations. These algorithms may be used (a) to…
Authors not listed
We present a vector-based method to balance chemical reactions. The algorithm builds candidates in a deterministic way, removes duplicates, and always prints coefficients in the lowest whole-number form. For redox cases, electrons and protons/hydroxide are treated explicitly, so both mass and charge are balanced. We…
Zhihao Lan, WanZhen Liang
The variational quantum eigensolver (VQE) algorithm can simulate the chemical systems such as molecules in the noisy intermediate-scale quantum devices and shows promising applications in quantum chemistry simulations. The accuracy and computational cost of the VQE simulations are determined by the underlying Ansätze.…
Eric Hermes, Khachik Sargsyan, Habib Najm, Judit Zádor
We present a new algorithm for the optimization of molecular structures to saddle points on the potential energy surface using a redundant internal coordinate system. This algorithm automates the procedure of defining the internal coordinate system, including the handling of linear bending angles, e.g. through the…
Alexandre Zénon, Samuel Salvaggio, Michael Andres
The assumption that the brain relies on Bayesian inference has been successful in accounting for many behavioural and neurophysiological observations, but to date, dependence on such mechanism has not been assessed in the context of arithmetic. Bayesian inference implies the representation of uncertainty and reliance…
MARCO TODISCO
Determining the distribution of multiple chemical species at equilibrium for a given system is a common problem that must be routinely addressed by scholars. While simple systems consisting of a few species and reactions can be solved manually, most of these problems require the definition and solution of higher-order…
Pavel Pokhilko, Evgeny Epifanovsky, Anna I. Krylov
Using single precision floating point representation reduces the size of data and computation time by a factor of two relative to double precision conventionally used in electronic structure programs. For large-scale calculations, such as those encountered in many-body theories, reduced memory footprint alleviates…
Authors not listed
The SCF part of the HF-SCF method is responsible for finding the ground state as the global minimum of the one-determinant approximation of the electronic energy, which is a 4th order multivariable polynomial of the LCAO coefficients and Lagrange multipliers. In this work we replace this SCF part with algebraic…