Skip to Content

5,829 Results Found

  • Article
  • Open Access
2 Citations
4,538 Views
23 Pages

In this article, the fast algorithms for the discrete Tchebichef transform (DTT) are proposed for input sequences of lengths in the range from 3 to 8. At present, DTT is widely applied in signal processing, image compression, and video coding. The re...

  • Article
  • Open Access
15 Citations
3,713 Views
30 Pages

Simulation of Spiking Neural P Systems with Sparse Matrix-Vector Operations

  • Miguel Ángel Martínez-del-Amor,
  • David Orellana-Martín,
  • Ignacio Pérez-Hurtado,
  • Francis George C. Cabarle and
  • Henry N. Adorna

14 April 2021

To date, parallel simulation algorithms for spiking neural P (SNP) systems are based on a matrix representation. This way, the simulation is implemented with linear algebra operations, which can be easily parallelized on high performance computing pl...

(This article belongs to the Special Issue Modeling, Simulation and Design of Membrane Computing System)
  • Article
  • Open Access
3 Citations
1,165 Views
29 Pages

Under large azimuth misalignment conditions, the initial alignment of strapdown inertial navigation systems (SINS) is challenged by the nonlinear characteristics of the error model. Traditional particle filter (PF) algorithms suffer from the inapprop...

(This article belongs to the Section Artificial Intelligence)
  • Article
  • Open Access
1,153 Views
20 Pages

Fast Algorithms for the Small-Size Type IV Discrete Hartley Transform

  • Vitalii Natalevych,
  • Marina Polyakova and
  • Aleksandr Cariow

This paper presents new fast algorithms for the fourth type discrete Hartley transform (DHT-IV) for input data sequences of lengths from 3 to 8. Fast algorithms for small-sized trigonometric transforms can be used as building blocks for synthesizing...

(This article belongs to the Section Circuit and Signal Processing)
  • Article
  • Open Access
2,537 Views
18 Pages

Non-negative Matrix Factorization (NMF) has gained popularity due to its effectiveness in clustering and feature selection tasks. It is particularly valuable for managing high-dimensional data by reducing dimensionality and providing meaningful seman...

(This article belongs to the Section Data)
  • Article
  • Open Access
5 Citations
2,553 Views
17 Pages

14 April 2024

The approach to solving linear systems with structured matrices by means of the bidiagonal factorization of the inverse of the coefficient matrix is first considered in this review article, the starting point being the classical Björck–Per...

(This article belongs to the Special Issue Advances in Linear Algebra with Applications)
  • Article
  • Open Access
213 Citations
12,642 Views
15 Pages

22 June 2017

To address the problem of image texture feature extraction, a direction measure statistic that is based on the directionality of image texture is constructed, and a new method of texture feature extraction, which is based on the direction measure and...

(This article belongs to the Special Issue Urban Remote Sensing: Monitoring, Synthesis and Modeling in the Urban Environment)
  • Article
  • Open Access
19 Citations
4,523 Views
27 Pages

26 May 2021

Seismic data provides integral information in geophysical exploration, for locating hydrocarbon rich areas as well as for fracture monitoring during well stimulation. Because of its high frequency acquisition rate and dense spatial sampling, distribu...

(This article belongs to the Section Earth Sciences)
  • Article
  • Open Access
1 Citations
2,167 Views
18 Pages

A Matrix Spline Method for a Class of Fourth-Order Ordinary Differential Problems

  • Michael M. Tung,
  • Emilio Defez,
  • Javier Ibáñez,
  • José M. Alonso and
  • Julia Real-Herráiz

9 August 2022

Differential matrix models provide an elementary blueprint for the adequate and efficient treatment of many important applications in science and engineering. In the present work, we suggest a procedure, extending our previous research results, to re...

(This article belongs to the Section C1: Difference and Differential Equations)
  • Article
  • Open Access
1,235 Views
25 Pages

Fast Algorithms for Small-Size Type VII Discrete Cosine Transform

  • Marina Polyakova,
  • Aleksandr Cariow and
  • Mirosław Łazoryszczak

