-
Notifications
You must be signed in to change notification settings - Fork 34
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
4 changed files
with
351 additions
and
8 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,60 @@ | ||
/* | ||
* $Id$ | ||
* | ||
* Copyright 2013 Valentyn Kolesnikov | ||
* | ||
* Licensed under the Apache License, Version 2.0 (the "License"); | ||
* you may not use this file except in compliance with the License. | ||
* You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, software | ||
* distributed under the License is distributed on an "AS IS" BASIS, | ||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. | ||
* See the License for the specific language governing permissions and | ||
* limitations under the License. | ||
*/ | ||
package com.github.calc; | ||
|
||
import java.math.BigDecimal; | ||
import java.math.BigInteger; | ||
|
||
public class BigDecimalUtil { | ||
|
||
/** | ||
* Compute the square root of x to a given scale, x >= 0. | ||
* Use Newton's algorithm. | ||
* @param x the value of x | ||
* @param scale the desired scale of the result | ||
* @return the result value | ||
*/ | ||
public static BigDecimal sqrt(BigDecimal x) { | ||
int scale = 18; | ||
// Check that x >= 0. | ||
if (x.signum() < 0) { | ||
throw new ArithmeticException("x < 0"); | ||
} | ||
|
||
// n = x*(10^(2*scale)) | ||
BigInteger n = x.movePointRight(scale << 1).toBigInteger(); | ||
|
||
// The first approximation is the upper half of n. | ||
int bits = (n.bitLength() + 1) >> 1; | ||
BigInteger ix = n.shiftRight(bits); | ||
BigInteger ixPrev; | ||
|
||
// Loop until the approximations converge | ||
// (two successive approximations are equal after rounding). | ||
do { | ||
ixPrev = ix; | ||
|
||
// x = (x + n/x)/2 | ||
ix = ix.add(n.divide(ix)).shiftRight(1); | ||
|
||
Thread.yield(); | ||
} while (ix.compareTo(ixPrev) != 0); | ||
|
||
return new BigDecimal(ix, scale); | ||
} | ||
} |
Oops, something went wrong.