The paper concerns a special approximate algorithm of the square root of the specific positive integer, which is built by the use of the property of positive integer solution of the Pell’s equation, together with using some elementary theorems of matrices, and then takes it to compare with general used the Newton’s method and give a practical numerical example and error analysis; it is unexpected to find its special property: the significant figure of the approximation value of the square root of positive integer will increase one digit by one. It is well useful in some occasions
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for comput...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
AbstractIn this paper, we construct a modification of Newton's method to accelerate the convergence ...
In this paper, we construct a modification of Newton's method to accelerate the convergence of this ...
Abstract The square root operation is indispensable in a myriad of computational science and enginee...
20 pages Published after the first Joint India-AMS meeting in Mathematics held in Bangalore in Decem...
Presently a direct analytical method is available for the digit-by-digit extraction of the square ro...
Abstract. Atkin’s algorithm [2] for computing square roots in Z∗ p, where p is a prime such that p ≡...
We consider the problem of computing the square root of a perturbation of the scaled identity matrix...
We show that all perfect odd integer squares not divisible by 3, can be usefully written as N = a + ...
Given an n × n symmetric positive definite matrix A and a vector ~c, two numer-ical methods for appr...
AbstractFor approximating N, where N is positive real, two sequences of iterative methods derived fr...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
It is a generalization of the Pell’s equation. Here, we show that: if the equation has an integer so...
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for comput...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
AbstractIn this paper, we construct a modification of Newton's method to accelerate the convergence ...
In this paper, we construct a modification of Newton's method to accelerate the convergence of this ...
Abstract The square root operation is indispensable in a myriad of computational science and enginee...
20 pages Published after the first Joint India-AMS meeting in Mathematics held in Bangalore in Decem...
Presently a direct analytical method is available for the digit-by-digit extraction of the square ro...
Abstract. Atkin’s algorithm [2] for computing square roots in Z∗ p, where p is a prime such that p ≡...
We consider the problem of computing the square root of a perturbation of the scaled identity matrix...
We show that all perfect odd integer squares not divisible by 3, can be usefully written as N = a + ...
Given an n × n symmetric positive definite matrix A and a vector ~c, two numer-ical methods for appr...
AbstractFor approximating N, where N is positive real, two sequences of iterative methods derived fr...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...
It is a generalization of the Pell’s equation. Here, we show that: if the equation has an integer so...
In a constructive setting, the formula ∀n ∃r r 2 ≤n ∧ n<(r+1) 2 specifies an algorithm for comput...
AbstractIn this paper, we present a new algorithm for the exact solutions of linear systems with int...
In this section is presented a new integer number algorithm for linear equation. This algorithm is m...