This paper presents new fast algorithms for the type VII discrete cosine transform (DCT-VII) applied to input data sequences of lengths ranging from 3 to 8. Fast algorithms for small-sized trigonometric transforms enable the processing of small data...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
1 Citations
1,889 Views
22 Pages

14 May 2023

KLFCM is a clustering algorithm proposed by introducing K-L divergence into FCM, which has been widely used in the field of fuzzy clustering. Although many studies have focused on improving its accuracy and efficiency, little attention has been paid...

  • Article
  • Open Access
1 Citations
1,697 Views
7 Pages

In this paper, we propose a new iterative algorithm to solve the matrix equation AXB + CXT D = E. The algorithm can obtain the minimal Frobenius norm solution or the least-squares solution with minimal Frobenius norm. Our algorithm is better than Alg...

  • Article
  • Open Access
8 Citations
1,855 Views
19 Pages

23 October 2024

Fast algorithms for type-five discrete cosine transform (DCT-V) for sequences of input data of short length in the range of two to eight are elaborated in the paper. A matrix–vector product representation of the DCT-V is the starting point for...

  • Article
  • Open Access
2 Citations
2,228 Views
10 Pages

17 August 2022

The irreducibility of nonnegative matrices is an important condition for the diagonal transformation algorithm to succeed. In this paper, we introduce zero symmetry to replace the irreducibility of nonnegative matrices and propose an improved diagona...

(This article belongs to the Section B: Mathematics)
  • Article
  • Open Access
5 Citations
4,582 Views
22 Pages

Winograd’s algorithms are an effective tool for calculating the discrete Fourier transform (DFT). These algorithms described in well-known articles are traditionally represented either with the help of sets of recurrent relations or with the he...

(This article belongs to the Special Issue Efficient Algorithms and Architectures for DSP Applications)
  • Article
  • Open Access
4 Citations
1,832 Views
20 Pages

19 November 2024

This paper presents the type-II fast discrete Hartley transform (DHT-II) algorithms for input data sequences of lengths from 2 to 8. The starting point for developing the eight algorithms is the representation of DHT-II as a matrix–vector produ...

(This article belongs to the Special Issue Advanced Digital Signal Processing and Its Applications)
  • Article
  • Open Access
1 Citations
3,536 Views
24 Pages

21 June 2021

Forward error correction codes (FEC) are one of the vital sections of modern communication systems; therefore, recognition of the coding type is an important issue in non-cooperative communication. At present, the recognition of FEC codes is mainly c...

  • Article
  • Open Access
8 Citations
3,842 Views
21 Pages

1 October 2022

The emergence of the Industrial Internet of Things (IIoT) has accelerated the adoption of Industrial Wireless Sensor Networks (IWSNs) for numerous applications. Effective communication in such applications requires reduced end-to-end transmission tim...

(This article belongs to the Collection Wireless Sensor Networks towards the Internet of Things)
  • Article
  • Open Access
1 Citations
3,154 Views
25 Pages

5 April 2023

To solve the problem of text clustering according to semantic groups, we suggest using a model of a unified lexico-semantic bond between texts and a similarity matrix based on it. Using lexico-semantic analysis methods, we can create “term&ndas...

(This article belongs to the Special Issue Nature-Inspired Algorithms in Machine Learning)
  • Article
  • Open Access
1 Citations
3,531 Views
18 Pages

1 August 2024

This article presents two quantum algorithms for computing the product of a circulant matrix and a vector. The arithmetic complexity of the first algorithm is O(Nlog2N) in most cases. For the second algorithm, when the entries in the circulant matrix...

(This article belongs to the Special Issue Quantum Information Processing and Machine Learning)
  • Article
  • Open Access
6 Citations
1,845 Views
20 Pages

Research on Global Navigation Operations for Rotary Burying of Stubbles Based on Machine Vision

  • Mingkuan Zhou,
  • Weiwei Wang,
  • Shenqing Shi,
  • Zhen Huang and
  • Tao Wang

