Efficient homomorphic comparison methods with optimal complexity

JH Cheon, D Kim, D Kim - … 2020: 26th International Conference on the …, 2020 - Springer
Abstract Comparison of two numbers is one of the most frequently used operations, but it
has been a challenging task to efficiently compute the comparison function in homomorphic …

[HTML][HTML] Numerically stable improved Chebyshev–Halley type schemes for matrix sign function

A Cordero, F Soleymani, JR Torregrosa… - Journal of Computational …, 2017 - Elsevier
A general family of iterative methods including a free parameter is derived and proved to be
convergent for computing matrix sign function under some restrictions on the parameter …

[PDF][PDF] A fast and efficient Newton-type iterative scheme to find the sign of a matrix

MZ Ullah, SM Alaslani, FO Mallawi, F Ahmad, S Shateyi… - Aims Math, 2023 - aimspress.com
This work proposes a new scheme under the umbrella of iteration methods to compute the
sign of an invertible matrix. To this target, a review of the exiting solvers of the same type is …

Extraction of deflating subspaces using disk function of a matrix pencil via matrix sign function with application in generalized eigenvalue problem

P Sharma, M Kansal - Journal of Computational and Applied Mathematics, 2024 - Elsevier
The objective of this study is to extract two pairs of left and right deflating subspaces of a
regular matrix pencil A− λ B corresponding to the eigenvalues lying inside and outside the …

An Enhanced Numerical Iterative Method for Expanding the Attraction Basins When Computing Matrix Signs of Invertible Matrices

L Shi, MZ Ullah, HK Nashine, M Alansari… - Fractal and Fractional, 2023 - mdpi.com
The computation of the sign function of a matrix plays a crucial role in various mathematical
applications. It provides a matrix-valued mapping that determines the sign of each …

Random non-autonomous second order linear differential equations: mean square analytic solutions and their statistical properties

J Calatayud, JC Cortés, M Jornet… - Advances in Difference …, 2018 - Springer
In this paper we study random non-autonomous second order linear differential equations
by taking advantage of the powerful theory of random difference equations. The coefficients …

Behind Jarratt's Steps: Is Jarratt's Scheme the Best Version of Itself?

A Cordero, E Segura… - Discrete Dynamics in …, 2023 - Wiley Online Library
In this paper, we analyze the stability of the family of iterative methods designed by Jarratt
using complex dynamics tools. This allows us to conclude whether the scheme known as …

[PDF][PDF] A numerically stable high-order Chebyshev-Halley type multipoint iterative method for calculating matrix sign function.

X Wang, Y Cao - Applied Mathematics for Modern Challenges, 2023 - aimspress.com
A new eighth-order Chebyshev-Halley type iteration is proposed for solving nonlinear
equations and matrix sign function. Basins of attraction show that several special cases of …

Towards Understanding Efficient Privacy-Preserving Homomorphic Comparison

B Pulido-Gaytan, A Tchernykh, F Leprévost… - IEEE …, 2023 - ieeexplore.ieee.org
The security issues that arise in public cloud environments raise several concerns about
privacy-preserving. Conventional security practices successfully protect stored and …

A novel iterative method for polar decomposition and matrix sign function

F Soleymani, PS Stanimirović… - Discrete Dynamics in …, 2015 - Wiley Online Library
We define and investigate a globally convergent iterative method possessing sixth order of
convergence which is intended to calculate the polar decomposition and the matrix sign …