Computational efficiency of simultaneous methods

AbstractTwo new iterative methods for the simultaneous determination of all multiple as well as distinct roots of nonlinear polynomial equation are established, using two suitable corrections to achieve a very high computational efficiency as compared to the existing methods in the literature. Convergence analysis shows that the orders of convergence of the newly constructed simultaneous methods are 10 and 12. At the end, numerical test examples are given to check the efficiency and numerical performance of these simultaneous methods.

Download Full-text

Forgetting and Potentiation in Automaticity: What Happens to Computational Efficiency Gains After a Delay?

PsycEXTRA Dataset ◽

10.1037/e527312012-923 ◽

2008 ◽

Author(s):

Nicolas J. Wilkins ◽

Katherine A. Rawson

Keyword(s):

Computational Efficiency ◽

Efficiency Gains

Download Full-text

Color processing and management in Ghostscript

Color and Imaging Conference ◽

10.2352/issn.2169-2629.2019.27.12 ◽

2019 ◽

Vol 2019 (1) ◽

pp. 62-68

Author(s):

Michael J. Vrhel ◽

Artifex Software

Keyword(s):

Open Source ◽

Computational Efficiency ◽

Color Processing ◽

Description Languages

Ghostscript has a long history in the open source community and was developed at the same time that page description languages were evolving to the complex specification of PDF today. Color is a key component in this specification and its description and proper implementation is as complex as any other part of the specification. In this document, the color processing and management that takes place in Ghostscript is reviewed with a focus on how its design achieves computational efficiency while providing flexibility for the developer and user.

Download Full-text

PERSPECTIVES OF ELLIPTICAL CRYPTOGRAPHY TO ENSURE THE INTEGRITY AND CONFIDENTIALITY OF INFORMATION

Visnyk Universytetu “Ukraina” ◽

10.36994/2707-4110-2019-2-23-26 ◽

2019 ◽

Author(s):

Anna ILYENKO ◽

Sergii ILYENKO ◽

Yana MASUR

Keyword(s):

Information Systems ◽

Elliptic Curve ◽

Elliptic Curves ◽

Finite Fields ◽

Computational Efficiency ◽

Digital Signature ◽

Discrete Logarithm ◽

Algebraic Groups ◽

Schnorr Signature ◽

Stability Of Algorithms

In this article, the main problems underlying the current asymmetric crypto algorithms for the formation and verification of electronic-digital signature are considered: problems of factorization of large integers and problems of discrete logarithm. It is noted that for the second problem, it is possible to use algebraic groups of points other than finite fields. The group of points of the elliptical curve, which satisfies all set requirements, looked attractive on this side. Aspects of the application of elliptic curves in cryptography and the possibilities offered by these algebraic groups in terms of computational efficiency and crypto-stability of algorithms were also considered. Information systems using elliptic curves, the keys have a shorter length than the algorithms above the finite fields. Theoretical directions of improvement of procedure of formation and verification of electronic-digital signature with the possibility of ensuring the integrity and confidentiality of information were considered. The proposed method is based on the Schnorr signature algorithm, which allows data to be recovered directly from the signature itself, similarly to RSA-like signature systems, and the amount of recoverable information is variable depending on the information message. As a result, the length of the signature itself, which is equal to the sum of the length of the end field over which the elliptic curve is determined, and the artificial excess redundancy provided to the hidden message was achieved.

Download Full-text

Efficiency, Sufficiency, and Optimality

10.1093/oso/9780199349524.003.0007 ◽

2017 ◽

Author(s):

Amos Golan

Keyword(s):

Limit Theorem ◽

Computational Efficiency ◽

The Other ◽

Information Compression ◽

Information Theoretic ◽

Conditional Limit Theorem ◽

Concept Of Information ◽

Conditional Limit

In this chapter I provide additional rationalization for using the info-metrics framework. This time the justifications are in terms of the statistical, mathematical, and information-theoretic properties of the formalism. Specifically, in this chapter I discuss optimality, statistical and computational efficiency, sufficiency, the concentration theorem, the conditional limit theorem, and the concept of information compression. These properties, together with the other properties and measures developed in earlier chapters, provide logical, mathematical, and statistical justifications for employing the info-metrics framework.

Download Full-text

Numerical Methods for the Kinetic Theory of Fluids

10.1093/oso/9780199592357.003.0010 ◽

2018 ◽

Author(s):

Sauro Succi

Keyword(s):

Molecular Dynamics ◽

Monte Carlo ◽

Numerical Methods ◽

Kinetic Theory ◽

Computational Efficiency ◽

Lattice Boltzmann ◽

Direct Simulation Monte Carlo ◽

Particle Methods ◽

Direct Simulation ◽

Simulation Monte Carlo

This chapter provides a bird’s eye view of the main numerical particle methods used in the kinetic theory of fluids, the main purpose being of locating Lattice Boltzmann in the broader context of computational kinetic theory. The leading numerical methods for dense and rarified fluids are Molecular Dynamics (MD) and Direct Simulation Monte Carlo (DSMC), respectively. These methods date of the mid 50s and 60s, respectively, and, ever since, they have undergone a series of impressive developments and refinements which have turned them in major tools of investigation, discovery and design. However, they are both very demanding on computational grounds, which motivates a ceaseless demand for new and improved variants aimed at enhancing their computational efficiency without losing physical fidelity and vice versa, enhance their physical fidelity without compromising computational viability.

Download Full-text