In order to plan suitable navigation operation paths for the characteristics of rice fields in the middle and lower reaches of the Yangtze River and the operational requirements of straw rotary burying, this paper proposes a combination of the Hough...

(This article belongs to the Section Agricultural Technology)
  • Article
  • Open Access
11 Citations
2,199 Views
26 Pages

13 February 2025

As the last link of power transmission, the safe operation of the distribution network directly affects the experience of power users, and short-time distribution network faults can cause huge economic losses. There are few fault recording devices in...

(This article belongs to the Section F: Electrical Engineering)
  • Article
  • Open Access
20 Citations
6,160 Views
16 Pages

An Efficient Hardware Accelerator for the MUSIC Algorithm

  • Hui Chen,
  • Kai Chen,
  • Kaifeng Cheng,
  • Qinyu Chen and ,
  • Yuxiang Fu and
  • Li Li
  • + 1 author+ 0 author

As a classical DOA (direction of arrival) estimation algorithm, the multiple signal classification (MUSIC) algorithm can estimate the direction of signal incidence. A major bottleneck in the application of this algorithm is the large computation amou...

(This article belongs to the Special Issue VLSI Architecture Design for Digital Signal Processing)
  • Article
  • Open Access
3 Citations
1,347 Views
23 Pages

28 February 2025

This paper proposes fast algorithms for odd-time and odd-frequency discrete Hartley transforms (DHTs) with normalization if the size of the input sequence ranges from 2 to 8. Fast algorithms for small-sized inputs can be included as modules in fast a...

  • Article
  • Open Access
2,708 Views
12 Pages

15 January 2025

There are many different algorithms for calculating the distances between DNA chains. Different algorithms for determining such distances give different results. This paper does not consider issues related to which of the classical algorithms is bett...

(This article belongs to the Collection Theoretical and Mathematical Ecology)
  • Article
  • Open Access
9 Citations
4,513 Views
20 Pages

23 July 2021

Pairwise comparison matrices play a prominent role in multiple-criteria decision-making, particularly in the analytic hierarchy process (AHP). Another form of preference modeling, called an incomplete pairwise comparison matrix, is considered when on...

(This article belongs to the Special Issue Algorithms and Models for Dynamic Multiple Criteria Decision Making)
  • Article
  • Open Access
2 Citations
3,797 Views
23 Pages

17 July 2023

The LU factorization of very large sparse matrices requires a significant amount of computing resources, including memory and broadband communication. A hybrid MPI + OpenMP + CUDA algorithm named SuperLU3D can efficiently compute the LU factorization...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
2 Citations
3,360 Views
14 Pages

A Preliminary Empirical Study of the Power Efficiency of Matrix Multiplication

  • Fares Jammal,
  • Naif Aljabri,
  • Muhammad Al-Hashimi,
  • Mostafa Saleh and
  • Osama Abulnaja

Matrix multiplication is ubiquitous in high-performance applications. It will be a significant part of exascale workloads where power is a big concern. This work experimentally studied the power efficiency of three matrix multiplication algorithms: t...

(This article belongs to the Section Computer Science & Engineering)
  • Article
  • Open Access
3 Citations
1,881 Views
13 Pages

2 April 2024

In this paper, a new thresholding operator, namely, designed thresholding operator, is designed to recover the low-rank matrices. With the change of parameter in designed thresholding operator, the designed thresholding operator can apply less bias t...

(This article belongs to the Section E: Applied Mathematics)
  • Article
  • Open Access
7 Citations
3,797 Views
17 Pages

30 December 2023

Environmental e-commerce is a sustainability-oriented e-commerce model. To address the problem of data sparsity and the lack of diversity in traditional e-commerce recommendation algorithms, a new collaborative filtering recommendation algorithm base...

(This article belongs to the Section Economic and Business Aspects of Sustainability)
  • Article
  • Open Access
2,553 Views
12 Pages

Consider the computation of the solution for a class of discrete-time algebraic Riccati equations (DAREs) with the low-ranked coefficient matrix G and the high-ranked constant matrix H. A structured doubling algorithm is proposed for large-scale prob...

(This article belongs to the Special Issue Applications of Iterative Methods in Solving Nonlinear Equations)
  • Article
  • Open Access
15 Citations
5,357 Views
20 Pages

18 October 2018

Underdetermined blind source separation (UBSS) is a hot topic in signal processing, which aims at recovering the source signals from a number of observed mixtures without knowing the mixing system. Recently, expectation-maximization algorithm shows a...

  • Article
  • Open Access
3 Citations
3,490 Views
17 Pages

Low-Rank Matrix Completion via QR-Based Retraction on Manifolds

  • Ke Wang,
  • Zhuo Chen,
  • Shihui Ying and
  • Xinjian Xu

26 February 2023

Low-rank matrix completion aims to recover an unknown matrix from a subset of observed entries. In this paper, we solve the problem via optimization of the matrix manifold. Specially, we apply QR factorization to retraction during optimization. We de...

(This article belongs to the Special Issue Advanced Optimization Methods and Applications)
  • Article
  • Open Access
1 Citations
3,553 Views
20 Pages

Gene Expression Analysis through Parallel Non-Negative Matrix Factorization

  • Angelica Alejandra Serrano-Rubio,
  • Guillermo B. Morales-Luna and
  • Amilcar Meneses-Viveros

30 September 2021

Genetic expression analysis is a principal tool to explain the behavior of genes in an organism when exposed to different experimental conditions. In the state of art, many clustering algorithms have been proposed. It is overwhelming the amount of bi...

(This article belongs to the Section Computational Biology)
  • Article
  • Open Access
5 Citations
1,854 Views
17 Pages

The Development of Fast DST-II Algorithms for Short-Length Input Sequences

  • Krystian Bielak,
  • Aleksandr Cariow and
  • Mateusz Raciborski

The subject of this work is the development of fast algorithms for the discrete sinusoidal transformation of the second type (DST-II) for sequences of input data of small length N = 2, 3, 4, 5, 6, 7, 8. The starting point for the development of algor...

  • Article
  • Open Access
9 Citations
5,032 Views
21 Pages

20 April 2017

We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is propo...

(This article belongs to the Section Sensor Networks)
  • Article
  • Open Access
11 Citations
4,708 Views
18 Pages

Physics-Based Aircraft Dynamics Identification Using Genetic Algorithms

  • Raymundo Peña-García,
  • Rodolfo Daniel Velázquez-Sánchez,
  • Cristian Gómez-Daza-Argumedo,
  • Jonathan Omega Escobedo-Alva and ,
  • Ricardo Tapia-Herrera and
  • Jesús Alberto Meda-Campaña
  • + 1 author+ 0 author

8 February 2024

This research introduces a physics-based identification technique utilizing genetic algorithms. The primary objective is to derive a parametric matrix, denoted as A, describing the time-invariant linear model governing the longitudinal dynamics of an...

  • Article
  • Open Access
3,269 Views
20 Pages

1 November 2021

Principal component analysis (PCA) is one of the most popular tools in multivariate exploratory data analysis. Its probabilistic version (PPCA) based on the maximum likelihood procedure provides a probabilistic manner to implement dimension reduction...

  • Article
  • Open Access
412 Views
26 Pages

13 July 2026

The structural and positional analysis of planar linkage mechanisms containing higher-class Assur groups requires the generation and solution of systems of algebraic kinematic equations. This paper presents algorithms for the automated analysis of su...

  • Article
  • Open Access
1,914 Views
12 Pages

7 September 2023

This study addresses the poor robustness of the current beamforming algorithm for covariance matrix reconstruction and the high computational complexity in the covariance matrix reconstruction process. A robust beamforming algorithm based on the Comp...

(This article belongs to the Special Issue Applications and Challenges in Sonar Signal Processing)
  • Article
  • Open Access
7 Citations
2,606 Views
15 Pages

Hyperspectral technology has proven to be an effective method for monitoring soil salt content (SSC). However, hyperspectral estimation capabilities are limited when the soil surface is partially vegetated. This work aimed to (1) quantify the influen...

  • Article
  • Open Access
10 Citations
3,947 Views
21 Pages

Some FFT Algorithms for Small-Length Real-Valued Sequences

  • Dorota Majorkowska-Mech and
  • Aleksandr Cariow

7 May 2022

This paper proposes fast algorithms for computing the discrete Fourier transform for real-valued sequences of lengths from 3 to 9. Since calculating the real-valued DFT using the complex-valued FFT is redundant regarding the number of needed operatio...

(This article belongs to the Special Issue Real, Complex and Hypercomplex Number Systems in Data Processing and Representation)
  • Article
  • Open Access
11 Citations
5,734 Views
25 Pages

27 April 2018

This paper presents an unsupervised learning algorithm for sparse nonnegative matrix factor time–frequency deconvolution with optimized fractional β -divergence. The β -divergence is a group of cost functions parametrized by a...

(This article belongs to the Special Issue Sensor Signal and Information Processing)
  • Article
  • Open Access
1 Citations
938 Views
15 Pages

Optimal Sensor Placement for Contactless Medium- or High-Voltage Measurement

  • Andrzej Bień,
  • Szymon Barczentewicz and
  • Andrzej Wetula

19 September 2025

The paper presents a method for selecting the locations of field sensors under a medium- or high-voltage line or substation busbars, in a contactless voltage measurement system. The proposed method uses the condition number of a distance matrix, corr...

(This article belongs to the Special Issue The Impact of Distributed Energy Resources (DERs) on Supply Network and Energy Market)
  • Article
  • Open Access
4 Citations
2,419 Views
12 Pages

9 August 2024

The detection of gas leaks using acoustic signals is often compromised by environmental noise, which significantly impacts the accuracy of subsequent leak identification. Current noise reduction algorithms based on non-negative matrix factorization (...

(This article belongs to the Section Physical Sensors)
  • Article
  • Open Access
2 Citations
1,267 Views
18 Pages

This paper presents three novel sufficient and necessary conditions for the admissibility of singular fractional-order systems (FOSs), a stabilization criterion, and a solution algorithm. The strict linear matrix inequality (LMI) stability criterion...

(This article belongs to the Special Issue Fractional Order Complex Systems: Advanced Control, Intelligent Estimation and Reinforcement Learning Image Processing​ Algorithms, Second Edition)
  • Review
  • Open Access
33 Citations
3,836 Views
50 Pages

28 January 2025

This survey provides a comprehensive overview of the solutions to the matrix equation AXB=C over real numbers, complex numbers, quaternions, dual quaternions, dual split quaternions, and dual generalized commutative quaternions, including various spe...

(This article belongs to the Section A: Algebra and Logic)
  • Article
  • Open Access
4 Citations
3,111 Views
15 Pages

10 January 2025

The proper selection of the model error covariance matrix and the measurement noise covariance matrix of Kalman filter is an optimization problem. Some scholars have studied this, but there is relatively little research on the selection of the two co...

(This article belongs to the Section Building Structures)
  • Article
  • Open Access
11 Citations
4,969 Views
19 Pages

Using Graph Partitioning for Scalable Distributed Quantum Molecular Dynamics

  • Hristo N. Djidjev,
  • Georg Hahn,
  • Susan M. Mniszewski,
  • Christian F. A. Negre and
  • Anders M. N. Niklasson

7 September 2019

The simulation of the physical movement of multi-body systems at an atomistic level, with forces calculated from a quantum mechanical description of the electrons, motivates a graph partitioning problem studied in this article. Several advanced algor...

  • Article
  • Open Access
1,298 Views
10 Pages

12 June 2025

The most popular iterative methods for solving nonsymmetric linear systems are Krylov methods. Recently, an optimal Quasi-ORthogonal (Q-OR) method was introduced, which yields the same residual norms as the Generalized Minimum Residual (GMRES) method...

(This article belongs to the Special Issue Numerical Analysis and Scientific Computing for Applied Mathematics)

of 117